Benchmark
non-incremental/QF_BVFPLRA/20190429-UltimateAutomizerSvcomp2019/digits_bad_while_false-unreach-call.i_3.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 | 2633 |
| Compressed Size | 1198 |
| 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 | 2625 |
| Compressed Size | 1208 |
| Max. Term Depth | 9 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 7 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 3 |
and | 1 |
= | 4 |
let | 1 |
bvadd | 2 |
bvmul | 3 |
bvsrem | 1 |
sign_extend | 1 |
fp.sub | 1 |
fp.mul | 1 |
fp.eq | 2 |
roundNearestTiesToEven | 1 |
roundTowardZero | 2 |
fp.to_sbv | 2 |
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.30990
|
0.30984
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.79568
|
0.79597
|
| |
MathSAT |
MathSAT5_default.sh |
sat ✅
|
1.03010
|
1.03001
|
|
SMT-COMP 2021
|
0.50 (2/4) |
COLIBRI |
COLIBRI_21_06_23_default |
unknown ❌
|
0.32229
|
0.32185
|
| |
|
COLIBRI 20.5.25_default |
unknown ❌
|
0.31239
|
0.31213
|
| |
|
COLIBRI_21_05_28_default |
unknown ❌
|
0.32317
|
0.32363
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.84099
|
0.84140
|
| |
MathSAT |
mathsat-5.6.6_default |
sat ✅
|
0.98171
|
0.98167
|
|
SMT-COMP 2022
|
0.20 (4/5) |
Bitwuzla |
Bitwuzla-wrapped_default |
sat ✅
|
0.07497
|
0.07494
|
| |
COLIBRI |
COLIBRI 22_06_18_default |
unknown ❌
|
0.32724
|
0.32735
|
| |
cvc5 |
cvc5_default |
sat ✅
|
0.77523
|
0.77571
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
0.80541
|
0.80224
|
| |
MathSAT |
MathSAT-5.6.8_default |
sat ✅
|
0.98263
|
0.98249
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
1.12871
|
1.13062
|
|
SMT-COMP 2023
|
0.67 (1/3) |
Bitwuzla |
Bitwuzla-fixed_default |
sat ✅
|
0.11873
|
0.11868
|
| |
COLIBRI |
COLIBRI 2023_05_10_default |
unknown ❌
|
0.34038
|
0.34086
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
unknown ❌
|
0.04351
|
0.04407
|
|
SMT-COMP 2024
|
0.67 (1/3) |
Bitwuzla |
Bitwuzla |
sat ✅
|
0.26714
|
0.16630
|
| |
COLIBRI |
COLIBRI |
unknown ❌
|
0.50097
|
0.39367
|
| |
cvc5 |
cvc5 |
unknown ❌
|
0.24162
|
0.13889
|
|
SMT-COMP 2025
|
0.25 (3/4) |
Bitwuzla |
Bitwuzla |
sat ✅
|
0.29118
|
0.17293
|
| |
COLIBRI |
COLIBRI |
unknown ❌
|
0.48907
|
0.36134
|
| |
Colibri2 |
colibri2 |
sat ✅
|
4.09302
|
3.96638
|
| |
cvc5 |
cvc5 |
sat ✅
|
0.75233
|
0.63133
|