Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r069-smll-174854075900042.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool gold2024
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 r069-smll-174854075900042
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 83K May 29 14:32 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 1748604162942

Invoking MCC driver with
BK_TOOL=gold2024
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 202405141337
[2025-05-30 11:22:45] [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]
[2025-05-30 11:22:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:22:45] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2025-05-30 11:22:45] [INFO ] Transformed 274 places.
[2025-05-30 11:22:45] [INFO ] Transformed 231 transitions.
[2025-05-30 11:22:45] [INFO ] Found NUPN structural information;
[2025-05-30 11:22:45] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 390 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 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
[2025-05-30 11:22:46] [INFO ] Computed 59 invariants in 54 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 (234 resets) in 79 ms. (125 steps per ms)
FORMULA DES-PT-40a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-09 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-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-40a-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80008 steps (360 resets) in 162 ms. (490 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
[2025-05-30 11:22:46] [INFO ] Invariant cache hit.
[2025-05-30 11:22:46] [INFO ] [Real]Absence check using 34 positive place invariants in 42 ms returned sat
[2025-05-30 11:22:47] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 74 ms returned sat
[2025-05-30 11:22:47] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2025-05-30 11:22:47] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:47] [INFO ] [Nat]Absence check using 34 positive place invariants in 38 ms returned sat
[2025-05-30 11:22:47] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 33 ms returned sat
[2025-05-30 11:22:47] [INFO ] [Nat]Absence check using state equation in 326 ms returned sat
[2025-05-30 11:22:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:22:48] [INFO ] [Nat]Added 1 Read/Feed constraints in 70 ms returned sat
[2025-05-30 11:22:48] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 55 ms.
[2025-05-30 11:22:48] [INFO ] Deduced a trap composed of 17 places in 186 ms of which 30 ms to minimize.
[2025-05-30 11:22:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 255 ms
[2025-05-30 11:22:49] [INFO ] Added : 77 causal constraints over 16 iterations in 963 ms. Result :sat
Minimization took 239 ms.
[2025-05-30 11:22:49] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:22:49] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2025-05-30 11:22:49] [INFO ] [Real]Absence check using state equation in 236 ms returned sat
[2025-05-30 11:22:49] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:49] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:22:49] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 21 ms returned sat
[2025-05-30 11:22:50] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-05-30 11:22:50] [INFO ] [Nat]Added 1 Read/Feed constraints in 126 ms returned sat
[2025-05-30 11:22:50] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 34 ms.
[2025-05-30 11:22:51] [INFO ] Added : 159 causal constraints over 32 iterations in 1405 ms. Result :sat
Minimization took 290 ms.
[2025-05-30 11:22:52] [INFO ] [Real]Absence check using 34 positive place invariants in 22 ms returned sat
[2025-05-30 11:22:52] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 31 ms returned sat
[2025-05-30 11:22:52] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2025-05-30 11:22:52] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:52] [INFO ] [Nat]Absence check using 34 positive place invariants in 25 ms returned sat
[2025-05-30 11:22:52] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2025-05-30 11:22:52] [INFO ] [Nat]Absence check using state equation in 247 ms returned sat
[2025-05-30 11:22:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 131 ms returned sat
[2025-05-30 11:22:53] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 37 ms.
[2025-05-30 11:22:54] [INFO ] Deduced a trap composed of 12 places in 140 ms of which 3 ms to minimize.
[2025-05-30 11:22:54] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 3 ms to minimize.
[2025-05-30 11:22:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2025-05-30 11:22:54] [INFO ] Added : 129 causal constraints over 27 iterations in 1570 ms. Result :sat
Minimization took 272 ms.
[2025-05-30 11:22:54] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:22:54] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 26 ms returned sat
[2025-05-30 11:22:55] [INFO ] [Real]Absence check using state equation in 279 ms returned sat
[2025-05-30 11:22:55] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:55] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:22:55] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 27 ms returned sat
[2025-05-30 11:22:55] [INFO ] [Nat]Absence check using state equation in 327 ms returned sat
[2025-05-30 11:22:55] [INFO ] [Nat]Added 1 Read/Feed constraints in 11 ms returned sat
[2025-05-30 11:22:55] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 2 ms to minimize.
[2025-05-30 11:22:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2025-05-30 11:22:55] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 52 ms.
[2025-05-30 11:22:56] [INFO ] Deduced a trap composed of 12 places in 96 ms of which 2 ms to minimize.
[2025-05-30 11:22:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 163 ms
[2025-05-30 11:22:56] [INFO ] Added : 74 causal constraints over 15 iterations in 1025 ms. Result :sat
Minimization took 147 ms.
[2025-05-30 11:22:57] [INFO ] [Real]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:22:57] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:22:57] [INFO ] [Real]Absence check using state equation in 202 ms returned sat
[2025-05-30 11:22:57] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:57] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:22:57] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 29 ms returned sat
[2025-05-30 11:22:58] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2025-05-30 11:22:58] [INFO ] [Nat]Added 1 Read/Feed constraints in 60 ms returned sat
[2025-05-30 11:22:58] [INFO ] Deduced a trap composed of 19 places in 180 ms of which 4 ms to minimize.
[2025-05-30 11:22:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 220 ms
[2025-05-30 11:22:58] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 32 ms.
[2025-05-30 11:22:59] [INFO ] Added : 87 causal constraints over 18 iterations in 728 ms. Result :sat
Minimization took 231 ms.
[2025-05-30 11:22:59] [INFO ] [Real]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:22:59] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2025-05-30 11:22:59] [INFO ] [Real]Absence check using state equation in 232 ms returned sat
[2025-05-30 11:22:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:22:59] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:22:59] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 25 ms returned sat
[2025-05-30 11:23:00] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2025-05-30 11:23:00] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:23:00] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 22 ms.
[2025-05-30 11:23:00] [INFO ] Added : 75 causal constraints over 15 iterations in 540 ms. Result :sat
Minimization took 139 ms.
[2025-05-30 11:23:00] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:23:00] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:23:01] [INFO ] [Real]Absence check using state equation in 191 ms returned sat
[2025-05-30 11:23:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:23:01] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:23:01] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 30 ms returned sat
[2025-05-30 11:23:01] [INFO ] [Nat]Absence check using state equation in 328 ms returned sat
[2025-05-30 11:23:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2025-05-30 11:23:01] [INFO ] Deduced a trap composed of 12 places in 182 ms of which 4 ms to minimize.
[2025-05-30 11:23:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2025-05-30 11:23:01] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 31 ms.
[2025-05-30 11:23:02] [INFO ] Added : 48 causal constraints over 10 iterations in 578 ms. Result :sat
Minimization took 184 ms.
[2025-05-30 11:23:02] [INFO ] [Real]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:23:02] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 22 ms returned sat
[2025-05-30 11:23:03] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-05-30 11:23:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:23:03] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2025-05-30 11:23:03] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 28 ms returned sat
[2025-05-30 11:23:03] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-05-30 11:23:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 90 ms returned sat
[2025-05-30 11:23:03] [INFO ] Computed and/alt/rep : 209/630/209 causal constraints (skipped 7 transitions) in 24 ms.
[2025-05-30 11:23:05] [INFO ] Added : 161 causal constraints over 33 iterations in 1604 ms. Result :sat
Minimization took 357 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
FORMULA DES-PT-40a-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA DES-PT-40a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 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 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 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 11 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 12 place count 271 transition count 213
Applied a total of 12 rules in 205 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 226 ms. Remains : 271/274 places, 213/217 transitions.
// Phase 1: matrix 213 rows 271 cols
[2025-05-30 11:23:07] [INFO ] Computed 60 invariants in 11 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (13578 resets) in 2979 ms. (335 steps per ms)
BEST_FIRST walk for 4000004 steps (9129 resets) in 5090 ms. (785 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2025-05-30 11:23:15] [INFO ] Invariant cache hit.
[2025-05-30 11:23:16] [INFO ] [Real]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-30 11:23:16] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:23:16] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-05-30 11:23:16] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:23:16] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2025-05-30 11:23:16] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 40 ms returned sat
[2025-05-30 11:23:16] [INFO ] [Nat]Absence check using state equation in 209 ms returned sat
[2025-05-30 11:23:16] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:23:16] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:23:16] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 22 ms.
[2025-05-30 11:23:17] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 3 ms to minimize.
[2025-05-30 11:23:18] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 3 ms to minimize.
[2025-05-30 11:23:18] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 2 ms to minimize.
[2025-05-30 11:23:18] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 353 ms
[2025-05-30 11:23:18] [INFO ] Added : 194 causal constraints over 39 iterations in 1455 ms. Result :sat
Minimization took 207 ms.
[2025-05-30 11:23:18] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:23:18] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 21 ms returned sat
[2025-05-30 11:23:18] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-05-30 11:23:18] [INFO ] [Real]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:23:18] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 20 ms.
[2025-05-30 11:23:19] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:23:19] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-30 11:23:19] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 18 ms returned sat
[2025-05-30 11:23:19] [INFO ] [Nat]Absence check using state equation in 148 ms returned sat
[2025-05-30 11:23:19] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2025-05-30 11:23:19] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 3 ms to minimize.
[2025-05-30 11:23:19] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 3 ms to minimize.
[2025-05-30 11:23:19] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 261 ms
[2025-05-30 11:23:19] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 16 ms.
[2025-05-30 11:23:20] [INFO ] Added : 167 causal constraints over 34 iterations in 886 ms. Result :sat
Minimization took 230 ms.
[2025-05-30 11:23:20] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-30 11:23:20] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:23:21] [INFO ] [Real]Absence check using state equation in 120 ms returned sat
[2025-05-30 11:23:21] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:23:21] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-30 11:23:21] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 28 ms returned sat
[2025-05-30 11:23:21] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2025-05-30 11:23:21] [INFO ] [Nat]Added 2 Read/Feed constraints in 21 ms returned sat
[2025-05-30 11:23:21] [INFO ] Deduced a trap composed of 15 places in 164 ms of which 4 ms to minimize.
[2025-05-30 11:23:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 198 ms
[2025-05-30 11:23:21] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 25 ms.
[2025-05-30 11:23:22] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 3 ms to minimize.
[2025-05-30 11:23:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2025-05-30 11:23:22] [INFO ] Added : 80 causal constraints over 16 iterations in 726 ms. Result :sat
Minimization took 151 ms.
[2025-05-30 11:23:22] [INFO ] [Real]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-30 11:23:22] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 24 ms returned sat
[2025-05-30 11:23:22] [INFO ] [Real]Absence check using state equation in 143 ms returned sat
[2025-05-30 11:23:22] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:23:22] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-30 11:23:22] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:23:23] [INFO ] [Nat]Absence check using state equation in 183 ms returned sat
[2025-05-30 11:23:23] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2025-05-30 11:23:23] [INFO ] Computed and/alt/rep : 204/350/204 causal constraints (skipped 6 transitions) in 18 ms.
[2025-05-30 11:23:23] [INFO ] Added : 89 causal constraints over 18 iterations in 404 ms. Result :sat
Minimization took 136 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 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 18 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.
[2025-05-30 11:23:24] [INFO ] Invariant cache hit.
[2025-05-30 11:23:25] [INFO ] Implicit Places using invariants in 514 ms returned []
[2025-05-30 11:23:25] [INFO ] Invariant cache hit.
[2025-05-30 11:23:25] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:23:26] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
[2025-05-30 11:23:26] [INFO ] Redundant transitions in 10 ms returned []
Running 210 sub problems to find dead transitions.
[2025-05-30 11:23:26] [INFO ] Invariant cache hit.
[2025-05-30 11:23:26] [INFO ] State equation strengthened by 2 read => feed constraints.
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
[2025-05-30 11:23:33] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2025-05-30 11:23:35] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 6 ms to minimize.
[2025-05-30 11:23:35] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2025-05-30 11:23:37] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 1/484 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2025-05-30 11:23:44] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2025-05-30 11:23:44] [INFO ] Deduced a trap composed of 16 places in 143 ms of which 3 ms to minimize.
[2025-05-30 11:23:45] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 13 (OVERLAPS) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 340 constraints, problems are : Problem set: 0 solved, 210 unsolved in 27945 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: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
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, 1/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/483 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 210/549 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2025-05-30 11:24:16] [INFO ] Deduced a trap composed of 12 places in 128 ms of which 4 ms to minimize.
[2025-05-30 11:24:16] [INFO ] Deduced a trap composed of 11 places in 114 ms of which 2 ms to minimize.
[2025-05-30 11:24:17] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 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 30027 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]
After SMT, in 58409ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 58444ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59577 ms. Remains : 271/271 places, 213/213 transitions.
RANDOM walk for 40000 steps (554 resets) in 2468 ms. (16 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (87 resets) in 252 ms. (158 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (90 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (94 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (84 resets) in 144 ms. (275 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (95 resets) in 133 ms. (298 steps per ms) remains 8/8 properties
[2025-05-30 11:24:25] [INFO ] Flatten gal took : 211 ms
BEST_FIRST walk for 40004 steps (93 resets) in 183 ms. (217 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (88 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (93 resets) in 140 ms. (283 steps per ms) remains 8/8 properties
[2025-05-30 11:24:25] [INFO ] Flatten gal took : 92 ms
[2025-05-30 11:24:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4468253293824960138.gal : 37 ms
[2025-05-30 11:24:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12246998698132097056.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4468253293824960138.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12246998698132097056.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality12246998698132097056.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 18
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :18 after 20
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :20 after 74
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :74 after 654
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :654 after 1442
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1442 after 12456
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :66068 after 77432
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :77432 after 109176
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :364744 after 2.9387e+07
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :2.9387e+07 after 1.41022e+08
Interrupted probabilistic random walk after 449223 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 8
Probabilistic random walk after 449223 steps, saw 65265 distinct states, run finished after 3006 ms. (steps per millisecond=149 ) properties seen :0
[2025-05-30 11:24:28] [INFO ] Invariant cache hit.
[2025-05-30 11:24:28] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 137/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/179 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 34/213 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 9/222 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 174/396 variables, 222/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:29] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 53/449 variables, 14/294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/450 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 34/484 variables, 34/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/484 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 334 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1245 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: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 137/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/179 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 34/213 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:30] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 2 ms to minimize.
[2025-05-30 11:24:30] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 9/222 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 174/396 variables, 222/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (OVERLAPS) 53/449 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:30] [INFO ] Deduced a trap composed of 15 places in 63 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/450 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/450 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:31] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/450 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/450 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 34/484 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:31] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/484 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/484 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 347 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2276 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: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 3531ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.41022e+08 after 2.52248e+08
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :2.52248e+08 after 3.44745e+08
Parikh walk visited 0 properties in 14595 ms.
Support contains 4 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 18 ms. Remains : 271/271 places, 213/213 transitions.
RANDOM walk for 40000 steps (552 resets) in 305 ms. (130 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (98 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (93 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (90 resets) in 126 ms. (314 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (91 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (86 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (93 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (89 resets) in 135 ms. (294 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (90 resets) in 160 ms. (248 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 462537 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 8
Probabilistic random walk after 462537 steps, saw 67001 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-05-30 11:24:50] [INFO ] Invariant cache hit.
[2025-05-30 11:24:50] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 137/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 38/179 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 34/213 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 9/222 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/222 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 174/396 variables, 222/277 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/396 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:50] [INFO ] Deduced a trap composed of 17 places in 126 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/396 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 53/449 variables, 14/294 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/449 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/449 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 1/450 variables, 1/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/450 variables, 1/300 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/450 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (OVERLAPS) 34/484 variables, 34/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/484 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (OVERLAPS) 0/484 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 334 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1409 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: 8/8 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 137/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 38/179 variables, 21/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/179 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 34/213 variables, 23/46 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:52] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 3 ms to minimize.
[2025-05-30 11:24:52] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/213 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 9/222 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/222 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 174/396 variables, 222/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD proceeding with computation,8 properties remain. new max is 65536
At refinement iteration 12 (INCLUDED_ONLY) 0/396 variables, 2/282 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/396 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/396 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SDD size :7.29588e+08 after 2.00959e+09
At refinement iteration 15 (OVERLAPS) 53/449 variables, 14/300 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/449 variables, 4/304 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/449 variables, 4/308 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:52] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 1/450 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/450 variables, 1/311 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:53] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 8 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/450 variables, 1/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/450 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 24 (OVERLAPS) 34/484 variables, 34/346 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-30 11:24:53] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/484 variables, 1/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 27 (OVERLAPS) 0/484 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 347 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2653 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: 8/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 4075ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 13545 ms.
Support contains 4 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 13 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 13 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 13 ms. Remains 271 /271 variables (removed 0) and now considering 213/213 (removed 0) transitions.
[2025-05-30 11:25:07] [INFO ] Invariant cache hit.
[2025-05-30 11:25:08] [INFO ] Implicit Places using invariants in 257 ms returned []
[2025-05-30 11:25:08] [INFO ] Invariant cache hit.
[2025-05-30 11:25:08] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:25:08] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 773 ms to find 0 implicit places.
[2025-05-30 11:25:08] [INFO ] Redundant transitions in 9 ms returned []
Running 210 sub problems to find dead transitions.
[2025-05-30 11:25:08] [INFO ] Invariant cache hit.
[2025-05-30 11:25:08] [INFO ] State equation strengthened by 2 read => feed constraints.
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
Detected timeout of ITS tools.
[2025-05-30 11:25:15] [INFO ] Flatten gal took : 31 ms
[2025-05-30 11:25:15] [INFO ] Applying decomposition
[2025-05-30 11:25:15] [INFO ] Flatten gal took : 28 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph12982223188977777163.txt' '-o' '/tmp/graph12982223188977777163.bin' '-w' '/tmp/graph12982223188977777163.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph12982223188977777163.bin' '-l' '-1' '-v' '-w' '/tmp/graph12982223188977777163.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:25:16] [INFO ] Decomposing Gal with order
[2025-05-30 11:25:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-30 11:25:16] [INFO ] Removed a total of 59 redundant transitions.
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 2/332 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2025-05-30 11:25:16] [INFO ] Flatten gal took : 87 ms
[2025-05-30 11:25:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 10 ms.
[2025-05-30 11:25:16] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10933368416581081407.gal : 10 ms
[2025-05-30 11:25:16] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8479122025167099526.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10933368416581081407.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8479122025167099526.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality8479122025167099526.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :20 after 364
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :364 after 8206
[2025-05-30 11:25:16] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 3 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :8206 after 1.62569e+09
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1.62569e+09 after 2.86125e+09
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :2.86125e+09 after 4.591e+09
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,6 properties remain. new max is 512
SDD size :4.591e+09 after 7.55626e+09
[2025-05-30 11:25:18] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 2 ms to minimize.
[2025-05-30 11:25:18] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 3/335 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2025-05-30 11:25:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 2 ms to minimize.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :4.12541e+12 after 4.59897e+12
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :8.86103e+12 after 8.98923e+12
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 10 (OVERLAPS) 1/484 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
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.70372e+13,12.4629,210048,24321,4484,466294,13908,257,620223,368,89906,0
Total reachable state count : 17037163668964

Verifying 8 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,64512,12.5298,210048,79,221,466294,13908,259,620223,371,89906,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,64512,12.5402,210048,79,221,466294,13908,263,620223,373,89906,0
Reachability property MAX1 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
MAX1,960,12.5459,210048,96,191,466294,13908,265,620223,375,89906,0
Invariant property MIN1 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
MIN1,960,12.552,210048,96,191,466294,13908,269,620223,377,89906,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,1536,12.5527,210048,54,166,466294,13908,271,620223,379,89906,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,1536,12.5531,210048,54,166,466294,13908,275,620223,381,89906,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,1536,12.5536,210048,54,180,466294,13908,276,620223,381,89906,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,1536,12.5539,210048,54,180,466294,13908,278,620223,381,89906,0
[2025-05-30 11:25:28] [INFO ] Deduced a trap composed of 6 places in 98 ms of which 3 ms to minimize.
[2025-05-30 11:25:29] [INFO ] Deduced a trap composed of 16 places in 105 ms of which 2 ms to minimize.
[2025-05-30 11:25:29] [INFO ] Deduced a trap composed of 18 places in 123 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/484 variables, 3/340 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/484 variables, 0/340 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 340 constraints, problems are : Problem set: 0 solved, 210 unsolved in 30025 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: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 210 unsolved
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, 1/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 7 (OVERLAPS) 213/483 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/483 variables, 2/339 constraints. Problems are: Problem set: 0 solved, 210 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/483 variables, 210/549 constraints. Problems are: Problem set: 0 solved, 210 unsolved
[2025-05-30 11:26:02] [INFO ] Deduced a trap composed of 12 places in 143 ms of which 4 ms to minimize.
[2025-05-30 11:26:02] [INFO ] Deduced a trap composed of 11 places in 133 ms of which 4 ms to minimize.
[2025-05-30 11:26:03] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 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 30018 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]
After SMT, in 60347ms problems are : Problem set: 0 solved, 210 unsolved
Search for dead transitions found 0 dead transitions in 60354ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61155 ms. Remains : 271/271 places, 213/213 transitions.
FORMULA DES-PT-40a-UpperBounds-12 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-01 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 4 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 203658 ms.

BK_STOP 1748604369186

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="gold2024"
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-5832"
echo " Executing tool gold2024"
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 r069-smll-174854075900042"
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 ;