About the Execution of ITS-Tools for DES-PT-20a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1897.896 | 160271.00 | 278410.00 | 465.00 | 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/mcc2026-input.r082-smll-177946993700381.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is DES-PT-20a, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r082-smll-177946993700381
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 7.0K Mar 6 18:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 6 18:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Mar 6 18:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 6 18:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 08:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 08:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Mar 6 18:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 6 18:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:57 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 57K Mar 3 18:30 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of positive values
NUM_VECTOR
echo here is the order used to build the result vector(from xml file)
FORMULA_NAME DES-PT-20a-UpperBounds-00
FORMULA_NAME DES-PT-20a-UpperBounds-01
FORMULA_NAME DES-PT-20a-UpperBounds-02
FORMULA_NAME DES-PT-20a-UpperBounds-03
FORMULA_NAME DES-PT-20a-UpperBounds-04
FORMULA_NAME DES-PT-20a-UpperBounds-05
FORMULA_NAME DES-PT-20a-UpperBounds-06
FORMULA_NAME DES-PT-20a-UpperBounds-07
FORMULA_NAME DES-PT-20a-UpperBounds-08
FORMULA_NAME DES-PT-20a-UpperBounds-09
FORMULA_NAME DES-PT-20a-UpperBounds-10
FORMULA_NAME DES-PT-20a-UpperBounds-11
FORMULA_NAME DES-PT-20a-UpperBounds-12
FORMULA_NAME DES-PT-20a-UpperBounds-13
FORMULA_NAME DES-PT-20a-UpperBounds-14
FORMULA_NAME DES-PT-20a-UpperBounds-15
=== Now, execution of the tool begins
BK_START 1779684083973
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-20a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202604301425
[2026-05-25 04:41:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 04:41:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 04:41:26] [INFO ] Load time of PNML (sax parser for PT used): 173 ms
[2026-05-25 04:41:26] [INFO ] Transformed 195 places.
[2026-05-25 04:41:26] [INFO ] Transformed 152 transitions.
[2026-05-25 04:41:26] [INFO ] Found NUPN structural information;
[2026-05-25 04:41:26] [INFO ] Parsed PT model containing 195 places and 152 transitions and 742 arcs in 421 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 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]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13229718019602654824.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8579948039639656217.kers'
[2026-05-25 04:41:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13229718019602654824.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8579948039639656217.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 138 rows 194 cols 675 entries
Finished phase 1 with 54 SingleSign rule and 82 generalized
[2026-05-25 04:41:27] [INFO ] Computed 59 invariants in 2 ms
Computed 59 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8579948039639656217.kers
Total runtime 4 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 (224 resets) in 110 ms. (90 steps per ms)
FORMULA DES-PT-20a-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA DES-PT-20a-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (236 resets) in 204 ms. (243 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 04:41:27] [INFO ] Invariant cache hit.
[2026-05-25 04:41:28] [INFO ] [Real]Absence check using 35 positive place invariants in 36 ms returned sat
[2026-05-25 04:41:28] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 35 ms returned sat
[2026-05-25 04:41:28] [INFO ] [Real]Absence check using state equation in 216 ms returned sat
[2026-05-25 04:41:28] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:28] [INFO ] [Nat]Absence check using 35 positive place invariants in 24 ms returned sat
[2026-05-25 04:41:28] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 18 ms returned sat
[2026-05-25 04:41:28] [INFO ] [Nat]Absence check using state equation in 161 ms returned sat
[2026-05-25 04:41:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 04:41:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 4 ms returned sat
[2026-05-25 04:41:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2026-05-25 04:41:29] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 29 ms.
[2026-05-25 04:41:29] [INFO ] Added : 97 causal constraints over 20 iterations in 587 ms. Result :sat
Minimization took 99 ms.
[2026-05-25 04:41:29] [INFO ] [Real]Absence check using 35 positive place invariants in 13 ms returned sat
[2026-05-25 04:41:29] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2026-05-25 04:41:29] [INFO ] [Real]Absence check using state equation in 107 ms returned sat
[2026-05-25 04:41:29] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:30] [INFO ] [Nat]Absence check using 35 positive place invariants in 29 ms returned sat
[2026-05-25 04:41:30] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2026-05-25 04:41:30] [INFO ] [Nat]Absence check using state equation in 138 ms returned sat
[2026-05-25 04:41:30] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 04:41:30] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 22 ms.
[2026-05-25 04:41:30] [INFO ] Added : 114 causal constraints over 23 iterations in 705 ms. Result :sat
Minimization took 186 ms.
[2026-05-25 04:41:31] [INFO ] [Real]Absence check using 35 positive place invariants in 19 ms returned sat
[2026-05-25 04:41:31] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 32 ms returned sat
[2026-05-25 04:41:31] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2026-05-25 04:41:31] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:31] [INFO ] [Nat]Absence check using 35 positive place invariants in 16 ms returned sat
[2026-05-25 04:41:31] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 17 ms returned sat
[2026-05-25 04:41:31] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2026-05-25 04:41:31] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 04:41:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 187 ms
[2026-05-25 04:41:31] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 18 ms.
[2026-05-25 04:41:32] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 267 ms
[2026-05-25 04:41:32] [INFO ] Added : 63 causal constraints over 14 iterations in 912 ms. Result :sat
Minimization took 105 ms.
[2026-05-25 04:41:33] [INFO ] [Real]Absence check using 35 positive place invariants in 25 ms returned sat
[2026-05-25 04:41:33] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 19 ms returned sat
[2026-05-25 04:41:33] [INFO ] [Real]Absence check using state equation in 165 ms returned sat
[2026-05-25 04:41:33] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:33] [INFO ] [Nat]Absence check using 35 positive place invariants in 20 ms returned sat
[2026-05-25 04:41:33] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 20 ms returned sat
[2026-05-25 04:41:33] [INFO ] [Nat]Absence check using state equation in 316 ms returned sat
[2026-05-25 04:41:33] [INFO ] [Nat]Added 1 Read/Feed constraints in 2 ms returned sat
[2026-05-25 04:41:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 117 ms
[2026-05-25 04:41:33] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 25 ms.
[2026-05-25 04:41:34] [INFO ] Added : 98 causal constraints over 21 iterations in 840 ms. Result :sat
Minimization took 169 ms.
[2026-05-25 04:41:35] [INFO ] [Real]Absence check using 35 positive place invariants in 16 ms returned sat
[2026-05-25 04:41:35] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2026-05-25 04:41:35] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2026-05-25 04:41:35] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 22 ms returned sat
[2026-05-25 04:41:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 23 ms returned sat
[2026-05-25 04:41:35] [INFO ] [Nat]Absence check using state equation in 184 ms returned sat
[2026-05-25 04:41:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2026-05-25 04:41:35] [INFO ] Computed and/alt/rep : 130/393/130 causal constraints (skipped 7 transitions) in 21 ms.
[2026-05-25 04:41:36] [INFO ] Added : 79 causal constraints over 16 iterations in 582 ms. Result :sat
Minimization took 165 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 195 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 195/195 places, 138/138 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 195 transition count 136
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 194 transition count 135
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 194 transition count 135
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 10 place count 194 transition count 135
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 193 transition count 134
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 192 transition count 134
Applied a total of 12 rules in 150 ms. Remains 192 /195 variables (removed 3) and now considering 134/138 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 163 ms. Remains : 192/195 places, 134/138 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-462401363923994189.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1749338598576709476.kers'
[2026-05-25 04:41:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-462401363923994189.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1749338598576709476.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 134 rows 163 cols 519 entries
Finished phase 1 with 102 SingleSign rule and 30 generalized
[2026-05-25 04:41:37] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1749338598576709476.kers
Total runtime 2 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (13676 resets) in 2795 ms. (357 steps per ms)
BEST_FIRST walk for 5000003 steps (11341 resets) in 5944 ms. (841 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 04:41:46] [INFO ] Invariant cache hit.
[2026-05-25 04:41:46] [INFO ] [Real]Absence check using 40 positive place invariants in 13 ms returned sat
[2026-05-25 04:41:46] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 15 ms returned sat
[2026-05-25 04:41:46] [INFO ] [Real]Absence check using state equation in 93 ms returned sat
[2026-05-25 04:41:46] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:46] [INFO ] [Nat]Absence check using 40 positive place invariants in 12 ms returned sat
[2026-05-25 04:41:46] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 17 ms returned sat
[2026-05-25 04:41:46] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2026-05-25 04:41:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 04:41:46] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2026-05-25 04:41:47] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 13 ms.
[2026-05-25 04:41:48] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 598 ms
[2026-05-25 04:41:48] [INFO ] Added : 116 causal constraints over 25 iterations in 1072 ms. Result :sat
Minimization took 131 ms.
[2026-05-25 04:41:48] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2026-05-25 04:41:48] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 23 ms returned sat
[2026-05-25 04:41:48] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2026-05-25 04:41:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:48] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2026-05-25 04:41:48] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 21 ms returned sat
[2026-05-25 04:41:48] [INFO ] [Nat]Absence check using state equation in 136 ms returned sat
[2026-05-25 04:41:48] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2026-05-25 04:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 316 ms
[2026-05-25 04:41:49] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 13 ms.
[2026-05-25 04:41:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 270 ms
[2026-05-25 04:41:49] [INFO ] Added : 118 causal constraints over 24 iterations in 921 ms. Result :sat
Minimization took 127 ms.
[2026-05-25 04:41:50] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2026-05-25 04:41:50] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 24 ms returned sat
[2026-05-25 04:41:50] [INFO ] [Real]Absence check using state equation in 141 ms returned sat
[2026-05-25 04:41:50] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:50] [INFO ] [Nat]Absence check using 40 positive place invariants in 19 ms returned sat
[2026-05-25 04:41:50] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 24 ms returned sat
[2026-05-25 04:41:50] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-25 04:41:50] [INFO ] [Nat]Added 2 Read/Feed constraints in 18 ms returned sat
[2026-05-25 04:41:50] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 164 ms
[2026-05-25 04:41:50] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 25 ms.
[2026-05-25 04:41:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 151 ms
[2026-05-25 04:41:51] [INFO ] Added : 71 causal constraints over 15 iterations in 731 ms. Result :sat
Minimization took 120 ms.
[2026-05-25 04:41:51] [INFO ] [Real]Absence check using 40 positive place invariants in 19 ms returned sat
[2026-05-25 04:41:51] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 25 ms returned sat
[2026-05-25 04:41:51] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2026-05-25 04:41:51] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2026-05-25 04:41:52] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 24 ms returned sat
[2026-05-25 04:41:52] [INFO ] [Nat]Absence check using state equation in 140 ms returned sat
[2026-05-25 04:41:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 2 ms returned sat
[2026-05-25 04:41:52] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 18 ms.
[2026-05-25 04:41:53] [INFO ] Added : 114 causal constraints over 23 iterations in 1024 ms. Result :sat
Minimization took 140 ms.
[2026-05-25 04:41:53] [INFO ] [Real]Absence check using 40 positive place invariants in 21 ms returned sat
[2026-05-25 04:41:53] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 24 ms returned sat
[2026-05-25 04:41:53] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2026-05-25 04:41:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:41:53] [INFO ] [Nat]Absence check using 40 positive place invariants in 18 ms returned sat
[2026-05-25 04:41:53] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 23 ms returned sat
[2026-05-25 04:41:53] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2026-05-25 04:41:53] [INFO ] [Nat]Added 2 Read/Feed constraints in 6 ms returned sat
[2026-05-25 04:41:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 371 ms
[2026-05-25 04:41:54] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 16 ms.
[2026-05-25 04:41:54] [INFO ] Added : 89 causal constraints over 18 iterations in 504 ms. Result :sat
Minimization took 128 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 11 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-25 04:41:55] [INFO ] Invariant cache hit.
[2026-05-25 04:41:56] [INFO ] Implicit Places using invariants in 380 ms returned []
[2026-05-25 04:41:56] [INFO ] Invariant cache hit.
[2026-05-25 04:41:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 04:41:56] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 929 ms to find 0 implicit places.
[2026-05-25 04:41:56] [INFO ] Redundant transitions in 7 ms returned []
Running 131 sub problems to find dead transitions.
[2026-05-25 04:41:56] [INFO ] Invariant cache hit.
[2026-05-25 04:41:57] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 131 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/191 variables, 11/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/191 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 134/325 variables, 191/251 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/325 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 1/326 variables, 1/258 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/326 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/326 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/326 variables, 1/262 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/326 variables, 1/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/326 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/326 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/326 variables, 2/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/326 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 326/326 variables, and 266 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/189 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/189 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/189 variables, 12/61 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (OVERLAPS) 2/191 variables, 11/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 134/325 variables, 191/263 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/325 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/325 variables, 131/396 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/325 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 131 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 325/326 variables, and 397 constraints, problems are : Problem set: 0 solved, 131 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 191/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60273ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 60355ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61363 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (539 resets) in 1236 ms. (32 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (79 resets) in 358 ms. (111 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (83 resets) in 281 ms. (141 steps per ms) remains 10/10 properties
[2026-05-25 04:42:57] [INFO ] Flatten gal took : 100 ms
[2026-05-25 04:42:57] [INFO ] Flatten gal took : 45 ms
BEST_FIRST walk for 40003 steps (94 resets) in 342 ms. (116 steps per ms) remains 10/10 properties
[2026-05-25 04:42:58] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality834349211860723520.gal : 18 ms
[2026-05-25 04:42:58] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18072068715645731646.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality834349211860723520.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18072068715645731646.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality18072068715645731646.prop.
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 4
BEST_FIRST walk for 40004 steps (96 resets) in 288 ms. (138 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :22 after 28
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :28 after 636
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :636 after 666
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :666 after 818
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :818 after 35952
BEST_FIRST walk for 40004 steps (86 resets) in 214 ms. (186 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :35952 after 82924
BEST_FIRST walk for 40004 steps (99 resets) in 230 ms. (173 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :82924 after 415672
BEST_FIRST walk for 40003 steps (90 resets) in 195 ms. (204 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (92 resets) in 178 ms. (223 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (80 resets) in 150 ms. (264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (86 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
SDD proceeding with computation,10 properties remain. new max is 4096
SDD size :4.51269e+08 after 6.76855e+08
SDD proceeding with computation,10 properties remain. new max is 8192
SDD size :7.06975e+08 after 7.07545e+08
SDD proceeding with computation,10 properties remain. new max is 16384
SDD size :5.58062e+09 after 7.96424e+09
Interrupted probabilistic random walk after 573473 steps, run timeout after 3001 ms. (steps per millisecond=191 ) properties seen :0 out of 10
Probabilistic random walk after 573473 steps, saw 82412 distinct states, run finished after 3009 ms. (steps per millisecond=190 ) properties seen :0
[2026-05-25 04:43:01] [INFO ] Invariant cache hit.
[2026-05-25 04:43:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 104/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 42/151 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/153 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 9/162 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 113/275 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 32768
SDD size :8.25738e+09 after 9.28829e+09
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 33/308 variables, 12/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/309 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 17/326 variables, 17/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1670 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 104/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 42/151 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 9/162 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 113/275 variables, 162/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/275 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 33/308 variables, 12/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 1/309 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 17/326 variables, 17/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/326 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
SDD proceeding with computation,10 properties remain. new max is 65536
SDD size :7.13581e+10 after 8.81372e+10
At refinement iteration 26 (OVERLAPS) 0/326 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 268 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2420 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4098ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 6496 ms.
Support contains 5 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
SDD proceeding with computation,10 properties remain. new max is 131072
Applied a total of 0 rules in 16 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 192/192 places, 134/134 transitions.
RANDOM walk for 40000 steps (546 resets) in 339 ms. (117 steps per ms) remains 10/10 properties
SDD size :1.77511e+11 after 1.77699e+11
BEST_FIRST walk for 40002 steps (92 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (91 resets) in 120 ms. (330 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (78 resets) in 114 ms. (347 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (84 resets) in 168 ms. (236 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (88 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (93 resets) in 153 ms. (259 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (81 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (87 resets) in 219 ms. (181 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (90 resets) in 180 ms. (221 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (95 resets) in 177 ms. (224 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 552320 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 10
Probabilistic random walk after 552320 steps, saw 79343 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2026-05-25 04:43:15] [INFO ] Invariant cache hit.
[2026-05-25 04:43:15] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 104/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 42/151 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 2/153 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/153 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 9/162 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/162 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 113/275 variables, 162/217 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/275 variables, 2/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 33/308 variables, 12/232 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/308 variables, 4/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/308 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (OVERLAPS) 1/309 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/309 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 17/326 variables, 17/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (OVERLAPS) 0/326 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 255 constraints, problems are : Problem set: 0 solved, 10 unsolved in 1549 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (OVERLAPS) 104/109 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 3 (OVERLAPS) 42/151 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/151 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/151 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/151 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 2/153 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 9 (OVERLAPS) 9/162 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/162 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 11 (OVERLAPS) 113/275 variables, 162/219 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/275 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 8/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/275 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 15 (OVERLAPS) 33/308 variables, 12/241 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/308 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/308 variables, 2/247 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/308 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 19 (OVERLAPS) 1/309 variables, 1/248 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/309 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/309 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 22 (OVERLAPS) 17/326 variables, 17/266 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 1/267 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/326 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/326 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 26 (OVERLAPS) 0/326 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 268 constraints, problems are : Problem set: 0 solved, 10 unsolved in 2442 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4001ms problems are : Problem set: 0 solved, 10 unsolved
Fused 10 Parikh solutions to 5 different solutions.
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
Parikh walk visited 0 properties in 6328 ms.
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 9 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 8 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-25 04:43:26] [INFO ] Invariant cache hit.
[2026-05-25 04:43:26] [INFO ] Implicit Places using invariants in 199 ms returned []
[2026-05-25 04:43:26] [INFO ] Invariant cache hit.
[2026-05-25 04:43:26] [INFO ] State equation strengthened by 2 read => feed constraints.
SDD proceeding with computation,8 properties remain. new max is 131072
[2026-05-25 04:43:26] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 550 ms to find 0 implicit places.
[2026-05-25 04:43:26] [INFO ] Redundant transitions in 4 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 570 ms. Remains : 192/192 places, 134/134 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 192 transition count 134
Applied a total of 1 rules in 17 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Running SMT prover for 8 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11411511358572842707.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7706793689194564630.kers'
[2026-05-25 04:43:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11411511358572842707.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7706793689194564630.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 134 rows 163 cols 520 entries
Finished phase 1 with 102 SingleSign rule and 30 generalized
[2026-05-25 04:43:26] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7706793689194564630.kers
Total runtime 2 ms.
SDD size :5.487e+11 after 5.96619e+11
[2026-05-25 04:43:26] [INFO ] [Real]Absence check using 40 positive place invariants in 10 ms returned sat
[2026-05-25 04:43:26] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 17 ms returned sat
[2026-05-25 04:43:26] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2026-05-25 04:43:26] [INFO ] [Nat]Absence check using 40 positive place invariants in 9 ms returned sat
[2026-05-25 04:43:26] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 17 ms returned sat
[2026-05-25 04:43:27] [INFO ] After 160ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
TRAPS : Iteration 0
[2026-05-25 04:43:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 113 ms
TRAPS : Iteration 1
[2026-05-25 04:43:27] [INFO ] After 509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
[2026-05-25 04:43:27] [INFO ] After 734ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
[2026-05-25 04:43:27] [INFO ] Flatten gal took : 51 ms
[2026-05-25 04:43:27] [INFO ] Flatten gal took : 31 ms
[2026-05-25 04:43:27] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10384198535725538640.gal : 16 ms
[2026-05-25 04:43:27] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13398584943879885103.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10384198535725538640.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13398584943879885103.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality13398584943879885103.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :4 after 14
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :14 after 20
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :20 after 35
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :35 after 46
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :46 after 1144
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1144 after 1396
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :1396 after 67806
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :67806 after 82448
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :82448 after 482568
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :8.77246e+08 after 8.77364e+08
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :8.77364e+08 after 8.80678e+08
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :9.50892e+09 after 9.51118e+09
SDD proceeding with computation,8 properties remain. new max is 32768
SDD size :3.90912e+10 after 3.90936e+10
SDD proceeding with computation,8 properties remain. new max is 65536
SDD size :1.0107e+11 after 1.01109e+11
SDD proceeding with computation,8 properties remain. new max is 131072
SDD size :3.24541e+11 after 3.24608e+11
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
Detected timeout of ITS tools.
Invariant property MIN3 does not hold.
[2026-05-25 04:43:42] [INFO ] Flatten gal took : 42 ms
[2026-05-25 04:43:42] [INFO ] Applying decomposition
[2026-05-25 04:43:42] [INFO ] Flatten gal took : 18 ms
Reachability property MAX3 is true.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4726121493254971107.txt' '-o' '/tmp/graph4726121493254971107.bin' '-w' '/tmp/graph4726121493254971107.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4726121493254971107.bin' '-l' '-1' '-v' '-w' '/tmp/graph4726121493254971107.weights' '-q' '0' '-e' '0.001'
[2026-05-25 04:43:43] [INFO ] Decomposing Gal with order
[2026-05-25 04:43:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:43:43] [INFO ] Removed a total of 39 redundant transitions.
[2026-05-25 04:43:43] [INFO ] Flatten gal took : 99 ms
[2026-05-25 04:43:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 20 labels/synchronizations in 9 ms.
[2026-05-25 04:43:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9843597945235257153.gal : 7 ms
[2026-05-25 04:43:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14243542484543131756.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9843597945235257153.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14243542484543131756.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality14243542484543131756.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :2 after 4
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :4 after 76
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :76 after 9360
SDD proceeding with computation,4 properties remain. new max is 131072
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :9360 after 7.79122e+08
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :7.79122e+08 after 1.31678e+09
SDD size :9.40552e+11 after 1.00248e+12
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :1.31678e+09 after 2.28565e+09
Invariant property MIN4 does not hold.
Reachability property MAX4 is true.
SDD proceeding with computation,6 properties remain. new max is 256
SDD size :1.66497e+12 after 1.70962e+12
Invariant property MIN3 does not hold.
Reachability property MAX3 is true.
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 257 fixpoint passes
Detected timeout of ITS tools.
[2026-05-25 04:43:48] [INFO ] Flatten gal took : 15 ms
[2026-05-25 04:43:48] [INFO ] Applying decomposition
[2026-05-25 04:43:48] [INFO ] Flatten gal took : 16 ms
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,3.99853e+12,4.98239,111708,13035,1397,219300,4152,275,470835,219,18350,0
Total reachable state count : 3998533060804
Verifying 8 reachability properties.
Reachability property MAX0 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,71680,4.99847,111832,81,101,219300,4152,278,470835,222,18350,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,71680,5.00143,111972,81,101,219300,4152,284,470835,224,18350,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,1.23385e+11,5.00401,111972,1932,458,219300,4152,286,470835,226,18350,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,1.23385e+11,5.00644,111972,1932,458,219300,4152,290,470835,228,18350,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,53760,5.00729,111972,85,100,219300,4152,293,470835,230,18350,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,53760,5.00811,111972,85,100,219300,4152,299,470835,232,18350,0
Reachability property MAX4 is true.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph9039004253887287938.txt' '-o' '/tmp/graph9039004253887287938.bin' '-w' '/tmp/graph9039004253887287938.weights'
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,4.06062e+10,5.00998,111972,1458,395,219300,4152,301,470835,234,18350,0
Invariant property MIN4 does not hold.
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9039004253887287938.bin' '-l' '-1' '-v' '-w' '/tmp/graph9039004253887287938.weights' '-q' '0' '-e' '0.001'
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,4.06062e+10,5.01172,111972,1458,395,219300,4152,305,470835,236,18350,0
[2026-05-25 04:43:48] [INFO ] Decomposing Gal with order
Over-approximation ignoring read arcs solved -4 properties in 21596 ms.
[2026-05-25 04:43:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 04:43:48] [INFO ] Removed a total of 39 redundant transitions.
[2026-05-25 04:43:48] [INFO ] Flatten gal took : 27 ms
[2026-05-25 04:43:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 22 labels/synchronizations in 4 ms.
[2026-05-25 04:43:48] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17334128548866476651.gal : 5 ms
[2026-05-25 04:43:48] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9020144789434761469.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.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17334128548866476651.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9020144789434761469.prop' '--nowitness'
ITS runner timed out or was interrupted.
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-20a-UpperBounds-08 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20a-UpperBounds-10 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20a-UpperBounds-15 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[0, 0] Max Struct:[1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12811760461109476677.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2906155047558099745.kers'
[2026-05-25 04:43:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12811760461109476677.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2906155047558099745.kers]
Culling duplicate invariants (modulo rational): removing 29 columns.
Culled 29 columns in 0 ms.
// Phase 1: matrix 134 rows 163 cols 519 entries
Finished phase 1 with 102 SingleSign rule and 30 generalized
[2026-05-25 04:43:48] [INFO ] Computed 60 invariants in 1 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2906155047558099745.kers
Total runtime 1 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (13626 resets) in 2082 ms. (480 steps per ms)
BEST_FIRST walk for 2000002 steps (4532 resets) in 1778 ms. (1124 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2026-05-25 04:43:52] [INFO ] Invariant cache hit.
[2026-05-25 04:43:52] [INFO ] [Real]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 04:43:52] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 15 ms returned sat
[2026-05-25 04:43:52] [INFO ] [Real]Absence check using state equation in 90 ms returned sat
[2026-05-25 04:43:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:43:52] [INFO ] [Nat]Absence check using 40 positive place invariants in 11 ms returned sat
[2026-05-25 04:43:52] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 19 ms returned sat
[2026-05-25 04:43:52] [INFO ] [Nat]Absence check using state equation in 123 ms returned sat
[2026-05-25 04:43:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 04:43:52] [INFO ] [Nat]Added 2 Read/Feed constraints in 7 ms returned sat
[2026-05-25 04:43:52] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 21 ms.
[2026-05-25 04:43:53] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 563 ms
[2026-05-25 04:43:53] [INFO ] Added : 116 causal constraints over 25 iterations in 1114 ms. Result :sat
Minimization took 124 ms.
[2026-05-25 04:43:53] [INFO ] [Real]Absence check using 40 positive place invariants in 18 ms returned sat
[2026-05-25 04:43:53] [INFO ] [Real]Absence check using 40 positive and 20 generalized place invariants in 23 ms returned sat
[2026-05-25 04:43:54] [INFO ] [Real]Absence check using state equation in 139 ms returned sat
[2026-05-25 04:43:54] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 04:43:54] [INFO ] [Nat]Absence check using 40 positive place invariants in 15 ms returned sat
[2026-05-25 04:43:54] [INFO ] [Nat]Absence check using 40 positive and 20 generalized place invariants in 18 ms returned sat
[2026-05-25 04:43:54] [INFO ] [Nat]Absence check using state equation in 151 ms returned sat
[2026-05-25 04:43:54] [INFO ] [Nat]Added 2 Read/Feed constraints in 8 ms returned sat
[2026-05-25 04:43:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 309 ms
[2026-05-25 04:43:54] [INFO ] Computed and/alt/rep : 125/233/125 causal constraints (skipped 6 transitions) in 15 ms.
[2026-05-25 04:43:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 268 ms
[2026-05-25 04:43:55] [INFO ] Added : 118 causal constraints over 24 iterations in 909 ms. Result :sat
Minimization took 129 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 13 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 192/192 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 134/134 transitions.
Applied a total of 0 rules in 12 ms. Remains 192 /192 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2026-05-25 04:43:56] [INFO ] Invariant cache hit.
[2026-05-25 04:43:56] [INFO ] Implicit Places using invariants in 340 ms returned []
[2026-05-25 04:43:56] [INFO ] Invariant cache hit.
[2026-05-25 04:43:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 04:43:57] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2026-05-25 04:43:57] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 843 ms. Remains : 192/192 places, 134/134 transitions.
[2026-05-25 04:43:57] [INFO ] Flatten gal took : 24 ms
[2026-05-25 04:43:57] [INFO ] Flatten gal took : 31 ms
[2026-05-25 04:43:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5534646838763819424.gal : 3 ms
[2026-05-25 04:43:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9436293968043639364.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5534646838763819424.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9436293968043639364.prop' '--nowitness' '--gen-order' 'FOLLOW'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality9436293968043639364.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :4 after 10
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :10 after 22
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :22 after 28
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :28 after 636
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :636 after 666
SDD proceeding with computation,4 properties remain. new max is 256
SDD size :666 after 818
RANDOM walk for 40000 steps (529 resets) in 518 ms. (77 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (91 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 512
SDD size :818 after 35952
BEST_FIRST walk for 40004 steps (93 resets) in 121 ms. (327 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 1024
SDD size :35952 after 82924
BEST_FIRST walk for 40002 steps (95 resets) in 115 ms. (344 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (96 resets) in 106 ms. (373 steps per ms) remains 4/4 properties
SDD proceeding with computation,4 properties remain. new max is 2048
SDD size :82924 after 415672
SDD proceeding with computation,4 properties remain. new max is 4096
SDD size :4.51269e+08 after 6.76855e+08
SDD proceeding with computation,4 properties remain. new max is 8192
SDD size :7.06975e+08 after 7.07545e+08
SDD proceeding with computation,4 properties remain. new max is 16384
SDD size :5.58062e+09 after 7.96424e+09
Interrupted probabilistic random walk after 590546 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 4
Probabilistic random walk after 590546 steps, saw 85003 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2026-05-25 04:44:00] [INFO ] Invariant cache hit.
[2026-05-25 04:44:00] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 42/150 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/152 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 12/284 variables, 8/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/284 variables, 3/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/285 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/285 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 22/307 variables, 3/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/307 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 19/326 variables, 19/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/326 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 326/326 variables, and 254 constraints, problems are : Problem set: 0 solved, 4 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 106/108 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 42/150 variables, 34/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,4 properties remain. new max is 32768
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 2/152 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/152 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :8.25738e+09 after 9.28829e+09
At refinement iteration 7 (OVERLAPS) 9/161 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 111/272 variables, 161/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 2/218 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 4/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 12/284 variables, 8/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/284 variables, 3/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/284 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/285 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/285 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/285 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 22/307 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/307 variables, 1/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/307 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 19/326 variables, 19/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/326 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/326 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 326/326 variables, and 258 constraints, problems are : Problem set: 0 solved, 4 unsolved in 730 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 192/192 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1297ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Finished Parikh walk after 40815 steps, including 203 resets, run visited all 4 properties in 545 ms. (steps per millisecond=74 )
Parikh walk visited 4 properties in 552 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA DES-PT-20a-UpperBounds-02 1 TECHNIQUES REACHABILITY_MAX
FORMULA DES-PT-20a-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 04:44:02] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (13631 resets) in 1816 ms. (550 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 157670 ms.
BK_STOP 1779684244244
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /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-20a"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is DES-PT-20a, 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 r082-smll-177946993700381"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-20a.tgz
mv DES-PT-20a 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 ;