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.r095-smll-177946996300052.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 DES-PT-40a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r095-smll-177946996300052
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 8.0K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 6 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 08:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 83K 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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-40a-UpperBounds-00
FORMULA_NAME DES-PT-40a-UpperBounds-01
FORMULA_NAME DES-PT-40a-UpperBounds-02
FORMULA_NAME DES-PT-40a-UpperBounds-03
FORMULA_NAME DES-PT-40a-UpperBounds-04
FORMULA_NAME DES-PT-40a-UpperBounds-05
FORMULA_NAME DES-PT-40a-UpperBounds-06
FORMULA_NAME DES-PT-40a-UpperBounds-07
FORMULA_NAME DES-PT-40a-UpperBounds-08
FORMULA_NAME DES-PT-40a-UpperBounds-09
FORMULA_NAME DES-PT-40a-UpperBounds-10
FORMULA_NAME DES-PT-40a-UpperBounds-11
FORMULA_NAME DES-PT-40a-UpperBounds-12
FORMULA_NAME DES-PT-40a-UpperBounds-13
FORMULA_NAME DES-PT-40a-UpperBounds-14
FORMULA_NAME DES-PT-40a-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779527735751

Invoking MCC driver with
GOLD_TOOL=
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202505121319
[2026-05-23 09:15:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-23 09:15:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:15:38] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2026-05-23 09:15:38] [INFO ] Transformed 274 places.
[2026-05-23 09:15:38] [INFO ] Transformed 231 transitions.
[2026-05-23 09:15:38] [INFO ] Found NUPN structural information;
[2026-05-23 09:15:38] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 447 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 15 ms.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 217 rows 274 cols
[2026-05-23 09:15:38] [INFO ] Computed 59 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (229 resets) in 124 ms. (80 steps per ms)
FORMULA DES-PT-40a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70004 steps (303 resets) in 362 ms. (192 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-23 09:15:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:39] [INFO ] [Real]Absence check using 34 positive place invariants in 25 ms returned sat
[2026-05-23 09:15:39] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 36 ms returned sat
[2026-05-23 09:15:40] [INFO ] [Real]Absence check using state equation in 280 ms returned sat
[2026-05-23 09:15:40] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:15:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-23 09:15:40] [INFO ] [Nat]Absence check using state equation in 236 ms returned sat
[2026-05-23 09:15:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-23 09:15:40] [INFO ] [Nat]Added 1 Read/Feed constraints in 51 ms returned sat
[2026-05-23 09:15:40] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 42 ms.
[2026-05-23 09:15:41] [INFO ] Added : 114 causal constraints over 24 iterations in 1078 ms. Result :sat
Minimization took 337 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:42] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2026-05-23 09:15:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:15:42] [INFO ] [Real]Absence check using state equation in 343 ms returned sat
[2026-05-23 09:15:42] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 28 ms returned sat
[2026-05-23 09:15:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-23 09:15:43] [INFO ] [Nat]Absence check using state equation in 295 ms returned sat
[2026-05-23 09:15:43] [INFO ] [Nat]Added 1 Read/Feed constraints in 45 ms returned sat
[2026-05-23 09:15:43] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 38 ms.
[2026-05-23 09:15:45] [INFO ] Added : 56 causal constraints over 12 iterations in 1851 ms. Result :sat
Minimization took 255 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:45] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:15:45] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 32 ms returned sat
[2026-05-23 09:15:45] [INFO ] [Real]Absence check using state equation in 322 ms returned sat
[2026-05-23 09:15:45] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:15:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:15:46] [INFO ] [Nat]Absence check using state equation in 515 ms returned sat
[2026-05-23 09:15:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 34 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:15:46] [INFO ] Deduced a trap composed of 17 places in 158 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:15:47] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 8 ms to minimize.
[2026-05-23 09:15:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2026-05-23 09:15:47] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 31 ms.
[2026-05-23 09:15:50] [INFO ] Added : 182 causal constraints over 37 iterations in 3287 ms. Result :sat
Minimization took 268 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:50] [INFO ] [Real]Absence check using 34 positive place invariants in 24 ms returned sat
[2026-05-23 09:15:50] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 38 ms returned sat
[2026-05-23 09:15:51] [INFO ] [Real]Absence check using state equation in 302 ms returned sat
[2026-05-23 09:15:51] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:51] [INFO ] [Nat]Absence check using 34 positive place invariants in 29 ms returned sat
[2026-05-23 09:15:51] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 35 ms returned sat
[2026-05-23 09:15:51] [INFO ] [Nat]Absence check using state equation in 215 ms returned sat
[2026-05-23 09:15:51] [INFO ] [Nat]Added 1 Read/Feed constraints in 63 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:15:51] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 8 ms to minimize.
[2026-05-23 09:15:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
[2026-05-23 09:15:51] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 25 ms.
[2026-05-23 09:15:54] [INFO ] Added : 206 causal constraints over 42 iterations in 2611 ms. Result :sat
Minimization took 269 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:54] [INFO ] [Real]Absence check using 34 positive place invariants in 23 ms returned sat
[2026-05-23 09:15:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2026-05-23 09:15:55] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2026-05-23 09:15:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2026-05-23 09:15:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 34 ms returned sat
[2026-05-23 09:15:55] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2026-05-23 09:15:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 86 ms returned sat
[2026-05-23 09:15:55] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 25 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:15:56] [INFO ] Deduced a trap composed of 17 places in 143 ms of which 11 ms to minimize.
[2026-05-23 09:15:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 222 ms
[2026-05-23 09:15:56] [INFO ] Added : 122 causal constraints over 25 iterations in 1275 ms. Result :sat
Minimization took 247 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:57] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2026-05-23 09:15:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 24 ms returned sat
[2026-05-23 09:15:57] [INFO ] [Real]Absence check using state equation in 239 ms returned sat
[2026-05-23 09:15:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:15:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 19 ms returned sat
[2026-05-23 09:15:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-23 09:15:58] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2026-05-23 09:15:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 39 ms returned sat
[2026-05-23 09:15:58] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 33 ms.
[2026-05-23 09:15:59] [INFO ] Added : 77 causal constraints over 16 iterations in 1630 ms. Result :sat
Minimization took 154 ms.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:16:00] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2026-05-23 09:16:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 37 ms returned sat
[2026-05-23 09:16:00] [INFO ] [Real]Absence check using state equation in 346 ms returned sat
[2026-05-23 09:16:00] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
[2026-05-23 09:16:00] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2026-05-23 09:16:00] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2026-05-23 09:16:00] [INFO ] [Nat]Absence check using state equation in 308 ms returned sat
[2026-05-23 09:16:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 42 ms returned sat
[2026-05-23 09:16:01] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 25 ms.
[2026-05-23 09:16:01] [INFO ] Added : 63 causal constraints over 13 iterations in 951 ms. Result :sat
Minimization took 194 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 217/217 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 2 place count 274 transition count 215
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 273 transition count 214
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 273 transition count 214
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 273 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 272 transition count 213
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 271 transition count 213
Applied a total of 11 rules in 142 ms. Remains 271 /274 variables (removed 3) and now considering 213/217 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2026-05-23 09:16:04] [INFO ] Computed 60 invariants in 14 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13611 resets) in 2524 ms. (396 steps per ms)
BEST_FIRST walk for 7000005 steps (15887 resets) in 7927 ms. (882 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2026-05-23 09:16:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:15] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:16:15] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2026-05-23 09:16:15] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-23 09:16:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:16:15] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-23 09:16:15] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 23 ms.
[2026-05-23 09:16:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:16:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2026-05-23 09:16:16] [INFO ] [Nat]Absence check using state equation in 218 ms returned sat
[2026-05-23 09:16:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-23 09:16:16] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 24 ms.
[2026-05-23 09:16:17] [INFO ] Added : 120 causal constraints over 24 iterations in 741 ms. Result :sat
Minimization took 209 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:17] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:16:17] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2026-05-23 09:16:17] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2026-05-23 09:16:17] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 21 ms returned sat
[2026-05-23 09:16:17] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2026-05-23 09:16:18] [INFO ] [Nat]Absence check using state equation in 195 ms returned sat
[2026-05-23 09:16:18] [INFO ] [Nat]Added 2 Read/Feed constraints in 16 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:18] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 11 ms to minimize.
[2026-05-23 09:16:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 133 ms
[2026-05-23 09:16:18] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 15 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:18] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:19] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 6 ms to minimize.
[2026-05-23 09:16:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 350 ms
[2026-05-23 09:16:19] [INFO ] Added : 66 causal constraints over 14 iterations in 831 ms. Result :sat
Minimization took 143 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:19] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2026-05-23 09:16:19] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 26 ms returned sat
[2026-05-23 09:16:19] [INFO ] [Real]Absence check using state equation in 177 ms returned sat
[2026-05-23 09:16:19] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2026-05-23 09:16:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 25 ms returned sat
[2026-05-23 09:16:19] [INFO ] [Nat]Absence check using state equation in 190 ms returned sat
[2026-05-23 09:16:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:20] [INFO ] Deduced a trap composed of 15 places in 107 ms of which 9 ms to minimize.
[2026-05-23 09:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 137 ms
[2026-05-23 09:16:20] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 16 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:20] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 3 ms to minimize.
[2026-05-23 09:16:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2026-05-23 09:16:20] [INFO ] Added : 90 causal constraints over 19 iterations in 542 ms. Result :sat
Minimization took 149 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:20] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:16:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2026-05-23 09:16:21] [INFO ] [Real]Absence check using state equation in 171 ms returned sat
[2026-05-23 09:16:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2026-05-23 09:16:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2026-05-23 09:16:21] [INFO ] [Nat]Absence check using state equation in 202 ms returned sat
[2026-05-23 09:16:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:21] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 11 ms to minimize.
[2026-05-23 09:16:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 145 ms
[2026-05-23 09:16:21] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 26 ms.
[2026-05-23 09:16:22] [INFO ] Added : 164 causal constraints over 33 iterations in 844 ms. Result :sat
Minimization took 151 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:22] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:16:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2026-05-23 09:16:22] [INFO ] [Real]Absence check using state equation in 154 ms returned sat
[2026-05-23 09:16:22] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2026-05-23 09:16:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 20 ms returned sat
[2026-05-23 09:16:23] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2026-05-23 09:16:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:23] [INFO ] Deduced a trap composed of 15 places in 185 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:23] [INFO ] Deduced a trap composed of 7 places in 243 ms of which 18 ms to minimize.
[2026-05-23 09:16:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 481 ms
[2026-05-23 09:16:23] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 22 ms.
[2026-05-23 09:16:24] [INFO ] Added : 112 causal constraints over 23 iterations in 587 ms. Result :sat
Minimization took 142 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:24] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2026-05-23 09:16:24] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 19 ms returned sat
[2026-05-23 09:16:24] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2026-05-23 09:16:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:24] [INFO ] [Nat]Absence check using 35 positive place invariants in 18 ms returned sat
[2026-05-23 09:16:24] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 29 ms returned sat
[2026-05-23 09:16:24] [INFO ] [Nat]Absence check using state equation in 235 ms returned sat
[2026-05-23 09:16:24] [INFO ] [Nat]Added 2 Read/Feed constraints in 17 ms returned sat
[2026-05-23 09:16:24] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 21 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:25] [INFO ] Deduced a trap composed of 6 places in 109 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:25] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 9 ms to minimize.
[2026-05-23 09:16:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 313 ms
[2026-05-23 09:16:25] [INFO ] Added : 82 causal constraints over 17 iterations in 821 ms. Result :sat
Minimization took 201 ms.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:26] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2026-05-23 09:16:26] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 22 ms returned sat
[2026-05-23 09:16:26] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2026-05-23 09:16:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
[2026-05-23 09:16:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2026-05-23 09:16:26] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 30 ms returned sat
[2026-05-23 09:16:26] [INFO ] [Nat]Absence check using state equation in 262 ms returned sat
[2026-05-23 09:16:26] [INFO ] [Nat]Added 2 Read/Feed constraints in 35 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:26] [INFO ] Deduced a trap composed of 15 places in 148 ms of which 13 ms to minimize.
[2026-05-23 09:16:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 194 ms
[2026-05-23 09:16:26] [INFO ] Computed and/alt/rep : 204/348/204 causal constraints (skipped 6 transitions) in 22 ms.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:27] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:27] [INFO ] Deduced a trap composed of 6 places in 86 ms of which 8 ms to minimize.
[2026-05-23 09:16:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2026-05-23 09:16:27] [INFO ] Added : 62 causal constraints over 14 iterations in 740 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 14 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-23 09:16:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:16:30] [INFO ] Implicit Places using invariants in 453 ms returned []
[2026-05-23 09:16:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:16:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:16:30] [INFO ] Implicit Places using invariants and state equation in 664 ms returned []
Implicit Place search using SMT with State Equation took 1119 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:16:30] [INFO ] Redundant transitions in 10 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-23 09:16:30] [INFO ] Invariant cache hit.
[2026-05-23 09:16:31] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/270 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (OVERLAPS) 213/483 variables, 270/330 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:39] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:41] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:41] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 1/484 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:52] [INFO ] Deduced a trap composed of 7 places in 182 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:53] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:16:54] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 339 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 6/58 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 213/483 variables, 270/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 2/338 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 210/548 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/484 variables, and 548 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61543 ms. Remains : 271/271 places, 213/213 transitions.
RANDOM walk for 40000 steps (547 resets) in 2173 ms. (18 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (84 resets) in 306 ms. (130 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (90 resets) in 205 ms. (194 steps per ms) remains 14/14 properties
[2026-05-23 09:17:32] [INFO ] Flatten gal took : 226 ms
BEST_FIRST walk for 40002 steps (92 resets) in 162 ms. (245 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (91 resets) in 266 ms. (149 steps per ms) remains 14/14 properties
[2026-05-23 09:17:32] [INFO ] Flatten gal took : 104 ms
BEST_FIRST walk for 40003 steps (86 resets) in 153 ms. (259 steps per ms) remains 14/14 properties
[2026-05-23 09:17:32] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6881444219901310516.gal : 41 ms
BEST_FIRST walk for 40003 steps (87 resets) in 198 ms. (201 steps per ms) remains 14/14 properties
[2026-05-23 09:17:32] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality159599072901250315.prop : 1 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/ReachabilityCardinality6881444219901310516.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality159599072901250315.prop' '--nowitness' '--gen-order' 'FOLLOW'

BEST_FIRST walk for 40004 steps (98 resets) in 159 ms. (250 steps per ms) remains 14/14 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 ...327
BEST_FIRST walk for 40004 steps (93 resets) in 182 ms. (218 steps per ms) remains 14/14 properties
Loading property file /tmp/ReachabilityCardinality159599072901250315.prop.
BEST_FIRST walk for 40001 steps (88 resets) in 183 ms. (217 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,14 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,14 properties remain. new max is 16
SDD size :4 after 12
SDD proceeding with computation,14 properties remain. new max is 32
SDD size :12 after 24
SDD proceeding with computation,14 properties remain. new max is 64
SDD size :24 after 28
SDD proceeding with computation,14 properties remain. new max is 128
SDD size :28 after 628
BEST_FIRST walk for 40004 steps (81 resets) in 198 ms. (201 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 256
SDD size :628 after 962
SDD proceeding with computation,14 properties remain. new max is 512
SDD size :962 after 17240
BEST_FIRST walk for 40004 steps (90 resets) in 192 ms. (207 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 1024
SDD size :17240 after 36016
BEST_FIRST walk for 40001 steps (87 resets) in 172 ms. (231 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (83 resets) in 145 ms. (274 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 2048
SDD size :36016 after 150036
BEST_FIRST walk for 40003 steps (88 resets) in 161 ms. (246 steps per ms) remains 14/14 properties
SDD proceeding with computation,14 properties remain. new max is 4096
SDD size :4.51269e+08 after 6.76738e+08
SDD proceeding with computation,14 properties remain. new max is 8192
SDD size :6.76738e+08 after 6.77732e+08
SDD proceeding with computation,14 properties remain. new max is 16384
SDD size :7.06975e+08 after 2.48352e+09
Interrupted probabilistic random walk after 441559 steps, run timeout after 3001 ms. (steps per millisecond=147 ) properties seen :0 out of 14
Probabilistic random walk after 441559 steps, saw 64351 distinct states, run finished after 3007 ms. (steps per millisecond=146 ) properties seen :0
[2026-05-23 09:17:35] [INFO ] Invariant cache hit.
[2026-05-23 09:17:35] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 152/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/192 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 177/401 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 51/452 variables, 15/296 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 32768
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD size :8.25738e+09 after 8.36148e+09
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 1/453 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 31/484 variables, 31/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 333 constraints, problems are : Problem set: 0 solved, 14 unsolved in 3175 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 152/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/192 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:39] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 11 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/224 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 177/401 variables, 224/280 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 6/288 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 51/452 variables, 15/303 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/452 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 65536
At refinement iteration 18 (OVERLAPS) 1/453 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/453 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD size :3.45799e+10 after 3.50894e+10
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 31/484 variables, 31/348 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:43] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/484 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:43] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/484 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:44] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 5 ms to minimize.
SMT process timed out in 8263ms, After SMT, problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 7 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 18 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 271/271 places, 213/213 transitions.
RANDOM walk for 40000 steps (546 resets) in 622 ms. (64 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (86 resets) in 99 ms. (400 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (86 resets) in 91 ms. (434 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (88 resets) in 177 ms. (224 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 142 ms. (279 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (90 resets) in 129 ms. (307 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (98 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (90 resets) in 152 ms. (261 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (88 resets) in 122 ms. (325 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (92 resets) in 184 ms. (216 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40002 steps (91 resets) in 137 ms. (289 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (92 resets) in 133 ms. (298 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (83 resets) in 173 ms. (229 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40003 steps (95 resets) in 123 ms. (322 steps per ms) remains 14/14 properties
Interrupted probabilistic random walk after 413769 steps, run timeout after 3001 ms. (steps per millisecond=137 ) properties seen :0 out of 14
Probabilistic random walk after 413769 steps, saw 60875 distinct states, run finished after 3001 ms. (steps per millisecond=137 ) properties seen :0
[2026-05-23 09:17:48] [INFO ] Invariant cache hit.
[2026-05-23 09:17:48] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 152/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/192 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 7/224 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 177/401 variables, 224/279 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/401 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (OVERLAPS) 51/452 variables, 15/296 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/452 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/452 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 1/453 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD proceeding with computation,14 properties remain. new max is 131072
At refinement iteration 17 (INCLUDED_ONLY) 0/453 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 14 unsolved
SDD size :1.48674e+11 after 1.74426e+11
At refinement iteration 18 (OVERLAPS) 31/484 variables, 31/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (OVERLAPS) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 333 constraints, problems are : Problem set: 0 solved, 14 unsolved in 4181 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 152/159 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 33/192 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/192 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (OVERLAPS) 25/217 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:52] [INFO ] Deduced a trap composed of 11 places in 101 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (OVERLAPS) 7/224 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 177/401 variables, 224/280 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/401 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/401 variables, 6/288 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/401 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (OVERLAPS) 51/452 variables, 15/303 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/452 variables, 4/307 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/452 variables, 8/315 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/452 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 1/453 variables, 1/316 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/453 variables, 1/317 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/453 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 31/484 variables, 31/348 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:56] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/484 variables, 1/349 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:56] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/484 variables, 1/350 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:57] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 8 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/484 variables, 1/351 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/484 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:17:59] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 4 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/484 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/484 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (OVERLAPS) 0/484 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 352 constraints, problems are : Problem set: 0 solved, 14 unsolved in 9208 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13411ms problems are : Problem set: 0 solved, 14 unsolved
Fused 14 Parikh solutions to 7 different solutions.
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,10 properties remain. new max is 131072
SDD size :2.93603e+11 after 2.98196e+11
Detected timeout of ITS tools.
[2026-05-23 09:18:22] [INFO ] Flatten gal took : 67 ms
[2026-05-23 09:18:22] [INFO ] Applying decomposition
[2026-05-23 09:18:22] [INFO ] Flatten gal took : 51 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph10268829110549691688.txt' '-o' '/tmp/graph10268829110549691688.bin' '-w' '/tmp/graph10268829110549691688.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10268829110549691688.bin' '-l' '-1' '-v' '-w' '/tmp/graph10268829110549691688.weights' '-q' '0' '-e' '0.001'
[2026-05-23 09:18:23] [INFO ] Decomposing Gal with order
[2026-05-23 09:18:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-23 09:18:23] [INFO ] Removed a total of 51 redundant transitions.
[2026-05-23 09:18:23] [INFO ] Flatten gal took : 118 ms
[2026-05-23 09:18:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 22 ms.
[2026-05-23 09:18:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16108953329561379519.gal : 15 ms
[2026-05-23 09:18:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4511794087681575579.prop : 0 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/ReachabilityCardinality16108953329561379519.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4511794087681575579.prop' '--nowitness'

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 ...308
Loading property file /tmp/ReachabilityCardinality4511794087681575579.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :20 after 366
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :366 after 8206
Parikh walk visited 0 properties in 22157 ms.
Support contains 5 out of 271 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 17 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 271/271 places, 213/213 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 271/271 places, 213/213 transitions.
Applied a total of 0 rules in 12 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2026-05-23 09:18:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :8206 after 1.62561e+09
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :1.62561e+09 after 2.62374e+09
[2026-05-23 09:18:24] [INFO ] Implicit Places using invariants in 327 ms returned []
[2026-05-23 09:18:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2026-05-23 09:18:24] [INFO ] State equation strengthened by 2 read => feed constraints.
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :2.62374e+09 after 4.34379e+09
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :4.34379e+09 after 7.06197e+09
[2026-05-23 09:18:24] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2026-05-23 09:18:24] [INFO ] Redundant transitions in 10 ms returned []
Running 210 sub problems to find dead transitions.
[2026-05-23 09:18:24] [INFO ] Invariant cache hit.
[2026-05-23 09:18:24] [INFO ] State equation strengthened by 2 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :1.78044e+12 after 1.85364e+12
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/270 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 210 unsolved
SDD proceeding with computation,6 properties remain. new max is 1024
SDD size :7.53717e+12 after 8.0169e+12
At refinement iteration 5 (OVERLAPS) 213/483 variables, 270/330 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:33] [INFO ] Deduced a trap composed of 11 places in 90 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:34] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:34] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 4 ms to minimize.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :1.56925e+13 after 1.57036e+13
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.79646e+13,14.376,212624,24121,4626,483280,15356,324,497635,387,95962,0
Total reachable state count : 17964576810280

Verifying 10 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,132,14.4276,212624,79,164,483280,15356,326,497635,390,95962,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,132,14.4385,212752,79,164,483280,15356,330,497635,392,95962,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,1.21958e+06,14.4395,212752,129,223,483280,15356,332,497635,394,95962,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,1.21958e+06,14.4401,212752,129,223,483280,15356,336,497635,396,95962,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,7.56349e+07,14.4451,212752,326,451,483280,15356,336,497635,397,95962,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,7.56349e+07,14.4502,212752,326,451,483280,15356,339,497635,398,95962,0
Reachability property MAX4 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,7.6177e+09,14.4526,212752,872,606,483280,15356,341,497635,400,95962,0
Invariant property MIN4 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,7.6177e+09,14.4548,212752,872,606,483280,15356,345,497635,402,95962,0
Reachability property MAX5 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,1.21958e+06,14.4554,212752,129,212,483280,15356,347,497635,404,95962,0
Invariant property MIN5 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,1.21958e+06,14.456,212752,129,212,483280,15356,351,497635,406,95962,0
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (OVERLAPS) 1/484 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:43] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 7 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/484 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:44] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:45] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:53] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:53] [INFO ] Deduced a trap composed of 47 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:18:54] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 14 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 484/484 variables, and 342 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (OVERLAPS) 213/483 variables, 270/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 2/341 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 210/551 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2026-05-23 09:19:24] [INFO ] Deduced a trap composed of 6 places in 93 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 483/484 variables, and 552 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 210/210 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60118ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61194 ms. Remains : 271/271 places, 213/213 transitions.
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40a-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40a-UpperBounds-09 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40a-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-40a-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 7 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 226960 ms.

BK_STOP 1779527965030

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="DES-PT-40a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2025"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
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 DES-PT-40a, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r095-smll-177946996300052"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;