Benchmark
non-incremental/QF_BVFPLRA/20190429-UltimateAutomizerSvcomp2019/digits_for_true-unreach-call.i_1.smt2
|
Generated by the tool Ultimate Automizer [1,2] which implements
an automata theoretic approach [3] to software verification.
This SMT script belongs to a set of SMT scripts that was generated by
applying Ultimate Automizer to benchmarks [4] from the SV-COMP 2019 [5,6].
This script might _not_ contain all SMT commands that are used by
Ultimate Automizer. In order to satisfy the restrictions of
the SMT-COMP we have to drop e.g., the commands for getting
values (resp. models), unsatisfiable cores and interpolants.
2019-04-27, Matthias Heizmann (heizmann@informatik.uni-freiburg.de)
[1] https://ultimate.informatik.uni-freiburg.de/automizer/
[2] Matthias Heizmann, Yu-Fang Chen, Daniel Dietsch, Marius Greitschus,
Jochen Hoenicke, Yong Li, Alexander Nutz, Betim Musa, Christian
Schilling, Tanja Schindler, Andreas Podelski: Ultimate Automizer
and the Search for Perfect Interpolants - (Competition Contribution).
TACAS (2) 2018: 447-451
[3] Matthias Heizmann, Jochen Hoenicke, Andreas Podelski: Software Model
Checking for People Who Love Automata. CAV 2013:36-52
[4] https://github.com/sosy-lab/sv-benchmarks
[5] Dirk Beyer: Automatic Verification of C and Java Programs: SV-COMP 2019.
TACAS (3) 2019: 133-155
[6] https://sv-comp.sosy-lab.org/2019/
|
| Benchmark |
| Size | 1987 |
| Compressed Size | 1037 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2020-07-06 |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | sat |
| Size | 1979 |
| Compressed Size | 1041 |
| Max. Term Depth | 6 |
| Asserts | 2 |
| Declared Functions | 0 |
| Declared Constants | 2 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
bvmul | 1 |
fp.sub | 1 |
fp.mul | 1 |
fp.eq | 2 |
roundTowardZero | 1 |
fp.to_sbv | 1 |
to_fp | 4 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2020
|
0.50 (2/4) |
COLIBRI |
COLIBRI 20.5.25_default |
unknown ❌
|
0.31081
|
0.31059
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.82851
|
0.82881
|
| |
MathSAT |
MathSAT5_default.sh |
sat ✅
|
0.87610
|
0.87603
|
|
SMT-COMP 2021
|
0.50 (2/4) |
COLIBRI |
COLIBRI_21_06_23_default |
unknown ❌
|
0.32264
|
0.32211
|
| |
|
COLIBRI 20.5.25_default |
unknown ❌
|
0.31292
|
0.31330
|
| |
|
COLIBRI_21_05_28_default |
unknown ❌
|
0.32105
|
0.32146
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.89477
|
0.89178
|
| |
MathSAT |
mathsat-5.6.6_default |
sat ✅
|
0.83544
|
0.83536
|
|
SMT-COMP 2022
|
0.20 (4/5) |
Bitwuzla |
Bitwuzla-wrapped_default |
sat ✅
|
0.07676
|
0.07668
|
| |
COLIBRI |
COLIBRI 22_06_18_default |
unknown ❌
|
0.35145
|
0.32536
|
| |
cvc5 |
cvc5_default |
sat ✅
|
0.73003
|
0.72829
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
0.85737
|
0.85773
|
| |
MathSAT |
MathSAT-5.6.8_default |
sat ✅
|
0.85164
|
0.85149
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
1.94979
|
1.95160
|
|
SMT-COMP 2023
|
0.67 (1/3) |
Bitwuzla |
Bitwuzla-fixed_default |
sat ✅
|
0.14015
|
0.14011
|
| |
COLIBRI |
COLIBRI 2023_05_10_default |
unknown ❌
|
0.34181
|
0.34154
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
unknown ❌
|
0.04375
|
0.04419
|
|
SMT-COMP 2024
|
0.67 (1/3) |
Bitwuzla |
Bitwuzla |
sat ✅
|
0.28996
|
0.19004
|
| |
COLIBRI |
COLIBRI |
unknown ❌
|
0.46529
|
0.36562
|
| |
cvc5 |
cvc5 |
unknown ❌
|
0.24044
|
0.14087
|
|
SMT-COMP 2025
|
0.25 (3/4) |
Bitwuzla |
Bitwuzla |
sat ✅
|
0.33387
|
0.20860
|
| |
COLIBRI |
COLIBRI |
unknown ❌
|
0.47441
|
0.35247
|
| |
Colibri2 |
colibri2 |
sat ✅
|
3.10474
|
2.98530
|
| |
cvc5 |
cvc5 |
sat ✅
|
0.67954
|
0.55853
|