About the Execution of 2024-gold for DES-PT-30a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15688.570 | 167002.00 | 273842.00 | 622.80 | 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 | normal |
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-174854075900040.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-30a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r069-smll-174854075900040
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-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.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K 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 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K 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 70K 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-30a-UpperBounds-00
FORMULA_NAME DES-PT-30a-UpperBounds-01
FORMULA_NAME DES-PT-30a-UpperBounds-02
FORMULA_NAME DES-PT-30a-UpperBounds-03
FORMULA_NAME DES-PT-30a-UpperBounds-04
FORMULA_NAME DES-PT-30a-UpperBounds-05
FORMULA_NAME DES-PT-30a-UpperBounds-06
FORMULA_NAME DES-PT-30a-UpperBounds-07
FORMULA_NAME DES-PT-30a-UpperBounds-08
FORMULA_NAME DES-PT-30a-UpperBounds-09
FORMULA_NAME DES-PT-30a-UpperBounds-10
FORMULA_NAME DES-PT-30a-UpperBounds-11
FORMULA_NAME DES-PT-30a-UpperBounds-12
FORMULA_NAME DES-PT-30a-UpperBounds-13
FORMULA_NAME DES-PT-30a-UpperBounds-14
FORMULA_NAME DES-PT-30a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1748603850345
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-30a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-05-30 11:17:32] [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:17:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 11:17:32] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2025-05-30 11:17:32] [INFO ] Transformed 234 places.
[2025-05-30 11:17:32] [INFO ] Transformed 191 transitions.
[2025-05-30 11:17:32] [INFO ] Found NUPN structural information;
[2025-05-30 11:17:32] [INFO ] Parsed PT model containing 234 places and 191 transitions and 926 arcs in 435 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 146 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 177 rows 234 cols
[2025-05-30 11:17:33] [INFO ] Computed 59 invariants in 51 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 (226 resets) in 115 ms. (86 steps per ms)
FORMULA DES-PT-30a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30a-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30a-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-30a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 80007 steps (359 resets) in 347 ms. (229 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:17:33] [INFO ] Invariant cache hit.
[2025-05-30 11:17:34] [INFO ] [Real]Absence check using 34 positive place invariants in 33 ms returned sat
[2025-05-30 11:17:34] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 41 ms returned sat
[2025-05-30 11:17:34] [INFO ] [Real]Absence check using state equation in 218 ms returned sat
[2025-05-30 11:17:34] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:34] [INFO ] [Nat]Absence check using 34 positive place invariants in 54 ms returned sat
[2025-05-30 11:17:34] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 45 ms returned sat
[2025-05-30 11:17:35] [INFO ] [Nat]Absence check using state equation in 331 ms returned sat
[2025-05-30 11:17:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-05-30 11:17:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2025-05-30 11:17:35] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 86 ms.
[2025-05-30 11:17:36] [INFO ] Added : 159 causal constraints over 32 iterations in 1369 ms. Result :sat
Minimization took 243 ms.
[2025-05-30 11:17:37] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2025-05-30 11:17:37] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:17:37] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2025-05-30 11:17:37] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:17:37] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 59 ms returned sat
[2025-05-30 11:17:37] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2025-05-30 11:17:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 29 ms returned sat
[2025-05-30 11:17:37] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 22 ms.
[2025-05-30 11:17:38] [INFO ] Added : 87 causal constraints over 18 iterations in 540 ms. Result :sat
Minimization took 143 ms.
[2025-05-30 11:17:38] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2025-05-30 11:17:38] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:17:38] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-30 11:17:38] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:38] [INFO ] [Nat]Absence check using 34 positive place invariants in 20 ms returned sat
[2025-05-30 11:17:38] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:17:38] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2025-05-30 11:17:38] [INFO ] [Nat]Added 1 Read/Feed constraints in 13 ms returned sat
[2025-05-30 11:17:39] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 21 ms.
[2025-05-30 11:17:40] [INFO ] Added : 149 causal constraints over 30 iterations in 1224 ms. Result :sat
Minimization took 310 ms.
[2025-05-30 11:17:40] [INFO ] [Real]Absence check using 34 positive place invariants in 10 ms returned sat
[2025-05-30 11:17:40] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 18 ms returned sat
[2025-05-30 11:17:40] [INFO ] [Real]Absence check using state equation in 133 ms returned sat
[2025-05-30 11:17:40] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:40] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2025-05-30 11:17:40] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:17:40] [INFO ] [Nat]Absence check using state equation in 106 ms returned sat
[2025-05-30 11:17:41] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2025-05-30 11:17:41] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 20 ms.
[2025-05-30 11:17:41] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 26 ms to minimize.
[2025-05-30 11:17:41] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 3 ms to minimize.
[2025-05-30 11:17:41] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 283 ms
[2025-05-30 11:17:42] [INFO ] Added : 121 causal constraints over 25 iterations in 978 ms. Result :sat
Minimization took 151 ms.
[2025-05-30 11:17:42] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2025-05-30 11:17:42] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:17:42] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2025-05-30 11:17:42] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:42] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2025-05-30 11:17:42] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:17:42] [INFO ] [Nat]Absence check using state equation in 217 ms returned sat
[2025-05-30 11:17:42] [INFO ] [Nat]Added 1 Read/Feed constraints in 33 ms returned sat
[2025-05-30 11:17:42] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 21 ms.
[2025-05-30 11:17:43] [INFO ] Added : 96 causal constraints over 20 iterations in 543 ms. Result :sat
Minimization took 169 ms.
[2025-05-30 11:17:43] [INFO ] [Real]Absence check using 34 positive place invariants in 12 ms returned sat
[2025-05-30 11:17:43] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:17:43] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 11:17:43] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:43] [INFO ] [Nat]Absence check using 34 positive place invariants in 17 ms returned sat
[2025-05-30 11:17:43] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 19 ms returned sat
[2025-05-30 11:17:44] [INFO ] [Nat]Absence check using state equation in 167 ms returned sat
[2025-05-30 11:17:44] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2025-05-30 11:17:44] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 26 ms.
[2025-05-30 11:17:44] [INFO ] Added : 98 causal constraints over 20 iterations in 587 ms. Result :sat
Minimization took 154 ms.
[2025-05-30 11:17:44] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2025-05-30 11:17:44] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:17:45] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-05-30 11:17:45] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:45] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2025-05-30 11:17:45] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:17:45] [INFO ] [Nat]Absence check using state equation in 130 ms returned sat
[2025-05-30 11:17:45] [INFO ] [Nat]Added 1 Read/Feed constraints in 26 ms returned sat
[2025-05-30 11:17:45] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 20 ms.
[2025-05-30 11:17:45] [INFO ] Added : 99 causal constraints over 21 iterations in 490 ms. Result :sat
Minimization took 151 ms.
[2025-05-30 11:17:46] [INFO ] [Real]Absence check using 34 positive place invariants in 14 ms returned sat
[2025-05-30 11:17:46] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:17:46] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 11:17:46] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:46] [INFO ] [Nat]Absence check using 34 positive place invariants in 14 ms returned sat
[2025-05-30 11:17:46] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:17:46] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2025-05-30 11:17:46] [INFO ] [Nat]Added 1 Read/Feed constraints in 14 ms returned sat
[2025-05-30 11:17:46] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 3 ms to minimize.
[2025-05-30 11:17:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-05-30 11:17:46] [INFO ] Computed and/alt/rep : 169/510/169 causal constraints (skipped 7 transitions) in 17 ms.
[2025-05-30 11:17:47] [INFO ] Added : 80 causal constraints over 16 iterations in 427 ms. Result :sat
Minimization took 152 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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 177/177 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 234 transition count 175
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 233 transition count 174
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 233 transition count 174
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 9 place count 233 transition count 174
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 232 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 231 transition count 173
Applied a total of 11 rules in 127 ms. Remains 231 /234 variables (removed 3) and now considering 173/177 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 143 ms. Remains : 231/234 places, 173/177 transitions.
// Phase 1: matrix 173 rows 231 cols
[2025-05-30 11:17:49] [INFO ] Computed 60 invariants in 21 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13762 resets) in 2227 ms. (448 steps per ms)
BEST_FIRST walk for 8000007 steps (18250 resets) in 8142 ms. (982 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:17:59] [INFO ] Invariant cache hit.
[2025-05-30 11:17:59] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:17:59] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:17:59] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-05-30 11:17:59] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:17:59] [INFO ] [Nat]Absence check using 35 positive place invariants in 14 ms returned sat
[2025-05-30 11:18:00] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:18:00] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-05-30 11:18:00] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:18:00] [INFO ] [Nat]Added 2 Read/Feed constraints in 5 ms returned sat
[2025-05-30 11:18:00] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 3 ms to minimize.
[2025-05-30 11:18:00] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
[2025-05-30 11:18:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 189 ms
[2025-05-30 11:18:00] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 16 ms.
[2025-05-30 11:18:00] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
[2025-05-30 11:18:00] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 3 ms to minimize.
[2025-05-30 11:18:00] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2025-05-30 11:18:00] [INFO ] Added : 132 causal constraints over 27 iterations in 648 ms. Result :sat
Minimization took 120 ms.
[2025-05-30 11:18:01] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:18:01] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:18:01] [INFO ] [Real]Absence check using state equation in 119 ms returned sat
[2025-05-30 11:18:01] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:18:01] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 21 ms.
[2025-05-30 11:18:01] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:18:01] [INFO ] [Nat]Absence check using 35 positive place invariants in 15 ms returned sat
[2025-05-30 11:18:01] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 23 ms returned sat
[2025-05-30 11:18:01] [INFO ] [Nat]Absence check using state equation in 146 ms returned sat
[2025-05-30 11:18:01] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2025-05-30 11:18:01] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 17 ms.
[2025-05-30 11:18:02] [INFO ] Added : 76 causal constraints over 16 iterations in 275 ms. Result :sat
Minimization took 95 ms.
[2025-05-30 11:18:02] [INFO ] [Real]Absence check using 35 positive place invariants in 17 ms returned sat
[2025-05-30 11:18:02] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:18:02] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-30 11:18:02] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:18:02] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-30 11:18:02] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:18:02] [INFO ] [Nat]Absence check using state equation in 145 ms returned sat
[2025-05-30 11:18:02] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:18:02] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 47 ms.
[2025-05-30 11:18:03] [INFO ] Added : 105 causal constraints over 21 iterations in 765 ms. Result :sat
Minimization took 122 ms.
[2025-05-30 11:18:03] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:18:03] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:18:03] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2025-05-30 11:18:03] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:18:03] [INFO ] [Nat]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:18:03] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:18:03] [INFO ] [Nat]Absence check using state equation in 133 ms returned sat
[2025-05-30 11:18:03] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2025-05-30 11:18:03] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 22 ms.
[2025-05-30 11:18:04] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 3 ms to minimize.
[2025-05-30 11:18:04] [INFO ] Deduced a trap composed of 20 places in 161 ms of which 2 ms to minimize.
[2025-05-30 11:18:04] [INFO ] Deduced a trap composed of 9 places in 169 ms of which 2 ms to minimize.
[2025-05-30 11:18:05] [INFO ] Deduced a trap composed of 21 places in 124 ms of which 2 ms to minimize.
[2025-05-30 11:18:05] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 690 ms
[2025-05-30 11:18:05] [INFO ] Added : 111 causal constraints over 23 iterations in 1280 ms. Result :sat
Minimization took 132 ms.
[2025-05-30 11:18:05] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-30 11:18:05] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:18:05] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2025-05-30 11:18:05] [INFO ] [Real]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:18:05] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 3 ms to minimize.
[2025-05-30 11:18:05] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:18:05] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-30 11:18:05] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:18:05] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2025-05-30 11:18:06] [INFO ] [Nat]Added 2 Read/Feed constraints in 4 ms returned sat
[2025-05-30 11:18:06] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 2 ms to minimize.
[2025-05-30 11:18:06] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2025-05-30 11:18:06] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:18:06] [INFO ] Deduced a trap composed of 15 places in 71 ms of which 2 ms to minimize.
[2025-05-30 11:18:06] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:18:06] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 444 ms
[2025-05-30 11:18:06] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 12 ms.
[2025-05-30 11:18:06] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 2 ms to minimize.
[2025-05-30 11:18:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-05-30 11:18:06] [INFO ] Added : 107 causal constraints over 22 iterations in 494 ms. Result :sat
Minimization took 122 ms.
[2025-05-30 11:18:07] [INFO ] [Real]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:18:07] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:18:07] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2025-05-30 11:18:07] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:18:07] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2025-05-30 11:18:07] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 15 ms returned sat
[2025-05-30 11:18:07] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-05-30 11:18:07] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-30 11:18:07] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 12 ms.
[2025-05-30 11:18:07] [INFO ] Added : 108 causal constraints over 22 iterations in 397 ms. Result :sat
Minimization took 113 ms.
[2025-05-30 11:18:08] [INFO ] [Real]Absence check using 35 positive place invariants in 12 ms returned sat
[2025-05-30 11:18:08] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:18:08] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2025-05-30 11:18:08] [INFO ] [Real]Added 2 Read/Feed constraints in 3 ms returned sat
[2025-05-30 11:18:08] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 12 ms.
[2025-05-30 11:18:08] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:18:08] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-30 11:18:08] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 16 ms returned sat
[2025-05-30 11:18:08] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-05-30 11:18:08] [INFO ] [Nat]Added 2 Read/Feed constraints in 13 ms returned sat
[2025-05-30 11:18:08] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2025-05-30 11:18:08] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:18:08] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-05-30 11:18:08] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 273 ms
[2025-05-30 11:18:08] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 12 ms.
[2025-05-30 11:18:09] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 2 ms to minimize.
[2025-05-30 11:18:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-05-30 11:18:09] [INFO ] Added : 119 causal constraints over 25 iterations in 512 ms. Result :sat
Minimization took 119 ms.
[2025-05-30 11:18:09] [INFO ] [Real]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-30 11:18:09] [INFO ] [Real]Absence check using 35 positive and 25 generalized place invariants in 17 ms returned sat
[2025-05-30 11:18:09] [INFO ] [Real]Absence check using state equation in 109 ms returned sat
[2025-05-30 11:18:09] [INFO ] Solution in real domain found non-integer solution.
[2025-05-30 11:18:09] [INFO ] [Nat]Absence check using 35 positive place invariants in 10 ms returned sat
[2025-05-30 11:18:09] [INFO ] [Nat]Absence check using 35 positive and 25 generalized place invariants in 13 ms returned sat
[2025-05-30 11:18:09] [INFO ] [Nat]Absence check using state equation in 108 ms returned sat
[2025-05-30 11:18:09] [INFO ] [Nat]Added 2 Read/Feed constraints in 1 ms returned sat
[2025-05-30 11:18:09] [INFO ] Computed and/alt/rep : 164/288/164 causal constraints (skipped 6 transitions) in 12 ms.
[2025-05-30 11:18:10] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2025-05-30 11:18:10] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2025-05-30 11:18:10] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2025-05-30 11:18:10] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 277 ms
[2025-05-30 11:18:10] [INFO ] Added : 83 causal constraints over 17 iterations in 582 ms. Result :sat
Minimization took 104 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]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1]
Support contains 8 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 11 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 13 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2025-05-30 11:18:12] [INFO ] Invariant cache hit.
[2025-05-30 11:18:12] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-05-30 11:18:12] [INFO ] Invariant cache hit.
[2025-05-30 11:18:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:18:13] [INFO ] Implicit Places using invariants and state equation in 647 ms returned []
Implicit Place search using SMT with State Equation took 947 ms to find 0 implicit places.
[2025-05-30 11:18:13] [INFO ] Redundant transitions in 12 ms returned []
Running 170 sub problems to find dead transitions.
[2025-05-30 11:18:13] [INFO ] Invariant cache hit.
[2025-05-30 11:18:13] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/230 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 173/403 variables, 230/290 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:18:17] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:18:20] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:18:21] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 1/404 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:18:25] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 2 ms to minimize.
[2025-05-30 11:18:25] [INFO ] Deduced a trap composed of 12 places in 109 ms of which 3 ms to minimize.
[2025-05-30 11:18:26] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 14 (OVERLAPS) 0/404 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 299 constraints, problems are : Problem set: 0 solved, 170 unsolved in 18921 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 2/230 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 173/403 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 170/468 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:18:41] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 3 ms to minimize.
[2025-05-30 11:18:44] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:18:55] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2025-05-30 11:18:56] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2025-05-30 11:18:59] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 2 ms to minimize.
[2025-05-30 11:18:59] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/404 variables, and 474 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 230/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 12/12 constraints]
After SMT, in 49276ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 49341ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50339 ms. Remains : 231/231 places, 173/173 transitions.
RANDOM walk for 40000 steps (557 resets) in 1808 ms. (22 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 55 ms. (71 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
[2025-05-30 11:19:03] [INFO ] Flatten gal took : 200 ms
BEST_FIRST walk for 4003 steps (10 resets) in 50 ms. (78 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
[2025-05-30 11:19:03] [INFO ] Flatten gal took : 61 ms
BEST_FIRST walk for 4004 steps (10 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
[2025-05-30 11:19:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8050091350785876636.gal : 18 ms
BEST_FIRST walk for 4004 steps (10 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
[2025-05-30 11:19:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6468083821885172166.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/ReachabilityCardinality8050091350785876636.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6468083821885172166.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (11 resets) in 21 ms. (182 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 51 ms. (76 steps per ms) remains 16/16 properties
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 ...328
BEST_FIRST walk for 4002 steps (12 resets) in 63 ms. (62 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
Loading property file /tmp/ReachabilityCardinality6468083821885172166.prop.
BEST_FIRST walk for 4003 steps (10 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 10
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :10 after 20
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :20 after 156
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :156 after 656
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :656 after 1336
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1336 after 25820
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :66068 after 80296
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :364744 after 717848
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :717848 after 1.34945e+07
Interrupted probabilistic random walk after 586207 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :0 out of 16
Probabilistic random walk after 586207 steps, saw 84371 distinct states, run finished after 3007 ms. (steps per millisecond=194 ) properties seen :0
[2025-05-30 11:19:06] [INFO ] Invariant cache hit.
[2025-05-30 11:19:06] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 118/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/159 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/184 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/191 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 142/333 variables, 191/246 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:07] [INFO ] Deduced a trap composed of 12 places in 126 ms of which 1 ms to minimize.
[2025-05-30 11:19:07] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 16 ms to minimize.
[2025-05-30 11:19:07] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 1 ms to minimize.
[2025-05-30 11:19:08] [INFO ] Deduced a trap composed of 10 places in 158 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:08] [INFO ] Deduced a trap composed of 8 places in 111 ms of which 2 ms to minimize.
[2025-05-30 11:19:08] [INFO ] Deduced a trap composed of 7 places in 159 ms of which 17 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:08] [INFO ] Deduced a trap composed of 17 places in 145 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 42/375 variables, 11/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/376 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/376 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:09] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 1 ms to minimize.
[2025-05-30 11:19:09] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 2 ms to minimize.
[2025-05-30 11:19:09] [INFO ] Deduced a trap composed of 15 places in 77 ms of which 2 ms to minimize.
[2025-05-30 11:19:10] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:19:10] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/376 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:10] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 2 ms to minimize.
[2025-05-30 11:19:10] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
SDD proceeding with computation,16 properties remain. new max is 8192
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD size :1.34945e+07 after 1.587e+08
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 28/404 variables, 28/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/404 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 404/404 variables, and 307 constraints, problems are : Problem set: 0 solved, 16 unsolved in 5006 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 118/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/159 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 25/184 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 7/191 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 142/333 variables, 191/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 14/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 42/375 variables, 11/282 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/375 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/375 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 1/376 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 28/404 variables, 28/323 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/404 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:14] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 2 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/404 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:14] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 2 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/404 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/404 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 0/404 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 325 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3729 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 16/16 constraints]
After SMT, in 8746ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :1.587e+08 after 3.07069e+08
Parikh walk visited 0 properties in 1503 ms.
Support contains 8 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 11 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 231/231 places, 173/173 transitions.
RANDOM walk for 40000 steps (534 resets) in 349 ms. (114 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 12 ms. (308 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 27 ms. (143 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 12 ms. (307 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 14 ms. (266 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 16 ms. (235 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (9 resets) in 9 ms. (400 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (9 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 11 ms. (333 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (11 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (10 resets) in 22 ms. (174 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 529189 steps, run timeout after 3001 ms. (steps per millisecond=176 ) properties seen :0 out of 16
Probabilistic random walk after 529189 steps, saw 75865 distinct states, run finished after 3001 ms. (steps per millisecond=176 ) properties seen :0
[2025-05-30 11:19:20] [INFO ] Invariant cache hit.
[2025-05-30 11:19:20] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 118/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 33/159 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 25/184 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/184 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 7/191 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 142/333 variables, 191/246 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/333 variables, 2/248 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:20] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 2 ms to minimize.
[2025-05-30 11:19:20] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:19:21] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 2 ms to minimize.
[2025-05-30 11:19:21] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 14 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/333 variables, 4/252 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:21] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 2 ms to minimize.
[2025-05-30 11:19:21] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:21] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 42/375 variables, 11/266 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 4/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (OVERLAPS) 1/376 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/376 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:22] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2025-05-30 11:19:22] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2025-05-30 11:19:22] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 2 ms to minimize.
[2025-05-30 11:19:22] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2025-05-30 11:19:22] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/376 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:23] [INFO ] Deduced a trap composed of 13 places in 58 ms of which 2 ms to minimize.
[2025-05-30 11:19:23] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (OVERLAPS) 28/404 variables, 28/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/404 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (OVERLAPS) 0/404 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 307 constraints, problems are : Problem set: 0 solved, 16 unsolved in 4002 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 118/126 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (OVERLAPS) 33/159 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 3/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 25/184 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 6/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/184 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 7/191 variables, 7/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/191 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 11 (OVERLAPS) 142/333 variables, 191/255 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD proceeding with computation,16 properties remain. new max is 32768
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 14/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
SDD size :3.07069e+08 after 4.73086e+08
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 15 (OVERLAPS) 42/375 variables, 11/282 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/375 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/375 variables, 2/288 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/375 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/375 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 20 (OVERLAPS) 1/376 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/376 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/376 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/376 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 24 (OVERLAPS) 28/404 variables, 28/323 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/404 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:26] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
At refinement iteration 26 (OVERLAPS) 0/404 variables, 1/324 constraints. Problems are: Problem set: 0 solved, 16 unsolved
[2025-05-30 11:19:26] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/404 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/404 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 29 (OVERLAPS) 0/404 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/404 variables, and 325 constraints, problems are : Problem set: 0 solved, 16 unsolved in 3647 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 16/16 constraints]
After SMT, in 7660ms problems are : Problem set: 0 solved, 16 unsolved
Fused 16 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 1651 ms.
Support contains 8 out of 231 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 231/231 places, 173/173 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 231/231 places, 173/173 transitions.
Applied a total of 0 rules in 10 ms. Remains 231 /231 variables (removed 0) and now considering 173/173 (removed 0) transitions.
[2025-05-30 11:19:29] [INFO ] Invariant cache hit.
[2025-05-30 11:19:29] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-05-30 11:19:29] [INFO ] Invariant cache hit.
[2025-05-30 11:19:29] [INFO ] State equation strengthened by 2 read => feed constraints.
[2025-05-30 11:19:30] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 725 ms to find 0 implicit places.
[2025-05-30 11:19:30] [INFO ] Redundant transitions in 6 ms returned []
Running 170 sub problems to find dead transitions.
[2025-05-30 11:19:30] [INFO ] Invariant cache hit.
[2025-05-30 11:19:30] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
SDD proceeding with computation,16 properties remain. new max is 65536
SDD size :7.29588e+08 after 7.36665e+08
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/230 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/230 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (OVERLAPS) 173/403 variables, 230/290 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/403 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:19:33] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/403 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:19:36] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:19:38] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 1/295 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 11 (OVERLAPS) 1/404 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:19:41] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 1 ms to minimize.
[2025-05-30 11:19:42] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 2 ms to minimize.
[2025-05-30 11:19:42] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/404 variables, 3/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/404 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 14 (OVERLAPS) 0/404 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 170 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/404 variables, and 299 constraints, problems are : Problem set: 0 solved, 170 unsolved in 16893 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 231/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 170 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/228 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/228 variables, 17/52 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/228 variables, 5/57 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 4 (OVERLAPS) 2/230 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/230 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/230 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 7 (OVERLAPS) 173/403 variables, 230/296 constraints. Problems are: Problem set: 0 solved, 170 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/403 variables, 2/298 constraints. Problems are: Problem set: 0 solved, 170 unsolved
Detected timeout of ITS tools.
[2025-05-30 11:19:53] [INFO ] Flatten gal took : 32 ms
[2025-05-30 11:19:53] [INFO ] Applying decomposition
[2025-05-30 11:19:53] [INFO ] Flatten gal took : 24 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/graph3193382478250932551.txt' '-o' '/tmp/graph3193382478250932551.bin' '-w' '/tmp/graph3193382478250932551.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph3193382478250932551.bin' '-l' '-1' '-v' '-w' '/tmp/graph3193382478250932551.weights' '-q' '0' '-e' '0.001'
[2025-05-30 11:19:53] [INFO ] Decomposing Gal with order
[2025-05-30 11:19:53] [INFO ] Rewriting arrays to variables to allow decomposition.
At refinement iteration 9 (INCLUDED_ONLY) 0/403 variables, 170/468 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:19:54] [INFO ] Removed a total of 22 redundant transitions.
[2025-05-30 11:19:54] [INFO ] Flatten gal took : 140 ms
[2025-05-30 11:19:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 23 ms.
[2025-05-30 11:19:54] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14812619194943148304.gal : 8 ms
[2025-05-30 11:19:54] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10705902165836366981.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality14812619194943148304.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10705902165836366981.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 ...309
Loading property file /tmp/ReachabilityCardinality10705902165836366981.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :4 after 20
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :20 after 382
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :8206 after 2.58972e+08
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :2.58972e+08 after 6.43705e+08
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :6.43705e+08 after 1.1229e+09
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :1.1229e+09 after 1.8896e+09
[2025-05-30 11:19:56] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
Invariant property MIN7 does not hold.
Reachability property MAX7 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,12 properties remain. new max is 512
SDD size :2.74921e+12 after 2.7679e+12
Invariant property MIN6 does not hold.
Reachability property MAX6 is true.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :5.95702e+12 after 6.00952e+12
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 513 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,9.16443e+12,4.29286,75192,6093,3556,165457,8907,248,196445,295,44424,0
Total reachable state count : 9164432443899
Verifying 16 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,5.71948e+10,4.30444,75452,1141,687,165457,8907,250,196445,298,44424,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,5.71948e+10,4.30773,75452,1141,687,165457,8907,254,196445,300,44424,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,408,4.30846,75452,83,150,165457,8907,257,196445,302,44424,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,408,4.3092,75452,83,150,165457,8907,263,196445,304,44424,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,10240,4.31052,75452,75,140,165457,8907,266,196445,306,44424,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,10240,4.31183,75452,75,140,165457,8907,272,196445,308,44424,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,32,4.3128,75452,58,143,165457,8907,275,196445,310,44424,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,32,4.31368,75452,58,143,165457,8907,281,196445,312,44424,0
Reachability property MAX4 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX4,5.80782e+10,4.31536,75452,1066,609,165457,8907,283,196445,314,44424,0
Invariant property MIN4 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN4,5.80782e+10,4.31702,75452,1066,609,165457,8907,287,196445,316,44424,0
Reachability property MAX5 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX5,1.61548e+09,4.31794,75452,465,394,165457,8907,289,196445,318,44424,0
Invariant property MIN5 does not hold.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN5,1.61548e+09,4.31882,75452,465,394,165457,8907,293,196445,320,44424,0
Reachability property MAX6 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
MAX6,2.31286e+06,4.31963,75452,394,381,165457,8907,295,196445,322,44424,0
Invariant property MIN6 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
MIN6,2.31286e+06,4.32039,75452,394,381,165457,8907,299,196445,324,44424,0
Reachability property MAX7 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
MAX7,118098,4.32078,75452,58,141,165457,8907,300,196445,324,44424,0
Invariant property MIN7 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
MIN7,118098,4.32114,75452,58,141,165457,8907,302,196445,324,44424,0
ITS tools runner thread asked to quit. Dying gracefully.
[2025-05-30 11:19:59] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/403 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 170 unsolved
[2025-05-30 11:20:10] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2025-05-30 11:20:10] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 1 ms to minimize.
[2025-05-30 11:20:13] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
[2025-05-30 11:20:13] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 403/404 variables, and 474 constraints, problems are : Problem set: 0 solved, 170 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 230/231 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 170/170 constraints, Known Traps: 12/12 constraints]
After SMT, in 47030ms problems are : Problem set: 0 solved, 170 unsolved
Search for dead transitions found 0 dead transitions in 47033ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47782 ms. Remains : 231/231 places, 173/173 transitions.
FORMULA DES-PT-30a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30a-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30a-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30a-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30a-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30a-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-30a-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 8 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 164794 ms.
BK_STOP 1748604017347
--------------------
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-30a"
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-30a, 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-174854075900040"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-30a.tgz
mv DES-PT-30a 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 '
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 ;