Benchmark
non-incremental/FP/20200911-Pine/1599120907827191000.smt2
These benchmarks were generated while developing the tool Pine [1], which uses
CVC4/Z3 to check inductiveness of invariants. The work is described in [2].
[1] https://github.com/izycheva/pine
[2] A.Izycheva, E.Darulova, H.Seidl, SAS'20, "Counterexample- and Simulation-Guided Floating-Point Loop Invariant Synthesis"
Loop:
x' := x + 0.01 * (-2*x - 3*y + x*x)
y' := y + 0.01 * (x + y)
Input ranges:
x in [0.0,0.1]
y in [0.0,0.1]
Invariant:
-0.03*x + -0.12*y + 0.49*x^2 + 1.0*x*y + 0.89*y^2 <= 0.02
and
x in [-0.5,0.2]
y in [-0.2,0.4]
Query: Loop and Invariant and not Invariant'
| Benchmark |
| Size | 4221 |
| Compressed Size | 1230 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2021-07-18 |
| Generated By | Anastasiia Izycheva, Eva Darulova |
| Generated On | 2020-09-11 00:00:00 |
| Generator | Pine (using Z3 Python API) |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | unknown |
| Inferred Status | sat |
| Size | 4213 |
| Compressed Size | 1249 |
| Max. Term Depth | 33 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 4 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
not | 1 |
and | 6 |
let | 29 |
fp | 24 |
fp.add | 12 |
fp.sub | 1 |
fp.mul | 21 |
fp.neg | 1 |
fp.leq | 10 |
fp.eq | 2 |
roundNearestTiesToEven | 34 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2024
|
|
Bitwuzla |
Bitwuzla |
sat ✅
|
243.11013
|
242.99990
|
| |
cvc5 |
cvc5 |
sat ✅
|
720.11640
|
719.77633
|