Benchmark
incremental/QF_BVFPLRA/20170501-Heizmann-UltimateAutomizer/square_5_true-unreach-call.i.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 2017 [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.
2017-05-01, Matthias Heizmann (heizmann@informatik.uni-freiburg.de)
[1] https://ultimate.informatik.uni-freiburg.de/automizer/
[2] Matthias Heizmann, Yu-Wen Chen, Daniel Dietsch, Marius Greitschus,
Alexander Nutz, Betim Musa, Claus Schätzle, Christian Schilling,
Frank Schüssele, Andreas Podelski:
Ultimate Automizer with an On-Demand Construction of Floyd-Hoare
Automata - (Competition Contribution). TACAS (2) 2017: 394-398
[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: Software Verification with Validation of Results -
(Report on SV-COMP 2017). TACAS (2) 2017: 331-349
[6] https://sv-comp.sosy-lab.org/2017/
| Benchmark |
|---|
| Size | 3734 |
| Compressed Size | 1315 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2017-07-23 |
| Generated By | — |
| Generated On | — |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 11 |
| Status | sat |
| Inferred Status | None |
| Size | 1500 |
| Compressed Size | 877 |
| Max. Term Depth | 0 |
| Asserts | 0 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
| Status | sat |
| Inferred Status | None |
| Size | 1524 |
| Compressed Size | 879 |
| Max. Term Depth | 0 |
| Asserts | 0 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
| Status | sat |
| Inferred Status | None |
| Size | 1525 |
| Compressed Size | 880 |
| Max. Term Depth | 0 |
| Asserts | 0 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
| Status | sat |
| Inferred Status | None |
| Size | 1526 |
| Compressed Size | 880 |
| Max. Term Depth | 0 |
| Asserts | 0 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
| Status | sat |
| Inferred Status | None |
| Size | 2525 |
| Compressed Size | 1153 |
| Max. Term Depth | 10 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 3 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
and | 1 |
= | 2 |
let | 1 |
fp.add | 2 |
fp.sub | 2 |
fp.mul | 10 |
fp.lt | 1 |
fp.geq | 1 |
to_fp | 6 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 1788 |
| Compressed Size | 1005 |
| Max. Term Depth | 6 |
| Asserts | 1 |
| 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
not | 1 |
and | 1 |
let | 1 |
fp.lt | 1 |
fp.geq | 1 |
to_fp | 1 |
| | | |
| Status | sat |
| Inferred Status | None |
| Size | 1529 |
| Compressed Size | 885 |
| Max. Term Depth | 0 |
| Asserts | 0 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
| Status | unsat |
| Inferred Status | None |
| Size | 1547 |
| Compressed Size | 896 |
| Max. Term Depth | 0 |
| Asserts | 1 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
| Status | sat |
| Inferred Status | None |
| Size | 1785 |
| Compressed Size | 1002 |
| Max. Term Depth | 5 |
| Asserts | 1 |
| 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
and | 1 |
let | 1 |
fp.lt | 1 |
fp.geq | 1 |
to_fp | 1 |
| | | | | |
| Status | sat |
| Inferred Status | None |
| Size | 1693 |
| Compressed Size | 963 |
| Max. Term Depth | 3 |
| Asserts | 1 |
| 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
| Status | sat |
| Inferred Status | None |
| Size | 1533 |
| Compressed Size | 885 |
| Max. Term Depth | 0 |
| Asserts | 0 |
| Declared Functions | 0 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols