Benchmark
non-incremental/QF_UFIDL/20210312-Bouvier/vlsat3_l97.smt2
Publications:
[1] Pierre Bouvier, Hubert Garavel, and Hernan Ponce de Leon.
"Automatic Decomposition of Petri Nets into Automata Networks -
A Synthetic Account". Proceedings PETRI NETS 2020, LNCS 12152,
Springer. https://doi.org/10.1007/978-3-030-51831-8_1
[2] Hubert Garavel. "Nested-Unit Petri Nets". Journal of Logical
and Algebraic Methods in Programming, vol. 104, Elsevier, 2019.
https://doi.org/10.1016/j.jlamp.2018.11.005
In [1], several methods for decomposing an ordinary, safe Petri net
into a flat, unit-safe NUPN [2], have been proposed. These methods
are implemented in a complete tool chain involving SAT solvers, SMT
solvers, and tools for graph coloring and finding maximal cliques.
From a data set of 12,000+ NUPN models, 51,000+ SMT formulas have
been generated, out of which a subset of 1200 interesting formulas
to be used as SMT-LIB 2.6 benchmarks was carefully selected.
Original filename: vlsat3_l97.smt2
Specific parameters for the present benchmark:
- number of places: 164
- number of units: 34
- number of edges in the concurrency graph: 10471
- number of variables: 0
- number of uninterpreted functions: 1
- number of asserts: 10635
- total number of operators in asserts: 67890
| Benchmark |
| Size | 438020 |
| Compressed Size | 39614 |
| License |
Creative Commons Attribution 4.0 International
(CC-BY-4.0)
|
| Category | industrial |
| First Occurrence | 2021-07-18 |
| Generated By | Pierre Bouvier |
| Generated On | 2021-03-12 00:00:00 |
| Generator | — |
| Dolmen OK | 1 |
| strict Dolmen OK | 1 |
| check-sat calls | 1 |
| Status | sat |
| Inferred Status | sat |
| Size | 438012 |
| Compressed Size | 39621 |
| Max. Term Depth | 3 |
| Asserts | 10635 |
| Declared Functions | 1 |
| Declared Constants | 0 |
| Declared Sorts | 0 |
| Defined Functions | 0 |
| Defined Recursive Functions | 0 |
| Defined Sorts | 0 |
| Constants | 0 |
| Declared Datatypes | 0 |
Symbols
or | 163 |
= | 5015 |
distinct | 10471 |
| |
Evaluations
| Evaluation |
Rating |
Solver |
Variant |
Result |
Wallclock |
CPU Time |
|
SMT-COMP 2021
|
0.40 (3/5) |
cvc5 |
cvc5-fixed_default |
sat ✅
|
206.13800
|
206.10100
|
| |
MathSAT |
mathsat-5.6.6_default |
unknown ❌
|
1200.12000
|
1199.80000
|
| |
SMTInterpol |
smtinterpol-2.5-823-g881e8631_default |
sat ✅
|
13.02230
|
20.35930
|
| |
veriT |
veriT_default |
sat ✅
|
0.78456
|
0.78448
|
| |
Z3 |
z3-4.8.11_default |
unknown ❌
|
1200.02000
|
1199.97000
|
|
SMT-COMP 2022
|
0.40 (3/5) |
cvc5 |
cvc5-default-2022-07-02-b15e116-wrapped_sq |
sat ✅
|
184.45200
|
184.44600
|
| |
MathSAT |
MathSAT-5.6.8_default |
unknown ❌
|
1200.09000
|
1199.93000
|
| |
veriT |
veriT_default |
sat ✅
|
0.42005
|
0.42023
|
| |
Yices2 |
Yices 2.6.2 for SMTCOMP 2021_default |
unknown ❌
|
1200.02000
|
1199.90000
|
| |
Z3 |
z3-4.8.17_default |
sat ✅
|
455.23600
|
455.14300
|
|
SMT-COMP 2023
|
0.40 (3/5) |
cvc5 |
cvc5-default-2023-05-16-ea045f305_sq |
sat ✅
|
199.96900
|
199.95700
|
| |
OpenSMT |
OpenSMT a78dcf01_default |
sat ✅
|
7.58517
|
7.58065
|
| |
SMTInterpol |
smtinterpol-2.5-1272-g2d6d356c_default |
sat ✅
|
18.79800
|
26.70560
|
| |
Yices2 |
Yices 2 for SMTCOMP 2023_default |
unknown ❌
|
1200.02000
|
1199.87000
|
| |
Z3 |
z3-4.8.17_default |
unknown ❌
|
1200.01000
|
1199.79000
|
|
SMT-COMP 2024
|
0.25 (3/4) |
cvc5 |
cvc5 |
sat ✅
|
217.15646
|
216.94189
|
| |
OpenSMT |
OpenSMT |
sat ✅
|
5.01700
|
4.91676
|
| |
SMTInterpol |
SMTInterpol |
sat ✅
|
36.18755
|
57.88897
|
| |
Yices2 |
Yices2 |
unknown ❌
|
1201.22872
|
1200.39837
|