About the Execution of 2025-gold for DBSingleClientW-PT-d0m10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 2246.728 | 126242.00 | 327733.00 | 308.00 | T | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r096-smll-177946996400082.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool gold2025
Input is DBSingleClientW-PT-d0m10, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r096-smll-177946996400082
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 6 18:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 6 18:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 18:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 08:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 08:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 6 18:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Mar 6 18:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 6 18:21 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Mar 6 18:21 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 08:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 08:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 119K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
FORMULA_NAME QuasiLiveness
=== Now, execution of the tool begins
BK_START 1779528435764
Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DBSingleClientW-PT-d0m10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202505121319
[2026-05-23 09:27:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-23 09:27:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:27:18] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-23 09:27:18] [INFO ] Transformed 553 places.
[2026-05-23 09:27:18] [INFO ] Transformed 150 transitions.
[2026-05-23 09:27:18] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 348 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 150/150 transitions.
Reduce places removed 451 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 462 rules applied. Total rules applied 462 place count 102 transition count 139
Applied a total of 462 rules in 38 ms. Remains 102 /553 variables (removed 451) and now considering 139/150 (removed 11) transitions.
// Phase 1: matrix 139 rows 102 cols
[2026-05-23 09:27:18] [INFO ] Computed 2 invariants in 24 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:27:18] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-23 09:27:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:27:19] [INFO ] State equation strengthened by 63 read => feed constraints.
[2026-05-23 09:27:20] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
Running 138 sub problems to find dead transitions.
[2026-05-23 09:27:20] [INFO ] Invariant cache hit.
[2026-05-23 09:27:20] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (OVERLAPS) 1/102 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (OVERLAPS) 139/241 variables, 102/104 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/241 variables, 63/167 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:26] [INFO ] Deduced a trap composed of 34 places in 141 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:26] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:26] [INFO ] Deduced a trap composed of 35 places in 93 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:26] [INFO ] Deduced a trap composed of 36 places in 89 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:26] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:26] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:26] [INFO ] Deduced a trap composed of 20 places in 85 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:27] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:27] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:27] [INFO ] Deduced a trap composed of 38 places in 75 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:27] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 19 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/241 variables, 11/178 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 0/178 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:30] [INFO ] Deduced a trap composed of 36 places in 78 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:30] [INFO ] Deduced a trap composed of 36 places in 81 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:27:31] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 11 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/241 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 10 (OVERLAPS) 0/241 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 181 constraints, problems are : Problem set: 0 solved, 138 unsolved in 15031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 138 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 2 (OVERLAPS) 1/102 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/102 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 12/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/102 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 6 (OVERLAPS) 139/241 variables, 102/118 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/241 variables, 63/181 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/241 variables, 138/319 constraints. Problems are: Problem set: 0 solved, 138 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 138 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 241/241 variables, and 319 constraints, problems are : Problem set: 0 solved, 138 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 138/138 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 45567ms problems are : Problem set: 0 solved, 138 unsolved
Search for dead transitions found 0 dead transitions in 45588ms
Starting structural reductions in LIVENESS mode, iteration 1 : 102/553 places, 139/150 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 47421 ms. Remains : 102/553 places, 139/150 transitions.
Discarding 48 transitions out of 139. Remains 91
Initial state reduction rules removed 1 formulas.
[2026-05-23 09:28:06] [INFO ] Flatten gal took : 126 ms
[2026-05-23 09:28:06] [INFO ] Flatten gal took : 52 ms
RANDOM walk for 40000 steps (9160 resets) in 3264 ms. (12 steps per ms) remains 47/90 properties
[2026-05-23 09:28:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16581858553131307440.gal : 26 ms
[2026-05-23 09:28:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14407991647044427193.prop : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16581858553131307440.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14407991647044427193.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (197 resets) in 130 ms. (30 steps per ms) remains 47/47 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
BEST_FIRST walk for 4004 steps (173 resets) in 85 ms. (46 steps per ms) remains 47/47 properties
Loading property file /tmp/ReachabilityCardinality14407991647044427193.prop.
SDD proceeding with computation,47 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 4004 steps (208 resets) in 165 ms. (24 steps per ms) remains 47/47 properties
SDD proceeding with computation,47 properties remain. new max is 8
SDD size :5 after 33
BEST_FIRST walk for 4002 steps (205 resets) in 95 ms. (41 steps per ms) remains 47/47 properties
SDD proceeding with computation,47 properties remain. new max is 16
SDD size :33 after 205
BEST_FIRST walk for 4003 steps (205 resets) in 42 ms. (93 steps per ms) remains 46/47 properties
BEST_FIRST walk for 4002 steps (187 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (183 resets) in 46 ms. (85 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (199 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (181 resets) in 19 ms. (200 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (205 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (190 resets) in 18 ms. (210 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (199 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
SDD proceeding with computation,47 properties remain. new max is 32
SDD size :205 after 834
BEST_FIRST walk for 4002 steps (185 resets) in 17 ms. (222 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (204 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (202 resets) in 32 ms. (121 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (184 resets) in 21 ms. (181 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (196 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (189 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (194 resets) in 27 ms. (143 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (202 resets) in 16 ms. (235 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (208 resets) in 31 ms. (125 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (198 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4003 steps (188 resets) in 20 ms. (190 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4004 steps (194 resets) in 30 ms. (129 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (800 resets) in 50 ms. (78 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4000 steps (800 resets) in 47 ms. (83 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (362 resets) in 33 ms. (117 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (408 resets) in 24 ms. (160 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4001 steps (411 resets) in 26 ms. (148 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (367 resets) in 23 ms. (166 steps per ms) remains 46/46 properties
BEST_FIRST walk for 4002 steps (357 resets) in 29 ms. (133 steps per ms) remains 44/46 properties
BEST_FIRST walk for 4003 steps (390 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (402 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (416 resets) in 27 ms. (142 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (398 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (404 resets) in 37 ms. (105 steps per ms) remains 44/44 properties
Reachability property qltransition_119 is true.
Reachability property qltransition_117 is true.
BEST_FIRST walk for 4002 steps (424 resets) in 21 ms. (181 steps per ms) remains 44/44 properties
Reachability property qltransition_115 is true.
Reachability property qltransition_25 is true.
SDD proceeding with computation,43 properties remain. new max is 32
SDD size :834 after 18714
BEST_FIRST walk for 4003 steps (445 resets) in 22 ms. (174 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4000 steps (413 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (422 resets) in 26 ms. (148 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (399 resets) in 57 ms. (69 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4001 steps (380 resets) in 37 ms. (105 steps per ms) remains 41/44 properties
BEST_FIRST walk for 4002 steps (422 resets) in 36 ms. (108 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (396 resets) in 23 ms. (166 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4001 steps (386 resets) in 21 ms. (181 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4002 steps (388 resets) in 17 ms. (222 steps per ms) remains 41/41 properties
BEST_FIRST walk for 4004 steps (397 resets) in 27 ms. (143 steps per ms) remains 41/41 properties
[2026-05-23 09:28:07] [INFO ] Invariant cache hit.
[2026-05-23 09:28:07] [INFO ] State equation strengthened by 63 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,43 properties remain. new max is 64
SDD size :18714 after 128164
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (OVERLAPS) 22/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (OVERLAPS) 23/90 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
SDD proceeding with computation,43 properties remain. new max is 128
SDD size :128164 after 594844
At refinement iteration 4 (INCLUDED_ONLY) 0/90 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 123/213 variables, 90/92 constraints. Problems are: Problem set: 0 solved, 38 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 47/139 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Reachability property qltransition_85 is true.
SDD proceeding with computation,42 properties remain. new max is 128
SDD size :594844 after 1.69867e+06
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/139 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 8 (OVERLAPS) 28/241 variables, 12/151 constraints. Problems are: Problem set: 1 solved, 37 unsolved
SDD proceeding with computation,42 properties remain. new max is 256
SDD size :1.69867e+06 after 2.06878e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/241 variables, 16/167 constraints. Problems are: Problem set: 1 solved, 37 unsolved
SDD proceeding with computation,42 properties remain. new max is 512
SDD size :2.06878e+06 after 2.5217e+06
At refinement iteration 10 (INCLUDED_ONLY) 0/241 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 11 (OVERLAPS) 0/241 variables, 0/167 constraints. Problems are: Problem set: 1 solved, 37 unsolved
No progress, stopping.
After SMT solving in domain Real declared 241/241 variables, and 167 constraints, problems are : Problem set: 1 solved, 37 unsolved in 2734 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 102/102 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 37 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 1 (OVERLAPS) 22/66 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 37 unsolved
At refinement iteration 3 (OVERLAPS) 23/89 variables, 1/2 constraints. Problems are: Problem set: 1 solved, 37 unsolved
Reachability property qltransition_93 is true.
Reachability property qltransition_89 is true.
SDD proceeding with computation,40 properties remain. new max is 512
SDD size :2.5217e+06 after 9.5543e+06
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 0/2 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 123/212 variables, 89/91 constraints. Problems are: Problem set: 3 solved, 35 unsolved
SDD proceeding with computation,40 properties remain. new max is 1024
SDD size :9.5543e+06 after 1.04904e+07
At refinement iteration 6 (INCLUDED_ONLY) 0/212 variables, 47/138 constraints. Problems are: Problem set: 3 solved, 35 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/212 variables, 13/151 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:11] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:11] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:11] [INFO ] Deduced a trap composed of 36 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:11] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:12] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:12] [INFO ] Deduced a trap composed of 37 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:12] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:12] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:12] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:12] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/212 variables, 10/161 constraints. Problems are: Problem set: 3 solved, 35 unsolved
SDD proceeding with computation,40 properties remain. new max is 2048
SDD size :1.04904e+07 after 2.20986e+07
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:28:13] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/212 variables, 1/162 constraints. Problems are: Problem set: 3 solved, 35 unsolved
Reachability property qltransition_136 is true.
Reachability property qltransition_133 is true.
At refinement iteration 10 (INCLUDED_ONLY) 0/212 variables, 0/162 constraints. Problems are: Problem set: 5 solved, 33 unsolved
SMT process timed out in 7788ms, After SMT, problems are : Problem set: 5 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 102 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 102/102 places, 139/139 transitions.
SDD proceeding with computation,38 properties remain. new max is 2048
Discarding 9 places :
SDD size :2.20986e+07 after 4.51116e+07
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 93 transition count 126
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 93 transition count 126
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 90 transition count 123
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 90 transition count 123
Applied a total of 24 rules in 45 ms. Remains 90 /102 variables (removed 12) and now considering 123/139 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 90/102 places, 123/139 transitions.
SDD proceeding with computation,38 properties remain. new max is 4096
SDD size :4.51116e+07 after 7.10583e+07
RANDOM walk for 4000000 steps (915375 resets) in 30793 ms. (129 steps per ms) remains 16/33 properties
BEST_FIRST walk for 400004 steps (19820 resets) in 1134 ms. (352 steps per ms) remains 14/16 properties
BEST_FIRST walk for 400003 steps (19743 resets) in 783 ms. (510 steps per ms) remains 12/14 properties
BEST_FIRST walk for 400004 steps (19875 resets) in 819 ms. (487 steps per ms) remains 10/12 properties
BEST_FIRST walk for 400003 steps (19699 resets) in 763 ms. (523 steps per ms) remains 10/10 properties
SDD proceeding with computation,38 properties remain. new max is 8192
BEST_FIRST walk for 400000 steps (80000 resets) in 1169 ms. (341 steps per ms) remains 10/10 properties
SDD size :7.10583e+07 after 1.03381e+08
BEST_FIRST walk for 400000 steps (80000 resets) in 1557 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (40286 resets) in 1089 ms. (366 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (40437 resets) in 1012 ms. (394 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400003 steps (40257 resets) in 866 ms. (461 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400002 steps (40279 resets) in 1005 ms. (397 steps per ms) remains 10/10 properties
BEST_FIRST walk for 400001 steps (40380 resets) in 1099 ms. (363 steps per ms) remains 10/10 properties
// Phase 1: matrix 123 rows 90 cols
[2026-05-23 09:28:28] [INFO ] Computed 2 invariants in 4 ms
[2026-05-23 09:28:28] [INFO ] State equation strengthened by 54 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 24/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 95/160 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (OVERLAPS) 47/207 variables, 22/115 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 25/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 6/213 variables, 3/143 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/213 variables, 3/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (OVERLAPS) 0/213 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 213/213 variables, and 146 constraints, problems are : Problem set: 0 solved, 10 unsolved in 832 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 26/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 24/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 95/160 variables, 65/67 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 26/93 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 47/207 variables, 22/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/207 variables, 25/142 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/207 variables, 8/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,38 properties remain. new max is 16384
SDD size :1.03381e+08 after 1.28552e+08
At refinement iteration 12 (INCLUDED_ONLY) 0/207 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 6/213 variables, 3/153 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/213 variables, 3/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/213 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 0/213 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 213/213 variables, and 156 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2507 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 90/90 constraints, ReadFeed: 54/54 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3361ms problems are : Problem set: 0 solved, 10 unsolved
Parikh walk visited 0 properties in 2894 ms.
Support contains 15 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 123/123 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 81 transition count 104
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 81 transition count 104
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 74 transition count 97
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 74 transition count 97
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 72 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 72 transition count 92
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 37 place count 72 transition count 91
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 71 transition count 90
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 71 transition count 90
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 40 place count 70 transition count 89
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 43 place count 70 transition count 87
Applied a total of 43 rules in 26 ms. Remains 70 /90 variables (removed 20) and now considering 87/123 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 70/90 places, 87/123 transitions.
RANDOM walk for 4000000 steps (915732 resets) in 15278 ms. (261 steps per ms) remains 8/10 properties
BEST_FIRST walk for 4000004 steps (200548 resets) in 5628 ms. (710 steps per ms) remains 6/8 properties
BEST_FIRST walk for 4000000 steps (800000 resets) in 8472 ms. (472 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (406284 resets) in 5136 ms. (778 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (406656 resets) in 5398 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (405534 resets) in 5903 ms. (677 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000002 steps (406895 resets) in 5911 ms. (676 steps per ms) remains 6/6 properties
// Phase 1: matrix 87 rows 70 cols
[2026-05-23 09:28:50] [INFO ] Computed 2 invariants in 3 ms
[2026-05-23 09:28:50] [INFO ] State equation strengthened by 32 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 65/117 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 36/153 variables, 16/80 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/153 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 4/157 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/157 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 0/157 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 157/157 variables, and 104 constraints, problems are : Problem set: 0 solved, 6 unsolved in 325 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 20/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 21/52 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 65/117 variables, 52/54 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/117 variables, 10/64 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/117 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/117 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 36/153 variables, 16/82 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/153 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/153 variables, 4/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/153 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 4/157 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/157 variables, 2/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/157 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/157 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 157/157 variables, and 110 constraints, problems are : Problem set: 0 solved, 6 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 70/70 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1254ms problems are : Problem set: 0 solved, 6 unsolved
Reachability property qltransition_137 is true.
Reachability property qltransition_135 is true.
Reachability property qltransition_134 is true.
Reachability property qltransition_120 is true.
Reachability property qltransition_118 is true.
Reachability property qltransition_116 is true.
Reachability property qltransition_114 is true.
Reachability property qltransition_106 is true.
Reachability property qltransition_105 is true.
Reachability property qltransition_90 is true.
Reachability property qltransition_86 is true.
Reachability property qltransition_27 is true.
Reachability property qltransition_23 is true.
Reachability property qltransition_22 is true.
SDD proceeding with computation,24 properties remain. new max is 16384
Parikh walk visited 0 properties in 1673 ms.
Support contains 11 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 87/87 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 68 transition count 81
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 68 transition count 81
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 66 transition count 79
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 66 transition count 79
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 66 transition count 78
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 65 transition count 77
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 65 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 64 transition count 75
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 63 transition count 74
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 63 transition count 74
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 62 transition count 73
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 62 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 19 place count 62 transition count 71
Applied a total of 19 rules in 26 ms. Remains 62 /70 variables (removed 8) and now considering 71/87 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 62/70 places, 71/87 transitions.
SDD size :1.28552e+08 after 4.45682e+08
RANDOM walk for 4000000 steps (917428 resets) in 9568 ms. (418 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000004 steps (202206 resets) in 3871 ms. (1033 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (407058 resets) in 6155 ms. (649 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (407583 resets) in 4994 ms. (800 steps per ms) remains 5/5 properties
Reachability property qltransition_138 is true.
Reachability property qltransition_73 is true.
SDD proceeding with computation,22 properties remain. new max is 16384
SDD size :4.45682e+08 after 6.67891e+08
BEST_FIRST walk for 4000003 steps (408657 resets) in 7716 ms. (518 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000004 steps (407740 resets) in 4933 ms. (810 steps per ms) remains 5/5 properties
// Phase 1: matrix 71 rows 62 cols
[2026-05-23 09:29:06] [INFO ] Computed 2 invariants in 1 ms
[2026-05-23 09:29:06] [INFO ] State equation strengthened by 24 read => feed constraints.
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 18/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 53/99 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 30/129 variables, 14/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 16/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/133 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/133 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 88 constraints, problems are : Problem set: 0 solved, 5 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 90.0 s and query timeout 9000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 18/27 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19/46 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 53/99 variables, 46/48 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 30/129 variables, 14/70 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/129 variables, 16/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/129 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/129 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 4/133 variables, 2/91 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/133 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/133 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 93 constraints, problems are : Problem set: 0 solved, 5 unsolved in 522 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 62/62 constraints, ReadFeed: 24/24 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 753ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 617 ms.
Support contains 9 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 71/71 transitions.
Graph (complete) has 182 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 61 transition count 69
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 60 transition count 68
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 60 transition count 67
Applied a total of 6 rules in 22 ms. Remains 60 /62 variables (removed 2) and now considering 67/71 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 60/62 places, 67/71 transitions.
RANDOM walk for 4000000 steps (916950 resets) in 8974 ms. (445 steps per ms) remains 3/5 properties
BEST_FIRST walk for 4000000 steps (407086 resets) in 4012 ms. (996 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000003 steps (406107 resets) in 3883 ms. (1029 steps per ms) remains 3/3 properties
Reachability property qltransition_74 is true.
SDD proceeding with computation,21 properties remain. new max is 16384
SDD size :6.67891e+08 after 9.6841e+08
BEST_FIRST walk for 4000002 steps (407638 resets) in 4101 ms. (975 steps per ms) remains 3/3 properties
// Phase 1: matrix 67 rows 60 cols
[2026-05-23 09:29:14] [INFO ] Computed 2 invariants in 1 ms
[2026-05-23 09:29:14] [INFO ] State equation strengthened by 20 read => feed constraints.
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 53/97 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 29/126 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/127 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/127 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/127 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 82 constraints, problems are : Problem set: 0 solved, 3 unsolved in 141 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 105.0 s and query timeout 10500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 39/44 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 53/97 variables, 44/46 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 8/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 29/126 variables, 15/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 12/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/126 variables, 3/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/126 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/127 variables, 1/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/127 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 85 constraints, problems are : Problem set: 0 solved, 3 unsolved in 267 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 60/60 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 416ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 241 ms.
Support contains 5 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 67/67 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 59 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 66
Applied a total of 2 rules in 7 ms. Remains 59 /60 variables (removed 1) and now considering 66/67 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 59/60 places, 66/67 transitions.
RANDOM walk for 4000000 steps (916997 resets) in 7946 ms. (503 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (407314 resets) in 4402 ms. (908 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000002 steps (407166 resets) in 3957 ms. (1010 steps per ms) remains 3/3 properties
SDD proceeding with computation,21 properties remain. new max is 32768
SDD size :9.6841e+08 after 1.02013e+09
BEST_FIRST walk for 4000003 steps (407572 resets) in 3561 ms. (1122 steps per ms) remains 3/3 properties
Finished probabilistic random walk after 4395 steps, run visited all 3 properties in 53 ms. (steps per millisecond=82 )
Probabilistic random walk after 4395 steps, saw 2007 distinct states, run finished after 60 ms. (steps per millisecond=73 ) properties seen :3
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 91 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 123955 ms.
BK_STOP 1779528562006
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d0m10"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool gold2025"
echo " Input is DBSingleClientW-PT-d0m10, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r096-smll-177946996400082"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m10.tgz
mv DBSingleClientW-PT-d0m10 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "QuasiLiveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
