Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r125-tall-174876435700056.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is JoinFreeModules-PT-0100, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r125-tall-174876435700056
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 732K
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 304K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748774360156

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0100
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-01 10:39:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 10:39:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 10:39:21] [INFO ] Load time of PNML (sax parser for PT used): 106 ms
[2025-06-01 10:39:21] [INFO ] Transformed 501 places.
[2025-06-01 10:39:21] [INFO ] Transformed 801 transitions.
[2025-06-01 10:39:21] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Reduce places removed 1 places and 0 transitions.
Current structural bounds on expressions (Initially) : Max Seen:[2, 2, 100, 100, 100, 0, 0, 100, 1, 0, 1, 100, 0, 0, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[2, 2, 100, 100, 100, 0, 0, 100, 1, 0, 1, 100, 0, 0, 1, 2] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 801 rows 500 cols
[2025-06-01 10:39:21] [INFO ] Computed 100 invariants in 28 ms
Current structural bounds on expressions (after invariants) : Max Seen:[2, 2, 100, 100, 100, 0, 0, 100, 1, 0, 1, 100, 0, 0, 1, 2] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 10074 steps (2 resets) in 84 ms. (118 steps per ms)
BEST_FIRST walk for 160016 steps (32 resets) in 898 ms. (177 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[27, 2, 100, 100, 100, 26, 60, 100, 101, 26, 18, 100, 17, 50, 18, 2] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2025-06-01 10:39:22] [INFO ] Invariant cache hit.
[2025-06-01 10:39:23] [INFO ] [Real]Absence check using 100 positive place invariants in 23 ms returned sat
[2025-06-01 10:39:23] [INFO ] [Real]Absence check using state equation in 223 ms returned sat
[2025-06-01 10:39:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:23] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2025-06-01 10:39:23] [INFO ] [Nat]Absence check using state equation in 270 ms returned sat
[2025-06-01 10:39:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2025-06-01 10:39:23] [INFO ] [Nat]Added 100 Read/Feed constraints in 212 ms returned sat
[2025-06-01 10:39:24] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 57 ms.
[2025-06-01 10:39:25] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 11 ms to minimize.
[2025-06-01 10:39:26] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:39:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2025-06-01 10:39:26] [INFO ] Added : 197 causal constraints over 41 iterations in 2147 ms. Result :sat
Minimization took 461 ms.
[2025-06-01 10:39:26] [INFO ] [Real]Absence check using 100 positive place invariants in 20 ms returned sat
[2025-06-01 10:39:26] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-01 10:39:26] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:27] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2025-06-01 10:39:27] [INFO ] [Nat]Absence check using state equation in 296 ms returned sat
[2025-06-01 10:39:27] [INFO ] [Nat]Added 100 Read/Feed constraints in 98 ms returned sat
[2025-06-01 10:39:27] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 44 ms.
[2025-06-01 10:39:28] [INFO ] Added : 155 causal constraints over 33 iterations in 1485 ms. Result :sat
Minimization took 440 ms.
[2025-06-01 10:39:29] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:39:29] [INFO ] [Real]Absence check using state equation in 176 ms returned sat
[2025-06-01 10:39:29] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:29] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:39:29] [INFO ] [Nat]Absence check using state equation in 181 ms returned sat
[2025-06-01 10:39:30] [INFO ] [Nat]Added 100 Read/Feed constraints in 193 ms returned sat
[2025-06-01 10:39:30] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 41 ms.
[2025-06-01 10:39:32] [INFO ] Added : 302 causal constraints over 62 iterations in 2761 ms. Result :sat
Minimization took 175 ms.
[2025-06-01 10:39:33] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:33] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-01 10:39:33] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:33] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:33] [INFO ] [Nat]Absence check using state equation in 248 ms returned sat
[2025-06-01 10:39:33] [INFO ] [Nat]Added 100 Read/Feed constraints in 140 ms returned sat
[2025-06-01 10:39:33] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-01 10:39:35] [INFO ] Added : 131 causal constraints over 28 iterations in 1204 ms. Result :sat
Minimization took 137 ms.
[2025-06-01 10:39:35] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:35] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2025-06-01 10:39:35] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:35] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:39:35] [INFO ] [Nat]Absence check using state equation in 265 ms returned sat
[2025-06-01 10:39:35] [INFO ] [Nat]Added 100 Read/Feed constraints in 121 ms returned sat
[2025-06-01 10:39:36] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-01 10:39:37] [INFO ] Added : 192 causal constraints over 39 iterations in 1690 ms. Result :sat
Minimization took 152 ms.
[2025-06-01 10:39:37] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:38] [INFO ] [Real]Absence check using state equation in 156 ms returned sat
[2025-06-01 10:39:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:38] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:38] [INFO ] [Nat]Absence check using state equation in 204 ms returned sat
[2025-06-01 10:39:38] [INFO ] [Nat]Added 100 Read/Feed constraints in 96 ms returned sat
[2025-06-01 10:39:38] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 38 ms.
[2025-06-01 10:39:40] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
[2025-06-01 10:39:40] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 10:39:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 10:39:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 10:39:40] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2025-06-01 10:39:40] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 390 ms
[2025-06-01 10:39:40] [INFO ] Added : 212 causal constraints over 44 iterations in 2287 ms. Result :sat
Minimization took 503 ms.
[2025-06-01 10:39:41] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:41] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-06-01 10:39:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:41] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:41] [INFO ] [Nat]Absence check using state equation in 226 ms returned sat
[2025-06-01 10:39:42] [INFO ] [Nat]Added 100 Read/Feed constraints in 131 ms returned sat
[2025-06-01 10:39:42] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 37 ms.
[2025-06-01 10:39:44] [INFO ] Added : 212 causal constraints over 45 iterations in 1925 ms. Result :sat
Minimization took 434 ms.
[2025-06-01 10:39:44] [INFO ] [Real]Absence check using 100 positive place invariants in 18 ms returned sat
[2025-06-01 10:39:44] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2025-06-01 10:39:44] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:44] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:39:45] [INFO ] [Nat]Absence check using state equation in 185 ms returned sat
[2025-06-01 10:39:45] [INFO ] [Nat]Added 100 Read/Feed constraints in 201 ms returned sat
[2025-06-01 10:39:45] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 41 ms.
[2025-06-01 10:39:47] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 10:39:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 105 ms
[2025-06-01 10:39:47] [INFO ] Added : 261 causal constraints over 54 iterations in 2532 ms. Result :sat
Minimization took 186 ms.
[2025-06-01 10:39:48] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:39:48] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2025-06-01 10:39:48] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:48] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:48] [INFO ] [Nat]Absence check using state equation in 193 ms returned sat
[2025-06-01 10:39:48] [INFO ] [Nat]Added 100 Read/Feed constraints in 127 ms returned sat
[2025-06-01 10:39:48] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 36 ms.
[2025-06-01 10:39:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:39:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2025-06-01 10:39:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:39:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 10:39:50] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 302 ms
[2025-06-01 10:39:50] [INFO ] Added : 204 causal constraints over 43 iterations in 2144 ms. Result :sat
Minimization took 156 ms.
[2025-06-01 10:39:51] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2025-06-01 10:39:51] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-06-01 10:39:51] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:51] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:51] [INFO ] [Nat]Absence check using state equation in 163 ms returned sat
[2025-06-01 10:39:51] [INFO ] [Nat]Added 100 Read/Feed constraints in 180 ms returned sat
[2025-06-01 10:39:51] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 45 ms.
[2025-06-01 10:39:54] [INFO ] Added : 264 causal constraints over 54 iterations in 2365 ms. Result :sat
Minimization took 494 ms.
[2025-06-01 10:39:54] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:39:54] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-06-01 10:39:54] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:54] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:55] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-06-01 10:39:55] [INFO ] [Nat]Added 100 Read/Feed constraints in 182 ms returned sat
[2025-06-01 10:39:55] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 37 ms.
[2025-06-01 10:39:57] [INFO ] Added : 261 causal constraints over 53 iterations in 2269 ms. Result :sat
Minimization took 196 ms.
[2025-06-01 10:39:57] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Real]Absence check using state equation in 163 ms returned sat
[2025-06-01 10:39:58] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Absence check using state equation in 176 ms returned sat
[2025-06-01 10:39:58] [INFO ] [Nat]Added 100 Read/Feed constraints in 147 ms returned sat
[2025-06-01 10:39:58] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 36 ms.
[2025-06-01 10:40:00] [INFO ] Added : 232 causal constraints over 49 iterations in 2100 ms. Result :sat
Minimization took 175 ms.
[2025-06-01 10:40:00] [INFO ] [Real]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:40:01] [INFO ] [Real]Absence check using state equation in 162 ms returned sat
[2025-06-01 10:40:01] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:01] [INFO ] [Nat]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:40:01] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2025-06-01 10:40:01] [INFO ] [Nat]Added 100 Read/Feed constraints in 174 ms returned sat
[2025-06-01 10:40:01] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 37 ms.
[2025-06-01 10:40:04] [INFO ] Added : 282 causal constraints over 58 iterations in 2498 ms. Result :sat
Minimization took 493 ms.
[2025-06-01 10:40:04] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2025-06-01 10:40:04] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-06-01 10:40:04] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:04] [INFO ] [Nat]Absence check using 100 positive place invariants in 15 ms returned sat
[2025-06-01 10:40:05] [INFO ] [Nat]Absence check using state equation in 279 ms returned sat
[2025-06-01 10:40:05] [INFO ] [Nat]Added 100 Read/Feed constraints in 77 ms returned sat
[2025-06-01 10:40:05] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-01 10:40:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 10:40:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2025-06-01 10:40:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2025-06-01 10:40:06] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 201 ms
[2025-06-01 10:40:06] [INFO ] Added : 132 causal constraints over 28 iterations in 1385 ms. Result :sat
Minimization took 305 ms.
[2025-06-01 10:40:07] [INFO ] [Real]Absence check using 100 positive place invariants in 14 ms returned sat
[2025-06-01 10:40:07] [INFO ] [Real]Absence check using state equation in 160 ms returned sat
[2025-06-01 10:40:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:07] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2025-06-01 10:40:07] [INFO ] [Nat]Absence check using state equation in 231 ms returned sat
[2025-06-01 10:40:07] [INFO ] [Nat]Added 100 Read/Feed constraints in 111 ms returned sat
[2025-06-01 10:40:07] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 39 ms.
[2025-06-01 10:40:09] [INFO ] Added : 184 causal constraints over 38 iterations in 1565 ms. Result :sat
Minimization took 149 ms.
[2025-06-01 10:40:09] [INFO ] [Real]Absence check using 100 positive place invariants in 16 ms returned sat
[2025-06-01 10:40:09] [INFO ] [Real]Absence check using state equation in 159 ms returned sat
[2025-06-01 10:40:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:40:09] [INFO ] [Nat]Absence check using 100 positive place invariants in 17 ms returned sat
[2025-06-01 10:40:10] [INFO ] [Nat]Absence check using state equation in 244 ms returned sat
[2025-06-01 10:40:10] [INFO ] [Nat]Added 100 Read/Feed constraints in 85 ms returned sat
[2025-06-01 10:40:10] [INFO ] Computed and/alt/rep : 600/1500/600 causal constraints (skipped 0 transitions) in 33 ms.
[2025-06-01 10:40:11] [INFO ] Added : 176 causal constraints over 36 iterations in 1514 ms. Result :sat
Minimization took 418 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[27, 2, 100, 100, 100, 26, 60, 100, 101, 26, 18, 100, 17, 50, 18, 2] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
FORMULA JoinFreeModules-PT-0100-UpperBounds-09 103 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[102, 102, 100, 100, 100, 26, 101, 100, 101, 101, 100, 99, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Support contains 15 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 801/801 transitions.
Graph (complete) has 1200 edges and 500 vertex of which 70 are kept as prefixes of interest. Removing 430 places using SCC suffix rule.2 ms
Discarding 430 places :
Also discarding 688 output transitions
Drop transitions (Output transitions of discarded places.) removed 688 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 70 transition count 112
Applied a total of 2 rules in 28 ms. Remains 70 /500 variables (removed 430) and now considering 112/801 (removed 689) transitions.
Running 84 sub problems to find dead transitions.
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:42:42] [INFO ] Computed 14 invariants in 1 ms
[2025-06-01 10:42:42] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 98 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1598 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 84/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 182 constraints, problems are : Problem set: 0 solved, 84 unsolved in 2205 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
After SMT, in 3898ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 3926ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3968 ms. Remains : 70/500 places, 112/801 transitions.
[2025-06-01 10:42:46] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[102, 102, 100, 100, 100, 26, 101, 100, 101, 101, 100, 99, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 1000028 steps (2 resets) in 1172 ms. (852 steps per ms)
BEST_FIRST walk for 15000015 steps (30 resets) in 18857 ms. (795 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102, 102, 100, 100, 100, 102, 101, 100, 101, 101, 100, 99, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2025-06-01 10:43:06] [INFO ] Invariant cache hit.
[2025-06-01 10:43:06] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:06] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:06] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2025-06-01 10:43:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:43:06] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:06] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:07] [INFO ] Added : 45 causal constraints over 11 iterations in 124 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:43:07] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:43:07] [INFO ] Added : 50 causal constraints over 11 iterations in 76 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 44 ms returned sat
[2025-06-01 10:43:07] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:07] [INFO ] Added : 37 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 24 ms returned sat
[2025-06-01 10:43:07] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:07] [INFO ] Added : 31 causal constraints over 8 iterations in 60 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2025-06-01 10:43:07] [INFO ] [Nat]Added 14 Read/Feed constraints in 26 ms returned sat
[2025-06-01 10:43:08] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:08] [INFO ] Added : 37 causal constraints over 9 iterations in 91 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:43:08] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Nat]Added 14 Read/Feed constraints in 65 ms returned sat
[2025-06-01 10:43:08] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:43:08] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-06-01 10:43:08] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2025-06-01 10:43:08] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2025-06-01 10:43:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 10:43:08] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 116 ms
[2025-06-01 10:43:08] [INFO ] Added : 44 causal constraints over 11 iterations in 206 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:43:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:43:08] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:08] [INFO ] Added : 35 causal constraints over 7 iterations in 57 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:43:08] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:43:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:08] [INFO ] [Nat]Added 14 Read/Feed constraints in 47 ms returned sat
[2025-06-01 10:43:08] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:08] [INFO ] Added : 32 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Added 14 Read/Feed constraints in 65 ms returned sat
[2025-06-01 10:43:09] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:09] [INFO ] Added : 31 causal constraints over 8 iterations in 63 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:09] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:09] [INFO ] Added : 35 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Added 14 Read/Feed constraints in 67 ms returned sat
[2025-06-01 10:43:09] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:09] [INFO ] Added : 33 causal constraints over 7 iterations in 61 ms. Result :sat
Minimization took 33 ms.
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2025-06-01 10:43:09] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:09] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:43:09] [INFO ] Added : 40 causal constraints over 9 iterations in 69 ms. Result :sat
Minimization took 50 ms.
[2025-06-01 10:43:10] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 4 ms returned sat
[2025-06-01 10:43:10] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:10] [INFO ] Added : 35 causal constraints over 8 iterations in 66 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:43:10] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:10] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:10] [INFO ] Added : 57 causal constraints over 13 iterations in 161 ms. Result :sat
Minimization took 31 ms.
[2025-06-01 10:43:10] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:10] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:10] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:10] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:10] [INFO ] Added : 48 causal constraints over 12 iterations in 108 ms. Result :sat
Minimization took 21 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[102, 102, 100, 100, 100, 102, 101, 100, 101, 101, 100, 99, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[102, 102, 100, 100, 100, 102, 102, 100, 101, 101, 100, 101, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Support contains 15 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/70 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2025-06-01 10:43:14] [INFO ] Invariant cache hit.
[2025-06-01 10:43:14] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-01 10:43:14] [INFO ] Invariant cache hit.
[2025-06-01 10:43:14] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:43:14] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
[2025-06-01 10:43:14] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-01 10:43:14] [INFO ] Invariant cache hit.
[2025-06-01 10:43:14] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 98 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1343 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 84/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-01 10:43:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 183 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3193 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints]
After SMT, in 4551ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 4552ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4637 ms. Remains : 70/70 places, 112/112 transitions.
[2025-06-01 10:43:19] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[102, 102, 100, 100, 100, 102, 102, 100, 101, 101, 100, 101, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
RANDOM walk for 1000025 steps (2 resets) in 1180 ms. (846 steps per ms)
BEST_FIRST walk for 15000015 steps (30 resets) in 17309 ms. (866 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102, 102, 100, 100, 100, 102, 102, 100, 101, 101, 100, 101, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
[2025-06-01 10:43:37] [INFO ] Invariant cache hit.
[2025-06-01 10:43:37] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:37] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:37] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2025-06-01 10:43:37] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:43:37] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:37] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:37] [INFO ] Added : 45 causal constraints over 11 iterations in 125 ms. Result :sat
Minimization took 22 ms.
[2025-06-01 10:43:37] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:37] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:37] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:43:38] [INFO ] Added : 50 causal constraints over 11 iterations in 75 ms. Result :sat
Minimization took 21 ms.
[2025-06-01 10:43:38] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 44 ms returned sat
[2025-06-01 10:43:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:43:38] [INFO ] Added : 37 causal constraints over 8 iterations in 76 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:43:38] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:43:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:38] [INFO ] Added : 31 causal constraints over 8 iterations in 61 ms. Result :sat
Minimization took 24 ms.
[2025-06-01 10:43:38] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:43:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Absence check using state equation in 53 ms returned sat
[2025-06-01 10:43:38] [INFO ] [Nat]Added 14 Read/Feed constraints in 25 ms returned sat
[2025-06-01 10:43:38] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:38] [INFO ] Added : 37 causal constraints over 9 iterations in 92 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 65 ms returned sat
[2025-06-01 10:43:39] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-01 10:43:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2025-06-01 10:43:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2025-06-01 10:43:39] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 10:43:39] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
[2025-06-01 10:43:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 121 ms
[2025-06-01 10:43:39] [INFO ] Added : 44 causal constraints over 11 iterations in 207 ms. Result :sat
Minimization took 25 ms.
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:43:39] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:39] [INFO ] Added : 67 causal constraints over 14 iterations in 144 ms. Result :sat
Minimization took 30 ms.
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:39] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Nat]Added 14 Read/Feed constraints in 46 ms returned sat
[2025-06-01 10:43:39] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:39] [INFO ] Added : 32 causal constraints over 8 iterations in 92 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:39] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-01 10:43:39] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:43:40] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-01 10:43:40] [INFO ] Added : 31 causal constraints over 8 iterations in 59 ms. Result :sat
Minimization took 23 ms.
[2025-06-01 10:43:40] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:43:40] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:43:40] [INFO ] Added : 35 causal constraints over 8 iterations in 83 ms. Result :sat
Minimization took 19 ms.
[2025-06-01 10:43:40] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 66 ms returned sat
[2025-06-01 10:43:40] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:40] [INFO ] Added : 33 causal constraints over 7 iterations in 59 ms. Result :sat
Minimization took 32 ms.
[2025-06-01 10:43:40] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-01 10:43:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:40] [INFO ] [Nat]Added 14 Read/Feed constraints in 65 ms returned sat
[2025-06-01 10:43:40] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:40] [INFO ] Added : 37 causal constraints over 8 iterations in 72 ms. Result :sat
Minimization took 27 ms.
[2025-06-01 10:43:41] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2025-06-01 10:43:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:43:41] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:43:41] [INFO ] Added : 35 causal constraints over 8 iterations in 66 ms. Result :sat
Minimization took 26 ms.
[2025-06-01 10:43:41] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:43:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:43:41] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-01 10:43:41] [INFO ] Added : 57 causal constraints over 13 iterations in 163 ms. Result :sat
Minimization took 35 ms.
[2025-06-01 10:43:41] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2025-06-01 10:43:41] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:43:41] [INFO ] [Nat]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2025-06-01 10:43:41] [INFO ] [Nat]Added 14 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:43:41] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-01 10:43:41] [INFO ] Added : 48 causal constraints over 12 iterations in 126 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[102, 102, 100, 100, 100, 102, 102, 100, 101, 101, 100, 101, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[102, 102, 100, 100, 100, 102, 102, 100, 101, 101, 100, 101, 101, 101, 102] Max Struct:[103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103, 103]
Support contains 15 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 112/112 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 70/70 places, 112/112 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 112/112 (removed 0) transitions.
[2025-06-01 10:43:45] [INFO ] Invariant cache hit.
[2025-06-01 10:43:45] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-01 10:43:45] [INFO ] Invariant cache hit.
[2025-06-01 10:43:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:43:45] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
[2025-06-01 10:43:45] [INFO ] Redundant transitions in 2 ms returned []
Running 84 sub problems to find dead transitions.
[2025-06-01 10:43:45] [INFO ] Invariant cache hit.
[2025-06-01 10:43:45] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 0/182 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 98 constraints, problems are : Problem set: 0 solved, 84 unsolved in 1359 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 1 (OVERLAPS) 14/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 3 (OVERLAPS) 112/182 variables, 70/84 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 14/98 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 84/182 constraints. Problems are: Problem set: 0 solved, 84 unsolved
[2025-06-01 10:43:47] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 1/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
At refinement iteration 8 (OVERLAPS) 0/182 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 182/182 variables, and 183 constraints, problems are : Problem set: 0 solved, 84 unsolved in 3209 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 84/84 constraints, Known Traps: 1/1 constraints]
After SMT, in 4579ms problems are : Problem set: 0 solved, 84 unsolved
Search for dead transitions found 0 dead transitions in 4582ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4667 ms. Remains : 70/70 places, 112/112 transitions.
RANDOM walk for 40069 steps (8 resets) in 337 ms. (118 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 30/30 properties
[2025-06-01 10:43:50] [INFO ] Flatten gal took : 59 ms
[2025-06-01 10:43:50] [INFO ] Flatten gal took : 9 ms
[2025-06-01 10:43:50] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1290374780143547685.gal : 26 ms
[2025-06-01 10:43:50] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6250223707827767615.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1290374780143547685.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6250223707827767615.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6250223707827767615.prop.
SDD proceeding with computation,30 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,30 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,30 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,30 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,30 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,30 properties remain. new max is 128
SDD size :851 after 2815
SDD proceeding with computation,30 properties remain. new max is 256
SDD size :2815 after 5105
SDD proceeding with computation,30 properties remain. new max is 512
SDD size :5105 after 608293
SDD proceeding with computation,30 properties remain. new max is 1024
SDD size :608293 after 1.71184e+06
Invariant property MIN12 does not hold.
SDD proceeding with computation,29 properties remain. new max is 1024
SDD size :1.71184e+06 after 3.13478e+12
SDD proceeding with computation,29 properties remain. new max is 2048
SDD size :3.13478e+12 after 1.15142e+13
Interrupted probabilistic random walk after 128558 steps, run timeout after 3001 ms. (steps per millisecond=42 ) properties seen :0 out of 30
Probabilistic random walk after 128558 steps, saw 119095 distinct states, run finished after 3004 ms. (steps per millisecond=42 ) properties seen :0
[2025-06-01 10:43:53] [INFO ] Invariant cache hit.
[2025-06-01 10:43:53] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 55/70 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem MAX0 is UNSAT
Problem MIN0 is UNSAT
Problem MAX1 is UNSAT
Problem MIN1 is UNSAT
Problem MAX2 is UNSAT
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 12 ms of which 0 ms to minimize.
Problem MAX3 is UNSAT
Problem MAX4 is UNSAT
Problem MAX6 is UNSAT
Problem MIN6 is UNSAT
[2025-06-01 10:43:53] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem MAX7 is UNSAT
Problem MAX8 is UNSAT
Problem MAX9 is UNSAT
Problem MAX10 is UNSAT
Problem MAX11 is UNSAT
Problem MAX12 is UNSAT
Problem MAX13 is UNSAT
Problem MAX14 is UNSAT
Problem MIN14 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 14/28 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/70 variables, 0/28 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 112/182 variables, 70/98 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 14/112 constraints. Problems are: Problem set: 18 solved, 11 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 0/112 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/182 variables, 0/112 constraints. Problems are: Problem set: 18 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 182/182 variables, and 112 constraints, problems are : Problem set: 18 solved, 11 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 18 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 40/50 variables, 10/10 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 10/20 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 0/20 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 4 (OVERLAPS) 80/130 variables, 50/70 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/130 variables, 10/80 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 11/91 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/91 constraints. Problems are: Problem set: 18 solved, 11 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/91 constraints. Problems are: Problem set: 18 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/182 variables, and 91 constraints, problems are : Problem set: 18 solved, 11 unsolved in 490 ms.
Refiners :[Positive P Invariants (semi-flows): 10/14 constraints, State Equation: 50/70 constraints, ReadFeed: 10/14 constraints, PredecessorRefiner: 11/29 constraints, Known Traps: 10/14 constraints]
After SMT, in 1101ms problems are : Problem set: 18 solved, 11 unsolved
Fused 11 Parikh solutions to 1 different solutions.
SDD proceeding with computation,29 properties remain. new max is 4096
SDD size :1.15142e+13 after 8.31893e+25
Parikh walk visited 3 properties in 3030 ms.
Support contains 8 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 40 are kept as prefixes of interest. Removing 30 places using SCC suffix rule.0 ms
Discarding 30 places :
Also discarding 48 output transitions
Drop transitions (Output transitions of discarded places.) removed 48 transitions
Applied a total of 1 rules in 2 ms. Remains 40 /70 variables (removed 30) and now considering 64/112 (removed 48) transitions.
Running 48 sub problems to find dead transitions.
// Phase 1: matrix 64 rows 40 cols
[2025-06-01 10:43:57] [INFO ] Computed 8 invariants in 0 ms
[2025-06-01 10:43:57] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 765 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1268ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1269ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1272 ms. Remains : 40/70 places, 64/112 transitions.
Invariant property MIN5 does not hold.
Reachability property MAX5 is true.
SDD proceeding with computation,27 properties remain. new max is 4096
SDD size :8.31893e+25 after 8.14268e+39
RANDOM walk for 40076 steps (8 resets) in 69 ms. (572 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 70 ms. (563 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
Interrupted probabilistic random walk after 200252 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :0 out of 8
Probabilistic random walk after 200252 steps, saw 174534 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
[2025-06-01 10:44:02] [INFO ] Invariant cache hit.
[2025-06-01 10:44:02] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 8 unsolved in 101 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 32/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-01 10:44:02] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 64/104 variables, 40/49 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 8/57 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 8/65 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-06-01 10:44:02] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/104 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 0/104 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 66 constraints, problems are : Problem set: 0 solved, 8 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 2/2 constraints]
After SMT, in 509ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Invariant property MIN11 does not hold.
SDD proceeding with computation,26 properties remain. new max is 4096
SDD size :8.14268e+39 after 6.38911e+59
Parikh walk visited 0 properties in 1352 ms.
Support contains 8 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 40/40 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-01 10:44:04] [INFO ] Invariant cache hit.
[2025-06-01 10:44:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-01 10:44:04] [INFO ] Invariant cache hit.
[2025-06-01 10:44:04] [INFO ] State equation strengthened by 8 read => feed constraints.
[2025-06-01 10:44:04] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2025-06-01 10:44:04] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-01 10:44:04] [INFO ] Invariant cache hit.
[2025-06-01 10:44:04] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (OVERLAPS) 0/104 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 56 constraints, problems are : Problem set: 0 solved, 48 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 48 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 1 (OVERLAPS) 8/40 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 3 (OVERLAPS) 64/104 variables, 40/48 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 8/56 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 48/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
At refinement iteration 7 (OVERLAPS) 0/104 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 48 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 104 constraints, problems are : Problem set: 0 solved, 48 unsolved in 689 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 40/40 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 0/0 constraints]
After SMT, in 1208ms problems are : Problem set: 0 solved, 48 unsolved
Search for dead transitions found 0 dead transitions in 1209ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1268 ms. Remains : 40/40 places, 64/64 transitions.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-01 10:44:05] [INFO ] Flatten gal took : 12 ms
[2025-06-01 10:44:05] [INFO ] Applying decomposition
[2025-06-01 10:44:05] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/convert-linux64' '-i' '/tmp/graph13641287415231786269.txt' '-o' '/tmp/graph13641287415231786269.bin' '-w' '/tmp/graph13641287415231786269.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202405141337/bin/louvain-linux64' '/tmp/graph13641287415231786269.bin' '-l' '-1' '-v' '-w' '/tmp/graph13641287415231786269.weights' '-q' '0' '-e' '0.001'
[2025-06-01 10:44:05] [INFO ] Decomposing Gal with order
[2025-06-01 10:44:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 10:44:05] [INFO ] Flatten gal took : 6 ms
[2025-06-01 10:44:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-01 10:44:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10350418044431036423.gal : 2 ms
[2025-06-01 10:44:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality11242302766298337039.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10350418044431036423.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality11242302766298337039.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality11242302766298337039.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 8
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :8 after 25
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :25 after 76
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :76 after 246
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :246 after 851
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :851 after 2815
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :2815 after 5105
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :5105 after 608293
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :608293 after 1.71184e+06
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :1.71184e+06 after 2.32887e+29
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,9.43672e+93,1.13166,27840,16,719,192,92583,70,0,70,107427,0
Total reachable state count : 9.436723776218776176841078104264069164562e+93

Verifying 8 reachability properties.
Invariant property MIN2 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
MIN2,0,1.13334,27840,1,0,192,92583,72,0,72,107427,0
Invariant property MIN3 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
MIN3,0,1.13362,28100,1,0,192,92583,73,0,72,107427,0
Invariant property MIN4 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
MIN4,0,1.13372,28100,1,0,192,92583,74,0,72,107427,0
Invariant property MIN7 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
MIN7,0,1.13383,28100,1,0,192,92583,75,0,72,107427,0
Invariant property MIN8 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
MIN8,0,1.13518,28100,1,0,192,92583,77,0,73,107427,0
Invariant property MIN9 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
MIN9,0,1.1353,28100,1,0,192,92583,78,0,73,107427,0
Invariant property MIN10 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
MIN10,0,1.1354,28100,1,0,192,92583,79,0,73,107427,0
Invariant property MIN13 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
MIN13,0,1.13549,28100,1,0,192,92583,80,0,73,107427,0
FORMULA JoinFreeModules-PT-0100-UpperBounds-15 102 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-14 101 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-11 100 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-10 101 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-08 101 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-07 100 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-06 102 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-05 103 TECHNIQUES REACHABILITY_MAX
FORMULA JoinFreeModules-PT-0100-UpperBounds-04 100 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-03 100 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-02 100 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-01 102 TECHNIQUES REACHABILITY_MIN
FORMULA JoinFreeModules-PT-0100-UpperBounds-00 102 TECHNIQUES REACHABILITY_MIN
Current structural bounds on expressions (After reachability solving 13 queries.) : Max Seen:[101, 101] Max Struct:[103, 103]
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-12
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[103]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:44:06] [INFO ] Computed 14 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[103]
RANDOM walk for 10016 steps (2 resets) in 17 ms. (556 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[67] Max Struct:[103]
[2025-06-01 10:44:06] [INFO ] Invariant cache hit.
[2025-06-01 10:44:06] [INFO ] [Real]Absence check using 14 positive place invariants in 3 ms returned sat
[2025-06-01 10:44:06] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-01 10:44:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:06] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:06] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2025-06-01 10:44:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:44:06] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:44:06] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-01 10:44:06] [INFO ] Added : 40 causal constraints over 8 iterations in 121 ms. Result :sat
Minimization took 61 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[67] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.0 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:44:07] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 56 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 100ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 100ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:44:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[101] Max Struct:[103]
RANDOM walk for 1000003 steps (2 resets) in 154 ms. (6451 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 147 ms. (6756 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[101] Max Struct:[103]
[2025-06-01 10:44:07] [INFO ] Invariant cache hit.
[2025-06-01 10:44:07] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:44:07] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:44:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:07] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:44:07] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:44:07] [INFO ] [Nat]Added 1 Read/Feed constraints in 0 ms returned sat
[2025-06-01 10:44:07] [INFO ] Computed and/alt/rep : 6/15/6 causal constraints (skipped 0 transitions) in 0 ms.
[2025-06-01 10:44:07] [INFO ] Deduced a trap composed of 3 places in 13 ms of which 0 ms to minimize.
[2025-06-01 10:44:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 15 ms
[2025-06-01 10:44:07] [INFO ] Added : 5 causal constraints over 2 iterations in 20 ms. Result :sat
Minimization took 3 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[101] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[102] Max Struct:[103]
Support contains 1 out of 5 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1 ms. Remains : 5/5 places, 8/8 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-01 10:44:07] [INFO ] Invariant cache hit.
[2025-06-01 10:44:07] [INFO ] Implicit Places using invariants in 19 ms returned []
[2025-06-01 10:44:07] [INFO ] Invariant cache hit.
[2025-06-01 10:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:44:07] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2025-06-01 10:44:07] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-01 10:44:07] [INFO ] Invariant cache hit.
[2025-06-01 10:44:07] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 42 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 86ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 86ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 5/5 places, 8/8 transitions.
[2025-06-01 10:44:07] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[102] Max Struct:[103]
RANDOM walk for 1000000 steps (2 resets) in 168 ms. (5917 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 145 ms. (6849 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102] Max Struct:[103]
[2025-06-01 10:44:08] [INFO ] Invariant cache hit.
[2025-06-01 10:44:08] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:44:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:44:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:44:08] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:44:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:44:08] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2025-06-01 10:44:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 22 ms
Current structural bounds on expressions (after SMT) : Max Seen:[102] Max Struct:[102]
FORMULA JoinFreeModules-PT-0100-UpperBounds-12 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-01 10:44:08] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:44:08] [INFO ] Flatten gal took : 0 ms
[2025-06-01 10:44:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16779140101996902097.gal : 0 ms
[2025-06-01 10:44:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality551278232036151460.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16779140101996902097.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality551278232036151460.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
ITS runner timed out or was interrupted.
Loading property file /tmp/ReachabilityCardinality551278232036151460.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.001984,3516,2,15,5,61,6,0,45,39,0
Total reachable state count : 8

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-12 in 1603 ms.
Starting property specific reduction for JoinFreeModules-PT-0100-UpperBounds-13
Current structural bounds on expressions (Initially) : Max Seen:[0] Max Struct:[+inf]
Current structural bounds on expressions (Adding known information on max bounds.) : Max Seen:[0] Max Struct:[103]
Current structural bounds on expressions (Before main loop) : Max Seen:[0] Max Struct:[103]
// Phase 1: matrix 112 rows 70 cols
[2025-06-01 10:44:08] [INFO ] Computed 14 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[103]
RANDOM walk for 10026 steps (2 resets) in 14 ms. (668 steps per ms)
BEST_FIRST walk for 10001 steps (2 resets) in 11 ms. (833 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[94] Max Struct:[103]
[2025-06-01 10:44:08] [INFO ] Invariant cache hit.
[2025-06-01 10:44:08] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:08] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-01 10:44:08] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:08] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2025-06-01 10:44:08] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2025-06-01 10:44:08] [INFO ] State equation strengthened by 14 read => feed constraints.
[2025-06-01 10:44:08] [INFO ] [Nat]Added 14 Read/Feed constraints in 2 ms returned sat
[2025-06-01 10:44:08] [INFO ] Computed and/alt/rep : 84/210/84 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-01 10:44:08] [INFO ] Added : 43 causal constraints over 9 iterations in 92 ms. Result :sat
Minimization took 40 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[94] Max Struct:[103]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[101] Max Struct:[103]
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 112/112 transitions.
Graph (complete) has 168 edges and 70 vertex of which 5 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.1 ms
Discarding 65 places :
Also discarding 104 output transitions
Drop transitions (Output transitions of discarded places.) removed 104 transitions
Applied a total of 1 rules in 1 ms. Remains 5 /70 variables (removed 65) and now considering 8/112 (removed 104) transitions.
Running 6 sub problems to find dead transitions.
// Phase 1: matrix 8 rows 5 cols
[2025-06-01 10:44:08] [INFO ] Computed 1 invariants in 0 ms
[2025-06-01 10:44:08] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/13 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 44 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/13 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/13 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 97ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 5/70 places, 8/112 transitions.
[2025-06-01 10:44:08] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[101] Max Struct:[103]
RANDOM walk for 1000008 steps (2 resets) in 152 ms. (6536 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 152 ms. (6535 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[102] Max Struct:[103]
[2025-06-01 10:44:09] [INFO ] Invariant cache hit.
[2025-06-01 10:44:09] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2025-06-01 10:44:09] [INFO ] [Real]Absence check using state equation in 2 ms returned sat
[2025-06-01 10:44:09] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 10:44:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2025-06-01 10:44:09] [INFO ] [Nat]Absence check using state equation in 3 ms returned sat
[2025-06-01 10:44:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2025-06-01 10:44:09] [INFO ] [Nat]Added 1 Read/Feed constraints in 1 ms returned sat
[2025-06-01 10:44:09] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2025-06-01 10:44:09] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 23 ms
Current structural bounds on expressions (after SMT) : Max Seen:[102] Max Struct:[102]
FORMULA JoinFreeModules-PT-0100-UpperBounds-13 102 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
[2025-06-01 10:44:09] [INFO ] Flatten gal took : 1 ms
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-01 10:44:09] [INFO ] Flatten gal took : 1 ms
[2025-06-01 10:44:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11899936113394825784.gal : 1 ms
[2025-06-01 10:44:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8325381530623729636.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11899936113394825784.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8325381530623729636.prop' '--nowitness' '--gen-order' 'FOLLOW'

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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality8325381530623729636.prop.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 3 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,8,0.001593,3516,2,15,5,61,6,0,45,39,0
Total reachable state count : 8

ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
Ending property specific reduction for JoinFreeModules-PT-0100-UpperBounds-13 in 1038 ms.
[2025-06-01 10:44:09] [INFO ] Flatten gal took : 5 ms
Total runtime 287873 ms.

BK_STOP 1748774649292

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="JoinFreeModules-PT-0100"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is JoinFreeModules-PT-0100, 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 r125-tall-174876435700056"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;