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.r084-tall-174860080700489.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 EisenbergMcGuire-PT-06, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700489
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 89K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 753K 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 booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748741348765

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:29:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:29:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:29:10] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2025-06-01 01:29:10] [INFO ] Transformed 414 places.
[2025-06-01 01:29:10] [INFO ] Transformed 1296 transitions.
[2025-06-01 01:29:10] [INFO ] Found NUPN structural information;
[2025-06-01 01:29:10] [INFO ] Parsed PT model containing 414 places and 1296 transitions and 5976 arcs in 260 ms.
Built sparse matrix representations for Structural reductions in 10 ms.21141KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 95 ms. Remains 414 /414 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 110 ms. Remains : 414/414 places, 1296/1296 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 49 ms. Remains 414 /414 variables (removed 0) and now considering 1296/1296 (removed 0) transitions.
[2025-06-01 01:29:10] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
// Phase 1: matrix 702 rows 414 cols
[2025-06-01 01:29:10] [INFO ] Computed 19 invariants in 14 ms
[2025-06-01 01:29:11] [INFO ] Implicit Places using invariants in 292 ms returned []
[2025-06-01 01:29:11] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
[2025-06-01 01:29:11] [INFO ] Invariant cache hit.
[2025-06-01 01:29:11] [INFO ] State equation strengthened by 314 read => feed constraints.
[2025-06-01 01:29:11] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 853 ms to find 0 implicit places.
[2025-06-01 01:29:11] [INFO ] Redundant transitions in 71 ms returned []
Running 1290 sub problems to find dead transitions.
[2025-06-01 01:29:11] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
[2025-06-01 01:29:11] [INFO ] Invariant cache hit.
[2025-06-01 01:29:11] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 414/414 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 13/427 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 6/433 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 34 places in 204 ms of which 36 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 41 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 30 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 29 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 29 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:29:22] [INFO ] Deduced a trap composed of 27 places in 113 ms of which 3 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 3 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 38 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 29 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:29:23] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 3 ms to minimize.
[2025-06-01 01:29:24] [INFO ] Deduced a trap composed of 121 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 124 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 113 places in 150 ms of which 3 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 109 places in 155 ms of which 3 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 103 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 103 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:29:26] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 20/453 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2025-06-01 01:29:35] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:29:35] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2025-06-01 01:29:36] [INFO ] Deduced a trap composed of 36 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:29:36] [INFO ] Deduced a trap composed of 32 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:29:36] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:29:36] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 81 places in 164 ms of which 3 ms to minimize.
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 118 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 87 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:29:37] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 2 ms to minimize.
[2025-06-01 01:29:38] [INFO ] Deduced a trap composed of 123 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:29:39] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 3 ms to minimize.
[2025-06-01 01:29:39] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-06-01 01:29:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2025-06-01 01:29:40] [INFO ] Deduced a trap composed of 92 places in 176 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2025-06-01 01:29:41] [INFO ] Deduced a trap composed of 63 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:29:41] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 414/1116 variables, and 475 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30061 ms.
Refiners :[Domain max(s): 414/414 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/414 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 1290/1290 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1290 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/414 variables, 414/414 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/414 variables, 13/427 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/414 variables, 6/433 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/414 variables, 42/475 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2025-06-01 01:29:45] [INFO ] Deduced a trap composed of 65 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:29:45] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:29:45] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:29:46] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:29:46] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:29:46] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 3 ms to minimize.
[2025-06-01 01:29:47] [INFO ] Deduced a trap composed of 84 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:29:47] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:29:47] [INFO ] Deduced a trap composed of 46 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:29:49] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:29:49] [INFO ] Deduced a trap composed of 73 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:29:49] [INFO ] Deduced a trap composed of 88 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:29:49] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:29:49] [INFO ] Deduced a trap composed of 109 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:29:50] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 5 ms to minimize.
[2025-06-01 01:29:50] [INFO ] Deduced a trap composed of 89 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:29:50] [INFO ] Deduced a trap composed of 74 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:29:50] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 3 ms to minimize.
[2025-06-01 01:29:50] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:29:51] [INFO ] Deduced a trap composed of 78 places in 173 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/414 variables, 20/495 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2025-06-01 01:29:52] [INFO ] Deduced a trap composed of 20 places in 162 ms of which 3 ms to minimize.
[2025-06-01 01:29:52] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2025-06-01 01:29:56] [INFO ] Deduced a trap composed of 88 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:29:56] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:29:57] [INFO ] Deduced a trap composed of 94 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:29:57] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:29:57] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:29:57] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 3 ms to minimize.
[2025-06-01 01:29:58] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:29:58] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:29:58] [INFO ] Deduced a trap composed of 106 places in 160 ms of which 3 ms to minimize.
[2025-06-01 01:29:58] [INFO ] Deduced a trap composed of 109 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:29:58] [INFO ] Deduced a trap composed of 110 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:29:59] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:29:59] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 3 ms to minimize.
[2025-06-01 01:29:59] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:30:00] [INFO ] Deduced a trap composed of 112 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:30:00] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:30:00] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 3 ms to minimize.
[2025-06-01 01:30:01] [INFO ] Deduced a trap composed of 129 places in 163 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/414 variables, 20/515 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
[2025-06-01 01:30:04] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:30:04] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 3 ms to minimize.
[2025-06-01 01:30:05] [INFO ] Deduced a trap composed of 71 places in 148 ms of which 3 ms to minimize.
[2025-06-01 01:30:05] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:30:05] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:30:08] [INFO ] Deduced a trap composed of 68 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:30:09] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:30:09] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 3 ms to minimize.
[2025-06-01 01:30:09] [INFO ] Deduced a trap composed of 65 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:30:09] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:30:09] [INFO ] Deduced a trap composed of 91 places in 165 ms of which 3 ms to minimize.
[2025-06-01 01:30:10] [INFO ] Deduced a trap composed of 67 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:30:10] [INFO ] Deduced a trap composed of 55 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:30:10] [INFO ] Deduced a trap composed of 88 places in 177 ms of which 3 ms to minimize.
[2025-06-01 01:30:10] [INFO ] Deduced a trap composed of 50 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:30:11] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:30:11] [INFO ] Deduced a trap composed of 97 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:30:11] [INFO ] Deduced a trap composed of 115 places in 159 ms of which 3 ms to minimize.
[2025-06-01 01:30:11] [INFO ] Deduced a trap composed of 110 places in 169 ms of which 3 ms to minimize.
[2025-06-01 01:30:11] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 20/535 constraints. Problems are: Problem set: 0 solved, 1290 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 414/1116 variables, and 535 constraints, problems are : Problem set: 0 solved, 1290 unsolved in 30027 ms.
Refiners :[Domain max(s): 414/414 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/414 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 0/1290 constraints, Known Traps: 102/102 constraints]
After SMT, in 60878ms problems are : Problem set: 0 solved, 1290 unsolved
Search for dead transitions found 0 dead transitions in 60907ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 61904 ms. Remains : 414/414 places, 1296/1296 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2986 ms (no deadlock found). (steps per millisecond=418 )
Random directed walk for 1250003 steps, including 0 resets, run took 2445 ms (no deadlock found). (steps per millisecond=511 )
[2025-06-01 01:30:18] [INFO ] Flow matrix only has 702 transitions (discarded 594 similar events)
[2025-06-01 01:30:18] [INFO ] Invariant cache hit.
[2025-06-01 01:30:18] [INFO ] [Real]Absence check using 13 positive place invariants in 13 ms returned sat
[2025-06-01 01:30:18] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 29 ms returned sat
[2025-06-01 01:30:18] [INFO ] [Real]Absence check using state equation in 509 ms returned sat
[2025-06-01 01:30:18] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 01:30:19] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2025-06-01 01:30:19] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 20 ms returned sat
[2025-06-01 01:30:19] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2025-06-01 01:30:19] [INFO ] State equation strengthened by 314 read => feed constraints.
[2025-06-01 01:30:19] [INFO ] [Nat]Added 314 Read/Feed constraints in 42 ms returned sat
[2025-06-01 01:30:19] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 3 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 51 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 3 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:30:20] [INFO ] Deduced a trap composed of 20 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 3 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Deduced a trap composed of 3 places in 173 ms of which 3 ms to minimize.
[2025-06-01 01:30:21] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 9 trap constraints in 1994 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 408 transition count 1176
Deduced a syphon composed of 114 places in 3 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 294 transition count 1176
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 2 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 264 transition count 1146
Applied a total of 300 rules in 73 ms. Remains 264 /414 variables (removed 150) and now considering 1146/1296 (removed 150) transitions.
[2025-06-01 01:30:21] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
// Phase 1: matrix 552 rows 264 cols
[2025-06-01 01:30:21] [INFO ] Computed 19 invariants in 4 ms
[2025-06-01 01:30:22] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-01 01:30:22] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2025-06-01 01:30:22] [INFO ] Invariant cache hit.
[2025-06-01 01:30:22] [INFO ] State equation strengthened by 314 read => feed constraints.
[2025-06-01 01:30:23] [INFO ] Implicit Places using invariants and state equation in 997 ms returned []
Implicit Place search using SMT with State Equation took 1308 ms to find 0 implicit places.
Running 1140 sub problems to find dead transitions.
[2025-06-01 01:30:23] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2025-06-01 01:30:23] [INFO ] Invariant cache hit.
[2025-06-01 01:30:23] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 3 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 38 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 67 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 40 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 59 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 59 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 41 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 46 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 73 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:30:32] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:30:40] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:30:40] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:30:40] [INFO ] Deduced a trap composed of 65 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:30:40] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:30:40] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:30:40] [INFO ] Deduced a trap composed of 47 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 24 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 3 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:30:41] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:30:42] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:30:42] [INFO ] Deduced a trap composed of 13 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:30:42] [INFO ] Deduced a trap composed of 17 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:30:42] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:30:43] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:30:43] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:30:45] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:30:45] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:30:45] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:30:45] [INFO ] Deduced a trap composed of 82 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 15 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 66 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 11 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:30:46] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 53 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:30:47] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:30:49] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:30:49] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 4 ms to minimize.
[2025-06-01 01:30:49] [INFO ] Deduced a trap composed of 67 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:30:50] [INFO ] Deduced a trap composed of 41 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:30:50] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:30:50] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:30:52] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:30:52] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 56 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 1 ms to minimize.
SMT process timed out in 30570ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 30588ms
Starting structural reductions in LIVENESS mode, iteration 1 : 264/414 places, 1146/1296 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 31980 ms. Remains : 264/414 places, 1146/1296 transitions.
Initial state reduction rules removed 6 formulas.
RANDOM walk for 40000 steps (8 resets) in 4074 ms. (9 steps per ms) remains 860/1140 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 9 ms. (12 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 8 ms. (13 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 10 ms. (10 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 12 ms. (9 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 6 ms. (17 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 14 ms. (8 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 4 ms. (24 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 5 ms. (20 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 15 ms. (7 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
BEST_FIRST walk for 120 steps (8 resets) in 7 ms. (15 steps per ms) remains 860/860 properties
[2025-06-01 01:30:54] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2025-06-01 01:30:54] [INFO ] Invariant cache hit.
[2025-06-01 01:30:54] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 860 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/816 variables, and 194 constraints, problems are : Problem set: 0 solved, 860 unsolved in 5022 ms.
Refiners :[Domain max(s): 193/264 constraints, Positive P Invariants (semi-flows): 1/13 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/264 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 860/860 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 860 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 3 (OVERLAPS) 71/264 variables, 12/206 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 71/277 constraints. Problems are: Problem set: 0 solved, 860 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 860 unsolved
[2025-06-01 01:31:05] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:31:05] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:31:05] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:31:05] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 1 ms to minimize.
SMT process timed out in 10401ms, After SMT, problems are : Problem set: 0 solved, 860 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 193 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1146/1146 transitions.
Applied a total of 0 rules in 32 ms. Remains 264 /264 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 264/264 places, 1146/1146 transitions.
RANDOM walk for 2767199 steps (8 resets) in 120004 ms. (23 steps per ms) remains 835/860 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 835/835 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 835/835 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 835/835 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 835/835 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 835/835 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 832/835 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 831/832 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 831/831 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 829/831 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 829/829 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 829/829 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 829/829 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 829/829 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 828/829 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 827/828 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 822/827 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 822/822 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 822/822 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 821/822 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 820/821 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 820/820 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 820/820 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 820/820 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 820/820 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 820/820 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 819/820 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 819/819 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 818/819 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 818/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 818/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 818/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 818/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 818/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 818/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 818/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 817/818 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 817/817 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 813/817 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 813/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 811/813 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 811/811 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 809/811 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 809/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 808/809 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 808/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 807/808 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 807/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 806/807 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 806/806 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 806/806 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 803/806 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 803/803 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 803/803 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 803/803 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 803/803 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 803/803 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 803/803 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 802/803 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 802/802 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 802/802 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 802/802 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/802 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 798/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 795/798 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 794/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 794/794 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 793/794 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 793/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 790/793 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 790/790 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 790/790 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 790/790 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 790/790 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 790/790 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 790/790 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 789/790 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 789/789 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 789/789 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 789/789 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 789/789 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 789/789 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 785/789 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 785/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 782/785 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 782/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/782 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 781/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 781/781 properties
[2025-06-01 01:31:37] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2025-06-01 01:31:37] [INFO ] Invariant cache hit.
[2025-06-01 01:31:37] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/181 variables, 181/181 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/181 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/181 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 3 (OVERLAPS) 83/264 variables, 12/194 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 83/277 constraints. Problems are: Problem set: 0 solved, 781 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2025-06-01 01:31:47] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:31:47] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:31:47] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:31:48] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:31:48] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:31:48] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:31:48] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:31:48] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 64 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 85 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 87 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:31:49] [INFO ] Deduced a trap composed of 77 places in 146 ms of which 1 ms to minimize.
[2025-06-01 01:31:50] [INFO ] Deduced a trap composed of 63 places in 144 ms of which 1 ms to minimize.
[2025-06-01 01:31:50] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:31:50] [INFO ] Deduced a trap composed of 51 places in 148 ms of which 1 ms to minimize.
[2025-06-01 01:31:50] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:31:50] [INFO ] Deduced a trap composed of 52 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:31:50] [INFO ] Deduced a trap composed of 39 places in 145 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 69 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:31:55] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 84 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 83 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 72 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 78 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:31:56] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:31:57] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:31:57] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:31:57] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:31:57] [INFO ] Deduced a trap composed of 50 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:31:57] [INFO ] Deduced a trap composed of 82 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:31:57] [INFO ] Deduced a trap composed of 70 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:31:57] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:31:58] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:31:58] [INFO ] Deduced a trap composed of 24 places in 122 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2025-06-01 01:31:59] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:31:59] [INFO ] Deduced a trap composed of 62 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:31:59] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:32:00] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:32:00] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:32:00] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:32:00] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:32:00] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:32:00] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:32:00] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:32:01] [INFO ] Deduced a trap composed of 58 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:32:02] [INFO ] Deduced a trap composed of 16 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:32:02] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 1 ms to minimize.
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 55 places in 145 ms of which 1 ms to minimize.
[2025-06-01 01:32:03] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 90 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 66 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 19 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:32:04] [INFO ] Deduced a trap composed of 68 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 50 places in 130 ms of which 4 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:32:05] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:32:06] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:32:06] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:32:06] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2025-06-01 01:32:11] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:32:11] [INFO ] Deduced a trap composed of 57 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:32:11] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 40 places in 139 ms of which 1 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:32:12] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:32:13] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:32:13] [INFO ] Deduced a trap composed of 41 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:32:13] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:32:13] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2025-06-01 01:32:13] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:32:13] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:32:13] [INFO ] Deduced a trap composed of 37 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:32:14] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:32:14] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:32:14] [INFO ] Deduced a trap composed of 11 places in 123 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2025-06-01 01:32:16] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2025-06-01 01:32:16] [INFO ] Deduced a trap composed of 61 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:32:16] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:32:16] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:32:16] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:32:16] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:32:16] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:32:17] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:32:17] [INFO ] Deduced a trap composed of 28 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:32:17] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:32:17] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:32:17] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:32:17] [INFO ] Deduced a trap composed of 72 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:32:18] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:32:18] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:32:18] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:32:18] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:32:18] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:32:18] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:32:18] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 781 unsolved
[2025-06-01 01:32:20] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:32:21] [INFO ] Deduced a trap composed of 77 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:32:21] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:32:21] [INFO ] Deduced a trap composed of 57 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:32:21] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:32:21] [INFO ] Deduced a trap composed of 74 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:32:21] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:32:21] [INFO ] Deduced a trap composed of 48 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 47 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 39 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 74 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:32:22] [INFO ] Deduced a trap composed of 73 places in 134 ms of which 2 ms to minimize.
SMT process timed out in 45405ms, After SMT, problems are : Problem set: 0 solved, 781 unsolved
Fused 781 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 181 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1146/1146 transitions.
Applied a total of 0 rules in 31 ms. Remains 264 /264 variables (removed 0) and now considering 1146/1146 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 264/264 places, 1146/1146 transitions.
RANDOM walk for 2872592 steps (8 resets) in 120004 ms. (23 steps per ms) remains 774/781 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 774/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 773/774 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 773/773 properties
Probabilistic random walk after 1000001 steps, saw 402967 distinct states, run finished after 24199 ms. (steps per millisecond=41 ) properties seen :198
[2025-06-01 01:33:17] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2025-06-01 01:33:17] [INFO ] Invariant cache hit.
[2025-06-01 01:33:17] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 143/264 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 143/277 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 66 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 69 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:33:24] [INFO ] Deduced a trap composed of 70 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 60 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 81 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:33:25] [INFO ] Deduced a trap composed of 72 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 51 places in 145 ms of which 1 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:33:26] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:29] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 16 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:33:30] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 66 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:33:31] [INFO ] Deduced a trap composed of 75 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:33:32] [INFO ] Deduced a trap composed of 94 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:33:32] [INFO ] Deduced a trap composed of 23 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:33:32] [INFO ] Deduced a trap composed of 88 places in 134 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:33:32] [INFO ] Deduced a trap composed of 67 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:33:33] [INFO ] Deduced a trap composed of 75 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:33:33] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:33:33] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:33:33] [INFO ] Deduced a trap composed of 68 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:33:33] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:33:33] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 48 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:33:34] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:33:35] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:33:35] [INFO ] Deduced a trap composed of 37 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:33:35] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:33:35] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:33:35] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2025-06-01 01:33:35] [INFO ] Deduced a trap composed of 13 places in 119 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:36] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:33:36] [INFO ] Deduced a trap composed of 76 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:33:36] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:33:37] [INFO ] Deduced a trap composed of 70 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:33:37] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:33:37] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:33:37] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 1 ms to minimize.
[2025-06-01 01:33:37] [INFO ] Deduced a trap composed of 92 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:33:37] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:33:38] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:33:38] [INFO ] Deduced a trap composed of 54 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:33:38] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:33:38] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:33:38] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:33:39] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:33:39] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:33:39] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:33:39] [INFO ] Deduced a trap composed of 37 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:33:39] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:33:39] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 20/363 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:43] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:33:43] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:33:43] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:33:44] [INFO ] Deduced a trap composed of 79 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:33:44] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:33:44] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:33:44] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:33:44] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:33:44] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:33:45] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:33:45] [INFO ] Deduced a trap composed of 85 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:33:45] [INFO ] Deduced a trap composed of 43 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:33:45] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:33:45] [INFO ] Deduced a trap composed of 11 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:33:46] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:33:46] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:33:46] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:33:46] [INFO ] Deduced a trap composed of 75 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:33:46] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:33:47] [INFO ] Deduced a trap composed of 50 places in 150 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 20/383 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:47] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 3 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 59 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 68 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 19 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:33:48] [INFO ] Deduced a trap composed of 72 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 55 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 78 places in 139 ms of which 1 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 20/403 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 69 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 67 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 74 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 59 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 77 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 15 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 3 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 40 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:33:55] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 20/423 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:33:59] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:33:59] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:34:00] [INFO ] Deduced a trap composed of 45 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:34:00] [INFO ] Deduced a trap composed of 46 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:34:00] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 8 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 1 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 76 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:34:01] [INFO ] Deduced a trap composed of 49 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 73 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:34:02] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 69 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:34:03] [INFO ] Deduced a trap composed of 39 places in 126 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/264 variables, 20/443 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 96 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 80 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 89 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 91 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 83 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 83 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 46 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 94 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 71 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 60 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 85 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 79 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 72 places in 135 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/264 variables, 20/463 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 66 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 69 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 66 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 71 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 4 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:34:14] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/264 variables, 20/483 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:34:19] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:34:19] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 62 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:34:20] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:34:22] [INFO ] Deduced a trap composed of 74 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:34:22] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:34:22] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:34:22] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:34:22] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 51 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:34:24] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:34:24] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/264 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:34:26] [INFO ] Deduced a trap composed of 69 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:34:26] [INFO ] Deduced a trap composed of 70 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:34:26] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:34:28] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:34:28] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:34:28] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:34:28] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 76 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 81 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 60 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:34:30] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/264 variables, 20/523 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 264/816 variables, and 523 constraints, problems are : Problem set: 0 solved, 575 unsolved in 75018 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/264 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 575/575 constraints, Known Traps: 240/240 constraints]
Escalating to Integer solving :Problem set: 0 solved, 575 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/121 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 3 (OVERLAPS) 143/264 variables, 12/134 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 143/277 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 575 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/264 variables, 240/523 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:34:36] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 60 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:34:37] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 78 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:34:38] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:34:39] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:34:39] [INFO ] Deduced a trap composed of 61 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:34:39] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:34:39] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 70 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:34:40] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:34:41] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 53 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/264 variables, 20/543 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:34:46] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:34:46] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 76 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 62 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 64 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:34:49] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 53 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 79 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:34:50] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:34:51] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/264 variables, 20/563 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:34:56] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:34:57] [INFO ] Deduced a trap composed of 40 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:34:57] [INFO ] Deduced a trap composed of 39 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:34:58] [INFO ] Deduced a trap composed of 40 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:34:58] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:34:58] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:34:58] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:34:58] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 60 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
[2025-06-01 01:34:59] [INFO ] Deduced a trap composed of 75 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:35:00] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:35:00] [INFO ] Deduced a trap composed of 78 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:35:00] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:35:00] [INFO ] Deduced a trap composed of 40 places in 111 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/264 variables, 20/583 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:35:05] [INFO ] Deduced a trap composed of 71 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:35:09] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:35:09] [INFO ] Deduced a trap composed of 87 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:35:09] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:35:09] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:35:09] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:35:10] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:35:10] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:35:10] [INFO ] Deduced a trap composed of 72 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:35:10] [INFO ] Deduced a trap composed of 66 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:35:11] [INFO ] Deduced a trap composed of 59 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:35:11] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:35:11] [INFO ] Deduced a trap composed of 51 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:35:12] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/264 variables, 15/598 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:35:23] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:35:23] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:35:24] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:35:24] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:35:25] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:35:26] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:35:26] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 49 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:35:28] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:35:28] [INFO ] Deduced a trap composed of 76 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 90 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/264 variables, 20/618 constraints. Problems are: Problem set: 0 solved, 575 unsolved
[2025-06-01 01:35:41] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:35:42] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:35:42] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:35:42] [INFO ] Deduced a trap composed of 48 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:35:42] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:35:42] [INFO ] Deduced a trap composed of 68 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:35:43] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:35:44] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:35:44] [INFO ] Deduced a trap composed of 70 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 67 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 69 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 3 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/264 variables, 20/638 constraints. Problems are: Problem set: 0 solved, 575 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 264/816 variables, and 638 constraints, problems are : Problem set: 0 solved, 575 unsolved in 75022 ms.
Refiners :[Domain max(s): 264/264 constraints, Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/264 constraints, ReadFeed: 0/314 constraints, PredecessorRefiner: 0/575 constraints, Known Traps: 355/355 constraints]
After SMT, in 150292ms problems are : Problem set: 0 solved, 575 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 121 out of 264 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 264/264 places, 1146/1146 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 257 transition count 1104
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 257 transition count 1104
Applied a total of 14 rules in 40 ms. Remains 257 /264 variables (removed 7) and now considering 1104/1146 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 257/264 places, 1104/1146 transitions.
RANDOM walk for 3830672 steps (8 resets) in 120004 ms. (31 steps per ms) remains 574/575 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 574/574 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 574/574 properties
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 19994 ms. (steps per millisecond=50 ) properties seen :12
[2025-06-01 01:36:38] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
// Phase 1: matrix 510 rows 257 cols
[2025-06-01 01:36:38] [INFO ] Computed 19 invariants in 3 ms
[2025-06-01 01:36:38] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 140/257 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 26 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 21 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 0 ms to minimize.
[2025-06-01 01:36:44] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 0 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 68 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:36:45] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 58 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 59 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:36:46] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 48 places in 134 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 68 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 16 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:36:47] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 61 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 59 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:36:48] [INFO ] Deduced a trap composed of 65 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 38 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 1 ms to minimize.
[2025-06-01 01:36:49] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:36:50] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 86 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 63 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:36:51] [INFO ] Deduced a trap composed of 54 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 47 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 44 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 19 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 84 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 73 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:36:52] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:36:53] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:36:53] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 52 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 83 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:36:56] [INFO ] Deduced a trap composed of 67 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 53 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:36:57] [INFO ] Deduced a trap composed of 21 places in 50 ms of which 0 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 22 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:36:58] [INFO ] Deduced a trap composed of 65 places in 156 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 3 places in 145 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 65 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:36:59] [INFO ] Deduced a trap composed of 59 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 64 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 64 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:37:00] [INFO ] Deduced a trap composed of 89 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 64 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:37:01] [INFO ] Deduced a trap composed of 39 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 53 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:37:02] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:03] [INFO ] Deduced a trap composed of 42 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:37:03] [INFO ] Deduced a trap composed of 44 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 43 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:37:04] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:37:05] [INFO ] Deduced a trap composed of 18 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:37:06] [INFO ] Deduced a trap composed of 24 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:37:06] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:37:06] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:37:06] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 79 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 59 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:37:07] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:37:11] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:37:12] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:37:12] [INFO ] Deduced a trap composed of 60 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:37:12] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:37:12] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:37:13] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:37:13] [INFO ] Deduced a trap composed of 61 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:37:13] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:37:14] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:37:14] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:37:14] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:37:14] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:37:15] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:37:15] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:37:15] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:37:15] [INFO ] Deduced a trap composed of 59 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:37:15] [INFO ] Deduced a trap composed of 68 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:37:15] [INFO ] Deduced a trap composed of 68 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:37:16] [INFO ] Deduced a trap composed of 42 places in 126 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:17] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:37:17] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:37:17] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 70 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:37:18] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 51 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 37 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 40 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:37:19] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 38 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:37:20] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:21] [INFO ] Deduced a trap composed of 51 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:37:21] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:37:21] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:37:22] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:37:22] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:37:22] [INFO ] Deduced a trap composed of 35 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:37:22] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:37:22] [INFO ] Deduced a trap composed of 35 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 47 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 49 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 36 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:37:23] [INFO ] Deduced a trap composed of 37 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 50 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 92 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:37:24] [INFO ] Deduced a trap composed of 79 places in 133 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 55 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 38 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 47 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 56 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:37:32] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:34] [INFO ] Deduced a trap composed of 68 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:37:34] [INFO ] Deduced a trap composed of 83 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:37:34] [INFO ] Deduced a trap composed of 40 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:37:37] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 5/224 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 71 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 77 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:37:42] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:37:42] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:37:42] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 3 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 38 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:37:44] [INFO ] Deduced a trap composed of 49 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:37:44] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:37:44] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:37:44] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:37:44] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 60 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 59 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 59 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 20/264 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:37:55] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:37:56] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 44 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 63 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:37:57] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:37:58] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:37:58] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:37:58] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:37:58] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:37:58] [INFO ] Deduced a trap composed of 63 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:37:58] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:37:59] [INFO ] Deduced a trap composed of 79 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:37:59] [INFO ] Deduced a trap composed of 76 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:37:59] [INFO ] Deduced a trap composed of 58 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:37:59] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:37:59] [INFO ] Deduced a trap composed of 69 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:38:00] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:38:00] [INFO ] Deduced a trap composed of 66 places in 132 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/257 variables, 20/284 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:38:02] [INFO ] Deduced a trap composed of 94 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 46 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 69 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 55 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:38:03] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:38:04] [INFO ] Deduced a trap composed of 36 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:38:04] [INFO ] Deduced a trap composed of 60 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:38:04] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 47 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 65 places in 96 ms of which 1 ms to minimize.
SMT process timed out in 90280ms, After SMT, problems are : Problem set: 0 solved, 562 unsolved
Fused 562 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 117 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 36 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 257/257 places, 1104/1104 transitions.
RANDOM walk for 3947089 steps (8 resets) in 118454 ms. (33 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 562/562 properties
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 25908 ms. (steps per millisecond=38 ) properties seen :0
[2025-06-01 01:39:05] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:39:05] [INFO ] Invariant cache hit.
[2025-06-01 01:39:05] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 140/257 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:11] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:39:11] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:39:11] [INFO ] Deduced a trap composed of 42 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:39:11] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:39:11] [INFO ] Deduced a trap composed of 38 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:39:12] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:39:12] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 1 ms to minimize.
[2025-06-01 01:39:12] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:39:12] [INFO ] Deduced a trap composed of 47 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:39:12] [INFO ] Deduced a trap composed of 35 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:39:12] [INFO ] Deduced a trap composed of 43 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:39:12] [INFO ] Deduced a trap composed of 71 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:39:13] [INFO ] Deduced a trap composed of 78 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:39:13] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:39:13] [INFO ] Deduced a trap composed of 76 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:39:13] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:39:13] [INFO ] Deduced a trap composed of 4 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:39:13] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:39:13] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:39:14] [INFO ] Deduced a trap composed of 82 places in 138 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:14] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:39:14] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:39:14] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:39:14] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:39:15] [INFO ] Deduced a trap composed of 54 places in 142 ms of which 1 ms to minimize.
[2025-06-01 01:39:15] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:39:15] [INFO ] Deduced a trap composed of 63 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:39:15] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:39:15] [INFO ] Deduced a trap composed of 4 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:39:15] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:39:15] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 65 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 49 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:39:16] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:39:17] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:17] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:39:17] [INFO ] Deduced a trap composed of 70 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:39:18] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:39:18] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:39:18] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:39:18] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:39:18] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:39:18] [INFO ] Deduced a trap composed of 57 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:39:19] [INFO ] Deduced a trap composed of 24 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:39:19] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:39:19] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:39:19] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:39:19] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:39:19] [INFO ] Deduced a trap composed of 53 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:39:19] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:39:20] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:39:20] [INFO ] Deduced a trap composed of 15 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:39:20] [INFO ] Deduced a trap composed of 52 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:39:20] [INFO ] Deduced a trap composed of 20 places in 74 ms of which 0 ms to minimize.
[2025-06-01 01:39:20] [INFO ] Deduced a trap composed of 51 places in 135 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:23] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:39:24] [INFO ] Deduced a trap composed of 43 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:39:24] [INFO ] Deduced a trap composed of 51 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 49 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 40 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 45 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 71 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:39:25] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:39:26] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:39:26] [INFO ] Deduced a trap composed of 65 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:39:26] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:39:26] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:39:26] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:39:27] [INFO ] Deduced a trap composed of 49 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:39:27] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:39:27] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:39:28] [INFO ] Deduced a trap composed of 43 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:39:28] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:29] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:39:29] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:39:29] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:39:29] [INFO ] Deduced a trap composed of 85 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 73 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 55 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 45 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 76 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:39:30] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 54 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 43 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:39:31] [INFO ] Deduced a trap composed of 61 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:39:32] [INFO ] Deduced a trap composed of 79 places in 103 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:33] [INFO ] Deduced a trap composed of 52 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:39:33] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:39:33] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:39:33] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:39:33] [INFO ] Deduced a trap composed of 48 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:39:34] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 0 ms to minimize.
[2025-06-01 01:39:34] [INFO ] Deduced a trap composed of 83 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:39:34] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:39:34] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:39:34] [INFO ] Deduced a trap composed of 64 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:39:34] [INFO ] Deduced a trap composed of 50 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:39:35] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:39:35] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:39:35] [INFO ] Deduced a trap composed of 39 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:39:35] [INFO ] Deduced a trap composed of 68 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:39:35] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:39:35] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:39:35] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:39:36] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:39:36] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:40] [INFO ] Deduced a trap composed of 57 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:39:41] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 73 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:39:42] [INFO ] Deduced a trap composed of 52 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 71 places in 141 ms of which 1 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 44 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:39:43] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:39:44] [INFO ] Deduced a trap composed of 56 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:39:44] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:39:44] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:39:44] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:39:45] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:46] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:39:46] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:39:46] [INFO ] Deduced a trap composed of 74 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:39:46] [INFO ] Deduced a trap composed of 89 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:39:46] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 74 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 67 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:39:47] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 49 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 75 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:39:48] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:39:49] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:39:49] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 55 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:39:51] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:39:52] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:39:52] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:39:52] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:39:52] [INFO ] Deduced a trap composed of 62 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 108 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 102 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 81 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 74 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:39:53] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:39:54] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:39:54] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:39:54] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:39:54] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:39:58] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:39:58] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:39:58] [INFO ] Deduced a trap composed of 44 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:39:59] [INFO ] Deduced a trap composed of 62 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:39:59] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:39:59] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:39:59] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:39:59] [INFO ] Deduced a trap composed of 50 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:40:00] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:40:00] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:40:00] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:40:00] [INFO ] Deduced a trap composed of 40 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:40:01] [INFO ] Deduced a trap composed of 98 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:40:01] [INFO ] Deduced a trap composed of 86 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:40:01] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:40:01] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 78 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:40:02] [INFO ] Deduced a trap composed of 56 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:40:03] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:40:03] [INFO ] Deduced a trap composed of 64 places in 121 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:40:04] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:40:04] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:40:05] [INFO ] Deduced a trap composed of 51 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:40:05] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:40:05] [INFO ] Deduced a trap composed of 48 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:40:05] [INFO ] Deduced a trap composed of 38 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 72 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 69 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 78 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:40:09] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 68 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 38 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:40:11] [INFO ] Deduced a trap composed of 48 places in 102 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 57 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 64 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 39 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 63 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 53 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 73 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:40:16] [INFO ] Deduced a trap composed of 73 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:40:18] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:40:18] [INFO ] Deduced a trap composed of 37 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:40:19] [INFO ] Deduced a trap composed of 62 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:40:20] [INFO ] Deduced a trap composed of 48 places in 133 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 17/256 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 63 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 61 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 37 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 43 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 75 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 47 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 64 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 41 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 69 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 53 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 37 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 59 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 36 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 37 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 37 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 69 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 71 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 67 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 57 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 75 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 73 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 63 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 69 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 59 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 55 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:40:39] [INFO ] Deduced a trap composed of 63 places in 114 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/257 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:40:41] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:40:42] [INFO ] Deduced a trap composed of 85 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:40:43] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:40:43] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:40:44] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:40:44] [INFO ] Deduced a trap composed of 73 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:40:44] [INFO ] Deduced a trap composed of 81 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:40:45] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:40:45] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 65 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:40:46] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 70 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/257 variables, 17/313 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/767 variables, and 313 constraints, problems are : Problem set: 0 solved, 562 unsolved in 105030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/257 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 294/294 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 140/257 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 294/313 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 56 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 65 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:40:53] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:40:54] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:40:54] [INFO ] Deduced a trap composed of 57 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 62 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 52 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 79 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 13/326 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 73 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:41:04] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:41:04] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:41:05] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:41:05] [INFO ] Deduced a trap composed of 73 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:41:05] [INFO ] Deduced a trap composed of 75 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:41:05] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:41:06] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:41:06] [INFO ] Deduced a trap composed of 68 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:41:06] [INFO ] Deduced a trap composed of 87 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:41:06] [INFO ] Deduced a trap composed of 81 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:41:06] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:41:06] [INFO ] Deduced a trap composed of 73 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:41:06] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:41:07] [INFO ] Deduced a trap composed of 76 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:41:07] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:41:08] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:41:08] [INFO ] Deduced a trap composed of 76 places in 110 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:41:10] [INFO ] Deduced a trap composed of 69 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:41:12] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:41:13] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 63 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 54 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 79 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 61 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 74 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 49 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 15/361 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:41:19] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:41:19] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:41:20] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:41:20] [INFO ] Deduced a trap composed of 57 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:41:20] [INFO ] Deduced a trap composed of 71 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 62 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 52 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 48 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 63 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:41:26] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:41:26] [INFO ] Deduced a trap composed of 49 places in 112 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 14/375 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:41:29] [INFO ] Deduced a trap composed of 57 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:41:29] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:41:30] [INFO ] Deduced a trap composed of 69 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:41:30] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:41:30] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:41:30] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:41:30] [INFO ] Deduced a trap composed of 70 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:41:34] [INFO ] Deduced a trap composed of 42 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:41:34] [INFO ] Deduced a trap composed of 51 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:41:34] [INFO ] Deduced a trap composed of 43 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:41:34] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 45 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 59 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 54 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:41:35] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 40 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 83 places in 112 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/395 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 70 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 87 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 63 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 73 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 79 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 75 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 78 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 82 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 68 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:41:40] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 57 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 57 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 53 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:41:42] [INFO ] Deduced a trap composed of 58 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:41:42] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/415 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:41:44] [INFO ] Deduced a trap composed of 60 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:41:47] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:41:47] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 57 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 6/421 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 13 (OVERLAPS) 510/767 variables, 257/678 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/767 variables, 279/957 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/767 variables, 562/1519 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 767/767 variables, and 1519 constraints, problems are : Problem set: 0 solved, 562 unsolved in 105023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 257/257 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 402/402 constraints]
After SMT, in 210315ms problems are : Problem set: 0 solved, 562 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 117 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 34 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 257/257 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 22 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2025-06-01 01:42:35] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:42:35] [INFO ] Invariant cache hit.
[2025-06-01 01:42:35] [INFO ] Implicit Places using invariants in 104 ms returned []
[2025-06-01 01:42:35] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:42:35] [INFO ] Invariant cache hit.
[2025-06-01 01:42:35] [INFO ] State equation strengthened by 279 read => feed constraints.
[2025-06-01 01:42:36] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2025-06-01 01:42:36] [INFO ] Redundant transitions in 45 ms returned []
Running 1098 sub problems to find dead transitions.
[2025-06-01 01:42:36] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:42:36] [INFO ] Invariant cache hit.
[2025-06-01 01:42:36] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2025-06-01 01:42:41] [INFO ] Deduced a trap composed of 37 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 46 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 60 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 80 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:42:43] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 48 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:42:44] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:42:46] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:42:46] [INFO ] Deduced a trap composed of 89 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:42:46] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:42:46] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 44 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 39 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 40 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 01:42:47] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 52 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 54 places in 144 ms of which 1 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 15 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:42:48] [INFO ] Deduced a trap composed of 72 places in 124 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:42:55] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:42:55] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:42:55] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:42:55] [INFO ] Deduced a trap composed of 44 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:42:55] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 71 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 35 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 62 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:42:56] [INFO ] Deduced a trap composed of 52 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 48 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:42:57] [INFO ] Deduced a trap composed of 15 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:42:58] [INFO ] Deduced a trap composed of 55 places in 117 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:42:59] [INFO ] Deduced a trap composed of 43 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 21 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 74 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 43 places in 114 ms of which 4 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 61 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 52 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 43 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:43:00] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 59 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 43 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 45 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:43:01] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 41 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 61 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:43:02] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:43:04] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:43:04] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:43:04] [INFO ] Deduced a trap composed of 16 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:43:04] [INFO ] Deduced a trap composed of 52 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:43:04] [INFO ] Deduced a trap composed of 49 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:43:05] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:43:05] [INFO ] Deduced a trap composed of 54 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:43:05] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:43:05] [INFO ] Deduced a trap composed of 45 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:43:05] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 46 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:43:06] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
SMT process timed out in 30417ms, After SMT, problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 30426ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31054 ms. Remains : 257/257 places, 1104/1104 transitions.
RANDOM walk for 400000 steps (8 resets) in 5402 ms. (74 steps per ms) remains 47/117 properties
Running SMT prover for 47 properties.
[2025-06-01 01:43:08] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:43:08] [INFO ] Invariant cache hit.
[2025-06-01 01:43:08] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-06-01 01:43:08] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-01 01:43:08] [INFO ] After 170ms SMT Verify possible using state equation in real domain returned unsat :0 sat :47
[2025-06-01 01:43:08] [INFO ] State equation strengthened by 279 read => feed constraints.
[2025-06-01 01:43:08] [INFO ] After 155ms SMT Verify possible using 279 Read/Feed constraints in real domain returned unsat :0 sat :47
TRAPS : Iteration 0
[2025-06-01 01:43:10] [INFO ] After 1781ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:47
[2025-06-01 01:43:10] [INFO ] After 2049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:47
[2025-06-01 01:43:10] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-01 01:43:10] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-01 01:43:10] [INFO ] After 161ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :47
[2025-06-01 01:43:10] [INFO ] After 190ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :47
TRAPS : Iteration 0
[2025-06-01 01:43:10] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 87 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 15 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:43:11] [INFO ] Deduced a trap composed of 27 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Deduced a trap composed of 19 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1408 ms
[2025-06-01 01:43:12] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-01 01:43:12] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2025-06-01 01:43:12] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2025-06-01 01:43:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 0 ms to minimize.
[2025-06-01 01:43:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2025-06-01 01:43:13] [INFO ] Deduced a trap composed of 19 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-06-01 01:43:13] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2025-06-01 01:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2025-06-01 01:43:13] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:43:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 94 ms
[2025-06-01 01:43:13] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:43:13] [INFO ] Deduced a trap composed of 31 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:43:13] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:43:14] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:43:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 513 ms
[2025-06-01 01:43:14] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 0 ms to minimize.
[2025-06-01 01:43:14] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:43:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 185 ms
[2025-06-01 01:43:14] [INFO ] Deduced a trap composed of 41 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:43:14] [INFO ] Deduced a trap composed of 21 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:43:14] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
TRAPS : Iteration 1
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 23 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 83 ms
[2025-06-01 01:43:15] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:43:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 116 ms
[2025-06-01 01:43:16] [INFO ] Deduced a trap composed of 47 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 144 ms
[2025-06-01 01:43:16] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:43:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
TRAPS : Iteration 2
[2025-06-01 01:43:17] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:43:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 123 ms
TRAPS : Iteration 3
[2025-06-01 01:43:19] [INFO ] After 9288ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :47
[2025-06-01 01:43:20] [INFO ] After 9718ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :47
RANDOM walk for 1697791 steps (4 resets) in 120004 ms. (14 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 562/562 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 562/562 properties
Probabilistic random walk after 1000001 steps, saw 344184 distinct states, run finished after 26736 ms. (steps per millisecond=37 ) properties seen :0
[2025-06-01 01:44:17] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:44:17] [INFO ] Invariant cache hit.
[2025-06-01 01:44:17] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 140/257 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 26 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 42 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:44:23] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 38 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 47 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 35 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:44:24] [INFO ] Deduced a trap composed of 71 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 76 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 25 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 4 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 74 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:44:25] [INFO ] Deduced a trap composed of 82 places in 117 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 69 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 54 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 4 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 3 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 46 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 49 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 14 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 47 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:29] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:44:29] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:44:29] [INFO ] Deduced a trap composed of 58 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 42 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 53 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:44:31] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 51 places in 117 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 49 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 36 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 40 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 71 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 44 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 64 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 56 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:44:37] [INFO ] Deduced a trap composed of 55 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 49 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 19 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 72 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 43 places in 142 ms of which 1 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:40] [INFO ] Deduced a trap composed of 67 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 61 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 85 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 73 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 55 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 62 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 76 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 53 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 54 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 66 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 52 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 73 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 43 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:44:43] [INFO ] Deduced a trap composed of 79 places in 96 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:44] [INFO ] Deduced a trap composed of 52 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:44:44] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:44:45] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:44:45] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:45] [INFO ] Deduced a trap composed of 48 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:44:45] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:44:45] [INFO ] Deduced a trap composed of 83 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:44:45] [INFO ] Deduced a trap composed of 70 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:44:46] [INFO ] Deduced a trap composed of 65 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:44:46] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:44:46] [INFO ] Deduced a trap composed of 50 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:44:46] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:44:46] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:44:46] [INFO ] Deduced a trap composed of 39 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:44:46] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:44:47] [INFO ] Deduced a trap composed of 69 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:44:47] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:44:47] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:44:47] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:44:47] [INFO ] Deduced a trap composed of 85 places in 136 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:51] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 19 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 69 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 73 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 52 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 71 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 54 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 44 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 42 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 46 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:44:56] [INFO ] Deduced a trap composed of 56 places in 109 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:44:57] [INFO ] Deduced a trap composed of 79 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:44:57] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:44:57] [INFO ] Deduced a trap composed of 74 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:44:57] [INFO ] Deduced a trap composed of 89 places in 136 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 49 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 74 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 89 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 52 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 72 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 75 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 62 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 51 places in 128 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:45:02] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:45:02] [INFO ] Deduced a trap composed of 72 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:45:02] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:45:02] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:45:03] [INFO ] Deduced a trap composed of 87 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:45:03] [INFO ] Deduced a trap composed of 70 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:45:03] [INFO ] Deduced a trap composed of 74 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:45:03] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:45:03] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:45:04] [INFO ] Deduced a trap composed of 108 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:45:04] [INFO ] Deduced a trap composed of 102 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:45:04] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:45:04] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:45:04] [INFO ] Deduced a trap composed of 81 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:45:04] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:45:05] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:45:05] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:45:05] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:45:05] [INFO ] Deduced a trap composed of 78 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:45:05] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:45:09] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:45:10] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:45:10] [INFO ] Deduced a trap composed of 44 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:45:10] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:45:10] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:45:10] [INFO ] Deduced a trap composed of 57 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:45:11] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:45:11] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:45:11] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:45:11] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:45:11] [INFO ] Deduced a trap composed of 61 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:45:12] [INFO ] Deduced a trap composed of 40 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:45:12] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:45:12] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:45:13] [INFO ] Deduced a trap composed of 66 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:45:13] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:45:13] [INFO ] Deduced a trap composed of 78 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:45:14] [INFO ] Deduced a trap composed of 56 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:45:14] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:45:14] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 20/219 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:45:16] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:45:16] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:45:16] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:45:16] [INFO ] Deduced a trap composed of 55 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:45:16] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:45:16] [INFO ] Deduced a trap composed of 38 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:45:18] [INFO ] Deduced a trap composed of 65 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:45:18] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:45:18] [INFO ] Deduced a trap composed of 72 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:45:18] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:45:18] [INFO ] Deduced a trap composed of 60 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:45:18] [INFO ] Deduced a trap composed of 42 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:45:19] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:45:20] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:45:20] [INFO ] Deduced a trap composed of 52 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:45:20] [INFO ] Deduced a trap composed of 54 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:45:21] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:45:21] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:45:21] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:45:23] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 20/239 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:45:24] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:45:25] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:45:25] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:45:25] [INFO ] Deduced a trap composed of 74 places in 122 ms of which 3 ms to minimize.
[2025-06-01 01:45:26] [INFO ] Deduced a trap composed of 39 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:45:26] [INFO ] Deduced a trap composed of 69 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:45:26] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:45:26] [INFO ] Deduced a trap composed of 63 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:45:27] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:45:27] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:45:27] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:45:27] [INFO ] Deduced a trap composed of 73 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:45:28] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:45:29] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:45:30] [INFO ] Deduced a trap composed of 37 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:45:30] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:45:32] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 17/256 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:45:37] [INFO ] Deduced a trap composed of 46 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:45:38] [INFO ] Deduced a trap composed of 61 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:45:39] [INFO ] Deduced a trap composed of 63 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:45:39] [INFO ] Deduced a trap composed of 69 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:45:40] [INFO ] Deduced a trap composed of 61 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:45:40] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:45:40] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:45:41] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:45:41] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:45:41] [INFO ] Deduced a trap composed of 53 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:45:41] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:45:41] [INFO ] Deduced a trap composed of 63 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:45:42] [INFO ] Deduced a trap composed of 47 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:45:42] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:45:42] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:45:42] [INFO ] Deduced a trap composed of 41 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:45:42] [INFO ] Deduced a trap composed of 69 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:45:43] [INFO ] Deduced a trap composed of 53 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:45:43] [INFO ] Deduced a trap composed of 37 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:45:43] [INFO ] Deduced a trap composed of 57 places in 110 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 20/276 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:45:45] [INFO ] Deduced a trap composed of 59 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:45:45] [INFO ] Deduced a trap composed of 36 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:45:45] [INFO ] Deduced a trap composed of 37 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:45:45] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:45:46] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:45:46] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:45:46] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:45:48] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:45:48] [INFO ] Deduced a trap composed of 71 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:45:48] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:45:49] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:45:49] [INFO ] Deduced a trap composed of 57 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:45:49] [INFO ] Deduced a trap composed of 75 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:45:50] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:45:50] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:45:50] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:45:50] [INFO ] Deduced a trap composed of 69 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:45:50] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:45:50] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:45:51] [INFO ] Deduced a trap composed of 63 places in 123 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/257 variables, 20/296 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:45:53] [INFO ] Deduced a trap composed of 59 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:45:54] [INFO ] Deduced a trap composed of 85 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:45:55] [INFO ] Deduced a trap composed of 50 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:45:55] [INFO ] Deduced a trap composed of 66 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:45:55] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:45:56] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:45:56] [INFO ] Deduced a trap composed of 81 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:45:56] [INFO ] Deduced a trap composed of 93 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:45:56] [INFO ] Deduced a trap composed of 68 places in 148 ms of which 1 ms to minimize.
[2025-06-01 01:45:58] [INFO ] Deduced a trap composed of 70 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:45:58] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:45:58] [INFO ] Deduced a trap composed of 61 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:45:58] [INFO ] Deduced a trap composed of 72 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:45:58] [INFO ] Deduced a trap composed of 59 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:45:58] [INFO ] Deduced a trap composed of 70 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:45:58] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:45:59] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/257 variables, 17/313 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:46:07] [INFO ] Deduced a trap composed of 38 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:46:07] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:46:08] [INFO ] Deduced a trap composed of 70 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 65 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:46:09] [INFO ] Deduced a trap composed of 62 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:46:10] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 57 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 67 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:46:11] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:46:12] [INFO ] Deduced a trap composed of 49 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:46:13] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:46:13] [INFO ] Deduced a trap composed of 57 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:46:13] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/257 variables, 20/333 constraints. Problems are: Problem set: 0 solved, 562 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/767 variables, and 333 constraints, problems are : Problem set: 0 solved, 562 unsolved in 120017 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/257 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 562/562 constraints, Known Traps: 314/314 constraints]
Escalating to Integer solving :Problem set: 0 solved, 562 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 2 (OVERLAPS) 140/257 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 562 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 314/333 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:46:21] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:46:23] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 64 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 48 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 48 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 48 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 65 places in 128 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 12/345 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 54 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 76 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 68 places in 144 ms of which 1 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 77 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 63 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 57 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 47 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 63 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 47 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 16/361 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 43 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 74 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 81 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 78 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:46:45] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:46:46] [INFO ] Deduced a trap composed of 71 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:46:46] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:46:46] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:46:47] [INFO ] Deduced a trap composed of 70 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:46:47] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:46:47] [INFO ] Deduced a trap composed of 75 places in 98 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 16/377 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:46:52] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 64 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 53 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 67 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 56 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 40 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 14/391 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:47:00] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:47:00] [INFO ] Deduced a trap composed of 48 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:47:01] [INFO ] Deduced a trap composed of 79 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 46 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:47:02] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:47:03] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 57 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 58 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 95 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 44 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 53 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 40 places in 109 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 20/411 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 54 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 70 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 57 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 57 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 55 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 64 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 66 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 66 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 58 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 78 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:47:12] [INFO ] Deduced a trap composed of 59 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:47:12] [INFO ] Deduced a trap composed of 62 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:47:12] [INFO ] Deduced a trap composed of 85 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 76 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 81 places in 133 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 64 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:47:15] [INFO ] Deduced a trap composed of 66 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:47:16] [INFO ] Deduced a trap composed of 56 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:47:16] [INFO ] Deduced a trap composed of 57 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 50 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 61 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 48 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 72 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 64 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:47:21] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:47:21] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/257 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:47:24] [INFO ] Deduced a trap composed of 51 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:47:24] [INFO ] Deduced a trap composed of 81 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:47:25] [INFO ] Deduced a trap composed of 87 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:47:25] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:47:25] [INFO ] Deduced a trap composed of 74 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 60 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:47:26] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:47:28] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:47:29] [INFO ] Deduced a trap composed of 71 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:47:29] [INFO ] Deduced a trap composed of 119 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 74 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 85 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 66 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 38 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 43 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 49 places in 100 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/257 variables, 20/471 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:47:36] [INFO ] Deduced a trap composed of 43 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:47:36] [INFO ] Deduced a trap composed of 51 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:47:36] [INFO ] Deduced a trap composed of 47 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:47:36] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:47:37] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:47:37] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:47:37] [INFO ] Deduced a trap composed of 73 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:47:37] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:47:40] [INFO ] Deduced a trap composed of 59 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:47:40] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 62 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 77 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:47:44] [INFO ] Deduced a trap composed of 68 places in 116 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/257 variables, 15/486 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:47:50] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:47:50] [INFO ] Deduced a trap composed of 78 places in 126 ms of which 1 ms to minimize.
[2025-06-01 01:47:51] [INFO ] Deduced a trap composed of 60 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:47:54] [INFO ] Deduced a trap composed of 49 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:47:54] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/257 variables, 5/491 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:47:57] [INFO ] Deduced a trap composed of 48 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 83 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 57 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 63 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 58 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:47:58] [INFO ] Deduced a trap composed of 54 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 96 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:47:59] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:48:00] [INFO ] Deduced a trap composed of 63 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:48:01] [INFO ] Deduced a trap composed of 68 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:48:01] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:48:02] [INFO ] Deduced a trap composed of 61 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:48:02] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:48:02] [INFO ] Deduced a trap composed of 50 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:48:02] [INFO ] Deduced a trap composed of 76 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:48:02] [INFO ] Deduced a trap composed of 53 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:48:03] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:48:03] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/257 variables, 20/511 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:48:07] [INFO ] Deduced a trap composed of 69 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:48:07] [INFO ] Deduced a trap composed of 62 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:48:07] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:48:07] [INFO ] Deduced a trap composed of 72 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:48:07] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:48:09] [INFO ] Deduced a trap composed of 54 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:48:09] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:48:10] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 61 places in 151 ms of which 1 ms to minimize.
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 88 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 56 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:48:13] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/257 variables, 13/524 constraints. Problems are: Problem set: 0 solved, 562 unsolved
[2025-06-01 01:48:17] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:48:17] [INFO ] Deduced a trap composed of 65 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:48:17] [INFO ] Deduced a trap composed of 70 places in 121 ms of which 2 ms to minimize.
SMT process timed out in 240337ms, After SMT, problems are : Problem set: 0 solved, 562 unsolved
Fused 562 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 117 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 25 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 257/257 places, 1104/1104 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Applied a total of 0 rules in 21 ms. Remains 257 /257 variables (removed 0) and now considering 1104/1104 (removed 0) transitions.
[2025-06-01 01:48:17] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:48:17] [INFO ] Invariant cache hit.
[2025-06-01 01:48:17] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-01 01:48:17] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:48:17] [INFO ] Invariant cache hit.
[2025-06-01 01:48:18] [INFO ] State equation strengthened by 279 read => feed constraints.
[2025-06-01 01:48:18] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2025-06-01 01:48:18] [INFO ] Redundant transitions in 21 ms returned []
Running 1098 sub problems to find dead transitions.
[2025-06-01 01:48:18] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:48:18] [INFO ] Invariant cache hit.
[2025-06-01 01:48:18] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:48:23] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:48:23] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:48:23] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:48:23] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2025-06-01 01:48:24] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 56 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 46 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 60 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 52 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 80 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 48 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 58 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:48:28] [INFO ] Deduced a trap composed of 43 places in 127 ms of which 3 ms to minimize.
[2025-06-01 01:48:28] [INFO ] Deduced a trap composed of 89 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 67 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 52 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 47 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 44 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 39 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:48:29] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 52 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 0 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 55 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:48:31] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:48:31] [INFO ] Deduced a trap composed of 72 places in 118 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:48:37] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 01:48:37] [INFO ] Deduced a trap composed of 59 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:48:37] [INFO ] Deduced a trap composed of 52 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 44 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 71 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 35 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 35 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 58 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:48:38] [INFO ] Deduced a trap composed of 59 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:48:39] [INFO ] Deduced a trap composed of 62 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:48:39] [INFO ] Deduced a trap composed of 52 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:48:39] [INFO ] Deduced a trap composed of 50 places in 118 ms of which 1 ms to minimize.
[2025-06-01 01:48:39] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:48:39] [INFO ] Deduced a trap composed of 61 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:48:39] [INFO ] Deduced a trap composed of 27 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:48:39] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:48:40] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:48:40] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 43 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 74 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 66 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 43 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 43 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 59 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 62 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 22 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 45 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 68 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 67 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 67 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 41 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 61 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 56 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 55 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 16 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 52 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:48:46] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:48:47] [INFO ] Deduced a trap composed of 58 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:48:47] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:48:47] [INFO ] Deduced a trap composed of 56 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 62 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 58 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 46 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:48:48] [INFO ] Deduced a trap composed of 62 places in 97 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 257/767 variables, and 112 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/257 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 1098/1098 constraints, Known Traps: 93/93 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1098 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/257 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/257 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/257 variables, 93/112 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 61 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 63 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 65 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 43 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 64 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 63 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 62 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 59 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 38 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 40 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 52 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:48:54] [INFO ] Deduced a trap composed of 65 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:48:54] [INFO ] Deduced a trap composed of 65 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:48:54] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:48:54] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 20/132 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:48:56] [INFO ] Deduced a trap composed of 74 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:48:56] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:48:56] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:48:56] [INFO ] Deduced a trap composed of 66 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:48:57] [INFO ] Deduced a trap composed of 48 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:48:57] [INFO ] Deduced a trap composed of 16 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 67 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 19 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2025-06-01 01:48:59] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:48:59] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:48:59] [INFO ] Deduced a trap composed of 47 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:49:00] [INFO ] Deduced a trap composed of 53 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:49:00] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:49:01] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:49:02] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:49:02] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:49:03] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/257 variables, 20/152 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:49:05] [INFO ] Deduced a trap composed of 43 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:49:07] [INFO ] Deduced a trap composed of 54 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 51 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:49:11] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:49:11] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:49:11] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 1 ms to minimize.
[2025-06-01 01:49:11] [INFO ] Deduced a trap composed of 59 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 68 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 76 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 68 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 63 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:49:13] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:49:13] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:49:13] [INFO ] Deduced a trap composed of 39 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:49:13] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:49:13] [INFO ] Deduced a trap composed of 68 places in 115 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/257 variables, 20/172 constraints. Problems are: Problem set: 0 solved, 1098 unsolved
[2025-06-01 01:49:16] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:49:16] [INFO ] Deduced a trap composed of 48 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:49:16] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:49:17] [INFO ] Deduced a trap composed of 82 places in 93 ms of which 1 ms to minimize.
[2025-06-01 01:49:17] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:49:17] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:49:17] [INFO ] Deduced a trap composed of 52 places in 98 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 257/767 variables, and 179 constraints, problems are : Problem set: 0 solved, 1098 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/257 constraints, ReadFeed: 0/279 constraints, PredecessorRefiner: 0/1098 constraints, Known Traps: 160/160 constraints]
After SMT, in 60401ms problems are : Problem set: 0 solved, 1098 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61013 ms. Remains : 257/257 places, 1104/1104 transitions.
RANDOM walk for 400000 steps (8 resets) in 3827 ms. (104 steps per ms) remains 46/117 properties
Running SMT prover for 46 properties.
[2025-06-01 01:49:20] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:49:20] [INFO ] Invariant cache hit.
[2025-06-01 01:49:20] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2025-06-01 01:49:20] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-01 01:49:20] [INFO ] After 172ms SMT Verify possible using state equation in real domain returned unsat :0 sat :46
[2025-06-01 01:49:20] [INFO ] State equation strengthened by 279 read => feed constraints.
[2025-06-01 01:49:20] [INFO ] After 134ms SMT Verify possible using 279 Read/Feed constraints in real domain returned unsat :0 sat :46
TRAPS : Iteration 0
[2025-06-01 01:49:22] [INFO ] After 1527ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:46
[2025-06-01 01:49:22] [INFO ] After 1793ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:46
[2025-06-01 01:49:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-01 01:49:22] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-01 01:49:22] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :46
[2025-06-01 01:49:22] [INFO ] After 202ms SMT Verify possible using 279 Read/Feed constraints in natural domain returned unsat :0 sat :46
TRAPS : Iteration 0
[2025-06-01 01:49:22] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 22 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 861 ms
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 178 ms
[2025-06-01 01:49:23] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:49:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2025-06-01 01:49:24] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 78 ms
[2025-06-01 01:49:24] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2025-06-01 01:49:24] [INFO ] Deduced a trap composed of 38 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:49:24] [INFO ] Deduced a trap composed of 27 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 310 ms
[2025-06-01 01:49:24] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2025-06-01 01:49:24] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:49:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2025-06-01 01:49:24] [INFO ] Deduced a trap composed of 69 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 74 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 287 ms
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 154 ms
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 114 ms
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 29 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 241 ms
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 190 ms
TRAPS : Iteration 1
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 48 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 306 ms
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 63 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 62 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 248 ms
TRAPS : Iteration 2
[2025-06-01 01:49:29] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:49:29] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:49:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 304 ms
TRAPS : Iteration 3
[2025-06-01 01:49:31] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:49:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 88 ms
TRAPS : Iteration 4
[2025-06-01 01:49:32] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:49:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 155 ms
TRAPS : Iteration 5
[2025-06-01 01:49:34] [INFO ] After 12412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :46
[2025-06-01 01:49:35] [INFO ] After 12842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :46
RANDOM walk for 323 steps (0 resets) in 5 ms. (53 steps per ms) remains 0/1 properties
RANDOM walk for 737 steps (0 resets) in 11 ms. (61 steps per ms) remains 0/1 properties
RANDOM walk for 1100 steps (0 resets) in 13 ms. (78 steps per ms) remains 0/1 properties
RANDOM walk for 686 steps (0 resets) in 6 ms. (98 steps per ms) remains 0/1 properties
RANDOM walk for 1295 steps (0 resets) in 10 ms. (117 steps per ms) remains 0/1 properties
RANDOM walk for 1059 steps (0 resets) in 10 ms. (96 steps per ms) remains 0/1 properties
RANDOM walk for 1735 steps (0 resets) in 11 ms. (144 steps per ms) remains 0/1 properties
RANDOM walk for 1418 steps (0 resets) in 12 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 133 steps (0 resets) in 4 ms. (26 steps per ms) remains 0/1 properties
RANDOM walk for 1747 steps (0 resets) in 12 ms. (134 steps per ms) remains 0/1 properties
RANDOM walk for 836 steps (0 resets) in 8 ms. (92 steps per ms) remains 0/1 properties
RANDOM walk for 1453 steps (0 resets) in 12 ms. (111 steps per ms) remains 0/1 properties
RANDOM walk for 1766 steps (0 resets) in 13 ms. (126 steps per ms) remains 0/1 properties
RANDOM walk for 102 steps (0 resets) in 7 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 431 steps (0 resets) in 6 ms. (61 steps per ms) remains 0/1 properties
RANDOM walk for 1361 steps (0 resets) in 11 ms. (113 steps per ms) remains 0/1 properties
RANDOM walk for 1757 steps (0 resets) in 13 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 152 steps (0 resets) in 5 ms. (25 steps per ms) remains 0/1 properties
RANDOM walk for 387 steps (0 resets) in 7 ms. (48 steps per ms) remains 0/1 properties
RANDOM walk for 647 steps (0 resets) in 7 ms. (80 steps per ms) remains 0/1 properties
RANDOM walk for 1637 steps (0 resets) in 10 ms. (148 steps per ms) remains 0/1 properties
RANDOM walk for 84 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 342 steps (0 resets) in 7 ms. (42 steps per ms) remains 0/1 properties
RANDOM walk for 687 steps (0 resets) in 7 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 1098 steps (0 resets) in 9 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 812 steps (0 resets) in 8 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 951 steps (0 resets) in 8 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 1401 steps (0 resets) in 12 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 26 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 36701 steps (8 resets) in 203 ms. (179 steps per ms) remains 0/1 properties
RANDOM walk for 237 steps (0 resets) in 7 ms. (29 steps per ms) remains 0/1 properties
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 18 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 714 steps (0 resets) in 7 ms. (89 steps per ms) remains 0/1 properties
RANDOM walk for 21 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
RANDOM walk for 1160 steps (0 resets) in 10 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 16 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 27 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 1337 steps (0 resets) in 15 ms. (83 steps per ms) remains 0/1 properties
RANDOM walk for 26 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 25 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 1965 steps (0 resets) in 17 ms. (109 steps per ms) remains 0/1 properties
RANDOM walk for 17 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 202 ms. (197 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 176832 steps, run visited all 1 properties in 743 ms. (steps per millisecond=237 )
Probabilistic random walk after 176832 steps, saw 93205 distinct states, run finished after 747 ms. (steps per millisecond=236 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 151387 steps, run visited all 1 properties in 652 ms. (steps per millisecond=232 )
Probabilistic random walk after 151387 steps, saw 81641 distinct states, run finished after 654 ms. (steps per millisecond=231 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 196 ms. (203 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 73652 steps, run visited all 1 properties in 315 ms. (steps per millisecond=233 )
Probabilistic random walk after 73652 steps, saw 45777 distinct states, run finished after 315 ms. (steps per millisecond=233 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 88079 steps, run visited all 1 properties in 374 ms. (steps per millisecond=235 )
Probabilistic random walk after 88079 steps, saw 52480 distinct states, run finished after 376 ms. (steps per millisecond=234 ) properties seen :1
RANDOM walk for 12991 steps (2 resets) in 62 ms. (206 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 458827 steps, run visited all 1 properties in 1912 ms. (steps per millisecond=239 )
Probabilistic random walk after 458827 steps, saw 196790 distinct states, run finished after 1913 ms. (steps per millisecond=239 ) properties seen :1
RANDOM walk for 385 steps (0 resets) in 7 ms. (48 steps per ms) remains 0/1 properties
RANDOM walk for 67 steps (0 resets) in 4 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 166 ms. (239 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 20214 steps, run visited all 1 properties in 88 ms. (steps per millisecond=229 )
Probabilistic random walk after 20214 steps, saw 14210 distinct states, run finished after 88 ms. (steps per millisecond=229 ) properties seen :1
RANDOM walk for 14 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26045 steps, run visited all 1 properties in 118 ms. (steps per millisecond=220 )
Probabilistic random walk after 26045 steps, saw 17996 distinct states, run finished after 119 ms. (steps per millisecond=218 ) properties seen :1
RANDOM walk for 46 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 234344 steps, run visited all 1 properties in 986 ms. (steps per millisecond=237 )
Probabilistic random walk after 234344 steps, saw 116671 distinct states, run finished after 988 ms. (steps per millisecond=237 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 62424 steps, run visited all 1 properties in 267 ms. (steps per millisecond=233 )
Probabilistic random walk after 62424 steps, saw 39836 distinct states, run finished after 268 ms. (steps per millisecond=232 ) properties seen :1
RANDOM walk for 17844 steps (3 resets) in 86 ms. (205 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 30805 steps, run visited all 1 properties in 133 ms. (steps per millisecond=231 )
Probabilistic random walk after 30805 steps, saw 21018 distinct states, run finished after 133 ms. (steps per millisecond=231 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7943 steps, run visited all 1 properties in 36 ms. (steps per millisecond=220 )
Probabilistic random walk after 7943 steps, saw 5821 distinct states, run finished after 37 ms. (steps per millisecond=214 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 64146 steps, run visited all 1 properties in 275 ms. (steps per millisecond=233 )
Probabilistic random walk after 64146 steps, saw 40629 distinct states, run finished after 275 ms. (steps per millisecond=233 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 153 ms. (259 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 86476 steps, run visited all 1 properties in 368 ms. (steps per millisecond=234 )
Probabilistic random walk after 86476 steps, saw 52088 distinct states, run finished after 368 ms. (steps per millisecond=234 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 33416 steps, run visited all 1 properties in 145 ms. (steps per millisecond=230 )
Probabilistic random walk after 33416 steps, saw 22593 distinct states, run finished after 146 ms. (steps per millisecond=228 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 35702 steps (7 resets) in 33 ms. (1050 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1797 steps, run visited all 1 properties in 10 ms. (steps per millisecond=179 )
Probabilistic random walk after 1797 steps, saw 1428 distinct states, run finished after 10 ms. (steps per millisecond=179 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 728126 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 728126 steps, saw 271494 distinct states, run finished after 3008 ms. (steps per millisecond=242 ) properties seen :0
[2025-06-01 01:49:46] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
[2025-06-01 01:49:46] [INFO ] Invariant cache hit.
[2025-06-01 01:49:46] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:46] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/128 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/184 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/274 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 17/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 159/433 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/443 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:46] [INFO ] Deduced a trap composed of 89 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:49:46] [INFO ] Deduced a trap composed of 74 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:49:46] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 3/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/443 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 324/767 variables, 169/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/767 variables, 232/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/767 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/767 variables, 0/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 767/767 variables, and 559 constraints, problems are : Problem set: 0 solved, 1 unsolved in 820 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 257/257 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/128 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/184 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/274 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 17/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 159/433 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/443 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/443 variables, 3/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:47] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 2 ms to minimize.
[2025-06-01 01:49:47] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:49:47] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/443 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/443 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 324/767 variables, 169/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/767 variables, 232/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/767 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/767 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 549 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 257/257 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1381ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 966
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 966
Applied a total of 46 rules in 37 ms. Remains 234 /257 variables (removed 23) and now considering 966/1104 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 234/257 places, 966/1104 transitions.
RANDOM walk for 40000 steps (8 resets) in 506 ms. (78 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 799204 steps, run timeout after 3001 ms. (steps per millisecond=266 ) properties seen :0 out of 1
Probabilistic random walk after 799204 steps, saw 195742 distinct states, run finished after 3001 ms. (steps per millisecond=266 ) properties seen :0
[2025-06-01 01:49:50] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2025-06-01 01:49:50] [INFO ] Computed 19 invariants in 7 ms
[2025-06-01 01:49:50] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/100 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/156 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/246 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 17/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 140/386 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/396 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 210/606 variables, 150/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 137/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/100 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/156 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/246 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 17/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 140/386 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/396 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:49:51] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:49:51] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 2/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 210/606 variables, 150/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 137/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/606 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 421 constraints, problems are : Problem set: 0 solved, 1 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 632ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 36 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 26 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 20 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2025-06-01 01:49:51] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2025-06-01 01:49:51] [INFO ] Invariant cache hit.
[2025-06-01 01:49:51] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-01 01:49:51] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2025-06-01 01:49:51] [INFO ] Invariant cache hit.
[2025-06-01 01:49:51] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-01 01:49:52] [INFO ] Implicit Places using invariants and state equation in 609 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2025-06-01 01:49:52] [INFO ] Redundant transitions in 13 ms returned []
Running 960 sub problems to find dead transitions.
[2025-06-01 01:49:52] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2025-06-01 01:49:52] [INFO ] Invariant cache hit.
[2025-06-01 01:49:52] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 67 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 27 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 70 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 0 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 44 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:49:58] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:49:59] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:49:59] [INFO ] Deduced a trap composed of 45 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:49:59] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:00] [INFO ] Deduced a trap composed of 34 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:00] [INFO ] Deduced a trap composed of 49 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:50:00] [INFO ] Deduced a trap composed of 32 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:00] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:50:00] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:50:00] [INFO ] Deduced a trap composed of 41 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 47 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 49 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 13 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 53 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 49 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 38 places in 83 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:50:07] [INFO ] Deduced a trap composed of 60 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:50:07] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:50:07] [INFO ] Deduced a trap composed of 44 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 1 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 63 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 46 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 55 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 49 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:50:08] [INFO ] Deduced a trap composed of 45 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:09] [INFO ] Deduced a trap composed of 45 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:50:09] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:50:09] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:50:09] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:50:09] [INFO ] Deduced a trap composed of 66 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:50:09] [INFO ] Deduced a trap composed of 67 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:50:10] [INFO ] Deduced a trap composed of 66 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:50:10] [INFO ] Deduced a trap composed of 50 places in 91 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:50:10] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:50:13] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 48 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 43 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 38 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:50:14] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 45 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 46 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 39 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:50:15] [INFO ] Deduced a trap composed of 61 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:50:20] [INFO ] Deduced a trap composed of 21 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:50:20] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:50:20] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2025-06-01 01:50:20] [INFO ] Deduced a trap composed of 45 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:50:20] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:50:21] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:50:21] [INFO ] Deduced a trap composed of 55 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:50:21] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2025-06-01 01:50:21] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:50:21] [INFO ] Deduced a trap composed of 68 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:50:22] [INFO ] Deduced a trap composed of 49 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:50:22] [INFO ] Deduced a trap composed of 36 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:50:22] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:50:22] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:50:22] [INFO ] Deduced a trap composed of 46 places in 94 ms of which 1 ms to minimize.
SMT process timed out in 30407ms, After SMT, problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 30415ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31286 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 866 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 3 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 204 transition count 236
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 93 place count 158 transition count 236
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 223
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 125 place count 139 transition count 223
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 243 place count 80 transition count 164
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 2 with 28 rules applied. Total rules applied 271 place count 80 transition count 136
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 283 place count 74 transition count 136
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 289 place count 74 transition count 130
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 296 place count 74 transition count 123
Free-agglomeration rule applied 31 times.
Iterating global reduction 4 with 31 rules applied. Total rules applied 327 place count 74 transition count 92
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 4 with 31 rules applied. Total rules applied 358 place count 43 transition count 92
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 5 with 6 rules applied. Total rules applied 364 place count 43 transition count 92
Applied a total of 364 rules in 29 ms. Remains 43 /234 variables (removed 191) and now considering 92/966 (removed 874) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 92 rows 43 cols
[2025-06-01 01:50:22] [INFO ] Computed 13 invariants in 1 ms
[2025-06-01 01:50:22] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 01:50:22] [INFO ] After 21ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 01:50:22] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 01:50:22] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:50:22] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:50:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 01:50:22] [INFO ] After 20ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 01:50:22] [INFO ] After 3ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 01:50:22] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 01:50:22] [INFO ] After 60ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 142 ms.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 43 ms. (909 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 120699 steps, run visited all 1 properties in 570 ms. (steps per millisecond=211 )
Probabilistic random walk after 120699 steps, saw 67433 distinct states, run finished after 571 ms. (steps per millisecond=211 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 31834 steps, run visited all 1 properties in 141 ms. (steps per millisecond=225 )
Probabilistic random walk after 31834 steps, saw 21597 distinct states, run finished after 141 ms. (steps per millisecond=225 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 81275 steps, run visited all 1 properties in 350 ms. (steps per millisecond=232 )
Probabilistic random walk after 81275 steps, saw 49674 distinct states, run finished after 350 ms. (steps per millisecond=232 ) properties seen :1
RANDOM walk for 37524 steps (8 resets) in 157 ms. (237 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 42 ms. (930 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 600 steps, run visited all 1 properties in 6 ms. (steps per millisecond=100 )
Probabilistic random walk after 600 steps, saw 503 distinct states, run finished after 7 ms. (steps per millisecond=85 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 24883 steps, run visited all 1 properties in 110 ms. (steps per millisecond=226 )
Probabilistic random walk after 24883 steps, saw 17187 distinct states, run finished after 110 ms. (steps per millisecond=226 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 13375 steps, run visited all 1 properties in 61 ms. (steps per millisecond=219 )
Probabilistic random walk after 13375 steps, saw 9651 distinct states, run finished after 61 ms. (steps per millisecond=219 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7334 steps, run visited all 1 properties in 36 ms. (steps per millisecond=203 )
Probabilistic random walk after 7334 steps, saw 5414 distinct states, run finished after 36 ms. (steps per millisecond=203 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10512 steps, run visited all 1 properties in 47 ms. (steps per millisecond=223 )
Probabilistic random walk after 10512 steps, saw 7591 distinct states, run finished after 47 ms. (steps per millisecond=223 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 195 ms. (204 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 44 ms. (888 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 3113 steps, run visited all 1 properties in 16 ms. (steps per millisecond=194 )
Probabilistic random walk after 3113 steps, saw 2434 distinct states, run finished after 16 ms. (steps per millisecond=194 ) properties seen :1
RANDOM walk for 208 steps (0 resets) in 4 ms. (41 steps per ms) remains 0/1 properties
RANDOM walk for 547 steps (0 resets) in 7 ms. (68 steps per ms) remains 0/1 properties
RANDOM walk for 1050 steps (0 resets) in 9 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 1231 steps (0 resets) in 10 ms. (111 steps per ms) remains 0/1 properties
RANDOM walk for 1499 steps (0 resets) in 11 ms. (124 steps per ms) remains 0/1 properties
RANDOM walk for 610 steps (0 resets) in 7 ms. (76 steps per ms) remains 0/1 properties
RANDOM walk for 951 steps (0 resets) in 7 ms. (118 steps per ms) remains 0/1 properties
RANDOM walk for 1356 steps (0 resets) in 9 ms. (135 steps per ms) remains 0/1 properties
RANDOM walk for 1655 steps (0 resets) in 11 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 1977 steps (0 resets) in 12 ms. (152 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 728217 steps, run timeout after 3001 ms. (steps per millisecond=242 ) properties seen :0 out of 1
Probabilistic random walk after 728217 steps, saw 271495 distinct states, run finished after 3001 ms. (steps per millisecond=242 ) properties seen :0
[2025-06-01 01:50:27] [INFO ] Flow matrix only has 510 transitions (discarded 594 similar events)
// Phase 1: matrix 510 rows 257 cols
[2025-06-01 01:50:27] [INFO ] Computed 19 invariants in 20 ms
[2025-06-01 01:50:27] [INFO ] State equation strengthened by 279 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:28] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/128 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/184 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/274 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 17/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 159/433 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/443 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 324/767 variables, 169/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/767 variables, 232/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/767 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/767 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 767/767 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 287 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 257/257 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 39/40 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/42 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 86/128 variables, 42/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/184 variables, 6/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/184 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/184 variables, 28/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/274 variables, 40/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/274 variables, 17/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/274 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 159/433 variables, 10/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/433 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/443 variables, 5/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/443 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:28] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 0 ms to minimize.
[2025-06-01 01:50:28] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/443 variables, 2/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/443 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 324/767 variables, 169/327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/767 variables, 232/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:28] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:50:28] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/767 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/767 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/767 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 767/767 variables, and 561 constraints, problems are : Problem set: 0 solved, 1 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 257/257 constraints, ReadFeed: 279/279 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 861ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 1 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 1104/1104 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 234 transition count 966
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 234 transition count 966
Applied a total of 46 rules in 37 ms. Remains 234 /257 variables (removed 23) and now considering 966/1104 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 234/257 places, 966/1104 transitions.
RANDOM walk for 40000 steps (8 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 809277 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :0 out of 1
Probabilistic random walk after 809277 steps, saw 197121 distinct states, run finished after 3001 ms. (steps per millisecond=269 ) properties seen :0
[2025-06-01 01:50:31] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
// Phase 1: matrix 372 rows 234 cols
[2025-06-01 01:50:31] [INFO ] Computed 19 invariants in 4 ms
[2025-06-01 01:50:31] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/100 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/156 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/246 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 17/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 140/386 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/396 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 210/606 variables, 150/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/606 variables, 137/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/606 variables, 0/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 606/606 variables, and 418 constraints, problems are : Problem set: 0 solved, 1 unsolved in 223 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/38 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 62/100 variables, 38/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 2/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/100 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 56/156 variables, 6/50 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/156 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 90/246 variables, 40/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/246 variables, 17/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/246 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 140/386 variables, 10/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/386 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 10/396 variables, 5/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/396 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/396 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/396 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 210/606 variables, 150/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/606 variables, 137/420 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 39 places in 50 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/606 variables, 3/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/606 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/606 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 606/606 variables, and 423 constraints, problems are : Problem set: 0 solved, 1 unsolved in 548 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 234/234 constraints, ReadFeed: 164/164 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 791ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 234/234 places, 966/966 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 966/966 transitions.
Applied a total of 0 rules in 19 ms. Remains 234 /234 variables (removed 0) and now considering 966/966 (removed 0) transitions.
[2025-06-01 01:50:32] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2025-06-01 01:50:32] [INFO ] Invariant cache hit.
[2025-06-01 01:50:33] [INFO ] Implicit Places using invariants in 212 ms returned []
[2025-06-01 01:50:33] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2025-06-01 01:50:33] [INFO ] Invariant cache hit.
[2025-06-01 01:50:33] [INFO ] State equation strengthened by 164 read => feed constraints.
[2025-06-01 01:50:33] [INFO ] Implicit Places using invariants and state equation in 619 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2025-06-01 01:50:33] [INFO ] Redundant transitions in 11 ms returned []
Running 960 sub problems to find dead transitions.
[2025-06-01 01:50:33] [INFO ] Flow matrix only has 372 transitions (discarded 594 similar events)
[2025-06-01 01:50:33] [INFO ] Invariant cache hit.
[2025-06-01 01:50:33] [INFO ] State equation strengthened by 164 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 67 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 28 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 70 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 3 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 19 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 20/39 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:50:41] [INFO ] Deduced a trap composed of 54 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:50:41] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:50:41] [INFO ] Deduced a trap composed of 39 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:50:41] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:50:41] [INFO ] Deduced a trap composed of 49 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:50:42] [INFO ] Deduced a trap composed of 32 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:50:42] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:50:42] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:50:42] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:50:43] [INFO ] Deduced a trap composed of 32 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:50:43] [INFO ] Deduced a trap composed of 47 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:50:43] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:50:43] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2025-06-01 01:50:43] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 2 ms to minimize.
[2025-06-01 01:50:43] [INFO ] Deduced a trap composed of 33 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:50:44] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:50:44] [INFO ] Deduced a trap composed of 17 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:50:44] [INFO ] Deduced a trap composed of 53 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:50:44] [INFO ] Deduced a trap composed of 49 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:50:44] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 20/59 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:50:49] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:50:49] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:50:49] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:50:49] [INFO ] Deduced a trap composed of 56 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 63 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 46 places in 90 ms of which 2 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 45 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 45 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 33 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 37 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 46 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 67 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 38 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 19 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 46 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 35 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 42 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 48 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 43 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 53 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 39 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 21 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Deduced a trap composed of 46 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Deduced a trap composed of 39 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Deduced a trap composed of 61 places in 91 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:51:01] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:51:02] [INFO ] Deduced a trap composed of 21 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:51:02] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:51:02] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
[2025-06-01 01:51:02] [INFO ] Deduced a trap composed of 45 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:51:02] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 1 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 55 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:51:03] [INFO ] Deduced a trap composed of 68 places in 110 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 234/606 variables, and 110 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 960/960 constraints, Known Traps: 91/91 constraints]
Escalating to Integer solving :Problem set: 0 solved, 960 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/234 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/234 variables, 6/19 constraints. Problems are: Problem set: 0 solved, 960 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 91/110 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:51:09] [INFO ] Deduced a trap composed of 45 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:51:09] [INFO ] Deduced a trap composed of 52 places in 119 ms of which 1 ms to minimize.
[2025-06-01 01:51:09] [INFO ] Deduced a trap composed of 51 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:51:10] [INFO ] Deduced a trap composed of 44 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:51:10] [INFO ] Deduced a trap composed of 51 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:51:10] [INFO ] Deduced a trap composed of 53 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:51:10] [INFO ] Deduced a trap composed of 51 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:51:10] [INFO ] Deduced a trap composed of 60 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:51:11] [INFO ] Deduced a trap composed of 46 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:51:11] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:51:11] [INFO ] Deduced a trap composed of 45 places in 106 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 11/121 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:51:18] [INFO ] Deduced a trap composed of 58 places in 121 ms of which 1 ms to minimize.
[2025-06-01 01:51:18] [INFO ] Deduced a trap composed of 49 places in 117 ms of which 1 ms to minimize.
[2025-06-01 01:51:19] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:51:19] [INFO ] Deduced a trap composed of 84 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:51:19] [INFO ] Deduced a trap composed of 54 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:51:19] [INFO ] Deduced a trap composed of 83 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:51:19] [INFO ] Deduced a trap composed of 60 places in 99 ms of which 1 ms to minimize.
[2025-06-01 01:51:20] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 1 ms to minimize.
[2025-06-01 01:51:22] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 9/130 constraints. Problems are: Problem set: 0 solved, 960 unsolved
[2025-06-01 01:51:27] [INFO ] Deduced a trap composed of 52 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:51:27] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:51:27] [INFO ] Deduced a trap composed of 65 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:51:27] [INFO ] Deduced a trap composed of 52 places in 107 ms of which 1 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 49 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 61 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 62 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 68 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 60 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 59 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:51:28] [INFO ] Deduced a trap composed of 67 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:51:29] [INFO ] Deduced a trap composed of 50 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:51:29] [INFO ] Deduced a trap composed of 54 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:51:29] [INFO ] Deduced a trap composed of 73 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:51:29] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:51:29] [INFO ] Deduced a trap composed of 71 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:51:29] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:51:29] [INFO ] Deduced a trap composed of 63 places in 99 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 960 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 234/606 variables, and 150 constraints, problems are : Problem set: 0 solved, 960 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 0/234 constraints, ReadFeed: 0/164 constraints, PredecessorRefiner: 0/960 constraints, Known Traps: 131/131 constraints]
After SMT, in 60390ms problems are : Problem set: 0 solved, 960 unsolved
Search for dead transitions found 0 dead transitions in 60398ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61266 ms. Remains : 234/234 places, 966/966 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 880 edges and 234 vertex of which 36 / 234 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Drop transitions (Empty/Sink Transition effects.) removed 114 transitions
Ensure Unique test removed 570 transitions
Reduce isomorphic transitions removed 684 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 204 transition count 235
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 157 transition count 235
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 95 place count 157 transition count 222
Deduced a syphon composed of 13 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 127 place count 138 transition count 222
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 245 place count 79 transition count 163
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 275 place count 79 transition count 133
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 289 place count 72 transition count 152
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 295 place count 72 transition count 146
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 4 with 6 rules applied. Total rules applied 301 place count 72 transition count 140
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 326 place count 72 transition count 115
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 351 place count 47 transition count 115
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 5 with 10 rules applied. Total rules applied 361 place count 47 transition count 115
Applied a total of 361 rules in 24 ms. Remains 47 /234 variables (removed 187) and now considering 115/966 (removed 851) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 115 rows 47 cols
[2025-06-01 01:51:34] [INFO ] Computed 13 invariants in 0 ms
[2025-06-01 01:51:34] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2025-06-01 01:51:34] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 01:51:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 01:51:34] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:51:34] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:51:34] [INFO ] [Nat]Absence check using 13 positive place invariants in 3 ms returned sat
[2025-06-01 01:51:34] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 01:51:34] [INFO ] After 4ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 01:51:34] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 01:51:34] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 164 ms.
RANDOM walk for 1138 steps (0 resets) in 11 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 219 steps (0 resets) in 5 ms. (36 steps per ms) remains 0/1 properties
RANDOM walk for 472 steps (0 resets) in 7 ms. (59 steps per ms) remains 0/1 properties
RANDOM walk for 944 steps (0 resets) in 9 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 1100 steps (0 resets) in 9 ms. (110 steps per ms) remains 0/1 properties
RANDOM walk for 1626 steps (0 resets) in 10 ms. (147 steps per ms) remains 0/1 properties
RANDOM walk for 1851 steps (0 resets) in 11 ms. (154 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 187 ms. (212 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 9889 steps, run visited all 1 properties in 50 ms. (steps per millisecond=197 )
Probabilistic random walk after 9889 steps, saw 7106 distinct states, run finished after 50 ms. (steps per millisecond=197 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 148 ms. (268 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10092 steps, run visited all 1 properties in 49 ms. (steps per millisecond=205 )
Probabilistic random walk after 10092 steps, saw 7256 distinct states, run finished after 49 ms. (steps per millisecond=205 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10099 steps, run visited all 1 properties in 50 ms. (steps per millisecond=201 )
Probabilistic random walk after 10099 steps, saw 7262 distinct states, run finished after 51 ms. (steps per millisecond=198 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10106 steps, run visited all 1 properties in 67 ms. (steps per millisecond=150 )
Probabilistic random walk after 10106 steps, saw 7268 distinct states, run finished after 67 ms. (steps per millisecond=150 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11800 steps, run visited all 1 properties in 59 ms. (steps per millisecond=200 )
Probabilistic random walk after 11800 steps, saw 8525 distinct states, run finished after 59 ms. (steps per millisecond=200 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 147 ms. (270 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11779 steps, run visited all 1 properties in 64 ms. (steps per millisecond=184 )
Probabilistic random walk after 11779 steps, saw 8507 distinct states, run finished after 65 ms. (steps per millisecond=181 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11786 steps, run visited all 1 properties in 60 ms. (steps per millisecond=196 )
Probabilistic random walk after 11786 steps, saw 8513 distinct states, run finished after 60 ms. (steps per millisecond=196 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 144 ms. (275 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 11793 steps, run visited all 1 properties in 64 ms. (steps per millisecond=184 )
Probabilistic random walk after 11793 steps, saw 8519 distinct states, run finished after 64 ms. (steps per millisecond=184 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5031 steps, run visited all 1 properties in 28 ms. (steps per millisecond=179 )
Probabilistic random walk after 5031 steps, saw 3718 distinct states, run finished after 28 ms. (steps per millisecond=179 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5038 steps, run visited all 1 properties in 29 ms. (steps per millisecond=173 )
Probabilistic random walk after 5038 steps, saw 3724 distinct states, run finished after 30 ms. (steps per millisecond=167 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5017 steps, run visited all 1 properties in 27 ms. (steps per millisecond=185 )
Probabilistic random walk after 5017 steps, saw 3706 distinct states, run finished after 27 ms. (steps per millisecond=185 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 136 ms. (291 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 5024 steps, run visited all 1 properties in 30 ms. (steps per millisecond=167 )
Probabilistic random walk after 5024 steps, saw 3712 distinct states, run finished after 30 ms. (steps per millisecond=167 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1482 steps, run visited all 1 properties in 11 ms. (steps per millisecond=134 )
Probabilistic random walk after 1482 steps, saw 1177 distinct states, run finished after 11 ms. (steps per millisecond=134 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 142 ms. (279 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1489 steps, run visited all 1 properties in 12 ms. (steps per millisecond=124 )
Probabilistic random walk after 1489 steps, saw 1183 distinct states, run finished after 12 ms. (steps per millisecond=124 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1496 steps, run visited all 1 properties in 10 ms. (steps per millisecond=149 )
Probabilistic random walk after 1496 steps, saw 1189 distinct states, run finished after 11 ms. (steps per millisecond=136 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1475 steps, run visited all 1 properties in 13 ms. (steps per millisecond=113 )
Probabilistic random walk after 1475 steps, saw 1171 distinct states, run finished after 13 ms. (steps per millisecond=113 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 411 steps, run visited all 1 properties in 5 ms. (steps per millisecond=82 )
Probabilistic random walk after 411 steps, saw 345 distinct states, run finished after 5 ms. (steps per millisecond=82 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 418 steps, run visited all 1 properties in 9 ms. (steps per millisecond=46 )
Probabilistic random walk after 418 steps, saw 351 distinct states, run finished after 9 ms. (steps per millisecond=46 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 160 ms. (248 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 425 steps, run visited all 1 properties in 6 ms. (steps per millisecond=70 )
Probabilistic random walk after 425 steps, saw 357 distinct states, run finished after 6 ms. (steps per millisecond=70 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 158 ms. (251 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 432 steps, run visited all 1 properties in 7 ms. (steps per millisecond=61 )
Probabilistic random walk after 432 steps, saw 363 distinct states, run finished after 7 ms. (steps per millisecond=61 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 145 ms. (273 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 124 steps, run visited all 1 properties in 5 ms. (steps per millisecond=24 )
Probabilistic random walk after 124 steps, saw 109 distinct states, run finished after 5 ms. (steps per millisecond=24 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 135 ms. (294 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 131 steps, run visited all 1 properties in 5 ms. (steps per millisecond=26 )
Probabilistic random walk after 131 steps, saw 115 distinct states, run finished after 5 ms. (steps per millisecond=26 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 155 edges and 257 vertex of which 13 / 257 are part of one of the 6 SCC in 1 ms
Free SCC test removed 7 places
Drop transitions (Empty/Sink Transition effects.) removed 22 transitions
Ensure Unique test removed 596 transitions
Reduce isomorphic transitions removed 618 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 250 transition count 475
Reduce places removed 11 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 16 rules applied. Total rules applied 28 place count 239 transition count 470
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 33 place count 234 transition count 470
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 33 place count 234 transition count 468
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 37 place count 232 transition count 468
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 41 place count 230 transition count 466
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -106
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 53 place count 224 transition count 572
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 112 transitions.
Iterating post reduction 3 with 112 rules applied. Total rules applied 165 place count 224 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 4 with 57 rules applied. Total rules applied 222 place count 224 transition count 403
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 247 place count 224 transition count 378
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 4 with 25 rules applied. Total rules applied 272 place count 199 transition count 378
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 273 place count 199 transition count 378
Applied a total of 273 rules in 31 ms. Remains 199 /257 variables (removed 58) and now considering 378/1104 (removed 726) transitions.
Running SMT prover for 562 properties.
// Phase 1: matrix 378 rows 199 cols
[2025-06-01 01:51:36] [INFO ] Computed 19 invariants in 5 ms
[2025-06-01 01:51:38] [INFO ] [Real]Absence check using 13 positive place invariants in 6 ms returned sat
[2025-06-01 01:51:38] [INFO ] [Real]Absence check using 13 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-01 01:51:49] [INFO ] After 13376ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:562
[2025-06-01 01:51:51] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2025-06-01 01:51:51] [INFO ] [Nat]Absence check using 13 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-01 01:52:00] [INFO ] After 7083ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :562
TRAPS : Iteration 0
[2025-06-01 01:52:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 01:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 53 ms
[2025-06-01 01:52:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 01:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2025-06-01 01:52:01] [INFO ] Deduced a trap composed of 4 places in 26 ms of which 1 ms to minimize.
[2025-06-01 01:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 54 ms
[2025-06-01 01:52:01] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 01:52:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-01 01:52:03] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2025-06-01 01:52:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-01 01:52:10] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2025-06-01 01:52:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
TRAPS : Iteration 1
[2025-06-01 01:52:24] [INFO ] After 30793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :562
[2025-06-01 01:52:31] [INFO ] After 41470ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :562
Over-approximation ignoring read arcs solved 0 properties in 55105 ms.
Unable to solve all queries for examination QuasiLiveness. Remains :562 assertions to prove.
Starting structural reductions in LIVENESS mode, iteration 0 : 414/414 places, 1296/1296 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 414 transition count 1290
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 408 transition count 1290
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 12 place count 408 transition count 1176
Deduced a syphon composed of 114 places in 1 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 240 place count 294 transition count 1176
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 300 place count 264 transition count 1146
Applied a total of 300 rules in 18 ms. Remains 264 /414 variables (removed 150) and now considering 1146/1296 (removed 150) transitions.
[2025-06-01 01:52:31] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
// Phase 1: matrix 552 rows 264 cols
[2025-06-01 01:52:31] [INFO ] Computed 19 invariants in 4 ms
[2025-06-01 01:52:31] [INFO ] Implicit Places using invariants in 268 ms returned []
[2025-06-01 01:52:31] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2025-06-01 01:52:31] [INFO ] Invariant cache hit.
[2025-06-01 01:52:31] [INFO ] State equation strengthened by 314 read => feed constraints.
[2025-06-01 01:52:32] [INFO ] Implicit Places using invariants and state equation in 1046 ms returned []
Implicit Place search using SMT with State Equation took 1316 ms to find 0 implicit places.
Running 1140 sub problems to find dead transitions.
[2025-06-01 01:52:32] [INFO ] Flow matrix only has 552 transitions (discarded 594 similar events)
[2025-06-01 01:52:32] [INFO ] Invariant cache hit.
[2025-06-01 01:52:32] [INFO ] State equation strengthened by 314 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/264 variables, 264/264 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/264 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 3 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 38 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 51 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 69 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 67 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 59 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 59 places in 142 ms of which 1 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 41 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 69 places in 143 ms of which 1 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 46 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 64 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 76 places in 120 ms of which 1 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 73 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 43 places in 144 ms of which 1 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 64 places in 134 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/264 variables, 20/303 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:52:49] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:52:49] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:52:49] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:52:50] [INFO ] Deduced a trap composed of 73 places in 124 ms of which 2 ms to minimize.
[2025-06-01 01:52:50] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:52:50] [INFO ] Deduced a trap composed of 47 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:52:50] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:52:50] [INFO ] Deduced a trap composed of 44 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 45 places in 128 ms of which 1 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 23 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 67 places in 103 ms of which 2 ms to minimize.
[2025-06-01 01:52:51] [INFO ] Deduced a trap composed of 13 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:52:52] [INFO ] Deduced a trap composed of 17 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:52:52] [INFO ] Deduced a trap composed of 73 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:52:52] [INFO ] Deduced a trap composed of 68 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:52:52] [INFO ] Deduced a trap composed of 77 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/264 variables, 20/323 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 72 places in 125 ms of which 1 ms to minimize.
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 82 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 66 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 49 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 38 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 65 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 49 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 53 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 64 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:52:59] [INFO ] Deduced a trap composed of 75 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:52:59] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:52:59] [INFO ] Deduced a trap composed of 67 places in 110 ms of which 2 ms to minimize.
[2025-06-01 01:53:00] [INFO ] Deduced a trap composed of 41 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:53:00] [INFO ] Deduced a trap composed of 52 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:53:00] [INFO ] Deduced a trap composed of 49 places in 137 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/264 variables, 20/343 constraints. Problems are: Problem set: 0 solved, 1140 unsolved
[2025-06-01 01:53:02] [INFO ] Deduced a trap composed of 73 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:53:03] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 1 ms to minimize.
SMT process timed out in 30519ms, After SMT, problems are : Problem set: 0 solved, 1140 unsolved
Search for dead transitions found 0 dead transitions in 30528ms
Starting structural reductions in LIVENESS mode, iteration 1 : 264/414 places, 1146/1296 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 31865 ms. Remains : 264/414 places, 1146/1296 transitions.
Unable to solve all queries for examination Liveness. Remains :1146 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 1146 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1432944 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-06

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 414
TRANSITIONS: 1296
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 5976
NUPN UNITS: 15
LOADING TIME: 0.704

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.051
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.05
OK.
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 8346
MODEL NAME: /home/mcc/execution/model
414 places, 1296 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

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="EisenbergMcGuire-PT-06"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 EisenbergMcGuire-PT-06, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080700489"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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