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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.6M
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K 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 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K 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 1.2M 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 1748741608921

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-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:33:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:33:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:33:30] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2025-06-01 01:33:30] [INFO ] Transformed 553 places.
[2025-06-01 01:33:30] [INFO ] Transformed 1960 transitions.
[2025-06-01 01:33:30] [INFO ] Found NUPN structural information;
[2025-06-01 01:33:30] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 312 ms.
Built sparse matrix representations for Structural reductions in 13 ms.29344KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 553/553 places, 1960/1960 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 128 ms. Remains 553 /553 variables (removed 0) and now considering 1960/1960 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 142 ms. Remains : 553/553 places, 1960/1960 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 553/553 places, 1960/1960 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 83 ms. Remains 553 /553 variables (removed 0) and now considering 1960/1960 (removed 0) transitions.
[2025-06-01 01:33:31] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2025-06-01 01:33:31] [INFO ] Computed 22 invariants in 24 ms
[2025-06-01 01:33:31] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-01 01:33:31] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2025-06-01 01:33:31] [INFO ] Invariant cache hit.
[2025-06-01 01:33:31] [INFO ] State equation strengthened by 472 read => feed constraints.
[2025-06-01 01:33:31] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 879 ms to find 0 implicit places.
[2025-06-01 01:33:32] [INFO ] Redundant transitions in 141 ms returned []
Running 1953 sub problems to find dead transitions.
[2025-06-01 01:33:32] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2025-06-01 01:33:32] [INFO ] Invariant cache hit.
[2025-06-01 01:33:32] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 553/553 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 15/568 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 7/575 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
[2025-06-01 01:33:49] [INFO ] Deduced a trap composed of 59 places in 218 ms of which 44 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 41 places in 182 ms of which 3 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 2 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 26 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:33:50] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 3 ms to minimize.
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 97 places in 230 ms of which 3 ms to minimize.
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 73 places in 177 ms of which 3 ms to minimize.
[2025-06-01 01:33:51] [INFO ] Deduced a trap composed of 56 places in 218 ms of which 3 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 3 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 165 places in 227 ms of which 2 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 23 places in 257 ms of which 4 ms to minimize.
[2025-06-01 01:33:52] [INFO ] Deduced a trap composed of 77 places in 222 ms of which 3 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 32 places in 218 ms of which 3 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 38 places in 218 ms of which 3 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 113 places in 211 ms of which 3 ms to minimize.
[2025-06-01 01:33:53] [INFO ] Deduced a trap composed of 125 places in 240 ms of which 3 ms to minimize.
[2025-06-01 01:33:54] [INFO ] Deduced a trap composed of 70 places in 232 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 20/595 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 553/1554 variables, and 595 constraints, problems are : Problem set: 0 solved, 1953 unsolved in 30053 ms.
Refiners :[Domain max(s): 553/553 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/553 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 1953/1953 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1953 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/553 variables, 553/553 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/553 variables, 15/568 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/553 variables, 7/575 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/553 variables, 20/595 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
[2025-06-01 01:34:05] [INFO ] Deduced a trap composed of 3 places in 237 ms of which 3 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 34 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 3 places in 228 ms of which 3 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 3 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 3 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:34:06] [INFO ] Deduced a trap composed of 32 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 73 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 96 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 126 places in 182 ms of which 3 ms to minimize.
[2025-06-01 01:34:07] [INFO ] Deduced a trap composed of 26 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:34:08] [INFO ] Deduced a trap composed of 21 places in 169 ms of which 3 ms to minimize.
[2025-06-01 01:34:09] [INFO ] Deduced a trap composed of 56 places in 277 ms of which 4 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 99 places in 232 ms of which 3 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 103 places in 215 ms of which 3 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 102 places in 215 ms of which 3 ms to minimize.
[2025-06-01 01:34:10] [INFO ] Deduced a trap composed of 86 places in 234 ms of which 3 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 88 places in 211 ms of which 3 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 120 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:34:11] [INFO ] Deduced a trap composed of 28 places in 213 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/553 variables, 20/615 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:34:12] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 96 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 3 ms to minimize.
[2025-06-01 01:34:13] [INFO ] Deduced a trap composed of 101 places in 157 ms of which 3 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 146 places in 231 ms of which 3 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 112 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:34:15] [INFO ] Deduced a trap composed of 103 places in 207 ms of which 3 ms to minimize.
[2025-06-01 01:34:16] [INFO ] Deduced a trap composed of 137 places in 201 ms of which 3 ms to minimize.
[2025-06-01 01:34:16] [INFO ] Deduced a trap composed of 102 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:34:16] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:34:16] [INFO ] Deduced a trap composed of 121 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:34:17] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:34:17] [INFO ] Deduced a trap composed of 29 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:34:17] [INFO ] Deduced a trap composed of 14 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:34:17] [INFO ] Deduced a trap composed of 62 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:34:19] [INFO ] Deduced a trap composed of 149 places in 210 ms of which 4 ms to minimize.
[2025-06-01 01:34:19] [INFO ] Deduced a trap composed of 63 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:34:19] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:34:19] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/553 variables, 20/635 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
[2025-06-01 01:34:21] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:34:21] [INFO ] Deduced a trap composed of 119 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 83 places in 224 ms of which 3 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 101 places in 229 ms of which 3 ms to minimize.
[2025-06-01 01:34:23] [INFO ] Deduced a trap composed of 106 places in 230 ms of which 3 ms to minimize.
[2025-06-01 01:34:24] [INFO ] Deduced a trap composed of 98 places in 231 ms of which 3 ms to minimize.
[2025-06-01 01:34:24] [INFO ] Deduced a trap composed of 104 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:34:24] [INFO ] Deduced a trap composed of 115 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:34:24] [INFO ] Deduced a trap composed of 85 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:34:24] [INFO ] Deduced a trap composed of 89 places in 173 ms of which 3 ms to minimize.
[2025-06-01 01:34:25] [INFO ] Deduced a trap composed of 118 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:34:25] [INFO ] Deduced a trap composed of 78 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:34:25] [INFO ] Deduced a trap composed of 147 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:34:25] [INFO ] Deduced a trap composed of 142 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:34:26] [INFO ] Deduced a trap composed of 23 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:34:26] [INFO ] Deduced a trap composed of 158 places in 231 ms of which 3 ms to minimize.
[2025-06-01 01:34:26] [INFO ] Deduced a trap composed of 159 places in 225 ms of which 3 ms to minimize.
[2025-06-01 01:34:26] [INFO ] Deduced a trap composed of 138 places in 206 ms of which 3 ms to minimize.
[2025-06-01 01:34:27] [INFO ] Deduced a trap composed of 138 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:34:27] [INFO ] Deduced a trap composed of 125 places in 210 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/553 variables, 20/655 constraints. Problems are: Problem set: 0 solved, 1953 unsolved
[2025-06-01 01:34:29] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 95 places in 218 ms of which 3 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 76 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:34:31] [INFO ] Deduced a trap composed of 98 places in 182 ms of which 3 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 108 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 114 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:34:32] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 3 ms to minimize.
[2025-06-01 01:34:33] [INFO ] Deduced a trap composed of 118 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:34:33] [INFO ] Deduced a trap composed of 77 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:34:33] [INFO ] Deduced a trap composed of 122 places in 206 ms of which 3 ms to minimize.
SMT process timed out in 61247ms, After SMT, problems are : Problem set: 0 solved, 1953 unsolved
Search for dead transitions found 0 dead transitions in 61283ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 62423 ms. Remains : 553/553 places, 1960/1960 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3215 ms (no deadlock found). (steps per millisecond=388 )
Random directed walk for 1250006 steps, including 0 resets, run took 3025 ms (no deadlock found). (steps per millisecond=413 )
[2025-06-01 01:34:39] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
[2025-06-01 01:34:39] [INFO ] Invariant cache hit.
[2025-06-01 01:34:40] [INFO ] [Real]Absence check using 15 positive place invariants in 15 ms returned sat
[2025-06-01 01:34:40] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 56 ms returned sat
[2025-06-01 01:34:40] [INFO ] [Real]Absence check using state equation in 748 ms returned sat
[2025-06-01 01:34:40] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 01:34:41] [INFO ] [Nat]Absence check using 15 positive place invariants in 14 ms returned sat
[2025-06-01 01:34:41] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 30 ms returned sat
[2025-06-01 01:34:42] [INFO ] [Nat]Absence check using state equation in 738 ms returned sat
[2025-06-01 01:34:42] [INFO ] State equation strengthened by 472 read => feed constraints.
[2025-06-01 01:34:42] [INFO ] [Nat]Added 472 Read/Feed constraints in 95 ms returned sat
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 84 places in 264 ms of which 4 ms to minimize.
[2025-06-01 01:34:42] [INFO ] Deduced a trap composed of 94 places in 257 ms of which 3 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 90 places in 263 ms of which 3 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 3 places in 250 ms of which 3 ms to minimize.
[2025-06-01 01:34:43] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 3 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 3 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 3 ms to minimize.
[2025-06-01 01:34:44] [INFO ] Deduced a trap composed of 3 places in 244 ms of which 3 ms to minimize.
[2025-06-01 01:34:45] [INFO ] Deduced a trap composed of 61 places in 254 ms of which 3 ms to minimize.
[2025-06-01 01:34:45] [INFO ] Deduced a trap composed of 108 places in 259 ms of which 3 ms to minimize.
[2025-06-01 01:34:45] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 3 ms to minimize.
[2025-06-01 01:34:45] [INFO ] Deduced a trap composed of 35 places in 250 ms of which 3 ms to minimize.
[2025-06-01 01:34:46] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 4 ms to minimize.
[2025-06-01 01:34:46] [INFO ] Deduced a trap composed of 122 places in 264 ms of which 3 ms to minimize.
[2025-06-01 01:34:46] [INFO ] Deduced a trap composed of 3 places in 253 ms of which 3 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 32 places in 262 ms of which 3 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 31 places in 259 ms of which 3 ms to minimize.
[2025-06-01 01:34:47] [INFO ] Deduced a trap composed of 70 places in 250 ms of which 3 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 86 places in 251 ms of which 3 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Deduced a trap composed of 3 places in 246 ms of which 3 ms to minimize.
[2025-06-01 01:34:48] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 20 trap constraints in 6230 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 14 place count 546 transition count 1799
Deduced a syphon composed of 154 places in 3 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 322 place count 392 transition count 1799
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 350 transition count 1757
Applied a total of 406 rules in 91 ms. Remains 350 /553 variables (removed 203) and now considering 1757/1960 (removed 203) transitions.
[2025-06-01 01:34:48] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
// Phase 1: matrix 798 rows 350 cols
[2025-06-01 01:34:48] [INFO ] Computed 22 invariants in 5 ms
[2025-06-01 01:34:48] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-06-01 01:34:48] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:34:48] [INFO ] Invariant cache hit.
[2025-06-01 01:34:49] [INFO ] State equation strengthened by 472 read => feed constraints.
[2025-06-01 01:34:50] [INFO ] Implicit Places using invariants and state equation in 1909 ms returned []
Implicit Place search using SMT with State Equation took 2269 ms to find 0 implicit places.
Running 1750 sub problems to find dead transitions.
[2025-06-01 01:34:50] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:34:50] [INFO ] Invariant cache hit.
[2025-06-01 01:34:50] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 3 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:35:02] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 46 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:35:03] [INFO ] Deduced a trap composed of 71 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:35:06] [INFO ] Deduced a trap composed of 119 places in 201 ms of which 3 ms to minimize.
[2025-06-01 01:35:06] [INFO ] Deduced a trap composed of 74 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:35:06] [INFO ] Deduced a trap composed of 92 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 87 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 68 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:35:07] [INFO ] Deduced a trap composed of 65 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:35:08] [INFO ] Deduced a trap composed of 107 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:35:08] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:35:08] [INFO ] Deduced a trap composed of 75 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:35:08] [INFO ] Deduced a trap composed of 74 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:35:08] [INFO ] Deduced a trap composed of 78 places in 201 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 392 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30042 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 1750/1750 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1750 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/350 variables, 350/350 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/350 variables, 15/365 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 94 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 80 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 82 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:35:27] [INFO ] Deduced a trap composed of 91 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:35:28] [INFO ] Deduced a trap composed of 96 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:35:28] [INFO ] Deduced a trap composed of 63 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:35:28] [INFO ] Deduced a trap composed of 79 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:35:28] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 83 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 46 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 83 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 83 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:35:29] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:35:30] [INFO ] Deduced a trap composed of 86 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:35:31] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:35:35] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:35:35] [INFO ] Deduced a trap composed of 91 places in 209 ms of which 2 ms to minimize.
[2025-06-01 01:35:36] [INFO ] Deduced a trap composed of 81 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:35:36] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:35:36] [INFO ] Deduced a trap composed of 82 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:35:36] [INFO ] Deduced a trap composed of 66 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:35:37] [INFO ] Deduced a trap composed of 85 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:35:37] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:35:37] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:35:37] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 61 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 73 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 67 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:35:38] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 76 places in 231 ms of which 2 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 89 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:35:39] [INFO ] Deduced a trap composed of 77 places in 251 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 85 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 88 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 75 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 77 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:35:45] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 65 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 75 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:35:46] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 66 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:35:47] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:35:48] [INFO ] Deduced a trap composed of 81 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:35:48] [INFO ] Deduced a trap composed of 94 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:35:48] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:35:48] [INFO ] Deduced a trap composed of 83 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:35:48] [INFO ] Deduced a trap composed of 86 places in 207 ms of which 3 ms to minimize.
[2025-06-01 01:35:49] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 1750 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 350/1148 variables, and 452 constraints, problems are : Problem set: 0 solved, 1750 unsolved in 30055 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 0/1750 constraints, Known Traps: 80/80 constraints]
After SMT, in 60979ms problems are : Problem set: 0 solved, 1750 unsolved
Search for dead transitions found 0 dead transitions in 60999ms
Starting structural reductions in LIVENESS mode, iteration 1 : 350/553 places, 1757/1960 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 63370 ms. Remains : 350/553 places, 1757/1960 transitions.
Initial state reduction rules removed 7 formulas.
RANDOM walk for 40000 steps (8 resets) in 6461 ms. (6 steps per ms) remains 1389/1750 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 29 ms. (4 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 38 ms. (3 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 22 ms. (5 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 24 ms. (4 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 20 ms. (5 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1389/1389 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1389/1389 properties
[2025-06-01 01:35:53] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:35:53] [INFO ] Invariant cache hit.
[2025-06-01 01:35:53] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/259 variables, 259/259 constraints. Problems are: Problem set: 0 solved, 1389 unsolved
SMT process timed out in 5742ms, After SMT, problems are : Problem set: 0 solved, 1389 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 259 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Applied a total of 0 rules in 54 ms. Remains 350 /350 variables (removed 0) and now considering 1757/1757 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 350/350 places, 1757/1757 transitions.
RANDOM walk for 1924567 steps (4 resets) in 120004 ms. (16 steps per ms) remains 1366/1389 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 1366/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1364/1366 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1364/1364 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1364/1364 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1363/1364 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1362/1363 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1361/1362 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1361/1361 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1361/1361 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1358/1361 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1358/1358 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 1354/1358 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 1354/1354 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1354/1354 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 1354/1354 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1352/1354 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1352/1352 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1352/1352 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 1351/1352 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1351/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 1350/1351 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1350/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1349/1350 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1349/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1348/1349 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1348/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1347/1348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1347/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1346/1347 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1346/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1346 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1344/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1343/1344 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1343/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1342/1343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1342/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1342/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1342 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1341/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1339/1341 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1339/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1337/1339 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1337/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1334/1337 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1334/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1334 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1333/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1332/1333 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1332/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1332 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1330/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1329/1330 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1329/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1329 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1328/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1328 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1327/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1326/1327 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1326/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1325/1326 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1325/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1324/1325 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1324/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1324 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1322/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1321/1322 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1321/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1321 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 1319/1319 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 1319/1319 properties
Probabilistic random walk after 1000000 steps, saw 578750 distinct states, run finished after 40041 ms. (steps per millisecond=24 ) properties seen :344
[2025-06-01 01:37:13] [INFO ] Flow matrix only has 798 transitions (discarded 959 similar events)
[2025-06-01 01:37:13] [INFO ] Invariant cache hit.
[2025-06-01 01:37:13] [INFO ] State equation strengthened by 472 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 3 (OVERLAPS) 179/350 variables, 14/186 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:37:28] [INFO ] Deduced a trap composed of 19 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:37:28] [INFO ] Deduced a trap composed of 32 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:37:28] [INFO ] Deduced a trap composed of 18 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:37:28] [INFO ] Deduced a trap composed of 27 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:37:28] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 85 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 3 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:37:29] [INFO ] Deduced a trap composed of 77 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 23 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 57 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 73 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:37:30] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 70 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:37:31] [INFO ] Deduced a trap composed of 95 places in 196 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 20/392 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 105 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 54 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 118 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 21 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:37:38] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:37:39] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:37:39] [INFO ] Deduced a trap composed of 69 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:37:39] [INFO ] Deduced a trap composed of 91 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:37:39] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:37:39] [INFO ] Deduced a trap composed of 101 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:37:40] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:37:40] [INFO ] Deduced a trap composed of 81 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:37:40] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:37:40] [INFO ] Deduced a trap composed of 97 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:37:40] [INFO ] Deduced a trap composed of 105 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:37:40] [INFO ] Deduced a trap composed of 91 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 3 places in 174 ms of which 3 ms to minimize.
[2025-06-01 01:37:41] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 20/412 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:37:42] [INFO ] Deduced a trap composed of 3 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:37:42] [INFO ] Deduced a trap composed of 70 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:37:42] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 77 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:37:43] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:37:44] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:37:44] [INFO ] Deduced a trap composed of 103 places in 199 ms of which 3 ms to minimize.
[2025-06-01 01:37:45] [INFO ] Deduced a trap composed of 101 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:37:45] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 3 ms to minimize.
[2025-06-01 01:37:45] [INFO ] Deduced a trap composed of 86 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:37:45] [INFO ] Deduced a trap composed of 77 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:37:46] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 4 ms to minimize.
[2025-06-01 01:37:46] [INFO ] Deduced a trap composed of 77 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:37:46] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:37:46] [INFO ] Deduced a trap composed of 61 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:37:46] [INFO ] Deduced a trap composed of 129 places in 189 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 20/432 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:37:48] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 72 places in 173 ms of which 3 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 91 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 82 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:37:49] [INFO ] Deduced a trap composed of 80 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 87 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 70 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 67 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:37:50] [INFO ] Deduced a trap composed of 66 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 101 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 101 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:37:51] [INFO ] Deduced a trap composed of 111 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 99 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 84 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 92 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:37:52] [INFO ] Deduced a trap composed of 77 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 84 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:37:53] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 (/ 1.0 2.0))
(s23 0.0)
(s24 (/ 1.0 2.0))
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 (/ 1.0 2.0))
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 20/452 constraints. Problems are: Problem set: 0 solved, 975 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 350/1148 variables, and 452 constraints, problems are : Problem set: 0 solved, 975 unsolved in 45023 ms.
Refiners :[Domain max(s): 350/350 constraints, Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/350 constraints, ReadFeed: 0/472 constraints, PredecessorRefiner: 975/975 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 975 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/171 variables, 171/171 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/171 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/171 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 3 (OVERLAPS) 179/350 variables, 14/186 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 179/365 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 975 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 80/452 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:38:05] [INFO ] Deduced a trap composed of 70 places in 201 ms of which 3 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 104 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:38:06] [INFO ] Deduced a trap composed of 91 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 75 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:38:07] [INFO ] Deduced a trap composed of 3 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 75 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:38:08] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 102 places in 216 ms of which 2 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 89 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:38:09] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:38:10] [INFO ] Deduced a trap composed of 86 places in 202 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/350 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:38:12] [INFO ] Deduced a trap composed of 77 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:38:13] [INFO ] Deduced a trap composed of 101 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:38:13] [INFO ] Deduced a trap composed of 88 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:38:13] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 2 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 65 places in 162 ms of which 1 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:38:14] [INFO ] Deduced a trap composed of 79 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 52 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 45 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:38:15] [INFO ] Deduced a trap composed of 60 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 47 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 88 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 50 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:38:16] [INFO ] Deduced a trap composed of 59 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:17] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/350 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:38:19] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 60 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 111 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:38:20] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 109 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 122 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:38:21] [INFO ] Deduced a trap composed of 103 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:38:22] [INFO ] Deduced a trap composed of 99 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:38:22] [INFO ] Deduced a trap composed of 120 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:38:22] [INFO ] Deduced a trap composed of 71 places in 207 ms of which 3 ms to minimize.
[2025-06-01 01:38:22] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:38:23] [INFO ] Deduced a trap composed of 91 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:38:23] [INFO ] Deduced a trap composed of 87 places in 211 ms of which 2 ms to minimize.
[2025-06-01 01:38:23] [INFO ] Deduced a trap composed of 93 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:38:23] [INFO ] Deduced a trap composed of 109 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 91 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 85 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:38:24] [INFO ] Deduced a trap composed of 4 places in 180 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/350 variables, 20/512 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:38:27] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:38:28] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:38:28] [INFO ] Deduced a trap composed of 111 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:38:28] [INFO ] Deduced a trap composed of 80 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 110 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 70 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 51 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:38:29] [INFO ] Deduced a trap composed of 68 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:30] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:38:30] [INFO ] Deduced a trap composed of 46 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:38:30] [INFO ] Deduced a trap composed of 54 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:38:30] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:38:30] [INFO ] Deduced a trap composed of 83 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:38:31] [INFO ] Deduced a trap composed of 33 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:38:31] [INFO ] Deduced a trap composed of 56 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:38:31] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:38:31] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:38:32] [INFO ] Deduced a trap composed of 71 places in 210 ms of which 2 ms to minimize.
[2025-06-01 01:38:32] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/350 variables, 20/532 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 31 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 109 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:38:34] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 71 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 88 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 70 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:38:35] [INFO ] Deduced a trap composed of 85 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 80 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 101 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:38:36] [INFO ] Deduced a trap composed of 89 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 95 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:38:37] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:38:38] [INFO ] Deduced a trap composed of 79 places in 184 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 20/552 constraints. Problems are: Problem set: 0 solved, 975 unsolved
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 55 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 60 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:38:41] [INFO ] Deduced a trap composed of 60 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:38:42] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 3 ms to minimize.
[2025-06-01 01:38:42] [INFO ] Deduced a trap composed of 57 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:38:42] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:38:42] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 21 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 51 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 18 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 52 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:38:43] [INFO ] Deduced a trap composed of 36 places in 174 ms of which 3 ms to minimize.
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 54 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 45 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 44 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:38:44] [INFO ] Deduced a trap composed of 98 places in 162 ms of which 2 ms to minimize.
SMT process timed out in 90696ms, After SMT, problems are : Problem set: 0 solved, 975 unsolved
Fused 975 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 171 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1757/1757 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 342 transition count 1701
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 342 transition count 1701
Applied a total of 16 rules in 64 ms. Remains 342 /350 variables (removed 8) and now considering 1701/1757 (removed 56) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 342/350 places, 1701/1757 transitions.
RANDOM walk for 2542073 steps (4 resets) in 120004 ms. (21 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 975/975 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 975/975 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 36433 ms. (steps per millisecond=27 ) properties seen :22
[2025-06-01 01:39:51] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 01:39:51] [INFO ] Computed 22 invariants in 3 ms
[2025-06-01 01:39:51] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:05] [INFO ] Deduced a trap composed of 50 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:40:05] [INFO ] Deduced a trap composed of 17 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:40:05] [INFO ] Deduced a trap composed of 19 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 21 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 112 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 108 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 73 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:06] [INFO ] Deduced a trap composed of 23 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 74 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 4 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 15 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:40:07] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 87 places in 151 ms of which 1 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 97 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 112 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:40:08] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:09] [INFO ] Deduced a trap composed of 3 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:40:09] [INFO ] Deduced a trap composed of 72 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:40:09] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:09] [INFO ] Deduced a trap composed of 73 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 70 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 97 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:40:10] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:40:11] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:11] [INFO ] Deduced a trap composed of 27 places in 89 ms of which 1 ms to minimize.
[2025-06-01 01:40:12] [INFO ] Deduced a trap composed of 96 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:40:12] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:40:12] [INFO ] Deduced a trap composed of 70 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:40:12] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:40:12] [INFO ] Deduced a trap composed of 79 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 67 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 77 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:40:13] [INFO ] Deduced a trap composed of 105 places in 190 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 30 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 31 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:40:14] [INFO ] Deduced a trap composed of 93 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 3 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 85 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 24 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 69 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:40:15] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:16] [INFO ] Deduced a trap composed of 28 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:40:16] [INFO ] Deduced a trap composed of 90 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:40:16] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:40:16] [INFO ] Deduced a trap composed of 74 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:40:16] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 78 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 90 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:40:17] [INFO ] Deduced a trap composed of 24 places in 184 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:23] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 3 ms to minimize.
[2025-06-01 01:40:23] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:40:24] [INFO ] Deduced a trap composed of 66 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 90 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 60 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 27 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 97 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:40:25] [INFO ] Deduced a trap composed of 95 places in 185 ms of which 7 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 86 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:26] [INFO ] Deduced a trap composed of 57 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 85 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:40:27] [INFO ] Deduced a trap composed of 101 places in 184 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 64 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:40:28] [INFO ] Deduced a trap composed of 3 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 5 ms to minimize.
[2025-06-01 01:40:29] [INFO ] Deduced a trap composed of 94 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:40:30] [INFO ] Deduced a trap composed of 62 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:31] [INFO ] Deduced a trap composed of 74 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 30 places in 174 ms of which 3 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:40:32] [INFO ] Deduced a trap composed of 94 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 75 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:40:33] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:34] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 84 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 89 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:35] [INFO ] Deduced a trap composed of 81 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 92 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 94 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 115 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:40:36] [INFO ] Deduced a trap composed of 100 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 99 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 100 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 66 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 85 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:40:37] [INFO ] Deduced a trap composed of 78 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 93 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 86 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 93 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:38] [INFO ] Deduced a trap composed of 91 places in 158 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 88 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 72 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 66 places in 167 ms of which 4 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 80 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:40:47] [INFO ] Deduced a trap composed of 63 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:40:48] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:40:48] [INFO ] Deduced a trap composed of 72 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:40:48] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:40:48] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:40:48] [INFO ] Deduced a trap composed of 60 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:40:49] [INFO ] Deduced a trap composed of 58 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:40:49] [INFO ] Deduced a trap composed of 84 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:40:49] [INFO ] Deduced a trap composed of 104 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:40:49] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 65 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 88 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 2 ms to minimize.
[2025-06-01 01:40:50] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:40:51] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 107 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 86 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 69 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:40:52] [INFO ] Deduced a trap composed of 69 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:40:54] [INFO ] Deduced a trap composed of 101 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:40:54] [INFO ] Deduced a trap composed of 86 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:40:54] [INFO ] Deduced a trap composed of 48 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:40:55] [INFO ] Deduced a trap composed of 68 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:40:55] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:40:55] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 106 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:40:56] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 90 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 86 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:40:57] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:40:59] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:41:00] [INFO ] Deduced a trap composed of 78 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:41:00] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 69 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:41:01] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:41:02] [INFO ] Deduced a trap composed of 83 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:41:02] [INFO ] Deduced a trap composed of 83 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:41:02] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:41:02] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 85 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:41:03] [INFO ] Deduced a trap composed of 78 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:41:04] [INFO ] Deduced a trap composed of 56 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:41:04] [INFO ] Deduced a trap composed of 97 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:41:04] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 202 constraints, problems are : Problem set: 0 solved, 953 unsolved in 75026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 953/953 constraints, Known Traps: 180/180 constraints]
Escalating to Integer solving :Problem set: 0 solved, 953 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 953 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 180/202 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 100 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 78 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 110 places in 140 ms of which 1 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:41:14] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 48 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 99 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:41:15] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 82 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 75 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:41:16] [INFO ] Deduced a trap composed of 68 places in 183 ms of which 4 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:41:17] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:41:18] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:41:18] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:41:21] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 56 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 122 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 88 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:41:22] [INFO ] Deduced a trap composed of 48 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 72 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 67 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:41:23] [INFO ] Deduced a trap composed of 89 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 3 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:41:24] [INFO ] Deduced a trap composed of 87 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:41:25] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:41:27] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:41:27] [INFO ] Deduced a trap composed of 116 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:41:27] [INFO ] Deduced a trap composed of 75 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:41:27] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:41:28] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:41:28] [INFO ] Deduced a trap composed of 86 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:41:28] [INFO ] Deduced a trap composed of 99 places in 151 ms of which 1 ms to minimize.
[2025-06-01 01:41:28] [INFO ] Deduced a trap composed of 98 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:41:29] [INFO ] Deduced a trap composed of 85 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:41:30] [INFO ] Deduced a trap composed of 15 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:41:30] [INFO ] Deduced a trap composed of 13 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:41:31] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:41:31] [INFO ] Deduced a trap composed of 64 places in 160 ms of which 1 ms to minimize.
[2025-06-01 01:41:31] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:41:32] [INFO ] Deduced a trap composed of 85 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:41:32] [INFO ] Deduced a trap composed of 83 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:41:32] [INFO ] Deduced a trap composed of 92 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:41:32] [INFO ] Deduced a trap composed of 90 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:41:33] [INFO ] Deduced a trap composed of 142 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:41:33] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 90 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 82 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:41:36] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 84 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 69 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 59 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:41:37] [INFO ] Deduced a trap composed of 64 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 100 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:41:38] [INFO ] Deduced a trap composed of 65 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 78 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 53 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:41:39] [INFO ] Deduced a trap composed of 50 places in 161 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:41:41] [INFO ] Deduced a trap composed of 93 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:41:42] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 1 ms to minimize.
[2025-06-01 01:41:42] [INFO ] Deduced a trap composed of 73 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:41:42] [INFO ] Deduced a trap composed of 41 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:41:42] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:41:43] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:41:43] [INFO ] Deduced a trap composed of 47 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:41:43] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:41:43] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:41:43] [INFO ] Deduced a trap composed of 45 places in 144 ms of which 1 ms to minimize.
[2025-06-01 01:41:43] [INFO ] Deduced a trap composed of 62 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:41:44] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:41:44] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:41:44] [INFO ] Deduced a trap composed of 51 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:41:44] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:41:45] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:41:45] [INFO ] Deduced a trap composed of 58 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:41:46] [INFO ] Deduced a trap composed of 43 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:41:47] [INFO ] Deduced a trap composed of 77 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:41:47] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:41:50] [INFO ] Deduced a trap composed of 95 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:41:51] [INFO ] Deduced a trap composed of 79 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:41:51] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:41:52] [INFO ] Deduced a trap composed of 51 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:41:53] [INFO ] Deduced a trap composed of 23 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 94 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:41:55] [INFO ] Deduced a trap composed of 68 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:41:56] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:41:56] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:41:57] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:41:57] [INFO ] Deduced a trap composed of 69 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:41:58] [INFO ] Deduced a trap composed of 75 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:41:58] [INFO ] Deduced a trap composed of 101 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:41:58] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:42:01] [INFO ] Deduced a trap composed of 53 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:42:02] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:42:02] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:42:05] [INFO ] Deduced a trap composed of 68 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:42:05] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:42:06] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:42:06] [INFO ] Deduced a trap composed of 79 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:42:06] [INFO ] Deduced a trap composed of 69 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:42:07] [INFO ] Deduced a trap composed of 98 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:42:07] [INFO ] Deduced a trap composed of 76 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:42:07] [INFO ] Deduced a trap composed of 64 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:42:07] [INFO ] Deduced a trap composed of 100 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:42:07] [INFO ] Deduced a trap composed of 92 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 67 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:42:08] [INFO ] Deduced a trap composed of 46 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:42:10] [INFO ] Deduced a trap composed of 74 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:42:10] [INFO ] Deduced a trap composed of 95 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 90 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 102 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:42:11] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 92 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:42:12] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 953 unsolved
[2025-06-01 01:42:15] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:42:15] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:42:16] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:42:16] [INFO ] Deduced a trap composed of 76 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:42:16] [INFO ] Deduced a trap composed of 77 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:42:16] [INFO ] Deduced a trap composed of 59 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 62 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 67 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:42:17] [INFO ] Deduced a trap composed of 48 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:42:18] [INFO ] Deduced a trap composed of 60 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:42:18] [INFO ] Deduced a trap composed of 77 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 43 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 1 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 77 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 1 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 77 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:42:19] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:42:20] [INFO ] Deduced a trap composed of 68 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:42:20] [INFO ] Deduced a trap composed of 67 places in 179 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 953 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 362 constraints, problems are : Problem set: 0 solved, 953 unsolved in 75024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/953 constraints, Known Traps: 340/340 constraints]
After SMT, in 150545ms problems are : Problem set: 0 solved, 953 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 71 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 2626786 steps (4 resets) in 120004 ms. (21 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 953/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 952/953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 952/952 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 38339 ms. (steps per millisecond=26 ) properties seen :0
[2025-06-01 01:43:31] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:43:31] [INFO ] Invariant cache hit.
[2025-06-01 01:43:31] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:43:44] [INFO ] Deduced a trap composed of 50 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:43:45] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:43:45] [INFO ] Deduced a trap composed of 47 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:43:45] [INFO ] Deduced a trap composed of 19 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:43:45] [INFO ] Deduced a trap composed of 29 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 52 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 17 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 31 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:46] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 76 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 29 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:43:47] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 23 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:43:48] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 111 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 81 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:43:49] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 31 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 25 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 67 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:43:50] [INFO ] Deduced a trap composed of 69 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:43:51] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:43:51] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:43:51] [INFO ] Deduced a trap composed of 100 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:43:51] [INFO ] Deduced a trap composed of 107 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:43:51] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 28 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 25 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:43:52] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 2 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 79 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 74 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:43:53] [INFO ] Deduced a trap composed of 69 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 81 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 81 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 90 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 58 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:43:54] [INFO ] Deduced a trap composed of 71 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 71 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 75 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:43:55] [INFO ] Deduced a trap composed of 71 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 82 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:43:56] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:43:57] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:03] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 3 ms to minimize.
[2025-06-01 01:44:04] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 2 ms to minimize.
[2025-06-01 01:44:04] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:44:04] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 3 ms to minimize.
[2025-06-01 01:44:04] [INFO ] Deduced a trap composed of 91 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:44:04] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 136 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 105 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:44:05] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:44:06] [INFO ] Deduced a trap composed of 66 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:44:06] [INFO ] Deduced a trap composed of 66 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:44:06] [INFO ] Deduced a trap composed of 70 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:44:06] [INFO ] Deduced a trap composed of 64 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:44:07] [INFO ] Deduced a trap composed of 67 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:44:07] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:44:07] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:44:07] [INFO ] Deduced a trap composed of 99 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:44:07] [INFO ] Deduced a trap composed of 100 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:44:08] [INFO ] Deduced a trap composed of 83 places in 191 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 75 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 69 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:44:09] [INFO ] Deduced a trap composed of 72 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 80 places in 147 ms of which 1 ms to minimize.
[2025-06-01 01:44:10] [INFO ] Deduced a trap composed of 88 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 61 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 87 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:44:11] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 87 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 63 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:44:12] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 72 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:44:13] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:15] [INFO ] Deduced a trap composed of 100 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:44:15] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:44:15] [INFO ] Deduced a trap composed of 66 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:44:16] [INFO ] Deduced a trap composed of 82 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:44:16] [INFO ] Deduced a trap composed of 75 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:44:16] [INFO ] Deduced a trap composed of 63 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:44:16] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:44:16] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 63 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:44:17] [INFO ] Deduced a trap composed of 81 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 55 places in 167 ms of which 1 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 78 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 52 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:44:18] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:44:19] [INFO ] Deduced a trap composed of 70 places in 191 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 77 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:44:26] [INFO ] Deduced a trap composed of 63 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 97 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 99 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:44:27] [INFO ] Deduced a trap composed of 90 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 80 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 94 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 102 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 1 ms to minimize.
[2025-06-01 01:44:28] [INFO ] Deduced a trap composed of 85 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:44:29] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:44:29] [INFO ] Deduced a trap composed of 79 places in 216 ms of which 31 ms to minimize.
[2025-06-01 01:44:29] [INFO ] Deduced a trap composed of 50 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
[2025-06-01 01:44:30] [INFO ] Deduced a trap composed of 79 places in 169 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 28 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:44:32] [INFO ] Deduced a trap composed of 77 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:44:33] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:44:33] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:44:33] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:44:33] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:44:33] [INFO ] Deduced a trap composed of 59 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 98 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 89 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:44:34] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 48 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 50 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:44:35] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:44:36] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 93 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:44:38] [INFO ] Deduced a trap composed of 80 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 73 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:44:39] [INFO ] Deduced a trap composed of 58 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:44:40] [INFO ] Deduced a trap composed of 59 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:44:40] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:44:40] [INFO ] Deduced a trap composed of 60 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:44:40] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 98 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 87 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:44:41] [INFO ] Deduced a trap composed of 65 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 80 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:44:42] [INFO ] Deduced a trap composed of 56 places in 154 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:50] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:44:51] [INFO ] Deduced a trap composed of 21 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:44:51] [INFO ] Deduced a trap composed of 20 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:44:51] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:44:51] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 81 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 86 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:44:52] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 11 places in 165 ms of which 1 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 72 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:44:53] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 73 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:44:54] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 1 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 70 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 58 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:44:55] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 79 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:44:58] [INFO ] Deduced a trap composed of 91 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 101 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 13 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:44:59] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 99 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 77 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:45:00] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:45:01] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:45:01] [INFO ] Deduced a trap composed of 83 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:45:01] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:45:01] [INFO ] Deduced a trap composed of 102 places in 169 ms of which 4 ms to minimize.
SMT process timed out in 90498ms, After SMT, problems are : Problem set: 0 solved, 952 unsolved
Fused 952 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 58 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 1466088 steps (4 resets) in 120004 ms. (12 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 952/952 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 37424 ms. (steps per millisecond=26 ) properties seen :0
[2025-06-01 01:46:10] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:46:10] [INFO ] Invariant cache hit.
[2025-06-01 01:46:10] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:46:23] [INFO ] Deduced a trap composed of 50 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:46:23] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 29 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 52 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:46:24] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 2 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 31 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 29 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:46:25] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 84 places in 182 ms of which 3 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 29 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 74 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 23 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:46:26] [INFO ] Deduced a trap composed of 98 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 87 places in 190 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 111 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:27] [INFO ] Deduced a trap composed of 77 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 81 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 76 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 16 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:46:28] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 25 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 39 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 69 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:46:29] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 100 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 107 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 72 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:46:30] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2025-06-01 01:46:31] [INFO ] Deduced a trap composed of 45 places in 68 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 74 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 69 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 81 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:46:32] [INFO ] Deduced a trap composed of 81 places in 206 ms of which 4 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 90 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 58 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2025-06-01 01:46:33] [INFO ] Deduced a trap composed of 71 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 75 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 71 places in 170 ms of which 1 ms to minimize.
[2025-06-01 01:46:34] [INFO ] Deduced a trap composed of 92 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 82 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:46:35] [INFO ] Deduced a trap composed of 65 places in 170 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 69 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 23 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 81 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:46:42] [INFO ] Deduced a trap composed of 91 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 136 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:46:43] [INFO ] Deduced a trap composed of 105 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 61 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 66 places in 214 ms of which 2 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 66 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:46:44] [INFO ] Deduced a trap composed of 70 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:46:45] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:46:45] [INFO ] Deduced a trap composed of 67 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:46:45] [INFO ] Deduced a trap composed of 68 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:46:45] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:46:46] [INFO ] Deduced a trap composed of 99 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:46:46] [INFO ] Deduced a trap composed of 100 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:46:46] [INFO ] Deduced a trap composed of 83 places in 185 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:46:47] [INFO ] Deduced a trap composed of 75 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:46:47] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:46:48] [INFO ] Deduced a trap composed of 58 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:46:48] [INFO ] Deduced a trap composed of 72 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:46:48] [INFO ] Deduced a trap composed of 66 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:46:48] [INFO ] Deduced a trap composed of 80 places in 146 ms of which 1 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 88 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 61 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 84 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:49] [INFO ] Deduced a trap composed of 87 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 80 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 87 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 63 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:46:50] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 3 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 52 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 72 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:46:51] [INFO ] Deduced a trap composed of 88 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:46:52] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:46:53] [INFO ] Deduced a trap composed of 100 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 82 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 1 ms to minimize.
[2025-06-01 01:46:54] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:46:55] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 80 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 81 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 55 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:46:56] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:46:57] [INFO ] Deduced a trap composed of 70 places in 173 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:47:04] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 86 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:05] [INFO ] Deduced a trap composed of 97 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 99 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 90 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 80 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 94 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 102 places in 159 ms of which 1 ms to minimize.
[2025-06-01 01:47:06] [INFO ] Deduced a trap composed of 111 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:47:07] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:47:07] [INFO ] Deduced a trap composed of 85 places in 135 ms of which 1 ms to minimize.
[2025-06-01 01:47:07] [INFO ] Deduced a trap composed of 62 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 79 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 50 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:47:08] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:47:09] [INFO ] Deduced a trap composed of 79 places in 144 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:47:10] [INFO ] Deduced a trap composed of 28 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 77 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 74 places in 155 ms of which 3 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 54 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:47:11] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:47:12] [INFO ] Deduced a trap composed of 59 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:47:12] [INFO ] Deduced a trap composed of 50 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:12] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:12] [INFO ] Deduced a trap composed of 89 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 77 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 66 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 58 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:47:13] [INFO ] Deduced a trap composed of 50 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 76 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 13 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 73 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:47:14] [INFO ] Deduced a trap composed of 82 places in 166 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 93 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 80 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:17] [INFO ] Deduced a trap composed of 73 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 58 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 59 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:47:18] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 56 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 3 ms to minimize.
[2025-06-01 01:47:19] [INFO ] Deduced a trap composed of 98 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 61 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 87 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 65 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 64 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:47:20] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:47:21] [INFO ] Deduced a trap composed of 80 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:47:21] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:47:29] [INFO ] Deduced a trap composed of 73 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 21 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 20 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 67 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:47:30] [INFO ] Deduced a trap composed of 70 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 81 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 86 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:47:31] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 11 places in 164 ms of which 1 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 61 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 73 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:32] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 47 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 73 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:47:33] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:47:34] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:47:34] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:47:37] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:47:37] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:47:38] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:47:38] [INFO ] Deduced a trap composed of 21 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:47:38] [INFO ] Deduced a trap composed of 13 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:47:38] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:47:39] [INFO ] Deduced a trap composed of 72 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:47:39] [INFO ] Deduced a trap composed of 99 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:47:39] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:47:39] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:47:40] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:47:40] [INFO ] Deduced a trap composed of 41 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:47:40] [INFO ] Deduced a trap composed of 83 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:47:40] [INFO ] Deduced a trap composed of 94 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:47:40] [INFO ] Deduced a trap composed of 102 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 57 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 19 places in 91 ms of which 1 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:47:41] [INFO ] Deduced a trap composed of 64 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:47:42] [INFO ] Deduced a trap composed of 62 places in 189 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:47:44] [INFO ] Deduced a trap composed of 79 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:47:44] [INFO ] Deduced a trap composed of 84 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:47:45] [INFO ] Deduced a trap composed of 85 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:47:45] [INFO ] Deduced a trap composed of 68 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:47:46] [INFO ] Deduced a trap composed of 97 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:47:46] [INFO ] Deduced a trap composed of 103 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:47:46] [INFO ] Deduced a trap composed of 99 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:47:46] [INFO ] Deduced a trap composed of 79 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:47:46] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:47:46] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 79 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 1 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 71 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:47:47] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:47:48] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:47:48] [INFO ] Deduced a trap composed of 62 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:47:48] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:47:48] [INFO ] Deduced a trap composed of 81 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:47:49] [INFO ] Deduced a trap composed of 87 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:47:49] [INFO ] Deduced a trap composed of 75 places in 177 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 timeout
0.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 262 constraints, problems are : Problem set: 0 solved, 952 unsolved in 105023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 240/240 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 240/262 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:48:03] [INFO ] Deduced a trap composed of 67 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:48:03] [INFO ] Deduced a trap composed of 76 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:48:04] [INFO ] Deduced a trap composed of 78 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:48:04] [INFO ] Deduced a trap composed of 72 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:48:04] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:48:05] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:48:07] [INFO ] Deduced a trap composed of 96 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:48:07] [INFO ] Deduced a trap composed of 64 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:48:08] [INFO ] Deduced a trap composed of 76 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:48:08] [INFO ] Deduced a trap composed of 74 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:48:09] [INFO ] Deduced a trap composed of 80 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:48:09] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:48:09] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 5 ms to minimize.
[2025-06-01 01:48:09] [INFO ] Deduced a trap composed of 97 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:48:10] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:48:10] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:48:10] [INFO ] Deduced a trap composed of 69 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:48:11] [INFO ] Deduced a trap composed of 102 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 78 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:48:12] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:48:15] [INFO ] Deduced a trap composed of 85 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:48:15] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:48:16] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:48:16] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:48:16] [INFO ] Deduced a trap composed of 82 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:48:16] [INFO ] Deduced a trap composed of 86 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:48:16] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:48:17] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:48:18] [INFO ] Deduced a trap composed of 84 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:48:18] [INFO ] Deduced a trap composed of 66 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:48:18] [INFO ] Deduced a trap composed of 45 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 86 places in 181 ms of which 3 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 66 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 74 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:48:19] [INFO ] Deduced a trap composed of 75 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 64 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 62 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 109 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:48:20] [INFO ] Deduced a trap composed of 81 places in 193 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/302 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:48:23] [INFO ] Deduced a trap composed of 88 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:48:23] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:48:24] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:48:24] [INFO ] Deduced a trap composed of 82 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:48:24] [INFO ] Deduced a trap composed of 71 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:48:24] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:48:24] [INFO ] Deduced a trap composed of 48 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 45 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 55 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 47 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:48:25] [INFO ] Deduced a trap composed of 65 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 67 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:48:26] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 72 places in 160 ms of which 1 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 76 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:48:27] [INFO ] Deduced a trap composed of 79 places in 164 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/322 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:48:30] [INFO ] Deduced a trap composed of 74 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:48:31] [INFO ] Deduced a trap composed of 43 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:48:31] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:48:31] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:48:31] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:48:32] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:48:32] [INFO ] Deduced a trap composed of 78 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:48:32] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 71 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 65 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:48:33] [INFO ] Deduced a trap composed of 50 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 95 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:48:34] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:48:35] [INFO ] Deduced a trap composed of 45 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:48:35] [INFO ] Deduced a trap composed of 96 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:48:36] [INFO ] Deduced a trap composed of 103 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:48:36] [INFO ] Deduced a trap composed of 67 places in 153 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/342 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:48:40] [INFO ] Deduced a trap composed of 95 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:48:40] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:48:40] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:48:40] [INFO ] Deduced a trap composed of 74 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:48:41] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:48:41] [INFO ] Deduced a trap composed of 70 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:48:41] [INFO ] Deduced a trap composed of 100 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:48:41] [INFO ] Deduced a trap composed of 78 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 80 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 74 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 67 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:48:42] [INFO ] Deduced a trap composed of 71 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 83 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 96 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:48:43] [INFO ] Deduced a trap composed of 96 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 84 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:48:44] [INFO ] Deduced a trap composed of 70 places in 162 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/362 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 54 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 59 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 76 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:48:49] [INFO ] Deduced a trap composed of 62 places in 144 ms of which 2 ms to minimize.
[2025-06-01 01:48:50] [INFO ] Deduced a trap composed of 77 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:48:50] [INFO ] Deduced a trap composed of 91 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:48:51] [INFO ] Deduced a trap composed of 73 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 75 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 85 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:48:52] [INFO ] Deduced a trap composed of 79 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 51 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 60 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:48:53] [INFO ] Deduced a trap composed of 63 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:48:54] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 4 ms to minimize.
[2025-06-01 01:48:54] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:48:54] [INFO ] Deduced a trap composed of 52 places in 147 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/382 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:48:57] [INFO ] Deduced a trap composed of 87 places in 174 ms of which 3 ms to minimize.
[2025-06-01 01:48:57] [INFO ] Deduced a trap composed of 64 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 85 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 73 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 70 places in 157 ms of which 1 ms to minimize.
[2025-06-01 01:48:58] [INFO ] Deduced a trap composed of 66 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:48:59] [INFO ] Deduced a trap composed of 82 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:48:59] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:49:00] [INFO ] Deduced a trap composed of 64 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:49:00] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:49:00] [INFO ] Deduced a trap composed of 73 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:49:00] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 1 ms to minimize.
[2025-06-01 01:49:01] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:49:01] [INFO ] Deduced a trap composed of 70 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:49:01] [INFO ] Deduced a trap composed of 81 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:49:01] [INFO ] Deduced a trap composed of 76 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:49:01] [INFO ] Deduced a trap composed of 76 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:49:01] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:49:02] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:49:02] [INFO ] Deduced a trap composed of 60 places in 155 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/402 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:49:06] [INFO ] Deduced a trap composed of 112 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:49:06] [INFO ] Deduced a trap composed of 107 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:49:06] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:49:07] [INFO ] Deduced a trap composed of 99 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:49:07] [INFO ] Deduced a trap composed of 85 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:49:07] [INFO ] Deduced a trap composed of 113 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:49:07] [INFO ] Deduced a trap composed of 99 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:49:07] [INFO ] Deduced a trap composed of 92 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:49:08] [INFO ] Deduced a trap composed of 79 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:49:08] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:49:08] [INFO ] Deduced a trap composed of 104 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:49:09] [INFO ] Deduced a trap composed of 71 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:49:10] [INFO ] Deduced a trap composed of 75 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:49:11] [INFO ] Deduced a trap composed of 66 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:49:11] [INFO ] Deduced a trap composed of 84 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:49:11] [INFO ] Deduced a trap composed of 76 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 64 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 64 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:49:12] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/422 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:49:17] [INFO ] Deduced a trap composed of 66 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:49:17] [INFO ] Deduced a trap composed of 73 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:49:18] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:49:18] [INFO ] Deduced a trap composed of 72 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:49:18] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:49:18] [INFO ] Deduced a trap composed of 59 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:49:18] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:49:18] [INFO ] Deduced a trap composed of 77 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:49:19] [INFO ] Deduced a trap composed of 82 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:49:19] [INFO ] Deduced a trap composed of 82 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:49:19] [INFO ] Deduced a trap composed of 87 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:49:19] [INFO ] Deduced a trap composed of 75 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:49:20] [INFO ] Deduced a trap composed of 63 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:49:20] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 49 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 63 places in 137 ms of which 2 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 72 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 47 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 2 ms to minimize.
[2025-06-01 01:49:21] [INFO ] Deduced a trap composed of 43 places in 137 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/442 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 66 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:49:25] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:49:26] [INFO ] Deduced a trap composed of 64 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 61 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 85 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 57 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 56 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:49:27] [INFO ] Deduced a trap composed of 46 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:49:28] [INFO ] Deduced a trap composed of 96 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:49:29] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:49:29] [INFO ] Deduced a trap composed of 66 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:49:29] [INFO ] Deduced a trap composed of 76 places in 143 ms of which 2 ms to minimize.
[2025-06-01 01:49:29] [INFO ] Deduced a trap composed of 70 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:49:29] [INFO ] Deduced a trap composed of 73 places in 131 ms of which 2 ms to minimize.
[2025-06-01 01:49:30] [INFO ] Deduced a trap composed of 83 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:49:30] [INFO ] Deduced a trap composed of 73 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:49:30] [INFO ] Deduced a trap composed of 83 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:49:30] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:49:31] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 20/462 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:49:34] [INFO ] Deduced a trap composed of 49 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:49:35] [INFO ] Deduced a trap composed of 56 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:49:35] [INFO ] Deduced a trap composed of 44 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:49:36] [INFO ] Deduced a trap composed of 53 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:49:36] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:49:36] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:49:36] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:49:36] [INFO ] Deduced a trap composed of 99 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:49:37] [INFO ] Deduced a trap composed of 94 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:49:37] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:49:37] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:49:37] [INFO ] Deduced a trap composed of 65 places in 137 ms of which 1 ms to minimize.
[2025-06-01 01:49:37] [INFO ] Deduced a trap composed of 114 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:49:38] [INFO ] Deduced a trap composed of 88 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:49:38] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 1 ms to minimize.
[2025-06-01 01:49:38] [INFO ] Deduced a trap composed of 86 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:49:38] [INFO ] Deduced a trap composed of 83 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:49:38] [INFO ] Deduced a trap composed of 51 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:49:38] [INFO ] Deduced a trap composed of 106 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:49:39] [INFO ] Deduced a trap composed of 78 places in 182 ms of which 3 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 20/482 constraints. Problems are: Problem set: 0 solved, 952 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 482 constraints, problems are : Problem set: 0 solved, 952 unsolved in 105029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 460/460 constraints]
After SMT, in 210528ms problems are : Problem set: 0 solved, 952 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 47 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 40 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2025-06-01 01:49:40] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:40] [INFO ] Invariant cache hit.
[2025-06-01 01:49:40] [INFO ] Implicit Places using invariants in 130 ms returned []
[2025-06-01 01:49:40] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:40] [INFO ] Invariant cache hit.
[2025-06-01 01:49:41] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:49:41] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
[2025-06-01 01:49:41] [INFO ] Redundant transitions in 101 ms returned []
Running 1694 sub problems to find dead transitions.
[2025-06-01 01:49:41] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:49:41] [INFO ] Invariant cache hit.
[2025-06-01 01:49:41] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 1 ms to minimize.
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:49:52] [INFO ] Deduced a trap composed of 45 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:49:53] [INFO ] Deduced a trap composed of 78 places in 122 ms of which 2 ms to minimize.
[2025-06-01 01:49:55] [INFO ] Deduced a trap composed of 54 places in 197 ms of which 3 ms to minimize.
[2025-06-01 01:49:55] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 74 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 64 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:49:56] [INFO ] Deduced a trap composed of 74 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 72 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 66 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:49:57] [INFO ] Deduced a trap composed of 70 places in 152 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:50:00] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 62 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 68 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:50:01] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 74 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 106 places in 207 ms of which 6 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:50:02] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:50:03] [INFO ] Deduced a trap composed of 79 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:50:03] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:50:03] [INFO ] Deduced a trap composed of 59 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:50:03] [INFO ] Deduced a trap composed of 81 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:50:03] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:50:04] [INFO ] Deduced a trap composed of 53 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:50:04] [INFO ] Deduced a trap composed of 49 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:50:04] [INFO ] Deduced a trap composed of 59 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:50:04] [INFO ] Deduced a trap composed of 86 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:50:04] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 62 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 1694/1694 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:50:16] [INFO ] Deduced a trap composed of 56 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:50:16] [INFO ] Deduced a trap composed of 65 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:50:16] [INFO ] Deduced a trap composed of 77 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:50:17] [INFO ] Deduced a trap composed of 61 places in 152 ms of which 1 ms to minimize.
[2025-06-01 01:50:17] [INFO ] Deduced a trap composed of 52 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:50:17] [INFO ] Deduced a trap composed of 63 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:50:17] [INFO ] Deduced a trap composed of 57 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:50:17] [INFO ] Deduced a trap composed of 53 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:50:17] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:50:18] [INFO ] Deduced a trap composed of 80 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:50:18] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:50:18] [INFO ] Deduced a trap composed of 53 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:50:18] [INFO ] Deduced a trap composed of 66 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:50:18] [INFO ] Deduced a trap composed of 52 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:50:18] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 81 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:50:19] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:50:23] [INFO ] Deduced a trap composed of 53 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:50:23] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:50:23] [INFO ] Deduced a trap composed of 103 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:50:23] [INFO ] Deduced a trap composed of 89 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:50:23] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:50:24] [INFO ] Deduced a trap composed of 80 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:50:24] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2025-06-01 01:50:24] [INFO ] Deduced a trap composed of 66 places in 134 ms of which 1 ms to minimize.
[2025-06-01 01:50:24] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:50:24] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:50:25] [INFO ] Deduced a trap composed of 96 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:50:25] [INFO ] Deduced a trap composed of 93 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:50:25] [INFO ] Deduced a trap composed of 102 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:50:25] [INFO ] Deduced a trap composed of 87 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:50:25] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 91 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 93 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 82 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 81 places in 175 ms of which 3 ms to minimize.
[2025-06-01 01:50:26] [INFO ] Deduced a trap composed of 80 places in 177 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:50:30] [INFO ] Deduced a trap composed of 79 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:50:30] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:50:30] [INFO ] Deduced a trap composed of 79 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:50:30] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:50:30] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:50:31] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:50:31] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:50:31] [INFO ] Deduced a trap composed of 77 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:50:31] [INFO ] Deduced a trap composed of 68 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:50:31] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:50:31] [INFO ] Deduced a trap composed of 76 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 88 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 25 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 23 places in 124 ms of which 1 ms to minimize.
[2025-06-01 01:50:32] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:50:33] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2025-06-01 01:50:33] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:50:33] [INFO ] Deduced a trap composed of 11 places in 179 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 100 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 52 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 43 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:50:37] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 67 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 66 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 75 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:50:38] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 76 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 71 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:50:39] [INFO ] Deduced a trap composed of 88 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 88 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 100 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:50:40] [INFO ] Deduced a trap composed of 60 places in 162 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/1694 constraints, Known Traps: 120/120 constraints]
After SMT, in 60766ms problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 60781ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61831 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 11700 ms. (34 steps per ms) remains 71/161 properties
Running SMT prover for 71 properties.
[2025-06-01 01:50:45] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:50:45] [INFO ] Invariant cache hit.
[2025-06-01 01:50:45] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 01:50:45] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:50:46] [INFO ] After 252ms SMT Verify possible using state equation in real domain returned unsat :0 sat :71
[2025-06-01 01:50:46] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:50:46] [INFO ] After 294ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:50:49] [INFO ] After 3336ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:50:49] [INFO ] After 3698ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:50:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 01:50:49] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:50:49] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :71
[2025-06-01 01:50:50] [INFO ] After 381ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 3 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:50:50] [INFO ] Deduced a trap composed of 59 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 62 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 44 places in 202 ms of which 2 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 21 places in 202 ms of which 3 ms to minimize.
[2025-06-01 01:50:51] [INFO ] Deduced a trap composed of 47 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 27 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 29 places in 198 ms of which 3 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:50:52] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 47 places in 97 ms of which 2 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3179 ms
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 16 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:50:53] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 18 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 650 ms
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 17 places in 130 ms of which 2 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 257 ms
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-06-01 01:50:54] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:50:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 104 ms
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 71 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 393 ms
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 130 ms
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:50:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-01 01:50:55] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 33 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:50:56] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 0 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2025-06-01 01:50:57] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:50:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 102 ms
[2025-06-01 01:50:58] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:50:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
TRAPS : Iteration 1
[2025-06-01 01:50:59] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:50:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 212 ms
[2025-06-01 01:51:00] [INFO ] Deduced a trap composed of 19 places in 116 ms of which 1 ms to minimize.
[2025-06-01 01:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 162 ms
[2025-06-01 01:51:00] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:51:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-01 01:51:01] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:51:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
TRAPS : Iteration 2
[2025-06-01 01:51:04] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 0 ms to minimize.
[2025-06-01 01:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-01 01:51:05] [INFO ] Deduced a trap composed of 47 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:51:05] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:51:05] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 191 ms
TRAPS : Iteration 3
[2025-06-01 01:51:08] [INFO ] After 19236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :71
[2025-06-01 01:51:09] [INFO ] After 20049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :71
RANDOM walk for 1338527 steps (2 resets) in 120004 ms. (11 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 952/952 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 952/952 properties
Probabilistic random walk after 1000000 steps, saw 530341 distinct states, run finished after 40514 ms. (steps per millisecond=24 ) properties seen :0
[2025-06-01 01:52:20] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:52:20] [INFO ] Invariant cache hit.
[2025-06-01 01:52:20] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:52:34] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:52:34] [INFO ] Deduced a trap composed of 72 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:52:34] [INFO ] Deduced a trap composed of 47 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:52:34] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:52:35] [INFO ] Deduced a trap composed of 29 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:52:35] [INFO ] Deduced a trap composed of 52 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:52:35] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:52:35] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:52:35] [INFO ] Deduced a trap composed of 31 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:52:35] [INFO ] Deduced a trap composed of 3 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:52:36] [INFO ] Deduced a trap composed of 67 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:52:36] [INFO ] Deduced a trap composed of 27 places in 97 ms of which 1 ms to minimize.
[2025-06-01 01:52:36] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:52:36] [INFO ] Deduced a trap composed of 76 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:52:36] [INFO ] Deduced a trap composed of 84 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:52:36] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:52:37] [INFO ] Deduced a trap composed of 74 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:52:37] [INFO ] Deduced a trap composed of 23 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:52:37] [INFO ] Deduced a trap composed of 98 places in 188 ms of which 3 ms to minimize.
[2025-06-01 01:52:37] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 111 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 77 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 81 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:52:38] [INFO ] Deduced a trap composed of 76 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:52:39] [INFO ] Deduced a trap composed of 85 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:52:39] [INFO ] Deduced a trap composed of 16 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:52:39] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:52:39] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:52:39] [INFO ] Deduced a trap composed of 67 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 69 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 71 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:52:40] [INFO ] Deduced a trap composed of 107 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 72 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 28 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:52:41] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 45 places in 59 ms of which 0 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 74 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:52:42] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 81 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 3 ms to minimize.
[2025-06-01 01:52:43] [INFO ] Deduced a trap composed of 58 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 71 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 71 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 75 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:52:44] [INFO ] Deduced a trap composed of 71 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 92 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 77 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:52:45] [INFO ] Deduced a trap composed of 77 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:52:46] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:52:52] [INFO ] Deduced a trap composed of 69 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:52:53] [INFO ] Deduced a trap composed of 23 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:52:53] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:52:53] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:52:53] [INFO ] Deduced a trap composed of 91 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:52:53] [INFO ] Deduced a trap composed of 3 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:52:54] [INFO ] Deduced a trap composed of 136 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:52:54] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:52:54] [INFO ] Deduced a trap composed of 105 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:52:54] [INFO ] Deduced a trap composed of 61 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 66 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 66 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:52:55] [INFO ] Deduced a trap composed of 64 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 67 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 68 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 99 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:52:56] [INFO ] Deduced a trap composed of 100 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:52:57] [INFO ] Deduced a trap composed of 83 places in 197 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 75 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 69 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:52:58] [INFO ] Deduced a trap composed of 72 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:52:59] [INFO ] Deduced a trap composed of 66 places in 172 ms of which 1 ms to minimize.
[2025-06-01 01:52:59] [INFO ] Deduced a trap composed of 80 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:52:59] [INFO ] Deduced a trap composed of 88 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:53:00] [INFO ] Deduced a trap composed of 61 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:53:00] [INFO ] Deduced a trap composed of 84 places in 195 ms of which 2 ms to minimize.
[2025-06-01 01:53:00] [INFO ] Deduced a trap composed of 87 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:53:00] [INFO ] Deduced a trap composed of 80 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:53:01] [INFO ] Deduced a trap composed of 87 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:53:01] [INFO ] Deduced a trap composed of 63 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:53:01] [INFO ] Deduced a trap composed of 79 places in 215 ms of which 2 ms to minimize.
[2025-06-01 01:53:01] [INFO ] Deduced a trap composed of 3 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:53:01] [INFO ] Deduced a trap composed of 52 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:53:02] [INFO ] Deduced a trap composed of 72 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:53:02] [INFO ] Deduced a trap composed of 87 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:53:02] [INFO ] Deduced a trap composed of 88 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:53:02] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:53:04] [INFO ] Deduced a trap composed of 100 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:53:04] [INFO ] Deduced a trap composed of 90 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:53:04] [INFO ] Deduced a trap composed of 66 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:53:05] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:53:05] [INFO ] Deduced a trap composed of 75 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:53:05] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:53:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:53:05] [INFO ] Deduced a trap composed of 56 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:53:06] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:53:06] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:53:06] [INFO ] Deduced a trap composed of 71 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:53:06] [INFO ] Deduced a trap composed of 80 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 78 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 78 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:53:07] [INFO ] Deduced a trap composed of 52 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:53:08] [INFO ] Deduced a trap composed of 70 places in 185 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:53:15] [INFO ] Deduced a trap composed of 77 places in 179 ms of which 1 ms to minimize.
[2025-06-01 01:53:16] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 2 ms to minimize.
[2025-06-01 01:53:16] [INFO ] Deduced a trap composed of 86 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:53:16] [INFO ] Deduced a trap composed of 79 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:53:16] [INFO ] Deduced a trap composed of 97 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:53:17] [INFO ] Deduced a trap composed of 99 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:53:17] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:53:17] [INFO ] Deduced a trap composed of 80 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:53:17] [INFO ] Deduced a trap composed of 94 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:53:17] [INFO ] Deduced a trap composed of 102 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:53:18] [INFO ] Deduced a trap composed of 111 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:53:18] [INFO ] Deduced a trap composed of 82 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:53:18] [INFO ] Deduced a trap composed of 85 places in 148 ms of which 1 ms to minimize.
[2025-06-01 01:53:19] [INFO ] Deduced a trap composed of 62 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:53:19] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 2 ms to minimize.
[2025-06-01 01:53:19] [INFO ] Deduced a trap composed of 50 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:53:19] [INFO ] Deduced a trap composed of 65 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:53:19] [INFO ] Deduced a trap composed of 58 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:53:20] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 01:53:20] [INFO ] Deduced a trap composed of 79 places in 175 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/162 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:53:22] [INFO ] Deduced a trap composed of 28 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:53:22] [INFO ] Deduced a trap composed of 77 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:53:22] [INFO ] Deduced a trap composed of 71 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:53:22] [INFO ] Deduced a trap composed of 74 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 54 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 0 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 59 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:53:23] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 3 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 98 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 89 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 77 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 66 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:53:24] [INFO ] Deduced a trap composed of 58 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 50 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 76 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:53:25] [INFO ] Deduced a trap composed of 73 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:53:26] [INFO ] Deduced a trap composed of 59 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:53:26] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/182 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:53:28] [INFO ] Deduced a trap composed of 93 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:53:28] [INFO ] Deduced a trap composed of 80 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:53:29] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:53:29] [INFO ] Deduced a trap composed of 77 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:53:29] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:53:29] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:53:30] [INFO ] Deduced a trap composed of 59 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:53:30] [INFO ] Deduced a trap composed of 58 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:53:30] [INFO ] Deduced a trap composed of 60 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 56 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 78 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 98 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 61 places in 177 ms of which 3 ms to minimize.
[2025-06-01 01:53:31] [INFO ] Deduced a trap composed of 87 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 65 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 64 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 65 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:53:32] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/202 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:53:41] [INFO ] Deduced a trap composed of 73 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:53:41] [INFO ] Deduced a trap composed of 21 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:53:42] [INFO ] Deduced a trap composed of 20 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:53:42] [INFO ] Deduced a trap composed of 67 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:53:42] [INFO ] Deduced a trap composed of 70 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:53:42] [INFO ] Deduced a trap composed of 81 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:53:42] [INFO ] Deduced a trap composed of 86 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:53:43] [INFO ] Deduced a trap composed of 71 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:53:43] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:53:44] [INFO ] Deduced a trap composed of 72 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:53:44] [INFO ] Deduced a trap composed of 61 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:53:44] [INFO ] Deduced a trap composed of 73 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:53:44] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:53:45] [INFO ] Deduced a trap composed of 47 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:53:45] [INFO ] Deduced a trap composed of 73 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:53:45] [INFO ] Deduced a trap composed of 55 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:53:45] [INFO ] Deduced a trap composed of 80 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:53:45] [INFO ] Deduced a trap composed of 70 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:53:46] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:53:46] [INFO ] Deduced a trap composed of 81 places in 169 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/222 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:53:49] [INFO ] Deduced a trap composed of 79 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:53:49] [INFO ] Deduced a trap composed of 91 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:53:49] [INFO ] Deduced a trap composed of 101 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:53:50] [INFO ] Deduced a trap composed of 21 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:53:50] [INFO ] Deduced a trap composed of 13 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:53:50] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:53:51] [INFO ] Deduced a trap composed of 72 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:53:51] [INFO ] Deduced a trap composed of 99 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:53:51] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:53:51] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:53:51] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:53:52] [INFO ] Deduced a trap composed of 41 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:53:52] [INFO ] Deduced a trap composed of 83 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:53:52] [INFO ] Deduced a trap composed of 94 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:53:52] [INFO ] Deduced a trap composed of 102 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:53:53] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:53:53] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:53:53] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:53:53] [INFO ] Deduced a trap composed of 64 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:53:54] [INFO ] Deduced a trap composed of 62 places in 194 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 20/242 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:53:56] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:53:57] [INFO ] Deduced a trap composed of 84 places in 204 ms of which 2 ms to minimize.
[2025-06-01 01:53:57] [INFO ] Deduced a trap composed of 85 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:53:57] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:53:58] [INFO ] Deduced a trap composed of 97 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:53:58] [INFO ] Deduced a trap composed of 103 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:53:58] [INFO ] Deduced a trap composed of 99 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:53:58] [INFO ] Deduced a trap composed of 79 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:53:58] [INFO ] Deduced a trap composed of 65 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:53:59] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:53:59] [INFO ] Deduced a trap composed of 79 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:53:59] [INFO ] Deduced a trap composed of 69 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:53:59] [INFO ] Deduced a trap composed of 71 places in 151 ms of which 1 ms to minimize.
[2025-06-01 01:54:00] [INFO ] Deduced a trap composed of 67 places in 139 ms of which 2 ms to minimize.
[2025-06-01 01:54:00] [INFO ] Deduced a trap composed of 72 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:54:00] [INFO ] Deduced a trap composed of 62 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:54:00] [INFO ] Deduced a trap composed of 70 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:54:01] [INFO ] Deduced a trap composed of 81 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:54:01] [INFO ] Deduced a trap composed of 87 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:54:02] [INFO ] Deduced a trap composed of 75 places in 183 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/342 variables, 20/262 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:54:11] [INFO ] Deduced a trap composed of 60 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:54:12] [INFO ] Deduced a trap composed of 55 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:54:12] [INFO ] Deduced a trap composed of 48 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:54:12] [INFO ] Deduced a trap composed of 45 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:54:12] [INFO ] Deduced a trap composed of 93 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:54:12] [INFO ] Deduced a trap composed of 84 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:54:13] [INFO ] Deduced a trap composed of 104 places in 177 ms of which 3 ms to minimize.
[2025-06-01 01:54:13] [INFO ] Deduced a trap composed of 89 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:54:13] [INFO ] Deduced a trap composed of 76 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:54:13] [INFO ] Deduced a trap composed of 82 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:54:14] [INFO ] Deduced a trap composed of 84 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:54:14] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:54:14] [INFO ] Deduced a trap composed of 73 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:54:15] [INFO ] Deduced a trap composed of 91 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:54:15] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:54:16] [INFO ] Deduced a trap composed of 77 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:54:16] [INFO ] Deduced a trap composed of 45 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:54:16] [INFO ] Deduced a trap composed of 67 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:54:16] [INFO ] Deduced a trap composed of 44 places in 151 ms of which 1 ms to minimize.
[2025-06-01 01:54:17] [INFO ] Deduced a trap composed of 50 places in 166 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/342 variables, 20/282 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:54:20] [INFO ] Deduced a trap composed of 72 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:54:20] [INFO ] Deduced a trap composed of 90 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:54:20] [INFO ] Deduced a trap composed of 78 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:54:21] [INFO ] Deduced a trap composed of 76 places in 166 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 (/ 1.0 8.0))
(s12 (/ 7.0 8.0))
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 (/ 1.0 8.0))
(s20 0.0)
(s21 (/ 7.0 8.0))
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 (/ 3.0 8.0))
(s27 (/ 5.0 8.0))
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 (/ 5.0 8.0))
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 (/ 7.0 8.0))
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 (/ 1.0 8.0))
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 (/ 1.0 2.0))
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 (/ 3.0 8.0))
(s90 0.0)
(s91 0.0)
(s92 (/ 1.0 8.0))
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 (/ 1.0 8.0))
(s103 0.0)
(s104 0.0)
(s105 (/ 3.0 8.0))
(s106 0.0)
(s107 (/ 3.0 4.0))
(s108 0.0)
(s109 0.0)
(s110 (/ 1.0 4.0))
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 1.0)
(s120timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 286 constraints, problems are : Problem set: 0 solved, 952 unsolved in 120027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 952/952 constraints, Known Traps: 264/264 constraints]
Escalating to Integer solving :Problem set: 0 solved, 952 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/161 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/161 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 2 (OVERLAPS) 181/342 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 952 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 264/286 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:54:28] [INFO ] Deduced a trap composed of 97 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:54:29] [INFO ] Deduced a trap composed of 54 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:54:29] [INFO ] Deduced a trap composed of 60 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:54:29] [INFO ] Deduced a trap composed of 79 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:54:30] [INFO ] Deduced a trap composed of 54 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:54:30] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 3 ms to minimize.
[2025-06-01 01:54:31] [INFO ] Deduced a trap composed of 55 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:54:31] [INFO ] Deduced a trap composed of 94 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:54:33] [INFO ] Deduced a trap composed of 71 places in 178 ms of which 4 ms to minimize.
[2025-06-01 01:54:33] [INFO ] Deduced a trap composed of 63 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:54:33] [INFO ] Deduced a trap composed of 55 places in 185 ms of which 3 ms to minimize.
[2025-06-01 01:54:33] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:54:34] [INFO ] Deduced a trap composed of 91 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:54:34] [INFO ] Deduced a trap composed of 102 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:54:34] [INFO ] Deduced a trap composed of 80 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:54:34] [INFO ] Deduced a trap composed of 85 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:54:35] [INFO ] Deduced a trap composed of 47 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:54:35] [INFO ] Deduced a trap composed of 52 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:54:35] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:54:35] [INFO ] Deduced a trap composed of 67 places in 172 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/306 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 73 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 93 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 90 places in 167 ms of which 3 ms to minimize.
[2025-06-01 01:54:40] [INFO ] Deduced a trap composed of 69 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:54:41] [INFO ] Deduced a trap composed of 63 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:54:42] [INFO ] Deduced a trap composed of 80 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:54:42] [INFO ] Deduced a trap composed of 84 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:54:42] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:54:42] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:54:42] [INFO ] Deduced a trap composed of 82 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:54:43] [INFO ] Deduced a trap composed of 81 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:54:43] [INFO ] Deduced a trap composed of 84 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:54:43] [INFO ] Deduced a trap composed of 66 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:54:43] [INFO ] Deduced a trap composed of 70 places in 169 ms of which 1 ms to minimize.
[2025-06-01 01:54:43] [INFO ] Deduced a trap composed of 85 places in 196 ms of which 3 ms to minimize.
[2025-06-01 01:54:44] [INFO ] Deduced a trap composed of 43 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:54:44] [INFO ] Deduced a trap composed of 79 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:54:44] [INFO ] Deduced a trap composed of 107 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:54:44] [INFO ] Deduced a trap composed of 95 places in 172 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/326 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:54:48] [INFO ] Deduced a trap composed of 66 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:54:49] [INFO ] Deduced a trap composed of 44 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:54:49] [INFO ] Deduced a trap composed of 24 places in 173 ms of which 1 ms to minimize.
[2025-06-01 01:54:49] [INFO ] Deduced a trap composed of 57 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:54:49] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:54:49] [INFO ] Deduced a trap composed of 70 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:54:49] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:54:50] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:54:50] [INFO ] Deduced a trap composed of 71 places in 195 ms of which 3 ms to minimize.
[2025-06-01 01:54:51] [INFO ] Deduced a trap composed of 63 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:54:52] [INFO ] Deduced a trap composed of 91 places in 132 ms of which 2 ms to minimize.
[2025-06-01 01:54:53] [INFO ] Deduced a trap composed of 92 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:54:53] [INFO ] Deduced a trap composed of 49 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:54:53] [INFO ] Deduced a trap composed of 67 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:54:54] [INFO ] Deduced a trap composed of 83 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:54:54] [INFO ] Deduced a trap composed of 82 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:54:54] [INFO ] Deduced a trap composed of 61 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:54:54] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:54:55] [INFO ] Deduced a trap composed of 78 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:54:55] [INFO ] Deduced a trap composed of 83 places in 170 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 20/346 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:54:59] [INFO ] Deduced a trap composed of 87 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:54:59] [INFO ] Deduced a trap composed of 84 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:54:59] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:54:59] [INFO ] Deduced a trap composed of 95 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:54:59] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:54:59] [INFO ] Deduced a trap composed of 83 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:55:00] [INFO ] Deduced a trap composed of 82 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:55:00] [INFO ] Deduced a trap composed of 57 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:55:01] [INFO ] Deduced a trap composed of 79 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:55:01] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:55:01] [INFO ] Deduced a trap composed of 50 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:55:01] [INFO ] Deduced a trap composed of 89 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:55:02] [INFO ] Deduced a trap composed of 92 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:55:02] [INFO ] Deduced a trap composed of 68 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:55:02] [INFO ] Deduced a trap composed of 89 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:55:02] [INFO ] Deduced a trap composed of 73 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:55:03] [INFO ] Deduced a trap composed of 86 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:55:03] [INFO ] Deduced a trap composed of 85 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:55:03] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:55:03] [INFO ] Deduced a trap composed of 79 places in 143 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 20/366 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:55:07] [INFO ] Deduced a trap composed of 77 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:55:08] [INFO ] Deduced a trap composed of 92 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:55:08] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 3 ms to minimize.
[2025-06-01 01:55:08] [INFO ] Deduced a trap composed of 69 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:55:09] [INFO ] Deduced a trap composed of 81 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:55:10] [INFO ] Deduced a trap composed of 78 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:55:10] [INFO ] Deduced a trap composed of 88 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:55:10] [INFO ] Deduced a trap composed of 76 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:55:11] [INFO ] Deduced a trap composed of 83 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:55:11] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:55:11] [INFO ] Deduced a trap composed of 80 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:55:12] [INFO ] Deduced a trap composed of 74 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:55:13] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:55:13] [INFO ] Deduced a trap composed of 71 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:55:13] [INFO ] Deduced a trap composed of 58 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:55:14] [INFO ] Deduced a trap composed of 70 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:55:15] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:55:15] [INFO ] Deduced a trap composed of 71 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:55:15] [INFO ] Deduced a trap composed of 79 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:55:15] [INFO ] Deduced a trap composed of 81 places in 161 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 20/386 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:55:19] [INFO ] Deduced a trap composed of 91 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:55:19] [INFO ] Deduced a trap composed of 79 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:55:22] [INFO ] Deduced a trap composed of 50 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:55:22] [INFO ] Deduced a trap composed of 70 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:55:23] [INFO ] Deduced a trap composed of 48 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:55:24] [INFO ] Deduced a trap composed of 65 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:55:24] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:55:25] [INFO ] Deduced a trap composed of 55 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:55:25] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:55:26] [INFO ] Deduced a trap composed of 74 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:55:26] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:55:26] [INFO ] Deduced a trap composed of 67 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:55:26] [INFO ] Deduced a trap composed of 55 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:55:27] [INFO ] Deduced a trap composed of 58 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:55:28] [INFO ] Deduced a trap composed of 73 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:55:28] [INFO ] Deduced a trap composed of 52 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:55:28] [INFO ] Deduced a trap composed of 90 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:55:28] [INFO ] Deduced a trap composed of 44 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:55:28] [INFO ] Deduced a trap composed of 55 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:55:29] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 20/406 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:55:32] [INFO ] Deduced a trap composed of 93 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:55:32] [INFO ] Deduced a trap composed of 89 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:55:33] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:55:33] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 2 ms to minimize.
[2025-06-01 01:55:34] [INFO ] Deduced a trap composed of 98 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:55:34] [INFO ] Deduced a trap composed of 95 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:55:34] [INFO ] Deduced a trap composed of 88 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:55:35] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:55:35] [INFO ] Deduced a trap composed of 61 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:55:35] [INFO ] Deduced a trap composed of 65 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:55:36] [INFO ] Deduced a trap composed of 62 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:55:39] [INFO ] Deduced a trap composed of 81 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:55:39] [INFO ] Deduced a trap composed of 65 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:55:39] [INFO ] Deduced a trap composed of 98 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:55:39] [INFO ] Deduced a trap composed of 83 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:55:40] [INFO ] Deduced a trap composed of 75 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:55:40] [INFO ] Deduced a trap composed of 64 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:55:40] [INFO ] Deduced a trap composed of 90 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:55:40] [INFO ] Deduced a trap composed of 79 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:55:42] [INFO ] Deduced a trap composed of 62 places in 155 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 20/426 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:55:45] [INFO ] Deduced a trap composed of 70 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:55:45] [INFO ] Deduced a trap composed of 87 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:55:45] [INFO ] Deduced a trap composed of 90 places in 189 ms of which 3 ms to minimize.
[2025-06-01 01:55:46] [INFO ] Deduced a trap composed of 63 places in 178 ms of which 3 ms to minimize.
[2025-06-01 01:55:46] [INFO ] Deduced a trap composed of 80 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:55:46] [INFO ] Deduced a trap composed of 71 places in 183 ms of which 3 ms to minimize.
[2025-06-01 01:55:46] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:55:46] [INFO ] Deduced a trap composed of 55 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:55:47] [INFO ] Deduced a trap composed of 97 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:55:47] [INFO ] Deduced a trap composed of 50 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:55:47] [INFO ] Deduced a trap composed of 89 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:55:47] [INFO ] Deduced a trap composed of 80 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:55:47] [INFO ] Deduced a trap composed of 83 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:55:48] [INFO ] Deduced a trap composed of 42 places in 172 ms of which 3 ms to minimize.
[2025-06-01 01:55:49] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:55:49] [INFO ] Deduced a trap composed of 71 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:55:50] [INFO ] Deduced a trap composed of 81 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:55:50] [INFO ] Deduced a trap composed of 68 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:55:50] [INFO ] Deduced a trap composed of 72 places in 154 ms of which 1 ms to minimize.
[2025-06-01 01:55:50] [INFO ] Deduced a trap composed of 72 places in 171 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 20/446 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:55:54] [INFO ] Deduced a trap composed of 82 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:55:55] [INFO ] Deduced a trap composed of 82 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:55:55] [INFO ] Deduced a trap composed of 69 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:55:55] [INFO ] Deduced a trap composed of 77 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:55:55] [INFO ] Deduced a trap composed of 76 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:55:56] [INFO ] Deduced a trap composed of 76 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:55:56] [INFO ] Deduced a trap composed of 68 places in 182 ms of which 2 ms to minimize.
[2025-06-01 01:55:56] [INFO ] Deduced a trap composed of 54 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:55:56] [INFO ] Deduced a trap composed of 107 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:55:57] [INFO ] Deduced a trap composed of 103 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:55:57] [INFO ] Deduced a trap composed of 100 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:55:57] [INFO ] Deduced a trap composed of 98 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:55:57] [INFO ] Deduced a trap composed of 93 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:55:57] [INFO ] Deduced a trap composed of 92 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:55:58] [INFO ] Deduced a trap composed of 85 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:55:58] [INFO ] Deduced a trap composed of 100 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:55:58] [INFO ] Deduced a trap composed of 63 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:55:58] [INFO ] Deduced a trap composed of 81 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:55:58] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:55:58] [INFO ] Deduced a trap composed of 80 places in 159 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 20/466 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:56:03] [INFO ] Deduced a trap composed of 86 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:56:04] [INFO ] Deduced a trap composed of 62 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:56:04] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:56:04] [INFO ] Deduced a trap composed of 50 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:56:05] [INFO ] Deduced a trap composed of 73 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:56:05] [INFO ] Deduced a trap composed of 63 places in 154 ms of which 1 ms to minimize.
[2025-06-01 01:56:05] [INFO ] Deduced a trap composed of 44 places in 140 ms of which 2 ms to minimize.
[2025-06-01 01:56:06] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:56:06] [INFO ] Deduced a trap composed of 44 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:56:06] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:56:06] [INFO ] Deduced a trap composed of 41 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:56:07] [INFO ] Deduced a trap composed of 75 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:56:07] [INFO ] Deduced a trap composed of 58 places in 165 ms of which 2 ms to minimize.
[2025-06-01 01:56:08] [INFO ] Deduced a trap composed of 77 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:56:08] [INFO ] Deduced a trap composed of 59 places in 166 ms of which 2 ms to minimize.
[2025-06-01 01:56:08] [INFO ] Deduced a trap composed of 51 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:56:09] [INFO ] Deduced a trap composed of 50 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:56:09] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:56:10] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:56:11] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/342 variables, 20/486 constraints. Problems are: Problem set: 0 solved, 952 unsolved
[2025-06-01 01:56:17] [INFO ] Deduced a trap composed of 98 places in 190 ms of which 3 ms to minimize.
[2025-06-01 01:56:18] [INFO ] Deduced a trap composed of 75 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:56:18] [INFO ] Deduced a trap composed of 68 places in 138 ms of which 2 ms to minimize.
[2025-06-01 01:56:18] [INFO ] Deduced a trap composed of 50 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:56:18] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:56:18] [INFO ] Deduced a trap composed of 52 places in 128 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 492 constraints, problems are : Problem set: 0 solved, 952 unsolved in 120023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/952 constraints, Known Traps: 470/470 constraints]
After SMT, in 240515ms problems are : Problem set: 0 solved, 952 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 161 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 47 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 342/342 places, 1701/1701 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Applied a total of 0 rules in 52 ms. Remains 342 /342 variables (removed 0) and now considering 1701/1701 (removed 0) transitions.
[2025-06-01 01:56:21] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:56:21] [INFO ] Invariant cache hit.
[2025-06-01 01:56:21] [INFO ] Implicit Places using invariants in 135 ms returned []
[2025-06-01 01:56:21] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:56:21] [INFO ] Invariant cache hit.
[2025-06-01 01:56:21] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:56:22] [INFO ] Implicit Places using invariants and state equation in 741 ms returned []
Implicit Place search using SMT with State Equation took 877 ms to find 0 implicit places.
[2025-06-01 01:56:22] [INFO ] Redundant transitions in 40 ms returned []
Running 1694 sub problems to find dead transitions.
[2025-06-01 01:56:22] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:56:22] [INFO ] Invariant cache hit.
[2025-06-01 01:56:22] [INFO ] State equation strengthened by 424 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:56:32] [INFO ] Deduced a trap composed of 3 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:56:32] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2025-06-01 01:56:33] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:56:33] [INFO ] Deduced a trap composed of 4 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:56:33] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:56:33] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:56:33] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:56:33] [INFO ] Deduced a trap composed of 45 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:56:33] [INFO ] Deduced a trap composed of 78 places in 127 ms of which 2 ms to minimize.
[2025-06-01 01:56:36] [INFO ] Deduced a trap composed of 54 places in 211 ms of which 3 ms to minimize.
[2025-06-01 01:56:36] [INFO ] Deduced a trap composed of 66 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:56:36] [INFO ] Deduced a trap composed of 74 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:56:37] [INFO ] Deduced a trap composed of 64 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:56:37] [INFO ] Deduced a trap composed of 73 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:56:37] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:56:37] [INFO ] Deduced a trap composed of 74 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:56:37] [INFO ] Deduced a trap composed of 73 places in 194 ms of which 3 ms to minimize.
[2025-06-01 01:56:38] [INFO ] Deduced a trap composed of 72 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:56:38] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 2 ms to minimize.
[2025-06-01 01:56:38] [INFO ] Deduced a trap composed of 70 places in 148 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:56:41] [INFO ] Deduced a trap composed of 60 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:56:41] [INFO ] Deduced a trap composed of 63 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:56:42] [INFO ] Deduced a trap composed of 62 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:56:42] [INFO ] Deduced a trap composed of 68 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:56:42] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:56:42] [INFO ] Deduced a trap composed of 74 places in 184 ms of which 3 ms to minimize.
[2025-06-01 01:56:43] [INFO ] Deduced a trap composed of 72 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:56:43] [INFO ] Deduced a trap composed of 106 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:56:43] [INFO ] Deduced a trap composed of 73 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:56:43] [INFO ] Deduced a trap composed of 70 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:56:43] [INFO ] Deduced a trap composed of 79 places in 196 ms of which 2 ms to minimize.
[2025-06-01 01:56:44] [INFO ] Deduced a trap composed of 56 places in 191 ms of which 3 ms to minimize.
[2025-06-01 01:56:44] [INFO ] Deduced a trap composed of 59 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:56:44] [INFO ] Deduced a trap composed of 81 places in 176 ms of which 3 ms to minimize.
[2025-06-01 01:56:44] [INFO ] Deduced a trap composed of 81 places in 190 ms of which 2 ms to minimize.
[2025-06-01 01:56:44] [INFO ] Deduced a trap composed of 53 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:56:45] [INFO ] Deduced a trap composed of 49 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:56:45] [INFO ] Deduced a trap composed of 59 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:56:45] [INFO ] Deduced a trap composed of 86 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:56:45] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 0 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 342/1084 variables, and 62 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 1694/1694 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1694 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/342 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:56:57] [INFO ] Deduced a trap composed of 56 places in 205 ms of which 3 ms to minimize.
[2025-06-01 01:56:57] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:56:57] [INFO ] Deduced a trap composed of 77 places in 186 ms of which 3 ms to minimize.
[2025-06-01 01:56:57] [INFO ] Deduced a trap composed of 61 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:56:57] [INFO ] Deduced a trap composed of 52 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:56:58] [INFO ] Deduced a trap composed of 63 places in 160 ms of which 2 ms to minimize.
[2025-06-01 01:56:58] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 2 ms to minimize.
[2025-06-01 01:56:58] [INFO ] Deduced a trap composed of 53 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:56:58] [INFO ] Deduced a trap composed of 73 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:56:58] [INFO ] Deduced a trap composed of 80 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:56:58] [INFO ] Deduced a trap composed of 75 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:56:59] [INFO ] Deduced a trap composed of 53 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:56:59] [INFO ] Deduced a trap composed of 66 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:56:59] [INFO ] Deduced a trap composed of 52 places in 151 ms of which 2 ms to minimize.
[2025-06-01 01:56:59] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:56:59] [INFO ] Deduced a trap composed of 52 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:56:59] [INFO ] Deduced a trap composed of 75 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:57:00] [INFO ] Deduced a trap composed of 77 places in 188 ms of which 4 ms to minimize.
[2025-06-01 01:57:00] [INFO ] Deduced a trap composed of 81 places in 189 ms of which 2 ms to minimize.
[2025-06-01 01:57:00] [INFO ] Deduced a trap composed of 75 places in 195 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/342 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:57:03] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 2 ms to minimize.
[2025-06-01 01:57:03] [INFO ] Deduced a trap composed of 71 places in 191 ms of which 2 ms to minimize.
[2025-06-01 01:57:04] [INFO ] Deduced a trap composed of 103 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:57:04] [INFO ] Deduced a trap composed of 89 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:57:04] [INFO ] Deduced a trap composed of 73 places in 148 ms of which 2 ms to minimize.
[2025-06-01 01:57:04] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 2 ms to minimize.
[2025-06-01 01:57:04] [INFO ] Deduced a trap composed of 69 places in 153 ms of which 2 ms to minimize.
[2025-06-01 01:57:05] [INFO ] Deduced a trap composed of 66 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:57:05] [INFO ] Deduced a trap composed of 89 places in 188 ms of which 2 ms to minimize.
[2025-06-01 01:57:05] [INFO ] Deduced a trap composed of 97 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:57:05] [INFO ] Deduced a trap composed of 96 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:57:05] [INFO ] Deduced a trap composed of 93 places in 172 ms of which 2 ms to minimize.
[2025-06-01 01:57:06] [INFO ] Deduced a trap composed of 102 places in 170 ms of which 3 ms to minimize.
[2025-06-01 01:57:06] [INFO ] Deduced a trap composed of 87 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:57:06] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:57:06] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 2 ms to minimize.
[2025-06-01 01:57:06] [INFO ] Deduced a trap composed of 93 places in 179 ms of which 3 ms to minimize.
[2025-06-01 01:57:07] [INFO ] Deduced a trap composed of 82 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:57:07] [INFO ] Deduced a trap composed of 81 places in 181 ms of which 2 ms to minimize.
[2025-06-01 01:57:07] [INFO ] Deduced a trap composed of 80 places in 194 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:57:10] [INFO ] Deduced a trap composed of 79 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:57:11] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2025-06-01 01:57:11] [INFO ] Deduced a trap composed of 79 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:57:11] [INFO ] Deduced a trap composed of 55 places in 171 ms of which 2 ms to minimize.
[2025-06-01 01:57:11] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:57:11] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:57:11] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:57:12] [INFO ] Deduced a trap composed of 77 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:57:12] [INFO ] Deduced a trap composed of 68 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:57:12] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:57:12] [INFO ] Deduced a trap composed of 76 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:57:12] [INFO ] Deduced a trap composed of 65 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:57:13] [INFO ] Deduced a trap composed of 88 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:57:13] [INFO ] Deduced a trap composed of 42 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:57:13] [INFO ] Deduced a trap composed of 25 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:57:13] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
[2025-06-01 01:57:13] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:57:13] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:57:13] [INFO ] Deduced a trap composed of 90 places in 184 ms of which 2 ms to minimize.
[2025-06-01 01:57:14] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
[2025-06-01 01:57:17] [INFO ] Deduced a trap composed of 60 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:57:18] [INFO ] Deduced a trap composed of 100 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:57:18] [INFO ] Deduced a trap composed of 52 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:57:18] [INFO ] Deduced a trap composed of 43 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:57:18] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:57:18] [INFO ] Deduced a trap composed of 67 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:57:19] [INFO ] Deduced a trap composed of 66 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:57:19] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:57:19] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 2 ms to minimize.
[2025-06-01 01:57:19] [INFO ] Deduced a trap composed of 76 places in 164 ms of which 2 ms to minimize.
[2025-06-01 01:57:19] [INFO ] Deduced a trap composed of 72 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:57:20] [INFO ] Deduced a trap composed of 71 places in 173 ms of which 3 ms to minimize.
[2025-06-01 01:57:20] [INFO ] Deduced a trap composed of 89 places in 186 ms of which 2 ms to minimize.
[2025-06-01 01:57:20] [INFO ] Deduced a trap composed of 88 places in 194 ms of which 2 ms to minimize.
[2025-06-01 01:57:20] [INFO ] Deduced a trap composed of 88 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:57:20] [INFO ] Deduced a trap composed of 87 places in 155 ms of which 2 ms to minimize.
[2025-06-01 01:57:21] [INFO ] Deduced a trap composed of 100 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:57:21] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:57:21] [INFO ] Deduced a trap composed of 71 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:57:21] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 20/142 constraints. Problems are: Problem set: 0 solved, 1694 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 342/1084 variables, and 142 constraints, problems are : Problem set: 0 solved, 1694 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/342 constraints, ReadFeed: 0/424 constraints, PredecessorRefiner: 0/1694 constraints, Known Traps: 120/120 constraints]
After SMT, in 60796ms problems are : Problem set: 0 solved, 1694 unsolved
Search for dead transitions found 0 dead transitions in 60811ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61793 ms. Remains : 342/342 places, 1701/1701 transitions.
RANDOM walk for 400000 steps (8 resets) in 10731 ms. (37 steps per ms) remains 71/161 properties
Running SMT prover for 71 properties.
[2025-06-01 01:57:26] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:57:26] [INFO ] Invariant cache hit.
[2025-06-01 01:57:26] [INFO ] [Real]Absence check using 15 positive place invariants in 7 ms returned sat
[2025-06-01 01:57:26] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2025-06-01 01:57:26] [INFO ] After 243ms SMT Verify possible using state equation in real domain returned unsat :0 sat :71
[2025-06-01 01:57:26] [INFO ] State equation strengthened by 424 read => feed constraints.
[2025-06-01 01:57:26] [INFO ] After 304ms SMT Verify possible using 424 Read/Feed constraints in real domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:57:29] [INFO ] After 3384ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:57:29] [INFO ] After 3743ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:71
[2025-06-01 01:57:29] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 01:57:29] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 3 ms returned sat
[2025-06-01 01:57:30] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :71
[2025-06-01 01:57:30] [INFO ] After 403ms SMT Verify possible using 424 Read/Feed constraints in natural domain returned unsat :0 sat :71
TRAPS : Iteration 0
[2025-06-01 01:57:30] [INFO ] Deduced a trap composed of 3 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:57:31] [INFO ] Deduced a trap composed of 3 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:57:31] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 3 ms to minimize.
[2025-06-01 01:57:31] [INFO ] Deduced a trap composed of 59 places in 207 ms of which 3 ms to minimize.
[2025-06-01 01:57:31] [INFO ] Deduced a trap composed of 62 places in 198 ms of which 2 ms to minimize.
[2025-06-01 01:57:31] [INFO ] Deduced a trap composed of 44 places in 199 ms of which 2 ms to minimize.
[2025-06-01 01:57:32] [INFO ] Deduced a trap composed of 21 places in 192 ms of which 3 ms to minimize.
[2025-06-01 01:57:32] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 2 ms to minimize.
[2025-06-01 01:57:32] [INFO ] Deduced a trap composed of 27 places in 193 ms of which 3 ms to minimize.
[2025-06-01 01:57:32] [INFO ] Deduced a trap composed of 29 places in 206 ms of which 2 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 3 places in 193 ms of which 2 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 15 places in 178 ms of which 2 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 47 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 0 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3170 ms
[2025-06-01 01:57:33] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:57:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2025-06-01 01:57:34] [INFO ] Deduced a trap composed of 16 places in 179 ms of which 2 ms to minimize.
[2025-06-01 01:57:34] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 2 ms to minimize.
[2025-06-01 01:57:34] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:57:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 664 ms
[2025-06-01 01:57:34] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 1 ms to minimize.
[2025-06-01 01:57:34] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:57:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 263 ms
[2025-06-01 01:57:35] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2025-06-01 01:57:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 136 ms
[2025-06-01 01:57:35] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:57:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 100 ms
[2025-06-01 01:57:35] [INFO ] Deduced a trap composed of 71 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:57:35] [INFO ] Deduced a trap composed of 62 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:57:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 425 ms
[2025-06-01 01:57:35] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 2 ms to minimize.
[2025-06-01 01:57:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-01 01:57:36] [INFO ] Deduced a trap composed of 17 places in 87 ms of which 2 ms to minimize.
[2025-06-01 01:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-01 01:57:36] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-06-01 01:57:36] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:57:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 138 ms
[2025-06-01 01:57:37] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2025-06-01 01:57:37] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 0 ms to minimize.
[2025-06-01 01:57:37] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 230 ms
[2025-06-01 01:57:37] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:57:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2025-06-01 01:57:38] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:57:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 115 ms
TRAPS : Iteration 1
[2025-06-01 01:57:39] [INFO ] Deduced a trap composed of 91 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2025-06-01 01:57:40] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:57:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 161 ms
[2025-06-01 01:57:41] [INFO ] Deduced a trap composed of 13 places in 67 ms of which 0 ms to minimize.
[2025-06-01 01:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 118 ms
[2025-06-01 01:57:41] [INFO ] Deduced a trap composed of 19 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:57:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
TRAPS : Iteration 2
[2025-06-01 01:57:45] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:57:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 111 ms
[2025-06-01 01:57:45] [INFO ] Deduced a trap composed of 47 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:57:46] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 2 ms to minimize.
[2025-06-01 01:57:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 192 ms
TRAPS : Iteration 3
[2025-06-01 01:57:49] [INFO ] After 19196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :71
[2025-06-01 01:57:49] [INFO ] After 19951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :71
RANDOM walk for 376 steps (0 resets) in 13 ms. (26 steps per ms) remains 0/1 properties
RANDOM walk for 942 steps (0 resets) in 10 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 1408 steps (0 resets) in 13 ms. (100 steps per ms) remains 0/1 properties
RANDOM walk for 908 steps (0 resets) in 9 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 1777 steps (0 resets) in 11 ms. (148 steps per ms) remains 0/1 properties
RANDOM walk for 1156 steps (0 resets) in 14 ms. (77 steps per ms) remains 0/1 properties
RANDOM walk for 2030 steps (0 resets) in 17 ms. (112 steps per ms) remains 0/1 properties
RANDOM walk for 1750 steps (0 resets) in 14 ms. (116 steps per ms) remains 0/1 properties
RANDOM walk for 2428 steps (0 resets) in 18 ms. (127 steps per ms) remains 0/1 properties
RANDOM walk for 2057 steps (0 resets) in 15 ms. (128 steps per ms) remains 0/1 properties
RANDOM walk for 101 steps (0 resets) in 5 ms. (16 steps per ms) remains 0/1 properties
RANDOM walk for 2383 steps (0 resets) in 17 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 1399 steps (0 resets) in 12 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 1581 steps (0 resets) in 15 ms. (98 steps per ms) remains 0/1 properties
RANDOM walk for 1893 steps (0 resets) in 16 ms. (111 steps per ms) remains 0/1 properties
RANDOM walk for 2460 steps (0 resets) in 20 ms. (117 steps per ms) remains 0/1 properties
RANDOM walk for 81 steps (0 resets) in 5 ms. (13 steps per ms) remains 0/1 properties
RANDOM walk for 376 steps (0 resets) in 7 ms. (47 steps per ms) remains 0/1 properties
RANDOM walk for 1771 steps (0 resets) in 16 ms. (104 steps per ms) remains 0/1 properties
RANDOM walk for 2225 steps (0 resets) in 20 ms. (105 steps per ms) remains 0/1 properties
RANDOM walk for 2599 steps (0 resets) in 18 ms. (136 steps per ms) remains 0/1 properties
RANDOM walk for 106 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
RANDOM walk for 423 steps (0 resets) in 7 ms. (52 steps per ms) remains 0/1 properties
RANDOM walk for 1032 steps (0 resets) in 11 ms. (86 steps per ms) remains 0/1 properties
RANDOM walk for 2177 steps (0 resets) in 19 ms. (108 steps per ms) remains 0/1 properties
RANDOM walk for 2751 steps (0 resets) in 19 ms. (137 steps per ms) remains 0/1 properties
RANDOM walk for 105 steps (0 resets) in 4 ms. (21 steps per ms) remains 0/1 properties
RANDOM walk for 413 steps (0 resets) in 7 ms. (51 steps per ms) remains 0/1 properties
RANDOM walk for 892 steps (0 resets) in 10 ms. (81 steps per ms) remains 0/1 properties
RANDOM walk for 1286 steps (0 resets) in 13 ms. (91 steps per ms) remains 0/1 properties
RANDOM walk for 2604 steps (0 resets) in 22 ms. (113 steps per ms) remains 0/1 properties
RANDOM walk for 72 steps (0 resets) in 5 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 373 steps (0 resets) in 6 ms. (53 steps per ms) remains 0/1 properties
RANDOM walk for 846 steps (0 resets) in 10 ms. (76 steps per ms) remains 0/1 properties
RANDOM walk for 1302 steps (0 resets) in 11 ms. (108 steps per ms) remains 0/1 properties
RANDOM walk for 1592 steps (0 resets) in 12 ms. (122 steps per ms) remains 0/1 properties
RANDOM walk for 941 steps (0 resets) in 9 ms. (94 steps per ms) remains 0/1 properties
RANDOM walk for 1608 steps (0 resets) in 14 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 1629 steps (0 resets) in 15 ms. (101 steps per ms) remains 0/1 properties
RANDOM walk for 2097 steps (0 resets) in 16 ms. (123 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 332 ms. (120 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30179 steps (6 resets) in 57 ms. (520 steps per ms) remains 0/1 properties
RANDOM walk for 515 steps (0 resets) in 5 ms. (85 steps per ms) remains 0/1 properties
RANDOM walk for 31 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 30 steps (0 resets) in 5 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 920 steps (0 resets) in 8 ms. (102 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 4 ms. (4 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 1295 steps (0 resets) in 11 ms. (107 steps per ms) remains 0/1 properties
RANDOM walk for 19 steps (0 resets) in 4 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 12 steps (0 resets) in 4 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 1786 steps (0 resets) in 17 ms. (99 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 13 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 2092 steps (0 resets) in 17 ms. (116 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 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 2611 steps (0 resets) in 19 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 32 steps (0 resets) in 4 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 595432 steps, run timeout after 3001 ms. (steps per millisecond=198 ) properties seen :0 out of 1
Probabilistic random walk after 595432 steps, saw 341513 distinct states, run finished after 3004 ms. (steps per millisecond=198 ) properties seen :0
[2025-06-01 01:57:53] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:57:53] [INFO ] Invariant cache hit.
[2025-06-01 01:57:53] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:57:53] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:57:54] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:57:54] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:57:54] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 3/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1068ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 53 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 1 properties in 7 ms.
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 43 ms. (909 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 597776 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 597776 steps, saw 342668 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2025-06-01 01:57:57] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:57:57] [INFO ] Invariant cache hit.
[2025-06-01 01:57:57] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:57:57] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:57:58] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 2 ms to minimize.
[2025-06-01 01:57:58] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 2 ms to minimize.
[2025-06-01 01:57:58] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:57:58] [INFO ] Deduced a trap composed of 3 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:57:58] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:57:58] [INFO ] Deduced a trap composed of 19 places in 84 ms of which 1 ms to minimize.
[2025-06-01 01:57:59] [INFO ] Deduced a trap composed of 13 places in 83 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 7/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1214 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1611ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6235 steps, including 207 resets, run visited all 1 properties in 40 ms. (steps per millisecond=155 )
Parikh walk visited 1 properties in 41 ms.
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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 578966 steps, run visited all 1 properties in 2897 ms. (steps per millisecond=199 )
Probabilistic random walk after 578966 steps, saw 333761 distinct states, run finished after 2903 ms. (steps per millisecond=199 ) 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 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 96174 steps, run visited all 1 properties in 489 ms. (steps per millisecond=196 )
Probabilistic random walk after 96174 steps, saw 65378 distinct states, run finished after 489 ms. (steps per millisecond=196 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 588640 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 588640 steps, saw 338022 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2025-06-01 01:58:05] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:58:05] [INFO ] Invariant cache hit.
[2025-06-01 01:58:05] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:06] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 361/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 37/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 24/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:06] [INFO ] Deduced a trap composed of 4 places in 201 ms of which 2 ms to minimize.
[2025-06-01 01:58:06] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2025-06-01 01:58:06] [INFO ] Deduced a trap composed of 13 places in 99 ms of which 2 ms to minimize.
[2025-06-01 01:58:07] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/200 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 361/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:07] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/795 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 795 constraints, problems are : Problem set: 0 solved, 1 unsolved in 992 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1390ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 63 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26934 steps, run visited all 1 properties in 127 ms. (steps per millisecond=212 )
Probabilistic random walk after 26934 steps, saw 18143 distinct states, run finished after 127 ms. (steps per millisecond=212 ) properties seen :1
RANDOM walk for 18265 steps (4 resets) in 79 ms. (228 steps per ms) remains 0/1 properties
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 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 606632 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 606632 steps, saw 346299 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2025-06-01 01:58:10] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:58:10] [INFO ] Invariant cache hit.
[2025-06-01 01:58:10] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 80 places in 163 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 17 places in 136 ms of which 2 ms to minimize.
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 3 places in 83 ms of which 1 ms to minimize.
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:58:11] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 5/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:12] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 1/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 945 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1572ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 60 steps, including 1 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 551 steps (0 resets) in 6 ms. (78 steps per ms) remains 0/1 properties
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 183 ms. (217 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 598040 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 598040 steps, saw 342682 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2025-06-01 01:58:15] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:58:15] [INFO ] Invariant cache hit.
[2025-06-01 01:58:15] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:15] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 416 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:16] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:58:16] [INFO ] Deduced a trap composed of 3 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:58:16] [INFO ] Deduced a trap composed of 3 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:58:16] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:58:16] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2025-06-01 01:58:16] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 6/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 796 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1135 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
After SMT, in 1565ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 3509 steps, including 123 resets, run visited all 1 properties in 25 ms. (steps per millisecond=140 )
Parikh walk visited 1 properties in 25 ms.
RANDOM walk for 69 steps (0 resets) in 6 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 74 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
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 128790 steps, run visited all 1 properties in 665 ms. (steps per millisecond=193 )
Probabilistic random walk after 128790 steps, saw 85754 distinct states, run finished after 668 ms. (steps per millisecond=192 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 184 ms. (216 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 172198 steps, run visited all 1 properties in 893 ms. (steps per millisecond=192 )
Probabilistic random walk after 172198 steps, saw 111859 distinct states, run finished after 893 ms. (steps per millisecond=192 ) 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 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 90342 steps, run visited all 1 properties in 468 ms. (steps per millisecond=193 )
Probabilistic random walk after 90342 steps, saw 61693 distinct states, run finished after 468 ms. (steps per millisecond=193 ) properties seen :1
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 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 133406 steps, run visited all 1 properties in 693 ms. (steps per millisecond=192 )
Probabilistic random walk after 133406 steps, saw 88796 distinct states, run finished after 693 ms. (steps per millisecond=192 ) properties seen :1
RANDOM walk for 23221 steps (4 resets) in 98 ms. (234 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 41 ms. (952 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 229926 steps, run visited all 1 properties in 1164 ms. (steps per millisecond=197 )
Probabilistic random walk after 229926 steps, saw 146021 distinct states, run finished after 1164 ms. (steps per millisecond=197 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 590408 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 590408 steps, saw 338684 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2025-06-01 01:58:24] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:58:24] [INFO ] Invariant cache hit.
[2025-06-01 01:58:24] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:24] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:24] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 611 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:25] [INFO ] Deduced a trap composed of 3 places in 185 ms of which 2 ms to minimize.
[2025-06-01 01:58:25] [INFO ] Deduced a trap composed of 21 places in 162 ms of which 2 ms to minimize.
[2025-06-01 01:58:25] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:58:25] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:58:25] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:58:25] [INFO ] Deduced a trap composed of 19 places in 62 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 6/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/797 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 797 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 1647ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 44 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 2 ms.
RANDOM walk for 40000 steps (8 resets) in 162 ms. (245 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 47790 steps, run visited all 1 properties in 251 ms. (steps per millisecond=190 )
Probabilistic random walk after 47790 steps, saw 34076 distinct states, run finished after 251 ms. (steps per millisecond=190 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 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 592672 steps, run timeout after 3001 ms. (steps per millisecond=197 ) properties seen :0 out of 1
Probabilistic random walk after 592672 steps, saw 339963 distinct states, run finished after 3001 ms. (steps per millisecond=197 ) properties seen :0
[2025-06-01 01:58:29] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:58:29] [INFO ] Invariant cache hit.
[2025-06-01 01:58:29] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:29] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:29] [INFO ] Deduced a trap composed of 90 places in 190 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:30] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:58:30] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 2/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/587 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 497/1084 variables, 233/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 362/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1212ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 85 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 49 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 209 ms. (190 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 600326 steps, run visited all 1 properties in 2726 ms. (steps per millisecond=220 )
Probabilistic random walk after 600326 steps, saw 223795 distinct states, run finished after 2726 ms. (steps per millisecond=220 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 167 ms. (238 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 364350 steps, run visited all 1 properties in 1857 ms. (steps per millisecond=196 )
Probabilistic random walk after 364350 steps, saw 222216 distinct states, run finished after 1857 ms. (steps per millisecond=196 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 113158 steps, run visited all 1 properties in 577 ms. (steps per millisecond=196 )
Probabilistic random walk after 113158 steps, saw 76084 distinct states, run finished after 577 ms. (steps per millisecond=196 ) properties seen :1
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 35 ms. (1111 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 26470 steps, run visited all 1 properties in 140 ms. (steps per millisecond=189 )
Probabilistic random walk after 26470 steps, saw 19571 distinct states, run finished after 140 ms. (steps per millisecond=189 ) 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 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 22478 steps, run visited all 1 properties in 119 ms. (steps per millisecond=188 )
Probabilistic random walk after 22478 steps, saw 16711 distinct states, run finished after 119 ms. (steps per millisecond=188 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 9766 steps, run visited all 1 properties in 52 ms. (steps per millisecond=187 )
Probabilistic random walk after 9766 steps, saw 7506 distinct states, run finished after 52 ms. (steps per millisecond=187 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 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 69470 steps, run visited all 1 properties in 352 ms. (steps per millisecond=197 )
Probabilistic random walk after 69470 steps, saw 48247 distinct states, run finished after 353 ms. (steps per millisecond=196 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 156830 steps, run visited all 1 properties in 781 ms. (steps per millisecond=200 )
Probabilistic random walk after 156830 steps, saw 102967 distinct states, run finished after 781 ms. (steps per millisecond=200 ) 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 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 137334 steps, run visited all 1 properties in 687 ms. (steps per millisecond=199 )
Probabilistic random walk after 137334 steps, saw 91235 distinct states, run finished after 687 ms. (steps per millisecond=199 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 65622 steps, run visited all 1 properties in 328 ms. (steps per millisecond=200 )
Probabilistic random walk after 65622 steps, saw 45757 distinct states, run finished after 328 ms. (steps per millisecond=200 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 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 2966 steps, run visited all 1 properties in 17 ms. (steps per millisecond=174 )
Probabilistic random walk after 2966 steps, saw 2436 distinct states, run finished after 17 ms. (steps per millisecond=174 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 2246 steps, run visited all 1 properties in 14 ms. (steps per millisecond=160 )
Probabilistic random walk after 2246 steps, saw 1845 distinct states, run finished after 15 ms. (steps per millisecond=149 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 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 602736 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 602736 steps, saw 344162 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-06-01 01:58:42] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 01:58:42] [INFO ] Invariant cache hit.
[2025-06-01 01:58:42] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:58:42] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/198 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 627 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1024ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 42 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 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
Interrupted probabilistic random walk after 673712 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 673712 steps, saw 242077 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2025-06-01 01:58:46] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2025-06-01 01:58:46] [INFO ] Computed 22 invariants in 7 ms
[2025-06-01 01:58:46] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 313 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 4 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:58:46] [INFO ] Deduced a trap composed of 10 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:58:47] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 5/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 679 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 1009ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-06-01 01:58:47] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:58:47] [INFO ] Invariant cache hit.
[2025-06-01 01:58:47] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-06-01 01:58:47] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:58:47] [INFO ] Invariant cache hit.
[2025-06-01 01:58:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-01 01:58:48] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1387 ms to find 0 implicit places.
[2025-06-01 01:58:48] [INFO ] Redundant transitions in 25 ms returned []
Running 1456 sub problems to find dead transitions.
[2025-06-01 01:58:48] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 01:58:48] [INFO ] Invariant cache hit.
[2025-06-01 01:58:48] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:58:57] [INFO ] Deduced a trap composed of 3 places in 146 ms of which 2 ms to minimize.
[2025-06-01 01:58:57] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:58:57] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:58:57] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:58:57] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2025-06-01 01:58:57] [INFO ] Deduced a trap composed of 39 places in 95 ms of which 2 ms to minimize.
[2025-06-01 01:58:58] [INFO ] Deduced a trap composed of 54 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:58:58] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2025-06-01 01:58:58] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:58:58] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2025-06-01 01:58:58] [INFO ] Deduced a trap composed of 60 places in 123 ms of which 1 ms to minimize.
[2025-06-01 01:58:58] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:58:58] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 2 ms to minimize.
[2025-06-01 01:58:59] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2025-06-01 01:58:59] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 1 ms to minimize.
[2025-06-01 01:58:59] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 2 ms to minimize.
[2025-06-01 01:58:59] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 2 ms to minimize.
[2025-06-01 01:58:59] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:58:59] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 0 ms to minimize.
[2025-06-01 01:58:59] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:59:00] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 01:59:01] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:59:03] [INFO ] Deduced a trap composed of 13 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:59:03] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:59:04] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:59:06] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:59:09] [INFO ] Deduced a trap composed of 22 places in 161 ms of which 2 ms to minimize.
[2025-06-01 01:59:09] [INFO ] Deduced a trap composed of 54 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:59:10] [INFO ] Deduced a trap composed of 64 places in 156 ms of which 2 ms to minimize.
[2025-06-01 01:59:10] [INFO ] Deduced a trap composed of 19 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:59:10] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:59:10] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2025-06-01 01:59:10] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2025-06-01 01:59:11] [INFO ] Deduced a trap composed of 19 places in 168 ms of which 2 ms to minimize.
[2025-06-01 01:59:11] [INFO ] Deduced a trap composed of 21 places in 167 ms of which 2 ms to minimize.
[2025-06-01 01:59:11] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:59:11] [INFO ] Deduced a trap composed of 17 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:59:11] [INFO ] Deduced a trap composed of 25 places in 171 ms of which 3 ms to minimize.
[2025-06-01 01:59:11] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 2 ms to minimize.
[2025-06-01 01:59:11] [INFO ] Deduced a trap composed of 67 places in 165 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:59:21] [INFO ] Deduced a trap composed of 42 places in 116 ms of which 2 ms to minimize.
[2025-06-01 01:59:21] [INFO ] Deduced a trap composed of 53 places in 104 ms of which 2 ms to minimize.
[2025-06-01 01:59:21] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2025-06-01 01:59:22] [INFO ] Deduced a trap composed of 73 places in 104 ms of which 1 ms to minimize.
[2025-06-01 01:59:22] [INFO ] Deduced a trap composed of 42 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:59:22] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 2 ms to minimize.
[2025-06-01 01:59:22] [INFO ] Deduced a trap composed of 44 places in 103 ms of which 1 ms to minimize.
[2025-06-01 01:59:22] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 1 ms to minimize.
[2025-06-01 01:59:23] [INFO ] Deduced a trap composed of 56 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:59:23] [INFO ] Deduced a trap composed of 53 places in 107 ms of which 2 ms to minimize.
[2025-06-01 01:59:23] [INFO ] Deduced a trap composed of 64 places in 114 ms of which 1 ms to minimize.
[2025-06-01 01:59:23] [INFO ] Deduced a trap composed of 70 places in 113 ms of which 1 ms to minimize.
[2025-06-01 01:59:23] [INFO ] Deduced a trap composed of 66 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:59:23] [INFO ] Deduced a trap composed of 60 places in 106 ms of which 2 ms to minimize.
[2025-06-01 01:59:23] [INFO ] Deduced a trap composed of 41 places in 117 ms of which 2 ms to minimize.
[2025-06-01 01:59:24] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 2 ms to minimize.
[2025-06-01 01:59:24] [INFO ] Deduced a trap composed of 44 places in 98 ms of which 1 ms to minimize.
[2025-06-01 01:59:24] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 1 ms to minimize.
[2025-06-01 01:59:25] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 2 ms to minimize.
[2025-06-01 01:59:25] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:59:34] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:59:35] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:59:35] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:59:35] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:59:36] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2025-06-01 01:59:36] [INFO ] Deduced a trap composed of 55 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:59:36] [INFO ] Deduced a trap composed of 75 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:59:36] [INFO ] Deduced a trap composed of 69 places in 176 ms of which 2 ms to minimize.
[2025-06-01 01:59:36] [INFO ] Deduced a trap composed of 40 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 61 places in 169 ms of which 2 ms to minimize.
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 55 places in 173 ms of which 2 ms to minimize.
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 62 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 2 ms to minimize.
[2025-06-01 01:59:37] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 2 ms to minimize.
[2025-06-01 01:59:38] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 2 ms to minimize.
[2025-06-01 01:59:38] [INFO ] Deduced a trap composed of 53 places in 180 ms of which 2 ms to minimize.
[2025-06-01 01:59:38] [INFO ] Deduced a trap composed of 61 places in 154 ms of which 2 ms to minimize.
[2025-06-01 01:59:38] [INFO ] Deduced a trap composed of 51 places in 159 ms of which 2 ms to minimize.
[2025-06-01 01:59:38] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2025-06-01 01:59:39] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 01:59:42] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2025-06-01 01:59:43] [INFO ] Deduced a trap composed of 72 places in 134 ms of which 2 ms to minimize.
[2025-06-01 01:59:43] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2025-06-01 01:59:43] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 1 ms to minimize.
[2025-06-01 01:59:43] [INFO ] Deduced a trap composed of 77 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:59:43] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2025-06-01 01:59:44] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2025-06-01 01:59:44] [INFO ] Deduced a trap composed of 56 places in 129 ms of which 1 ms to minimize.
[2025-06-01 01:59:44] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 1 ms to minimize.
[2025-06-01 01:59:45] [INFO ] Deduced a trap composed of 73 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:59:45] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:59:45] [INFO ] Deduced a trap composed of 52 places in 129 ms of which 2 ms to minimize.
[2025-06-01 01:59:46] [INFO ] Deduced a trap composed of 61 places in 130 ms of which 1 ms to minimize.
[2025-06-01 01:59:46] [INFO ] Deduced a trap composed of 77 places in 131 ms of which 1 ms to minimize.
[2025-06-01 01:59:46] [INFO ] Deduced a trap composed of 47 places in 115 ms of which 2 ms to minimize.
[2025-06-01 01:59:47] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 2 ms to minimize.
[2025-06-01 01:59:47] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 2 ms to minimize.
[2025-06-01 01:59:47] [INFO ] Deduced a trap composed of 66 places in 123 ms of which 2 ms to minimize.
[2025-06-01 01:59:47] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2025-06-01 01:59:48] [INFO ] Deduced a trap composed of 56 places in 120 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 0)
(s12 1)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 0)
(s27 1)
(s28 0)
(s29 1)
(s30 1)
(s31 0)
(s32 1)
(s33 1)
(s34 1)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 122 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 100/100 constraints]
After SMT, in 60604ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60618ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62072 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1332 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 266 transition count 317
Reduce places removed 61 places and 0 transitions.
Iterating post reduction 1 with 61 rules applied. Total rules applied 123 place count 205 transition count 317
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 123 place count 205 transition count 302
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 160 place count 183 transition count 302
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 326 place count 100 transition count 219
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 366 place count 100 transition count 179
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
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 380 place count 93 transition count 179
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 93 transition count 172
Drop transitions (Redundant composition of simpler transitions.) removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 395 place count 93 transition count 164
Free-agglomeration rule applied 43 times.
Iterating global reduction 4 with 43 rules applied. Total rules applied 438 place count 93 transition count 121
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 4 with 43 rules applied. Total rules applied 481 place count 50 transition count 121
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 488 place count 50 transition count 121
Applied a total of 488 rules in 54 ms. Remains 50 /308 variables (removed 258) and now considering 121/1463 (removed 1342) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 121 rows 50 cols
[2025-06-01 01:59:49] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 01:59:49] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 01:59:49] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 01:59:49] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 01:59:49] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:59:49] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 01:59:49] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 01:59:49] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 01:59:49] [INFO ] After 4ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 01:59:49] [INFO ] After 9ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 01:59:49] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 178 ms.
RANDOM walk for 40000 steps (8 resets) in 185 ms. (215 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 597416 steps, run timeout after 3001 ms. (steps per millisecond=199 ) properties seen :0 out of 1
Probabilistic random walk after 597416 steps, saw 342601 distinct states, run finished after 3001 ms. (steps per millisecond=199 ) properties seen :0
[2025-06-01 01:59:52] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 01:59:52] [INFO ] Computed 22 invariants in 7 ms
[2025-06-01 01:59:52] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:59:52] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 390 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 01:59:53] [INFO ] Deduced a trap composed of 3 places in 111 ms of which 1 ms to minimize.
[2025-06-01 01:59:53] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:59:53] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:59:53] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 4/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 794 constraints, problems are : Problem set: 0 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1157ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 45 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 58 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 308/342 places, 1463/1701 transitions.
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 40 ms. (975 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 51886 steps, run visited all 1 properties in 251 ms. (steps per millisecond=206 )
Probabilistic random walk after 51886 steps, saw 32735 distinct states, run finished after 252 ms. (steps per millisecond=205 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 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 102246 steps, run visited all 1 properties in 528 ms. (steps per millisecond=193 )
Probabilistic random walk after 102246 steps, saw 69177 distinct states, run finished after 529 ms. (steps per millisecond=193 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 151782 steps, run visited all 1 properties in 786 ms. (steps per millisecond=193 )
Probabilistic random walk after 151782 steps, saw 99847 distinct states, run finished after 786 ms. (steps per millisecond=193 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 173 ms. (229 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 69038 steps, run visited all 1 properties in 366 ms. (steps per millisecond=188 )
Probabilistic random walk after 69038 steps, saw 48014 distinct states, run finished after 367 ms. (steps per millisecond=188 ) 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 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1366 steps, run visited all 1 properties in 10 ms. (steps per millisecond=136 )
Probabilistic random walk after 1366 steps, saw 1152 distinct states, run finished after 10 ms. (steps per millisecond=136 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 758 steps, run visited all 1 properties in 6 ms. (steps per millisecond=126 )
Probabilistic random walk after 758 steps, saw 651 distinct states, run finished after 6 ms. (steps per millisecond=126 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 72278 steps, run visited all 1 properties in 371 ms. (steps per millisecond=194 )
Probabilistic random walk after 72278 steps, saw 50032 distinct states, run finished after 371 ms. (steps per millisecond=194 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 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 49510 steps, run visited all 1 properties in 270 ms. (steps per millisecond=183 )
Probabilistic random walk after 49510 steps, saw 35268 distinct states, run finished after 270 ms. (steps per millisecond=183 ) properties seen :1
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 38 ms. (1025 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 23638 steps, run visited all 1 properties in 124 ms. (steps per millisecond=190 )
Probabilistic random walk after 23638 steps, saw 17572 distinct states, run finished after 125 ms. (steps per millisecond=189 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 165 ms. (240 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 9014 steps, run visited all 1 properties in 51 ms. (steps per millisecond=176 )
Probabilistic random walk after 9014 steps, saw 6971 distinct states, run finished after 51 ms. (steps per millisecond=176 ) 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 10662 steps, run visited all 1 properties in 55 ms. (steps per millisecond=193 )
Probabilistic random walk after 10662 steps, saw 8235 distinct states, run finished after 55 ms. (steps per millisecond=193 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 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 3854 steps, run visited all 1 properties in 26 ms. (steps per millisecond=148 )
Probabilistic random walk after 3854 steps, saw 3124 distinct states, run finished after 26 ms. (steps per millisecond=148 ) properties seen :1
RANDOM walk for 340 steps (0 resets) in 4 ms. (68 steps per ms) remains 0/1 properties
RANDOM walk for 695 steps (0 resets) in 7 ms. (86 steps per ms) remains 0/1 properties
RANDOM walk for 1222 steps (0 resets) in 10 ms. (111 steps per ms) remains 0/1 properties
RANDOM walk for 1637 steps (0 resets) in 12 ms. (125 steps per ms) remains 0/1 properties
RANDOM walk for 2119 steps (0 resets) in 15 ms. (132 steps per ms) remains 0/1 properties
RANDOM walk for 2356 steps (0 resets) in 15 ms. (147 steps per ms) remains 0/1 properties
RANDOM walk for 345 steps (0 resets) in 5 ms. (57 steps per ms) remains 0/1 properties
RANDOM walk for 729 steps (0 resets) in 8 ms. (81 steps per ms) remains 0/1 properties
RANDOM walk for 1391 steps (0 resets) in 9 ms. (139 steps per ms) remains 0/1 properties
RANDOM walk for 1656 steps (0 resets) in 14 ms. (110 steps per ms) remains 0/1 properties
RANDOM walk for 2056 steps (0 resets) in 16 ms. (120 steps per ms) remains 0/1 properties
RANDOM walk for 2542 steps (0 resets) in 17 ms. (141 steps per ms) remains 0/1 properties
RANDOM walk for 2839 steps (0 resets) in 18 ms. (149 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 588560 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :0 out of 1
Probabilistic random walk after 588560 steps, saw 338008 distinct states, run finished after 3001 ms. (steps per millisecond=196 ) properties seen :0
[2025-06-01 02:00:00] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
[2025-06-01 02:00:00] [INFO ] Invariant cache hit.
[2025-06-01 02:00:00] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:00:00] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:00:01] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:00:01] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1084 variables, 0/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 792 constraints, problems are : Problem set: 0 solved, 1 unsolved in 518 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 933ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 55 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 37 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 308/342 places, 1463/1701 transitions.
RANDOM walk for 40000 steps (8 resets) in 174 ms. (228 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 675224 steps, run timeout after 3001 ms. (steps per millisecond=224 ) properties seen :0 out of 1
Probabilistic random walk after 675224 steps, saw 242816 distinct states, run finished after 3001 ms. (steps per millisecond=224 ) properties seen :0
[2025-06-01 02:00:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2025-06-01 02:00:04] [INFO ] Computed 22 invariants in 6 ms
[2025-06-01 02:00:04] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:00:04] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 334 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 188/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 301 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 659ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 30 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 29 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-06-01 02:00:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 02:00:05] [INFO ] Invariant cache hit.
[2025-06-01 02:00:05] [INFO ] Implicit Places using invariants in 301 ms returned []
[2025-06-01 02:00:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 02:00:05] [INFO ] Invariant cache hit.
[2025-06-01 02:00:06] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-01 02:00:07] [INFO ] Implicit Places using invariants and state equation in 1130 ms returned []
Implicit Place search using SMT with State Equation took 1433 ms to find 0 implicit places.
[2025-06-01 02:00:07] [INFO ] Redundant transitions in 83 ms returned []
Running 1456 sub problems to find dead transitions.
[2025-06-01 02:00:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 02:00:07] [INFO ] Invariant cache hit.
[2025-06-01 02:00:07] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:00:15] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:00:15] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 2 ms to minimize.
[2025-06-01 02:00:15] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:00:15] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-06-01 02:00:16] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2025-06-01 02:00:16] [INFO ] Deduced a trap composed of 39 places in 109 ms of which 1 ms to minimize.
[2025-06-01 02:00:16] [INFO ] Deduced a trap composed of 54 places in 112 ms of which 2 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 2 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 2 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 1 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 2 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 02:00:17] [INFO ] Deduced a trap composed of 55 places in 121 ms of which 1 ms to minimize.
[2025-06-01 02:00:18] [INFO ] Deduced a trap composed of 51 places in 116 ms of which 2 ms to minimize.
[2025-06-01 02:00:18] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:00:18] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 0 ms to minimize.
[2025-06-01 02:00:18] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2025-06-01 02:00:18] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:00:18] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2025-06-01 02:00:20] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-06-01 02:00:21] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 2 ms to minimize.
[2025-06-01 02:00:22] [INFO ] Deduced a trap composed of 15 places in 108 ms of which 2 ms to minimize.
[2025-06-01 02:00:23] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 1 ms to minimize.
[2025-06-01 02:00:25] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2025-06-01 02:00:28] [INFO ] Deduced a trap composed of 22 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:00:28] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:00:28] [INFO ] Deduced a trap composed of 64 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:00:28] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:00:28] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:00:28] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2025-06-01 02:00:29] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:00:29] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 3 ms to minimize.
[2025-06-01 02:00:29] [INFO ] Deduced a trap composed of 21 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:00:30] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 0 ms to minimize.
[2025-06-01 02:00:30] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 1 ms to minimize.
[2025-06-01 02:00:30] [INFO ] Deduced a trap composed of 25 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:00:30] [INFO ] Deduced a trap composed of 26 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:00:30] [INFO ] Deduced a trap composed of 67 places in 166 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:00:39] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2025-06-01 02:00:39] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 2 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 73 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 41 places in 105 ms of which 2 ms to minimize.
[2025-06-01 02:00:40] [INFO ] Deduced a trap composed of 44 places in 109 ms of which 2 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 56 places in 114 ms of which 2 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 53 places in 106 ms of which 2 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 64 places in 116 ms of which 1 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2025-06-01 02:00:41] [INFO ] Deduced a trap composed of 66 places in 113 ms of which 2 ms to minimize.
[2025-06-01 02:00:42] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:00:42] [INFO ] Deduced a trap composed of 41 places in 106 ms of which 2 ms to minimize.
[2025-06-01 02:00:42] [INFO ] Deduced a trap composed of 48 places in 107 ms of which 2 ms to minimize.
[2025-06-01 02:00:42] [INFO ] Deduced a trap composed of 44 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:00:42] [INFO ] Deduced a trap composed of 37 places in 106 ms of which 2 ms to minimize.
[2025-06-01 02:00:43] [INFO ] Deduced a trap composed of 67 places in 137 ms of which 2 ms to minimize.
[2025-06-01 02:00:43] [INFO ] Deduced a trap composed of 72 places in 133 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 0 ms to minimize.
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 27 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:00:53] [INFO ] Deduced a trap composed of 25 places in 56 ms of which 1 ms to minimize.
[2025-06-01 02:00:54] [INFO ] Deduced a trap composed of 55 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:00:54] [INFO ] Deduced a trap composed of 55 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:00:54] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:00:55] [INFO ] Deduced a trap composed of 69 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:00:55] [INFO ] Deduced a trap composed of 40 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:00:55] [INFO ] Deduced a trap composed of 61 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:00:55] [INFO ] Deduced a trap composed of 55 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:00:55] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:00:55] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 1 ms to minimize.
[2025-06-01 02:00:56] [INFO ] Deduced a trap composed of 59 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:00:56] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:00:56] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:00:56] [INFO ] Deduced a trap composed of 61 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:00:56] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:00:57] [INFO ] Deduced a trap composed of 64 places in 172 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 2 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 72 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 2 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 60 places in 113 ms of which 2 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 77 places in 114 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 60 places in 118 ms of which 2 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 56 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 71 places in 127 ms of which 1 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 73 places in 117 ms of which 2 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:01:03] [INFO ] Deduced a trap composed of 52 places in 124 ms of which 1 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 2 ms to minimize.
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 77 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:01:05] [INFO ] Deduced a trap composed of 47 places in 124 ms of which 1 ms to minimize.
[2025-06-01 02:01:05] [INFO ] Deduced a trap composed of 64 places in 122 ms of which 2 ms to minimize.
[2025-06-01 02:01:05] [INFO ] Deduced a trap composed of 53 places in 122 ms of which 2 ms to minimize.
[2025-06-01 02:01:05] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 2 ms to minimize.
[2025-06-01 02:01:06] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 1 ms to minimize.
[2025-06-01 02:01:06] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 122 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 100/100 constraints]
After SMT, in 60612ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60624ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62177 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 1 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
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 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
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 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 21 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2025-06-01 02:01:07] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 02:01:07] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 02:01:07] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:01:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 02:01:07] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:01:07] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:01:07] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 02:01:07] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:01:07] [INFO ] After 7ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:01:07] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:01:07] [INFO ] After 68ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 154 ms.
RANDOM walk for 40000 steps (8 resets) in 197 ms. (202 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 583080 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :0 out of 1
Probabilistic random walk after 583080 steps, saw 335445 distinct states, run finished after 3001 ms. (steps per millisecond=194 ) properties seen :0
[2025-06-01 02:01:10] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 02:01:10] [INFO ] Computed 22 invariants in 9 ms
[2025-06-01 02:01:10] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 78 places in 165 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 497/1084 variables, 233/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 362/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 24 (OVERLAPS) 0/1084 variables, 0/790 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 790 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 1/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/429 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/791 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 3 places in 88 ms of which 1 ms to minimize.
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 45 places in 62 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 2/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 530 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1124ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 34 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 35 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 308/342 places, 1463/1701 transitions.
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 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 657816 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :0 out of 1
Probabilistic random walk after 657816 steps, saw 239245 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
[2025-06-01 02:01:15] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2025-06-01 02:01:15] [INFO ] Computed 22 invariants in 15 ms
[2025-06-01 02:01:15] [INFO ] State equation strengthened by 220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/812 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 319 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 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) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 72/115 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 2/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/115 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/194 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/314 variables, 54/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 21/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:01:15] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/518 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 294/812 variables, 204/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 188/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 336 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 687ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 39 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 27 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2025-06-01 02:01:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 02:01:16] [INFO ] Invariant cache hit.
[2025-06-01 02:01:16] [INFO ] Implicit Places using invariants in 280 ms returned []
[2025-06-01 02:01:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 02:01:16] [INFO ] Invariant cache hit.
[2025-06-01 02:01:16] [INFO ] State equation strengthened by 220 read => feed constraints.
[2025-06-01 02:01:17] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1289 ms to find 0 implicit places.
[2025-06-01 02:01:17] [INFO ] Redundant transitions in 30 ms returned []
Running 1456 sub problems to find dead transitions.
[2025-06-01 02:01:17] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2025-06-01 02:01:17] [INFO ] Invariant cache hit.
[2025-06-01 02:01:17] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:01:25] [INFO ] Deduced a trap composed of 3 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 1 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
[2025-06-01 02:01:26] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 54 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 2 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 1 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 2 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 60 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 2 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 60 places in 126 ms of which 1 ms to minimize.
[2025-06-01 02:01:27] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 55 places in 115 ms of which 2 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 51 places in 118 ms of which 1 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 58 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:01:28] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2025-06-01 02:01:30] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2025-06-01 02:01:32] [INFO ] Deduced a trap composed of 13 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:01:32] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:01:33] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2025-06-01 02:01:35] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2025-06-01 02:01:38] [INFO ] Deduced a trap composed of 22 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:01:38] [INFO ] Deduced a trap composed of 54 places in 151 ms of which 1 ms to minimize.
[2025-06-01 02:01:38] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:01:39] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:01:39] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:01:39] [INFO ] Deduced a trap composed of 15 places in 56 ms of which 0 ms to minimize.
[2025-06-01 02:01:39] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:01:39] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:01:40] [INFO ] Deduced a trap composed of 21 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:01:40] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 0 ms to minimize.
[2025-06-01 02:01:40] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2025-06-01 02:01:40] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:01:40] [INFO ] Deduced a trap composed of 26 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:01:40] [INFO ] Deduced a trap composed of 67 places in 162 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:01:49] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:01:50] [INFO ] Deduced a trap composed of 53 places in 101 ms of which 2 ms to minimize.
[2025-06-01 02:01:50] [INFO ] Deduced a trap composed of 42 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:01:50] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 2 ms to minimize.
[2025-06-01 02:01:50] [INFO ] Deduced a trap composed of 42 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:01:51] [INFO ] Deduced a trap composed of 41 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:01:51] [INFO ] Deduced a trap composed of 44 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:01:51] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2025-06-01 02:01:51] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:01:51] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 2 ms to minimize.
[2025-06-01 02:01:51] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 2 ms to minimize.
[2025-06-01 02:01:52] [INFO ] Deduced a trap composed of 70 places in 109 ms of which 1 ms to minimize.
[2025-06-01 02:01:52] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 1 ms to minimize.
[2025-06-01 02:01:52] [INFO ] Deduced a trap composed of 60 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:01:52] [INFO ] Deduced a trap composed of 41 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:01:52] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2025-06-01 02:01:53] [INFO ] Deduced a trap composed of 44 places in 99 ms of which 2 ms to minimize.
[2025-06-01 02:01:53] [INFO ] Deduced a trap composed of 37 places in 107 ms of which 2 ms to minimize.
[2025-06-01 02:01:53] [INFO ] Deduced a trap composed of 67 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:01:53] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:02:03] [INFO ] Deduced a trap composed of 21 places in 57 ms of which 1 ms to minimize.
[2025-06-01 02:02:03] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 0 ms to minimize.
[2025-06-01 02:02:03] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:02:03] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-01 02:02:04] [INFO ] Deduced a trap composed of 55 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:02:04] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:02:04] [INFO ] Deduced a trap composed of 75 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:02:05] [INFO ] Deduced a trap composed of 69 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:02:05] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:02:05] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 2 ms to minimize.
[2025-06-01 02:02:05] [INFO ] Deduced a trap composed of 55 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:02:05] [INFO ] Deduced a trap composed of 62 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:02:05] [INFO ] Deduced a trap composed of 61 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:02:06] [INFO ] Deduced a trap composed of 59 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:02:06] [INFO ] Deduced a trap composed of 58 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:02:06] [INFO ] Deduced a trap composed of 53 places in 156 ms of which 1 ms to minimize.
[2025-06-01 02:02:06] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:02:06] [INFO ] Deduced a trap composed of 51 places in 143 ms of which 2 ms to minimize.
[2025-06-01 02:02:06] [INFO ] Deduced a trap composed of 58 places in 145 ms of which 2 ms to minimize.
[2025-06-01 02:02:07] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2025-06-01 02:02:10] [INFO ] Deduced a trap composed of 60 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:02:11] [INFO ] Deduced a trap composed of 72 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:02:11] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 1 ms to minimize.
[2025-06-01 02:02:11] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:02:11] [INFO ] Deduced a trap composed of 77 places in 112 ms of which 1 ms to minimize.
[2025-06-01 02:02:11] [INFO ] Deduced a trap composed of 42 places in 104 ms of which 2 ms to minimize.
[2025-06-01 02:02:12] [INFO ] Deduced a trap composed of 60 places in 122 ms of which 1 ms to minimize.
[2025-06-01 02:02:12] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2025-06-01 02:02:12] [INFO ] Deduced a trap composed of 71 places in 129 ms of which 1 ms to minimize.
[2025-06-01 02:02:13] [INFO ] Deduced a trap composed of 73 places in 119 ms of which 1 ms to minimize.
[2025-06-01 02:02:13] [INFO ] Deduced a trap composed of 54 places in 133 ms of which 1 ms to minimize.
[2025-06-01 02:02:13] [INFO ] Deduced a trap composed of 52 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:02:14] [INFO ] Deduced a trap composed of 61 places in 126 ms of which 2 ms to minimize.
[2025-06-01 02:02:14] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 3 ms to minimize.
[2025-06-01 02:02:14] [INFO ] Deduced a trap composed of 47 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:02:15] [INFO ] Deduced a trap composed of 64 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:02:15] [INFO ] Deduced a trap composed of 53 places in 119 ms of which 1 ms to minimize.
[2025-06-01 02:02:15] [INFO ] Deduced a trap composed of 66 places in 128 ms of which 2 ms to minimize.
[2025-06-01 02:02:15] [INFO ] Deduced a trap composed of 61 places in 140 ms of which 2 ms to minimize.
[2025-06-01 02:02:16] [INFO ] Deduced a trap composed of 56 places in 111 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/308 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 122 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 100/100 constraints]
After SMT, in 60678ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60690ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62046 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 0 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 1 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
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 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
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 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 29 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2025-06-01 02:02:18] [INFO ] Computed 15 invariants in 1 ms
[2025-06-01 02:02:18] [INFO ] [Real]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 02:02:18] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2025-06-01 02:02:18] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 02:02:18] [INFO ] After 5ms SMT Verify possible using 7 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:02:18] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:02:18] [INFO ] [Nat]Absence check using 15 positive place invariants in 2 ms returned sat
[2025-06-01 02:02:18] [INFO ] After 24ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:02:18] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:02:18] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:02:18] [INFO ] After 72ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 166 ms.
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 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 602576 steps, run timeout after 3001 ms. (steps per millisecond=200 ) properties seen :0 out of 1
Probabilistic random walk after 602576 steps, saw 344130 distinct states, run finished after 3001 ms. (steps per millisecond=200 ) properties seen :0
[2025-06-01 02:02:21] [INFO ] Flow matrix only has 742 transitions (discarded 959 similar events)
// Phase 1: matrix 742 rows 342 cols
[2025-06-01 02:02:21] [INFO ] Computed 22 invariants in 2 ms
[2025-06-01 02:02:21] [INFO ] State equation strengthened by 424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:02:21] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 497/1084 variables, 233/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (INCLUDED_ONLY) 0/1084 variables, 362/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1084 variables, 0/789 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 789 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 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) 45/46 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/48 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 107/155 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 2/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 79/234 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/234 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/234 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 120/354 variables, 54/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/354 variables, 21/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/354 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 221/575 variables, 12/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 12/587 variables, 6/194 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/587 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:02:22] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 2 ms to minimize.
[2025-06-01 02:02:22] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/587 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/587 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 497/1084 variables, 233/430 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1084 variables, 362/792 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:02:22] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1084 variables, 1/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1084 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 793 constraints, problems are : Problem set: 0 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 342/342 constraints, ReadFeed: 424/424 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 1701/1701 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 308 transition count 1463
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 308 transition count 1463
Applied a total of 68 rules in 47 ms. Remains 308 /342 variables (removed 34) and now considering 1463/1701 (removed 238) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 308/342 places, 1463/1701 transitions.
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 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 520590 steps, run visited all 1 properties in 2279 ms. (steps per millisecond=228 )
Probabilistic random walk after 520590 steps, saw 200480 distinct states, run finished after 2279 ms. (steps per millisecond=228 ) properties seen :1
RANDOM walk for 2086 steps (0 resets) in 22 ms. (90 steps per ms) remains 0/1 properties
RANDOM walk for 332 steps (0 resets) in 6 ms. (47 steps per ms) remains 0/1 properties
RANDOM walk for 688 steps (0 resets) in 9 ms. (68 steps per ms) remains 0/1 properties
RANDOM walk for 1066 steps (0 resets) in 10 ms. (96 steps per ms) remains 0/1 properties
RANDOM walk for 1540 steps (0 resets) in 13 ms. (110 steps per ms) remains 0/1 properties
RANDOM walk for 2091 steps (0 resets) in 15 ms. (130 steps per ms) remains 0/1 properties
RANDOM walk for 2202 steps (0 resets) in 25 ms. (84 steps per ms) remains 0/1 properties
RANDOM walk for 2768 steps (0 resets) in 17 ms. (153 steps per ms) remains 0/1 properties
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 10110 steps, run visited all 1 properties in 52 ms. (steps per millisecond=194 )
Probabilistic random walk after 10110 steps, saw 7778 distinct states, run finished after 52 ms. (steps per millisecond=194 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10118 steps, run visited all 1 properties in 53 ms. (steps per millisecond=190 )
Probabilistic random walk after 10118 steps, saw 7785 distinct states, run finished after 54 ms. (steps per millisecond=187 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 155 ms. (256 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 10126 steps, run visited all 1 properties in 53 ms. (steps per millisecond=191 )
Probabilistic random walk after 10126 steps, saw 7792 distinct states, run finished after 53 ms. (steps per millisecond=191 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10134 steps, run visited all 1 properties in 52 ms. (steps per millisecond=194 )
Probabilistic random walk after 10134 steps, saw 7799 distinct states, run finished after 52 ms. (steps per millisecond=194 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 10142 steps, run visited all 1 properties in 54 ms. (steps per millisecond=187 )
Probabilistic random walk after 10142 steps, saw 7806 distinct states, run finished after 54 ms. (steps per millisecond=187 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46862 steps, run visited all 1 properties in 240 ms. (steps per millisecond=195 )
Probabilistic random walk after 46862 steps, saw 33349 distinct states, run finished after 240 ms. (steps per millisecond=195 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 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 13662 steps, run visited all 1 properties in 71 ms. (steps per millisecond=192 )
Probabilistic random walk after 13662 steps, saw 10321 distinct states, run finished after 71 ms. (steps per millisecond=192 ) 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 46838 steps, run visited all 1 properties in 234 ms. (steps per millisecond=200 )
Probabilistic random walk after 46838 steps, saw 33328 distinct states, run finished after 234 ms. (steps per millisecond=200 ) properties seen :1
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 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46846 steps, run visited all 1 properties in 235 ms. (steps per millisecond=199 )
Probabilistic random walk after 46846 steps, saw 33335 distinct states, run finished after 235 ms. (steps per millisecond=199 ) 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 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 46854 steps, run visited all 1 properties in 234 ms. (steps per millisecond=200 )
Probabilistic random walk after 46854 steps, saw 33342 distinct states, run finished after 234 ms. (steps per millisecond=200 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 161 ms. (246 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 16942 steps, run visited all 1 properties in 92 ms. (steps per millisecond=184 )
Probabilistic random walk after 16942 steps, saw 12667 distinct states, run finished after 92 ms. (steps per millisecond=184 ) properties seen :1
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 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16950 steps, run visited all 1 properties in 89 ms. (steps per millisecond=190 )
Probabilistic random walk after 16950 steps, saw 12674 distinct states, run finished after 89 ms. (steps per millisecond=190 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 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 16918 steps, run visited all 1 properties in 87 ms. (steps per millisecond=194 )
Probabilistic random walk after 16918 steps, saw 12646 distinct states, run finished after 87 ms. (steps per millisecond=194 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 16926 steps, run visited all 1 properties in 86 ms. (steps per millisecond=196 )
Probabilistic random walk after 16926 steps, saw 12653 distinct states, run finished after 87 ms. (steps per millisecond=194 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 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 16934 steps, run visited all 1 properties in 89 ms. (steps per millisecond=190 )
Probabilistic random walk after 16934 steps, saw 12660 distinct states, run finished after 89 ms. (steps per millisecond=190 ) 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 34 ms. (1142 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6190 steps, run visited all 1 properties in 36 ms. (steps per millisecond=171 )
Probabilistic random walk after 6190 steps, saw 4788 distinct states, run finished after 36 ms. (steps per millisecond=171 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 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 6198 steps, run visited all 1 properties in 33 ms. (steps per millisecond=187 )
Probabilistic random walk after 6198 steps, saw 4795 distinct states, run finished after 34 ms. (steps per millisecond=182 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 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 6206 steps, run visited all 1 properties in 33 ms. (steps per millisecond=188 )
Probabilistic random walk after 6206 steps, saw 4802 distinct states, run finished after 33 ms. (steps per millisecond=188 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 6174 steps, run visited all 1 properties in 33 ms. (steps per millisecond=187 )
Probabilistic random walk after 6174 steps, saw 4774 distinct states, run finished after 34 ms. (steps per millisecond=181 ) properties seen :1
RANDOM walk for 40000 steps (8 resets) in 156 ms. (254 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 6182 steps, run visited all 1 properties in 34 ms. (steps per millisecond=181 )
Probabilistic random walk after 6182 steps, saw 4781 distinct states, run finished after 34 ms. (steps per millisecond=181 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1846 steps, run visited all 1 properties in 12 ms. (steps per millisecond=153 )
Probabilistic random walk after 1846 steps, saw 1516 distinct states, run finished after 12 ms. (steps per millisecond=153 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1854 steps, run visited all 1 properties in 12 ms. (steps per millisecond=154 )
Probabilistic random walk after 1854 steps, saw 1523 distinct states, run finished after 12 ms. (steps per millisecond=154 ) 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 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1862 steps, run visited all 1 properties in 12 ms. (steps per millisecond=155 )
Probabilistic random walk after 1862 steps, saw 1530 distinct states, run finished after 12 ms. (steps per millisecond=155 ) 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 33 ms. (1176 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1870 steps, run visited all 1 properties in 12 ms. (steps per millisecond=155 )
Probabilistic random walk after 1870 steps, saw 1537 distinct states, run finished after 12 ms. (steps per millisecond=155 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1838 steps, run visited all 1 properties in 13 ms. (steps per millisecond=141 )
Probabilistic random walk after 1838 steps, saw 1509 distinct states, run finished after 13 ms. (steps per millisecond=141 ) 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 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 518 steps, run visited all 1 properties in 6 ms. (steps per millisecond=86 )
Probabilistic random walk after 518 steps, saw 445 distinct states, run finished after 6 ms. (steps per millisecond=86 ) 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 30 ms. (1290 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 526 steps, run visited all 1 properties in 5 ms. (steps per millisecond=105 )
Probabilistic random walk after 526 steps, saw 452 distinct states, run finished after 5 ms. (steps per millisecond=105 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 534 steps, run visited all 1 properties in 6 ms. (steps per millisecond=89 )
Probabilistic random walk after 534 steps, saw 459 distinct states, run finished after 6 ms. (steps per millisecond=89 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 542 steps, run visited all 1 properties in 6 ms. (steps per millisecond=90 )
Probabilistic random walk after 542 steps, saw 466 distinct states, run finished after 6 ms. (steps per millisecond=90 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 550 steps, run visited all 1 properties in 6 ms. (steps per millisecond=91 )
Probabilistic random walk after 550 steps, saw 473 distinct states, run finished after 6 ms. (steps per millisecond=91 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 158 steps, run visited all 1 properties in 4 ms. (steps per millisecond=39 )
Probabilistic random walk after 158 steps, saw 141 distinct states, run finished after 4 ms. (steps per millisecond=39 ) 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 32 ms. (1212 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 166 steps, run visited all 1 properties in 4 ms. (steps per millisecond=41 )
Probabilistic random walk after 166 steps, saw 148 distinct states, run finished after 4 ms. (steps per millisecond=41 ) 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 29 ms. (1333 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 174 steps, run visited all 1 properties in 4 ms. (steps per millisecond=43 )
Probabilistic random walk after 174 steps, saw 155 distinct states, run finished after 4 ms. (steps per millisecond=43 ) properties seen :1
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 204 edges and 342 vertex of which 15 / 342 are part of one of the 7 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Ensure Unique test removed 962 transitions
Reduce isomorphic transitions removed 987 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 334 transition count 701
Reduce places removed 13 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 19 rules applied. Total rules applied 33 place count 321 transition count 695
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 39 place count 315 transition count 695
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 39 place count 315 transition count 694
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 41 place count 314 transition count 694
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 45 place count 312 transition count 692
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 47 place count 311 transition count 711
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 67 place count 311 transition count 691
Drop transitions (Redundant composition of simpler transitions.) removed 178 transitions
Redundant transition composition rules discarded 178 transitions
Iterating global reduction 4 with 178 rules applied. Total rules applied 245 place count 311 transition count 513
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -54
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 257 place count 305 transition count 567
Drop transitions (Redundant composition of simpler transitions.) removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 4 with 34 rules applied. Total rules applied 291 place count 305 transition count 533
Free-agglomeration rule applied 47 times.
Iterating global reduction 4 with 47 rules applied. Total rules applied 338 place count 305 transition count 486
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 4 with 47 rules applied. Total rules applied 385 place count 258 transition count 486
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 391 place count 258 transition count 486
Applied a total of 391 rules in 34 ms. Remains 258 /342 variables (removed 84) and now considering 486/1701 (removed 1215) transitions.
Running SMT prover for 952 properties.
// Phase 1: matrix 486 rows 258 cols
[2025-06-01 02:02:28] [INFO ] Computed 22 invariants in 4 ms
[2025-06-01 02:02:32] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2025-06-01 02:02:32] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-01 02:02:55] [INFO ] After 26716ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:952
[2025-06-01 02:02:59] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2025-06-01 02:02:59] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 2 ms returned sat
[2025-06-01 02:03:19] [INFO ] After 15818ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :952
TRAPS : Iteration 0
[2025-06-01 02:03:19] [INFO ] Deduced a trap composed of 12 places in 24 ms of which 1 ms to minimize.
[2025-06-01 02:03:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2025-06-01 02:03:21] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2025-06-01 02:03:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-01 02:03:21] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2025-06-01 02:03:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2025-06-01 02:03:22] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 02:03:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-06-01 02:03:22] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2025-06-01 02:03:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2025-06-01 02:03:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 02:03:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 64 ms

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-07"
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-07, 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-174860080700494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 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 ;