Benchmark
non-incremental/QF_ABVFPLRA/20190429-UltimateAutomizerSvcomp2019/float_req_bl_0240b_true-unreach-call.c_0.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 | 47255 |
| Compressed Size | 6088 |
| 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 | sat |
| Inferred Status | sat |
| Size | 47247 |
| Compressed Size | 6103 |
| Max. Term Depth | 22 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 66 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
true | 4 |
false | 1 |
not | 8 |
and | 1 |
= | 305 |
let | 4 |
/ | 49 |
extract | 33 |
bvadd | 240 |
bvslt | 4 |
select | 252 |
store | 22 |
fp | 11 |
fp.neg | 7 |
roundNearestTiesToEven | 1 |
to_fp | 107 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2020
|
0.67 (1/3) |
COLIBRI |
COLIBRI 20.5.25_default |
unknown ❌
|
0.56525
|
0.56579
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.57251
|
0.57264
|
| |
MathSAT |
MathSAT5_default.sh |
unknown ❌
|
0.01890
|
0.01886
|
|
SMT-COMP 2021
|
0.33 (2/3) |
COLIBRI |
COLIBRI_21_06_23_default |
sat ✅
|
0.73388
|
0.73436
|
| |
|
COLIBRI 20.5.25_default |
unknown ❌
|
0.56893
|
0.56949
|
| |
|
COLIBRI_21_05_28_default |
sat ✅
|
0.72781
|
0.72828
|
| |
CVC4 |
CVC4-sq-final_default |
sat ✅
|
0.54729
|
0.54758
|
| |
MathSAT |
mathsat-5.6.6_default |
unknown ❌
|
0.01878
|
0.01873
|
|
SMT-COMP 2022
|
0.40 (3/5) |
Bitwuzla |
Bitwuzla-wrapped_default |
unknown ❌
|
0.02255
|
0.00736
|
| |
COLIBRI |
COLIBRI 22_06_18_default |
sat ✅
|
0.77073
|
0.77080
|
| |
cvc5 |
cvc5_default |
sat ✅
|
0.36725
|
0.36780
|
| |
|
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
0.28193
|
0.28213
|
| |
MathSAT |
MathSAT-5.6.8_default |
unknown ❌
|
0.01624
|
0.01584
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
0.07373
|
0.07562
|
|
SMT-COMP 2023
|
|
Bitwuzla |
Bitwuzla-fixed_default |
sat ✅
|
0.14669
|
0.14661
|
| |
COLIBRI |
COLIBRI 2023_05_10_default |
sat ✅
|
0.93967
|
0.94005
|
| |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
sat ✅
|
0.30407
|
0.30383
|
|
SMT-COMP 2024
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
0.30424
|
0.20466
|
| |
COLIBRI |
COLIBRI |
sat ✅
|
0.92817
|
0.82814
|
| |
cvc5 |
cvc5 |
sat ✅
|
0.40709
|
0.30702
|
|
SMT-COMP 2025
|
0.25 (3/4) |
Bitwuzla |
Bitwuzla |
sat ✅
|
0.31100
|
0.18338
|
| |
COLIBRI |
COLIBRI |
sat ✅
|
1.62412
|
1.50820
|
| |
Colibri2 |
colibri2 |
unknown ❌
|
0.71029
|
0.59225
|
| |
cvc5 |
cvc5 |
sat ✅
|
0.44280
|
0.31192
|