Benchmark
non-incremental/QF_ABVFP/20170428-Liew-KLEE/imperial_synthetic_interval_klee_no_bug.x86_64/query.12.smt2
Corresponding query: An equisatisfiable query (arrays replaced with bitvectors) is available at QF_BVFP/20170428-Liew-KLEE/imperial_synthetic_interval_klee_no_bug.x86_64/query.12.smt2
| Benchmark |
|---|
| Size | 1751 |
| Compressed Size | 742 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2017-07-23 |
| Generated By | Daniel Liew, Daniel Schemmel, Cristian Cadar, Alastair Donaldson, and Rafael Zähl |
| Generated On | — |
| Generator | KLEE |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unsat |
| Inferred Status | unsat |
| Size | 1743 |
| Compressed Size | 730 |
| Max. Term Depth | 10 |
| Asserts | 3 |
| Declared Functions | 0 |
| Declared Constants | 1 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
ite | 2 |
not | 3 |
= | 1 |
let | 8 |
concat | 9 |
select | 12 |
fp.add | 2 |
fp.gt | 1 |
fp.isInfinite | 1 |
fp.isNaN | 2 |
roundNearestTiesToEven | 3 |
to_fp | 7 |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2018
|
|
COLIBRI |
COLIBRI 10_06_18 v2038_default |
unsat ✅
|
0.29059
|
0.29087
|
| |
CVC4 |
master-2018-06-10-b19c840-competition-default_default |
unsat ✅
|
0.17952
|
0.17970
|