MCC'2025- Execution of r014-tall-174853743400134

About the Execution of 2024-gold for Anderson-PT-12

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
15693.590	1800000.00	3307051.00	2981.80	[undef]	Time out reached

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.r014-tall-174853743400134.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 Anderson-PT-12, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r014-tall-174853743400134
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 7.7K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K 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 139K 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 69K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K 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 2.1M 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 1748544315031

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:45:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:45:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:45:16] [INFO ] Load time of PNML (sax parser for PT used): 204 ms
[2025-05-29 18:45:16] [INFO ] Transformed 889 places.
[2025-05-29 18:45:16] [INFO ] Transformed 4152 transitions.
[2025-05-29 18:45:16] [INFO ] Found NUPN structural information;
[2025-05-29 18:45:16] [INFO ] Parsed PT model containing 889 places and 4152 transitions and 16080 arcs in 329 ms.
Built sparse matrix representations for Structural reductions in 20 ms.59560KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 889/889 places, 4152/4152 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 201 ms. Remains 889 /889 variables (removed 0) and now considering 4152/4152 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 216 ms. Remains : 889/889 places, 4152/4152 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 889/889 places, 4152/4152 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 117 ms. Remains 889 /889 variables (removed 0) and now considering 4152/4152 (removed 0) transitions.
// Phase 1: matrix 4152 rows 889 cols
[2025-05-29 18:45:17] [INFO ] Computed 27 invariants in 126 ms
[2025-05-29 18:45:18] [INFO ] Implicit Places using invariants in 782 ms returned []
[2025-05-29 18:45:18] [INFO ] Invariant cache hit.
[2025-05-29 18:45:20] [INFO ] State equation strengthened by 132 read => feed constraints.
[2025-05-29 18:45:20] [INFO ] Implicit Places using invariants and state equation in 2441 ms returned []
Implicit Place search using SMT with State Equation took 3253 ms to find 0 implicit places.
[2025-05-29 18:45:21] [INFO ] Redundant transitions in 362 ms returned []
Running 4140 sub problems to find dead transitions.
[2025-05-29 18:45:21] [INFO ] Invariant cache hit.
[2025-05-29 18:45:21] [INFO ] State equation strengthened by 132 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/889 variables, 889/889 constraints. Problems are: Problem set: 0 solved, 4140 unsolved
SMT process timed out in 49361ms, After SMT, problems are : Problem set: 0 solved, 4140 unsolved
Search for dead transitions found 0 dead transitions in 49424ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 53198 ms. Remains : 889/889 places, 4152/4152 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4913 ms (no deadlock found). (steps per millisecond=254 )
Random directed walk for 1250001 steps, including 0 resets, run took 5300 ms (no deadlock found). (steps per millisecond=235 )
[2025-05-29 18:46:20] [INFO ] Invariant cache hit.
[2025-05-29 18:46:21] [INFO ] [Real]Absence check using 13 positive place invariants in 76 ms returned sat
[2025-05-29 18:46:22] [INFO ] [Real]Absence check using 13 positive and 14 generalized place invariants in 1474 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 889/889 places, 4152/4152 transitions.
Performed 132 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 132 Pre rules applied. Total rules applied 0 place count 889 transition count 4020
Deduced a syphon composed of 132 places in 6 ms
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 0 with 264 rules applied. Total rules applied 264 place count 757 transition count 4020
Applied a total of 264 rules in 84 ms. Remains 757 /889 variables (removed 132) and now considering 4020/4152 (removed 132) transitions.
// Phase 1: matrix 4020 rows 757 cols
[2025-05-29 18:46:23] [INFO ] Computed 27 invariants in 71 ms
[2025-05-29 18:46:25] [INFO ] Implicit Places using invariants in 2366 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 2377 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 756/889 places, 4020/4152 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 144 rules applied. Total rules applied 144 place count 756 transition count 3876
Reduce places removed 144 places and 0 transitions.
Iterating post reduction 1 with 144 rules applied. Total rules applied 288 place count 612 transition count 3876
Applied a total of 288 rules in 24 ms. Remains 612 /756 variables (removed 144) and now considering 3876/4020 (removed 144) transitions.
// Phase 1: matrix 3876 rows 612 cols
[2025-05-29 18:46:25] [INFO ] Computed 26 invariants in 27 ms
[2025-05-29 18:46:26] [INFO ] Implicit Places using invariants in 1581 ms returned []
[2025-05-29 18:46:27] [INFO ] Invariant cache hit.
[2025-05-29 18:46:28] [INFO ] State equation strengthened by 252 read => feed constraints.
[2025-05-29 18:46:35] [INFO ] Implicit Places using invariants and state equation in 8765 ms returned []
Implicit Place search using SMT with State Equation took 10350 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 612/889 places, 3876/4152 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 12836 ms. Remains : 612/889 places, 3876/4152 transitions.
Initial state reduction rules removed 12 formulas.
RANDOM walk for 40000 steps (8 resets) in 13899 ms. (2 steps per ms) remains 2456/3864 properties
BEST_FIRST walk for 124 steps (8 resets) in 16 ms. (7 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 18 ms. (6 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2456/2456 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2456/2456 properties
[2025-05-29 18:46:39] [INFO ] Invariant cache hit.
[2025-05-29 18:46:39] [INFO ] State equation strengthened by 252 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/285 variables, 285/285 constraints. Problems are: Problem set: 0 solved, 2456 unsolved
SMT process timed out in 17244ms, After SMT, problems are : Problem set: 0 solved, 2456 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 285 out of 612 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 612/612 places, 3876/3876 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 576 transition count 3840
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 576 transition count 3840
Applied a total of 72 rules in 133 ms. Remains 576 /612 variables (removed 36) and now considering 3840/3876 (removed 36) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 134 ms. Remains : 576/612 places, 3840/3876 transitions.
RANDOM walk for 1200503 steps (0 resets) in 120004 ms. (10 steps per ms) remains 1682/2456 properties
BEST_FIRST walk for 4002 steps (8 resets) in 114 ms. (34 steps per ms) remains 1680/1682 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 1678/1680 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 1673/1678 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 1673/1673 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 1670/1673 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 1669/1670 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 1664/1669 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 1663/1664 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 1521/1663 properties
BEST_FIRST walk for 4001 steps (8 resets) in 93 ms. (42 steps per ms) remains 1518/1521 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 1518/1518 properties
BEST_FIRST walk for 4001 steps (8 resets) in 87 ms. (45 steps per ms) remains 1513/1518 properties
BEST_FIRST walk for 4001 steps (8 resets) in 123 ms. (32 steps per ms) remains 1513/1513 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 1513/1513 properties
BEST_FIRST walk for 4003 steps (8 resets) in 128 ms. (31 steps per ms) remains 1513/1513 properties
BEST_FIRST walk for 4003 steps (8 resets) in 146 ms. (27 steps per ms) remains 1513/1513 properties
BEST_FIRST walk for 4004 steps (8 resets) in 132 ms. (30 steps per ms) remains 1513/1513 properties
BEST_FIRST walk for 4004 steps (8 resets) in 113 ms. (35 steps per ms) remains 1513/1513 properties
BEST_FIRST walk for 4002 steps (8 resets) in 123 ms. (32 steps per ms) remains 1512/1513 properties
BEST_FIRST walk for 4004 steps (8 resets) in 125 ms. (31 steps per ms) remains 1512/1512 properties
BEST_FIRST walk for 4002 steps (8 resets) in 139 ms. (28 steps per ms) remains 1512/1512 properties
BEST_FIRST walk for 4004 steps (8 resets) in 136 ms. (29 steps per ms) remains 1512/1512 properties
BEST_FIRST walk for 4003 steps (8 resets) in 118 ms. (33 steps per ms) remains 1512/1512 properties
BEST_FIRST walk for 4003 steps (8 resets) in 99 ms. (40 steps per ms) remains 1512/1512 properties
BEST_FIRST walk for 4002 steps (8 resets) in 96 ms. (41 steps per ms) remains 1511/1512 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 1510/1511 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 1424/1510 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 1227/1424 properties
BEST_FIRST walk for 4001 steps (8 resets) in 112 ms. (35 steps per ms) remains 1227/1227 properties
BEST_FIRST walk for 4003 steps (8 resets) in 109 ms. (36 steps per ms) remains 1227/1227 properties
BEST_FIRST walk for 4001 steps (8 resets) in 72 ms. (54 steps per ms) remains 1194/1227 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 1194/1194 properties
BEST_FIRST walk for 4001 steps (8 resets) in 72 ms. (54 steps per ms) remains 1194/1194 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 1194/1194 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 1193/1194 properties
BEST_FIRST walk for 4003 steps (8 resets) in 106 ms. (37 steps per ms) remains 1193/1193 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 1182/1193 properties
BEST_FIRST walk for 4001 steps (8 resets) in 83 ms. (47 steps per ms) remains 1182/1182 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 1178/1182 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 1178/1178 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 1178/1178 properties
BEST_FIRST walk for 4001 steps (8 resets) in 69 ms. (57 steps per ms) remains 1178/1178 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 1112/1178 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 1111/1112 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 1111/1111 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 1111/1111 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 1109/1111 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 1109/1109 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 1109/1109 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 1106/1109 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 1106/1106 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 1106/1106 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 1106/1106 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 1106/1106 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 1103/1106 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 1103/1103 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 1103/1103 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 1103/1103 properties
BEST_FIRST walk for 4001 steps (8 resets) in 65 ms. (60 steps per ms) remains 1103/1103 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 1103/1103 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 1084/1103 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 1062/1084 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 1062/1062 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 1060/1062 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 1060/1060 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 1060/1060 properties
BEST_FIRST walk for 4000 steps (8 resets) in 64 ms. (61 steps per ms) remains 1060/1060 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 1044/1060 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 1026/1044 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 1024/1026 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 1024/1024 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 1021/1024 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4003 steps (8 resets) in 63 ms. (62 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 1021/1021 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 1004/1021 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 1004/1004 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 1004/1004 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 1004/1004 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 999/1004 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 997/999 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 997/997 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 997/997 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 997/997 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 997/997 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 997/997 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 973/997 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 973/973 properties
BEST_FIRST walk for 4002 steps (8 resets) in 62 ms. (63 steps per ms) remains 972/973 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 972/972 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 957/972 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 955/957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 942/955 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 934/942 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 929/934 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 926/929 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 926/926 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 926/926 properties
BEST_FIRST walk for 4000 steps (8 resets) in 57 ms. (68 steps per ms) remains 926/926 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 926/926 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 926/926 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 926/926 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 919/926 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 909/919 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 909/909 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 909/909 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 898/909 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4001 steps (8 resets) in 60 ms. (65 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 898/898 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 896/898 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 896/896 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 881/896 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 881/881 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 881/881 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 881/881 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 881/881 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 881/881 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 881/881 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 881/881 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 878/881 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 873/878 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 873/873 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 872/873 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 872/872 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 872/872 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 872/872 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 869/872 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 869/869 properties
BEST_FIRST walk for 4000 steps (8 resets) in 59 ms. (66 steps per ms) remains 869/869 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 868/869 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 868/868 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 868/868 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 868/868 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 868/868 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 868/868 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 868/868 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 868/868 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 865/868 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 864/865 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 863/864 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 854/863 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 850/854 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 840/850 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 840/840 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 836/840 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 836/836 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 812/836 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4000 steps (8 resets) in 54 ms. (72 steps per ms) remains 812/812 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 811/812 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 811/811 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 811/811 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 810/811 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 804/810 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 795/804 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4003 steps (8 resets) in 58 ms. (67 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 795/795 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 791/795 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 791/791 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 786/791 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 786/786 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 776/786 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 776/776 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 776/776 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 776/776 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 776/776 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 773/776 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 773/773 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 770/773 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4000 steps (8 resets) in 49 ms. (80 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 770/770 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 746/770 properties
BEST_FIRST walk for 4001 steps (8 resets) in 64 ms. (61 steps per ms) remains 746/746 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 746/746 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 746/746 properties
BEST_FIRST walk for 4001 steps (8 resets) in 61 ms. (64 steps per ms) remains 746/746 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 746/746 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 746/746 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 746/746 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 745/746 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 729/745 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 729/729 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 727/729 properties
BEST_FIRST walk for 4003 steps (8 resets) in 56 ms. (70 steps per ms) remains 713/727 properties
BEST_FIRST walk for 4002 steps (8 resets) in 55 ms. (71 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 58 ms. (67 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 80 ms. (49 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 713/713 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 712/713 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 712/712 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 712/712 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 712/712 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 712/712 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 712/712 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 712/712 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 712/712 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 654/712 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 654/654 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 652/654 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/652 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 649/649 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 642/649 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 641/642 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 639/641 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4000 steps (8 resets) in 42 ms. (93 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 637/639 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 636/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 636/636 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 636/636 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 626/636 properties
BEST_FIRST walk for 4000 steps (8 resets) in 44 ms. (88 steps per ms) remains 625/626 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 625/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 623/625 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 622/623 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 620/622 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/620 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 60 ms. (65 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 619/619 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 614/619 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 47 ms. (83 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 614/614 properties
BEST_FIRST walk for 4001 steps (8 resets) in 46 ms. (85 steps per ms) remains 614/614 properties
// Phase 1: matrix 3840 rows 576 cols
[2025-05-29 18:47:37] [INFO ] Computed 26 invariants in 24 ms
[2025-05-29 18:47:37] [INFO ] State equation strengthened by 228 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (OVERLAPS) 340/561 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2025-05-29 18:47:53] [INFO ] Deduced a trap composed of 449 places in 427 ms of which 76 ms to minimize.
[2025-05-29 18:47:53] [INFO ] Deduced a trap composed of 495 places in 371 ms of which 5 ms to minimize.
[2025-05-29 18:47:53] [INFO ] Deduced a trap composed of 473 places in 315 ms of which 4 ms to minimize.
[2025-05-29 18:47:54] [INFO ] Deduced a trap composed of 473 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:47:54] [INFO ] Deduced a trap composed of 472 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:47:55] [INFO ] Deduced a trap composed of 407 places in 323 ms of which 3 ms to minimize.
[2025-05-29 18:47:55] [INFO ] Deduced a trap composed of 428 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:47:55] [INFO ] Deduced a trap composed of 472 places in 320 ms of which 4 ms to minimize.
[2025-05-29 18:47:56] [INFO ] Deduced a trap composed of 471 places in 337 ms of which 4 ms to minimize.
[2025-05-29 18:47:56] [INFO ] Deduced a trap composed of 406 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:47:57] [INFO ] Deduced a trap composed of 450 places in 344 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/561 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2025-05-29 18:48:00] [INFO ] Deduced a trap composed of 427 places in 331 ms of which 4 ms to minimize.
[2025-05-29 18:48:00] [INFO ] Deduced a trap composed of 426 places in 344 ms of which 4 ms to minimize.
[2025-05-29 18:48:00] [INFO ] Deduced a trap composed of 472 places in 320 ms of which 5 ms to minimize.
[2025-05-29 18:48:01] [INFO ] Deduced a trap composed of 472 places in 353 ms of which 4 ms to minimize.
[2025-05-29 18:48:01] [INFO ] Deduced a trap composed of 476 places in 333 ms of which 3 ms to minimize.
[2025-05-29 18:48:01] [INFO ] Deduced a trap composed of 432 places in 346 ms of which 3 ms to minimize.
[2025-05-29 18:48:02] [INFO ] Deduced a trap composed of 494 places in 353 ms of which 4 ms to minimize.
[2025-05-29 18:48:02] [INFO ] Deduced a trap composed of 473 places in 354 ms of which 3 ms to minimize.
[2025-05-29 18:48:02] [INFO ] Deduced a trap composed of 426 places in 370 ms of which 3 ms to minimize.
[2025-05-29 18:48:03] [INFO ] Deduced a trap composed of 453 places in 334 ms of which 4 ms to minimize.
[2025-05-29 18:48:03] [INFO ] Deduced a trap composed of 449 places in 323 ms of which 3 ms to minimize.
[2025-05-29 18:48:03] [INFO ] Deduced a trap composed of 471 places in 344 ms of which 3 ms to minimize.
[2025-05-29 18:48:04] [INFO ] Deduced a trap composed of 403 places in 318 ms of which 4 ms to minimize.
[2025-05-29 18:48:04] [INFO ] Deduced a trap composed of 380 places in 314 ms of which 4 ms to minimize.
[2025-05-29 18:48:05] [INFO ] Deduced a trap composed of 451 places in 329 ms of which 4 ms to minimize.
[2025-05-29 18:48:05] [INFO ] Deduced a trap composed of 455 places in 311 ms of which 3 ms to minimize.
[2025-05-29 18:48:05] [INFO ] Deduced a trap composed of 426 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:48:06] [INFO ] Deduced a trap composed of 431 places in 345 ms of which 3 ms to minimize.
[2025-05-29 18:48:06] [INFO ] Deduced a trap composed of 407 places in 336 ms of which 3 ms to minimize.
[2025-05-29 18:48:06] [INFO ] Deduced a trap composed of 443 places in 336 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/561 variables, 20/44 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2025-05-29 18:48:13] [INFO ] Deduced a trap composed of 449 places in 343 ms of which 4 ms to minimize.
[2025-05-29 18:48:13] [INFO ] Deduced a trap composed of 449 places in 361 ms of which 4 ms to minimize.
[2025-05-29 18:48:13] [INFO ] Deduced a trap composed of 408 places in 349 ms of which 6 ms to minimize.
[2025-05-29 18:48:14] [INFO ] Deduced a trap composed of 451 places in 347 ms of which 4 ms to minimize.
[2025-05-29 18:48:14] [INFO ] Deduced a trap composed of 428 places in 323 ms of which 4 ms to minimize.
[2025-05-29 18:48:14] [INFO ] Deduced a trap composed of 426 places in 343 ms of which 4 ms to minimize.
[2025-05-29 18:48:15] [INFO ] Deduced a trap composed of 403 places in 344 ms of which 3 ms to minimize.
[2025-05-29 18:48:15] [INFO ] Deduced a trap composed of 423 places in 349 ms of which 4 ms to minimize.
[2025-05-29 18:48:16] [INFO ] Deduced a trap composed of 382 places in 343 ms of which 4 ms to minimize.
[2025-05-29 18:48:17] [INFO ] Deduced a trap composed of 383 places in 346 ms of which 3 ms to minimize.
[2025-05-29 18:48:17] [INFO ] Deduced a trap composed of 410 places in 335 ms of which 4 ms to minimize.
[2025-05-29 18:48:18] [INFO ] Deduced a trap composed of 426 places in 321 ms of which 4 ms to minimize.
[2025-05-29 18:48:19] [INFO ] Deduced a trap composed of 347 places in 341 ms of which 3 ms to minimize.
[2025-05-29 18:48:19] [INFO ] Deduced a trap composed of 375 places in 325 ms of which 4 ms to minimize.
[2025-05-29 18:48:20] [INFO ] Deduced a trap composed of 448 places in 329 ms of which 3 ms to minimize.
[2025-05-29 18:48:20] [INFO ] Deduced a trap composed of 344 places in 325 ms of which 3 ms to minimize.
[2025-05-29 18:48:20] [INFO ] Deduced a trap composed of 406 places in 348 ms of which 4 ms to minimize.
[2025-05-29 18:48:21] [INFO ] Deduced a trap composed of 430 places in 352 ms of which 4 ms to minimize.
[2025-05-29 18:48:21] [INFO ] Deduced a trap composed of 405 places in 498 ms of which 3 ms to minimize.
[2025-05-29 18:48:22] [INFO ] Deduced a trap composed of 406 places in 359 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/561 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 614 unsolved
[2025-05-29 18:48:23] [INFO ] Deduced a trap composed of 407 places in 327 ms of which 4 ms to minimize.
[2025-05-29 18:48:23] [INFO ] Deduced a trap composed of 449 places in 331 ms of which 4 ms to minimize.
[2025-05-29 18:48:23] [INFO ] Deduced a trap composed of 448 places in 326 ms of which 3 ms to minimize.
[2025-05-29 18:48:24] [INFO ] Deduced a trap composed of 472 places in 349 ms of which 3 ms to minimize.
[2025-05-29 18:48:24] [INFO ] Deduced a trap composed of 427 places in 330 ms of which 4 ms to minimize.
[2025-05-29 18:48:24] [INFO ] Deduced a trap composed of 380 places in 322 ms of which 4 ms to minimize.
SMT process timed out in 47875ms, After SMT, problems are : Problem set: 0 solved, 614 unsolved
Fused 614 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 221 out of 576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 576/576 places, 3840/3840 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 540 transition count 3782
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 540 transition count 3782
Applied a total of 72 rules in 92 ms. Remains 540 /576 variables (removed 36) and now considering 3782/3840 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 540/576 places, 3782/3840 transitions.
RANDOM walk for 3760021 steps (8 resets) in 120004 ms. (31 steps per ms) remains 596/614 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4001 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 596/596 properties
Probabilistic random walk after 1000001 steps, saw 773581 distinct states, run finished after 47226 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 3782 rows 540 cols
[2025-05-29 18:49:42] [INFO ] Computed 26 invariants in 19 ms
[2025-05-29 18:49:42] [INFO ] State equation strengthened by 193 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 311/525 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2025-05-29 18:49:57] [INFO ] Deduced a trap composed of 459 places in 308 ms of which 3 ms to minimize.
[2025-05-29 18:49:57] [INFO ] Deduced a trap composed of 438 places in 296 ms of which 3 ms to minimize.
[2025-05-29 18:49:58] [INFO ] Deduced a trap composed of 436 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:49:58] [INFO ] Deduced a trap composed of 413 places in 319 ms of which 4 ms to minimize.
[2025-05-29 18:49:58] [INFO ] Deduced a trap composed of 436 places in 317 ms of which 4 ms to minimize.
[2025-05-29 18:49:59] [INFO ] Deduced a trap composed of 368 places in 302 ms of which 3 ms to minimize.
[2025-05-29 18:49:59] [INFO ] Deduced a trap composed of 415 places in 290 ms of which 4 ms to minimize.
[2025-05-29 18:49:59] [INFO ] Deduced a trap composed of 391 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:50:00] [INFO ] Deduced a trap composed of 425 places in 281 ms of which 3 ms to minimize.
[2025-05-29 18:50:00] [INFO ] Deduced a trap composed of 389 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:50:00] [INFO ] Deduced a trap composed of 393 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:50:01] [INFO ] Deduced a trap composed of 345 places in 306 ms of which 3 ms to minimize.
[2025-05-29 18:50:01] [INFO ] Deduced a trap composed of 389 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:50:02] [INFO ] Deduced a trap composed of 322 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:50:02] [INFO ] Deduced a trap composed of 331 places in 332 ms of which 3 ms to minimize.
[2025-05-29 18:50:02] [INFO ] Deduced a trap composed of 346 places in 283 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2025-05-29 18:50:12] [INFO ] Deduced a trap composed of 436 places in 313 ms of which 4 ms to minimize.
[2025-05-29 18:50:12] [INFO ] Deduced a trap composed of 414 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:50:13] [INFO ] Deduced a trap composed of 329 places in 327 ms of which 3 ms to minimize.
[2025-05-29 18:50:13] [INFO ] Deduced a trap composed of 413 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:50:14] [INFO ] Deduced a trap composed of 323 places in 310 ms of which 3 ms to minimize.
[2025-05-29 18:50:14] [INFO ] Deduced a trap composed of 413 places in 281 ms of which 3 ms to minimize.
[2025-05-29 18:50:14] [INFO ] Deduced a trap composed of 392 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:50:14] [INFO ] Deduced a trap composed of 437 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:50:15] [INFO ] Deduced a trap composed of 391 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:50:15] [INFO ] Deduced a trap composed of 369 places in 314 ms of which 4 ms to minimize.
[2025-05-29 18:50:15] [INFO ] Deduced a trap composed of 369 places in 313 ms of which 3 ms to minimize.
[2025-05-29 18:50:16] [INFO ] Deduced a trap composed of 392 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:50:16] [INFO ] Deduced a trap composed of 347 places in 311 ms of which 4 ms to minimize.
[2025-05-29 18:50:16] [INFO ] Deduced a trap composed of 370 places in 293 ms of which 3 ms to minimize.
[2025-05-29 18:50:17] [INFO ] Deduced a trap composed of 347 places in 323 ms of which 3 ms to minimize.
[2025-05-29 18:50:17] [INFO ] Deduced a trap composed of 370 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:50:17] [INFO ] Deduced a trap composed of 307 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:50:18] [INFO ] Deduced a trap composed of 305 places in 324 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2025-05-29 18:50:25] [INFO ] Deduced a trap composed of 321 places in 298 ms of which 4 ms to minimize.
[2025-05-29 18:50:25] [INFO ] Deduced a trap composed of 327 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:50:26] [INFO ] Deduced a trap composed of 394 places in 346 ms of which 4 ms to minimize.
[2025-05-29 18:50:26] [INFO ] Deduced a trap composed of 393 places in 321 ms of which 4 ms to minimize.
[2025-05-29 18:50:26] [INFO ] Deduced a trap composed of 391 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:50:27] [INFO ] Deduced a trap composed of 348 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:50:27] [INFO ] Deduced a trap composed of 321 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:50:27] [INFO ] Deduced a trap composed of 371 places in 320 ms of which 3 ms to minimize.
[2025-05-29 18:50:28] [INFO ] Deduced a trap composed of 356 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:50:28] [INFO ] Deduced a trap composed of 394 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:50:28] [INFO ] Deduced a trap composed of 321 places in 306 ms of which 3 ms to minimize.
[2025-05-29 18:50:29] [INFO ] Deduced a trap composed of 332 places in 315 ms of which 4 ms to minimize.
[2025-05-29 18:50:29] [INFO ] Deduced a trap composed of 344 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:50:30] [INFO ] Deduced a trap composed of 371 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:50:30] [INFO ] Deduced a trap composed of 299 places in 296 ms of which 3 ms to minimize.
[2025-05-29 18:50:30] [INFO ] Deduced a trap composed of 349 places in 303 ms of which 3 ms to minimize.
[2025-05-29 18:50:31] [INFO ] Deduced a trap composed of 374 places in 320 ms of which 3 ms to minimize.
[2025-05-29 18:50:31] [INFO ] Deduced a trap composed of 322 places in 310 ms of which 3 ms to minimize.
[2025-05-29 18:50:31] [INFO ] Deduced a trap composed of 376 places in 323 ms of which 4 ms to minimize.
[2025-05-29 18:50:32] [INFO ] Deduced a trap composed of 374 places in 303 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/525 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2025-05-29 18:50:41] [INFO ] Deduced a trap composed of 375 places in 338 ms of which 4 ms to minimize.
[2025-05-29 18:50:42] [INFO ] Deduced a trap composed of 368 places in 299 ms of which 3 ms to minimize.
[2025-05-29 18:50:42] [INFO ] Deduced a trap composed of 347 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:50:42] [INFO ] Deduced a trap composed of 345 places in 303 ms of which 3 ms to minimize.
[2025-05-29 18:50:43] [INFO ] Deduced a trap composed of 346 places in 316 ms of which 4 ms to minimize.
[2025-05-29 18:50:43] [INFO ] Deduced a trap composed of 325 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:50:43] [INFO ] Deduced a trap composed of 414 places in 320 ms of which 4 ms to minimize.
[2025-05-29 18:50:44] [INFO ] Deduced a trap composed of 366 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:50:44] [INFO ] Deduced a trap composed of 369 places in 298 ms of which 4 ms to minimize.
[2025-05-29 18:50:44] [INFO ] Deduced a trap composed of 345 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:50:45] [INFO ] Deduced a trap composed of 299 places in 332 ms of which 4 ms to minimize.
[2025-05-29 18:50:45] [INFO ] Deduced a trap composed of 412 places in 333 ms of which 4 ms to minimize.
[2025-05-29 18:50:45] [INFO ] Deduced a trap composed of 343 places in 325 ms of which 3 ms to minimize.
[2025-05-29 18:50:46] [INFO ] Deduced a trap composed of 367 places in 346 ms of which 3 ms to minimize.
[2025-05-29 18:50:46] [INFO ] Deduced a trap composed of 413 places in 341 ms of which 3 ms to minimize.
[2025-05-29 18:50:46] [INFO ] Deduced a trap composed of 367 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:50:47] [INFO ] Deduced a trap composed of 390 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:50:47] [INFO ] Deduced a trap composed of 348 places in 313 ms of which 3 ms to minimize.
[2025-05-29 18:50:47] [INFO ] Deduced a trap composed of 345 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:50:48] [INFO ] Deduced a trap composed of 389 places in 329 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/525 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2025-05-29 18:50:58] [INFO ] Deduced a trap composed of 416 places in 325 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 1.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 1.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)timeout

org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/525 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 525/4322 variables, and 88 constraints, problems are : Problem set: 0 solved, 596 unsolved in 75035 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 0/13 constraints, State Equation: 0/540 constraints, ReadFeed: 0/193 constraints, PredecessorRefiner: 596/596 constraints, Known Traps: 75/75 constraints]
Escalating to Integer solving :Problem set: 0 solved, 596 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/214 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 1 (OVERLAPS) 311/525 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/525 variables, 75/88 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/525 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 596 unsolved
At refinement iteration 4 (OVERLAPS) 15/540 variables, 13/101 constraints. Problems are: Problem set: 0 solved, 596 unsolved
[2025-05-29 18:51:45] [INFO ] Deduced a trap composed of 101 places in 498 ms of which 4 ms to minimize.
[2025-05-29 18:51:46] [INFO ] Deduced a trap composed of 155 places in 536 ms of which 3 ms to minimize.
[2025-05-29 18:51:46] [INFO ] Deduced a trap composed of 126 places in 496 ms of which 4 ms to minimize.
[2025-05-29 18:51:47] [INFO ] Deduced a trap composed of 184 places in 505 ms of which 3 ms to minimize.
[2025-05-29 18:51:47] [INFO ] Deduced a trap composed of 144 places in 511 ms of which 3 ms to minimize.
[2025-05-29 18:51:48] [INFO ] Deduced a trap composed of 169 places in 484 ms of which 4 ms to minimize.
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 139 places in 521 ms of which 4 ms to minimize.
[2025-05-29 18:51:49] [INFO ] Deduced a trap composed of 145 places in 511 ms of which 3 ms to minimize.
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 173 places in 481 ms of which 3 ms to minimize.
[2025-05-29 18:51:50] [INFO ] Deduced a trap composed of 144 places in 528 ms of which 4 ms to minimize.
[2025-05-29 18:51:51] [INFO ] Deduced a trap composed of 88 places in 497 ms of which 5 ms to minimize.
[2025-05-29 18:51:51] [INFO ] Deduced a trap composed of 106 places in 485 ms of which 3 ms to minimize.
[2025-05-29 18:51:52] [INFO ] Deduced a trap composed of 219 places in 527 ms of which 4 ms to minimize.
[2025-05-29 18:51:52] [INFO ] Deduced a trap composed of 187 places in 499 ms of which 3 ms to minimize.
[2025-05-29 18:51:53] [INFO ] Deduced a trap composed of 127 places in 493 ms of which 4 ms to minimize.
[2025-05-29 18:51:54] [INFO ] Deduced a trap composed of 195 places in 483 ms of which 3 ms to minimize.
[2025-05-29 18:51:54] [INFO ] Deduced a trap composed of 133 places in 481 ms of which 3 ms to minimize.
[2025-05-29 18:51:55] [INFO ] Deduced a trap composed of 203 places in 483 ms of which 4 ms to minimize.
[2025-05-29 18:51:55] [INFO ] Deduced a trap composed of 152 places in 523 ms of which 3 ms to minimize.
[2025-05-29 18:51:56] [INFO ] Deduced a trap composed of 122 places in 508 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/540 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 596 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/4322 variables, and 121 constraints, problems are : Problem set: 0 solved, 596 unsolved in 75032 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/540 constraints, ReadFeed: 0/193 constraints, PredecessorRefiner: 0/596 constraints, Known Traps: 95/95 constraints]
After SMT, in 152648ms problems are : Problem set: 0 solved, 596 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 214 out of 540 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 540/540 places, 3782/3782 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 533 transition count 3775
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 533 transition count 3775
Applied a total of 14 rules in 94 ms. Remains 533 /540 variables (removed 7) and now considering 3775/3782 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 533/540 places, 3775/3782 transitions.
RANDOM walk for 3322936 steps (8 resets) in 120004 ms. (27 steps per ms) remains 584/596 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 584/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 584/584 properties
Probabilistic random walk after 1000000 steps, saw 764472 distinct states, run finished after 46053 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 3775 rows 533 cols
[2025-05-29 18:53:32] [INFO ] Computed 26 invariants in 20 ms
[2025-05-29 18:53:32] [INFO ] State equation strengthened by 186 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/208 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (OVERLAPS) 310/518 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2025-05-29 18:53:46] [INFO ] Deduced a trap composed of 361 places in 306 ms of which 3 ms to minimize.
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 429 places in 322 ms of which 3 ms to minimize.
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 363 places in 315 ms of which 3 ms to minimize.
[2025-05-29 18:53:47] [INFO ] Deduced a trap composed of 385 places in 304 ms of which 4 ms to minimize.
[2025-05-29 18:53:48] [INFO ] Deduced a trap composed of 320 places in 297 ms of which 3 ms to minimize.
[2025-05-29 18:53:48] [INFO ] Deduced a trap composed of 408 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:53:48] [INFO ] Deduced a trap composed of 407 places in 290 ms of which 3 ms to minimize.
[2025-05-29 18:53:49] [INFO ] Deduced a trap composed of 407 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:53:49] [INFO ] Deduced a trap composed of 362 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:53:50] [INFO ] Deduced a trap composed of 360 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:53:50] [INFO ] Deduced a trap composed of 290 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 364 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 382 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 360 places in 305 ms of which 3 ms to minimize.
[2025-05-29 18:53:51] [INFO ] Deduced a trap composed of 268 places in 301 ms of which 3 ms to minimize.
[2025-05-29 18:53:52] [INFO ] Deduced a trap composed of 342 places in 327 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 16/29 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2025-05-29 18:53:55] [INFO ] Deduced a trap composed of 315 places in 336 ms of which 4 ms to minimize.
[2025-05-29 18:53:55] [INFO ] Deduced a trap composed of 314 places in 331 ms of which 4 ms to minimize.
[2025-05-29 18:53:56] [INFO ] Deduced a trap composed of 291 places in 333 ms of which 4 ms to minimize.
[2025-05-29 18:53:57] [INFO ] Deduced a trap composed of 291 places in 340 ms of which 3 ms to minimize.
[2025-05-29 18:53:57] [INFO ] Deduced a trap composed of 268 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:53:57] [INFO ] Deduced a trap composed of 385 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:53:58] [INFO ] Deduced a trap composed of 339 places in 315 ms of which 4 ms to minimize.
[2025-05-29 18:53:58] [INFO ] Deduced a trap composed of 386 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:53:58] [INFO ] Deduced a trap composed of 391 places in 336 ms of which 4 ms to minimize.
[2025-05-29 18:53:59] [INFO ] Deduced a trap composed of 368 places in 335 ms of which 4 ms to minimize.
[2025-05-29 18:53:59] [INFO ] Deduced a trap composed of 389 places in 333 ms of which 4 ms to minimize.
[2025-05-29 18:53:59] [INFO ] Deduced a trap composed of 389 places in 335 ms of which 3 ms to minimize.
[2025-05-29 18:54:00] [INFO ] Deduced a trap composed of 362 places in 333 ms of which 3 ms to minimize.
[2025-05-29 18:54:00] [INFO ] Deduced a trap composed of 303 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:54:01] [INFO ] Deduced a trap composed of 321 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:54:01] [INFO ] Deduced a trap composed of 367 places in 338 ms of which 3 ms to minimize.
[2025-05-29 18:54:01] [INFO ] Deduced a trap composed of 370 places in 307 ms of which 4 ms to minimize.
[2025-05-29 18:54:02] [INFO ] Deduced a trap composed of 349 places in 305 ms of which 4 ms to minimize.
[2025-05-29 18:54:02] [INFO ] Deduced a trap composed of 315 places in 334 ms of which 4 ms to minimize.
[2025-05-29 18:54:03] [INFO ] Deduced a trap composed of 291 places in 307 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/518 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/518 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (OVERLAPS) 15/533 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2025-05-29 18:54:19] [INFO ] Deduced a trap composed of 65 places in 458 ms of which 3 ms to minimize.
[2025-05-29 18:54:19] [INFO ] Deduced a trap composed of 271 places in 484 ms of which 3 ms to minimize.
[2025-05-29 18:54:20] [INFO ] Deduced a trap composed of 117 places in 487 ms of which 4 ms to minimize.
[2025-05-29 18:54:20] [INFO ] Deduced a trap composed of 155 places in 498 ms of which 4 ms to minimize.
[2025-05-29 18:54:21] [INFO ] Deduced a trap composed of 149 places in 525 ms of which 3 ms to minimize.
[2025-05-29 18:54:22] [INFO ] Deduced a trap composed of 153 places in 506 ms of which 4 ms to minimize.
[2025-05-29 18:54:22] [INFO ] Deduced a trap composed of 147 places in 511 ms of which 4 ms to minimize.
[2025-05-29 18:54:23] [INFO ] Deduced a trap composed of 125 places in 503 ms of which 4 ms to minimize.
[2025-05-29 18:54:23] [INFO ] Deduced a trap composed of 84 places in 516 ms of which 4 ms to minimize.
[2025-05-29 18:54:24] [INFO ] Deduced a trap composed of 90 places in 489 ms of which 4 ms to minimize.
[2025-05-29 18:54:25] [INFO ] Deduced a trap composed of 170 places in 525 ms of which 3 ms to minimize.
[2025-05-29 18:54:25] [INFO ] Deduced a trap composed of 186 places in 505 ms of which 3 ms to minimize.
[2025-05-29 18:54:26] [INFO ] Deduced a trap composed of 180 places in 531 ms of which 3 ms to minimize.
[2025-05-29 18:54:26] [INFO ] Deduced a trap composed of 167 places in 518 ms of which 4 ms to minimize.
[2025-05-29 18:54:27] [INFO ] Deduced a trap composed of 176 places in 482 ms of which 3 ms to minimize.
[2025-05-29 18:54:27] [INFO ] Deduced a trap composed of 93 places in 487 ms of which 3 ms to minimize.
[2025-05-29 18:54:28] [INFO ] Deduced a trap composed of 111 places in 520 ms of which 3 ms to minimize.
[2025-05-29 18:54:28] [INFO ] Deduced a trap composed of 89 places in 518 ms of which 4 ms to minimize.
[2025-05-29 18:54:29] [INFO ] Deduced a trap composed of 180 places in 482 ms of which 3 ms to minimize.
[2025-05-29 18:54:29] [INFO ] Deduced a trap composed of 247 places in 529 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2025-05-29 18:54:37] [INFO ] Deduced a trap composed of 179 places in 526 ms of which 3 ms to minimize.
[2025-05-29 18:54:37] [INFO ] Deduced a trap composed of 145 places in 521 ms of which 3 ms to minimize.
[2025-05-29 18:54:38] [INFO ] Deduced a trap composed of 104 places in 516 ms of which 3 ms to minimize.
[2025-05-29 18:54:38] [INFO ] Deduced a trap composed of 110 places in 499 ms of which 3 ms to minimize.
[2025-05-29 18:54:39] [INFO ] Deduced a trap composed of 131 places in 471 ms of which 4 ms to minimize.
[2025-05-29 18:54:39] [INFO ] Deduced a trap composed of 182 places in 512 ms of which 4 ms to minimize.
[2025-05-29 18:54:40] [INFO ] Deduced a trap composed of 157 places in 505 ms of which 3 ms to minimize.
[2025-05-29 18:54:41] [INFO ] Deduced a trap composed of 172 places in 515 ms of which 4 ms to minimize.
[2025-05-29 18:54:41] [INFO ] Deduced a trap composed of 163 places in 509 ms of which 4 ms to minimize.
[2025-05-29 18:54:42] [INFO ] Deduced a trap composed of 152 places in 530 ms of which 4 ms to minimize.
[2025-05-29 18:54:42] [INFO ] Deduced a trap composed of 150 places in 491 ms of which 4 ms to minimize.
[2025-05-29 18:54:43] [INFO ] Deduced a trap composed of 159 places in 531 ms of which 3 ms to minimize.
[2025-05-29 18:54:43] [INFO ] Deduced a trap composed of 86 places in 535 ms of which 4 ms to minimize.
[2025-05-29 18:54:44] [INFO ] Deduced a trap composed of 86 places in 529 ms of which 4 ms to minimize.
[2025-05-29 18:54:44] [INFO ] Deduced a trap composed of 98 places in 539 ms of which 3 ms to minimize.
[2025-05-29 18:54:45] [INFO ] Deduced a trap composed of 188 places in 502 ms of which 4 ms to minimize.
[2025-05-29 18:54:46] [INFO ] Deduced a trap composed of 187 places in 531 ms of which 3 ms to minimize.
[2025-05-29 18:54:46] [INFO ] Deduced a trap composed of 154 places in 488 ms of which 3 ms to minimize.
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 172 places in 520 ms of which 3 ms to minimize.
[2025-05-29 18:54:47] [INFO ] Deduced a trap composed of 202 places in 470 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/533 variables, 20/102 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2025-05-29 18:54:49] [INFO ] Deduced a trap composed of 119 places in 522 ms of which 4 ms to minimize.
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 199 places in 508 ms of which 3 ms to minimize.
[2025-05-29 18:54:50] [INFO ] Deduced a trap composed of 229 places in 507 ms of which 3 ms to minimize.
[2025-05-29 18:54:51] [INFO ] Deduced a trap composed of 117 places in 529 ms of which 4 ms to minimize.
[2025-05-29 18:54:51] [INFO ] Deduced a trap composed of 123 places in 508 ms of which 3 ms to minimize.
[2025-05-29 18:54:52] [INFO ] Deduced a trap composed of 108 places in 490 ms of which 3 ms to minimize.
[2025-05-29 18:54:52] [INFO ] Deduced a trap composed of 179 places in 504 ms of which 4 ms to minimize.
[2025-05-29 18:54:53] [INFO ] Deduced a trap composed of 154 places in 494 ms of which 3 ms to minimize.
[2025-05-29 18:54:53] [INFO ] Deduced a trap composed of 227 places in 485 ms of which 3 ms to minimize.
[2025-05-29 18:54:54] [INFO ] Deduced a trap composed of 149 places in 482 ms of which 3 ms to minimize.
[2025-05-29 18:54:54] [INFO ] Deduced a trap composed of 179 places in 480 ms of which 3 ms to minimize.
[2025-05-29 18:54:55] [INFO ] Deduced a trap composed of 208 places in 490 ms of which 4 ms to minimize.
[2025-05-29 18:54:55] [INFO ] Deduced a trap composed of 186 places in 533 ms of which 3 ms to minimize.
[2025-05-29 18:54:56] [INFO ] Deduced a trap composed of 170 places in 516 ms of which 4 ms to minimize.
[2025-05-29 18:54:56] [INFO ] Deduced a trap composed of 165 places in 510 ms of which 3 ms to minimize.
[2025-05-29 18:54:57] [INFO ] Deduced a trap composed of 197 places in 518 ms of which 4 ms to minimize.
[2025-05-29 18:54:57] [INFO ] Deduced a trap composed of 195 places in 507 ms of which 3 ms to minimize.
[2025-05-29 18:54:58] [INFO ] Deduced a trap composed of 150 places in 456 ms of which 4 ms to minimize.
[2025-05-29 18:54:58] [INFO ] Deduced a trap composed of 148 places in 469 ms of which 3 ms to minimize.
[2025-05-29 18:54:59] [INFO ] Deduced a trap composed of 109 places in 525 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/533 variables, 20/122 constraints. Problems are: Problem set: 0 solved, 584 unsolved
[2025-05-29 18:55:02] [INFO ] Deduced a trap composed of 108 places in 524 ms of which 3 ms to minimize.
[2025-05-29 18:55:02] [INFO ] Deduced a trap composed of 136 places in 507 ms of which 3 ms to minimize.
[2025-05-29 18:55:03] [INFO ] Deduced a trap composed of 131 places in 522 ms of which 4 ms to minimize.
[2025-05-29 18:55:03] [INFO ] Deduced a trap composed of 91 places in 459 ms of which 3 ms to minimize.
[2025-05-29 18:55:04] [INFO ] Deduced a trap composed of 141 places in 466 ms of which 4 ms to minimize.
[2025-05-29 18:55:04] [INFO ] Deduced a trap composed of 102 places in 470 ms of which 4 ms to minimize.
[2025-05-29 18:55:05] [INFO ] Deduced a trap composed of 183 places in 511 ms of which 3 ms to minimize.
SMT process timed out in 93023ms, After SMT, problems are : Problem set: 0 solved, 584 unsolved
Fused 584 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 208 out of 533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 533/533 places, 3775/3775 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 528 transition count 3770
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 528 transition count 3770
Applied a total of 10 rules in 78 ms. Remains 528 /533 variables (removed 5) and now considering 3770/3775 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 528/533 places, 3770/3775 transitions.
RANDOM walk for 3944449 steps (8 resets) in 119860 ms. (32 steps per ms) remains 577/584 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 96 ms. (41 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4000 steps (8 resets) in 92 ms. (43 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 44 ms. (88 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4001 steps (8 resets) in 98 ms. (40 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 577/577 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 572/577 properties
BEST_FIRST walk for 4000 steps (8 resets) in 102 ms. (38 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4001 steps (8 resets) in 89 ms. (44 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 96 ms. (41 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4000 steps (8 resets) in 79 ms. (50 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 96 ms. (41 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 80 ms. (49 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4001 steps (8 resets) in 93 ms. (42 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4001 steps (8 resets) in 88 ms. (44 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 103 ms. (38 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4000 steps (8 resets) in 78 ms. (50 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4001 steps (8 resets) in 83 ms. (47 steps per ms) remains 572/572 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 572/572 properties
Probabilistic random walk after 1000001 steps, saw 767295 distinct states, run finished after 54019 ms. (steps per millisecond=18 ) properties seen :0
// Phase 1: matrix 3770 rows 528 cols
[2025-05-29 18:56:31] [INFO ] Computed 26 invariants in 21 ms
[2025-05-29 18:56:31] [INFO ] State equation strengthened by 181 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 307/513 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:56:45] [INFO ] Deduced a trap composed of 336 places in 324 ms of which 5 ms to minimize.
[2025-05-29 18:56:45] [INFO ] Deduced a trap composed of 378 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:56:46] [INFO ] Deduced a trap composed of 402 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:56:46] [INFO ] Deduced a trap composed of 403 places in 324 ms of which 4 ms to minimize.
[2025-05-29 18:56:46] [INFO ] Deduced a trap composed of 425 places in 321 ms of which 4 ms to minimize.
[2025-05-29 18:56:47] [INFO ] Deduced a trap composed of 380 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:56:47] [INFO ] Deduced a trap composed of 315 places in 328 ms of which 3 ms to minimize.
[2025-05-29 18:56:48] [INFO ] Deduced a trap composed of 447 places in 326 ms of which 3 ms to minimize.
[2025-05-29 18:56:48] [INFO ] Deduced a trap composed of 382 places in 327 ms of which 4 ms to minimize.
[2025-05-29 18:56:49] [INFO ] Deduced a trap composed of 426 places in 321 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 10/23 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:56:51] [INFO ] Deduced a trap composed of 426 places in 331 ms of which 3 ms to minimize.
[2025-05-29 18:56:51] [INFO ] Deduced a trap composed of 382 places in 327 ms of which 3 ms to minimize.
[2025-05-29 18:56:52] [INFO ] Deduced a trap composed of 337 places in 322 ms of which 3 ms to minimize.
[2025-05-29 18:56:52] [INFO ] Deduced a trap composed of 383 places in 308 ms of which 3 ms to minimize.
[2025-05-29 18:56:52] [INFO ] Deduced a trap composed of 316 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:56:53] [INFO ] Deduced a trap composed of 339 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:56:53] [INFO ] Deduced a trap composed of 386 places in 328 ms of which 3 ms to minimize.
[2025-05-29 18:56:54] [INFO ] Deduced a trap composed of 382 places in 329 ms of which 4 ms to minimize.
[2025-05-29 18:56:54] [INFO ] Deduced a trap composed of 332 places in 315 ms of which 3 ms to minimize.
[2025-05-29 18:56:55] [INFO ] Deduced a trap composed of 356 places in 300 ms of which 4 ms to minimize.
[2025-05-29 18:56:55] [INFO ] Deduced a trap composed of 380 places in 294 ms of which 3 ms to minimize.
[2025-05-29 18:56:56] [INFO ] Deduced a trap composed of 340 places in 299 ms of which 4 ms to minimize.
[2025-05-29 18:56:56] [INFO ] Deduced a trap composed of 402 places in 296 ms of which 3 ms to minimize.
[2025-05-29 18:56:56] [INFO ] Deduced a trap composed of 407 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:56:56] [INFO ] Deduced a trap composed of 359 places in 303 ms of which 4 ms to minimize.
[2025-05-29 18:56:57] [INFO ] Deduced a trap composed of 380 places in 307 ms of which 3 ms to minimize.
[2025-05-29 18:56:57] [INFO ] Deduced a trap composed of 360 places in 322 ms of which 3 ms to minimize.
[2025-05-29 18:56:58] [INFO ] Deduced a trap composed of 316 places in 322 ms of which 4 ms to minimize.
[2025-05-29 18:56:58] [INFO ] Deduced a trap composed of 315 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:56:58] [INFO ] Deduced a trap composed of 293 places in 316 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 5 (OVERLAPS) 15/528 variables, 13/56 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:57:14] [INFO ] Deduced a trap composed of 108 places in 478 ms of which 4 ms to minimize.
[2025-05-29 18:57:15] [INFO ] Deduced a trap composed of 101 places in 521 ms of which 4 ms to minimize.
[2025-05-29 18:57:15] [INFO ] Deduced a trap composed of 68 places in 510 ms of which 3 ms to minimize.
[2025-05-29 18:57:16] [INFO ] Deduced a trap composed of 114 places in 493 ms of which 3 ms to minimize.
[2025-05-29 18:57:16] [INFO ] Deduced a trap composed of 129 places in 524 ms of which 3 ms to minimize.
[2025-05-29 18:57:17] [INFO ] Deduced a trap composed of 97 places in 523 ms of which 3 ms to minimize.
[2025-05-29 18:57:17] [INFO ] Deduced a trap composed of 116 places in 517 ms of which 3 ms to minimize.
[2025-05-29 18:57:18] [INFO ] Deduced a trap composed of 101 places in 477 ms of which 4 ms to minimize.
[2025-05-29 18:57:18] [INFO ] Deduced a trap composed of 85 places in 520 ms of which 3 ms to minimize.
[2025-05-29 18:57:19] [INFO ] Deduced a trap composed of 139 places in 503 ms of which 4 ms to minimize.
[2025-05-29 18:57:20] [INFO ] Deduced a trap composed of 154 places in 490 ms of which 4 ms to minimize.
[2025-05-29 18:57:20] [INFO ] Deduced a trap composed of 142 places in 494 ms of which 4 ms to minimize.
[2025-05-29 18:57:21] [INFO ] Deduced a trap composed of 149 places in 519 ms of which 4 ms to minimize.
[2025-05-29 18:57:21] [INFO ] Deduced a trap composed of 192 places in 521 ms of which 4 ms to minimize.
[2025-05-29 18:57:22] [INFO ] Deduced a trap composed of 189 places in 499 ms of which 3 ms to minimize.
[2025-05-29 18:57:22] [INFO ] Deduced a trap composed of 177 places in 491 ms of which 4 ms to minimize.
[2025-05-29 18:57:23] [INFO ] Deduced a trap composed of 190 places in 505 ms of which 3 ms to minimize.
[2025-05-29 18:57:23] [INFO ] Deduced a trap composed of 166 places in 505 ms of which 3 ms to minimize.
[2025-05-29 18:57:24] [INFO ] Deduced a trap composed of 117 places in 506 ms of which 4 ms to minimize.
[2025-05-29 18:57:24] [INFO ] Deduced a trap composed of 78 places in 507 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/528 variables, 20/76 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:57:31] [INFO ] Deduced a trap composed of 222 places in 529 ms of which 3 ms to minimize.
[2025-05-29 18:57:32] [INFO ] Deduced a trap composed of 250 places in 514 ms of which 4 ms to minimize.
[2025-05-29 18:57:32] [INFO ] Deduced a trap composed of 154 places in 460 ms of which 3 ms to minimize.
[2025-05-29 18:57:33] [INFO ] Deduced a trap composed of 151 places in 462 ms of which 3 ms to minimize.
[2025-05-29 18:57:33] [INFO ] Deduced a trap composed of 103 places in 461 ms of which 3 ms to minimize.
[2025-05-29 18:57:34] [INFO ] Deduced a trap composed of 97 places in 518 ms of which 4 ms to minimize.
[2025-05-29 18:57:34] [INFO ] Deduced a trap composed of 98 places in 521 ms of which 3 ms to minimize.
[2025-05-29 18:57:35] [INFO ] Deduced a trap composed of 105 places in 499 ms of which 3 ms to minimize.
[2025-05-29 18:57:36] [INFO ] Deduced a trap composed of 141 places in 512 ms of which 3 ms to minimize.
[2025-05-29 18:57:36] [INFO ] Deduced a trap composed of 114 places in 514 ms of which 4 ms to minimize.
[2025-05-29 18:57:37] [INFO ] Deduced a trap composed of 172 places in 515 ms of which 3 ms to minimize.
[2025-05-29 18:57:37] [INFO ] Deduced a trap composed of 127 places in 509 ms of which 3 ms to minimize.
[2025-05-29 18:57:38] [INFO ] Deduced a trap composed of 194 places in 509 ms of which 4 ms to minimize.
[2025-05-29 18:57:38] [INFO ] Deduced a trap composed of 187 places in 490 ms of which 3 ms to minimize.
[2025-05-29 18:57:39] [INFO ] Deduced a trap composed of 123 places in 510 ms of which 3 ms to minimize.
[2025-05-29 18:57:39] [INFO ] Deduced a trap composed of 143 places in 499 ms of which 4 ms to minimize.
[2025-05-29 18:57:40] [INFO ] Deduced a trap composed of 150 places in 507 ms of which 3 ms to minimize.
[2025-05-29 18:57:40] [INFO ] Deduced a trap composed of 141 places in 497 ms of which 3 ms to minimize.
[2025-05-29 18:57:41] [INFO ] Deduced a trap composed of 136 places in 510 ms of which 3 ms to minimize.
[2025-05-29 18:57:41] [INFO ] Deduced a trap composed of 155 places in 505 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/528 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:57:44] [INFO ] Deduced a trap composed of 168 places in 501 ms of which 3 ms to minimize.
[2025-05-29 18:57:44] [INFO ] Deduced a trap composed of 133 places in 490 ms of which 3 ms to minimize.
[2025-05-29 18:57:45] [INFO ] Deduced a trap composed of 155 places in 500 ms of which 3 ms to minimize.
[2025-05-29 18:57:45] [INFO ] Deduced a trap composed of 152 places in 515 ms of which 3 ms to minimize.
[2025-05-29 18:57:46] [INFO ] Deduced a trap composed of 132 places in 452 ms of which 3 ms to minimize.
[2025-05-29 18:57:47] [INFO ] Deduced a trap composed of 117 places in 521 ms of which 3 ms to minimize.
[2025-05-29 18:57:47] [INFO ] Deduced a trap composed of 94 places in 511 ms of which 3 ms to minimize.
[2025-05-29 18:57:48] [INFO ] Deduced a trap composed of 205 places in 523 ms of which 3 ms to minimize.
[2025-05-29 18:57:48] [INFO ] Deduced a trap composed of 209 places in 510 ms of which 3 ms to minimize.
[2025-05-29 18:57:49] [INFO ] Deduced a trap composed of 202 places in 465 ms of which 3 ms to minimize.
[2025-05-29 18:57:49] [INFO ] Deduced a trap composed of 175 places in 457 ms of which 3 ms to minimize.
[2025-05-29 18:57:50] [INFO ] Deduced a trap composed of 230 places in 488 ms of which 4 ms to minimize.
[2025-05-29 18:57:50] [INFO ] Deduced a trap composed of 250 places in 525 ms of which 4 ms to minimize.
[2025-05-29 18:57:51] [INFO ] Deduced a trap composed of 182 places in 528 ms of which 3 ms to minimize.
[2025-05-29 18:57:51] [INFO ] Deduced a trap composed of 183 places in 516 ms of which 4 ms to minimize.
[2025-05-29 18:57:52] [INFO ] Deduced a trap composed of 162 places in 508 ms of which 3 ms to minimize.
[2025-05-29 18:57:53] [INFO ] Deduced a trap composed of 181 places in 499 ms of which 3 ms to minimize.
[2025-05-29 18:57:53] [INFO ] Deduced a trap composed of 183 places in 505 ms of which 3 ms to minimize.
[2025-05-29 18:57:54] [INFO ] Deduced a trap composed of 232 places in 528 ms of which 4 ms to minimize.
[2025-05-29 18:57:54] [INFO ] Deduced a trap composed of 190 places in 467 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/528 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:57:57] [INFO ] Deduced a trap composed of 125 places in 511 ms of which 3 ms to minimize.
[2025-05-29 18:57:58] [INFO ] Deduced a trap composed of 172 places in 526 ms of which 4 ms to minimize.
[2025-05-29 18:57:58] [INFO ] Deduced a trap composed of 166 places in 517 ms of which 3 ms to minimize.
[2025-05-29 18:57:59] [INFO ] Deduced a trap composed of 174 places in 517 ms of which 3 ms to minimize.
[2025-05-29 18:57:59] [INFO ] Deduced a trap composed of 176 places in 511 ms of which 3 ms to minimize.
[2025-05-29 18:58:00] [INFO ] Deduced a trap composed of 156 places in 474 ms of which 3 ms to minimize.
[2025-05-29 18:58:00] [INFO ] Deduced a trap composed of 147 places in 471 ms of which 3 ms to minimize.
[2025-05-29 18:58:01] [INFO ] Deduced a trap composed of 149 places in 479 ms of which 4 ms to minimize.
[2025-05-29 18:58:02] [INFO ] Deduced a trap composed of 122 places in 519 ms of which 3 ms to minimize.
[2025-05-29 18:58:02] [INFO ] Deduced a trap composed of 63 places in 484 ms of which 3 ms to minimize.
[2025-05-29 18:58:03] [INFO ] Deduced a trap composed of 151 places in 535 ms of which 3 ms to minimize.
[2025-05-29 18:58:04] [INFO ] Deduced a trap composed of 68 places in 489 ms of which 3 ms to minimize.
[2025-05-29 18:58:04] [INFO ] Deduced a trap composed of 150 places in 476 ms of which 3 ms to minimize.
[2025-05-29 18:58:05] [INFO ] Deduced a trap composed of 143 places in 469 ms of which 3 ms to minimize.
[2025-05-29 18:58:05] [INFO ] Deduced a trap composed of 158 places in 466 ms of which 3 ms to minimize.
[2025-05-29 18:58:06] [INFO ] Deduced a trap composed of 154 places in 461 ms of which 3 ms to minimize.
[2025-05-29 18:58:06] [INFO ] Deduced a trap composed of 181 places in 504 ms of which 3 ms to minimize.
[2025-05-29 18:58:07] [INFO ] Deduced a trap composed of 202 places in 464 ms of which 3 ms to minimize.
[2025-05-29 18:58:07] [INFO ] Deduced a trap composed of 208 places in 502 ms of which 4 ms to minimize.
[2025-05-29 18:58:08] [INFO ] Deduced a trap composed of 106 places in 459 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/528 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 528/4298 variables, and 136 constraints, problems are : Problem set: 0 solved, 572 unsolved in 105030 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/528 constraints, ReadFeed: 0/181 constraints, PredecessorRefiner: 572/572 constraints, Known Traps: 110/110 constraints]
Escalating to Integer solving :Problem set: 0 solved, 572 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 1 (OVERLAPS) 307/513 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 572 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/513 variables, 30/43 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:58:29] [INFO ] Deduced a trap composed of 333 places in 308 ms of which 3 ms to minimize.
[2025-05-29 18:58:29] [INFO ] Deduced a trap composed of 313 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:58:29] [INFO ] Deduced a trap composed of 380 places in 307 ms of which 3 ms to minimize.
[2025-05-29 18:58:30] [INFO ] Deduced a trap composed of 355 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:58:30] [INFO ] Deduced a trap composed of 334 places in 310 ms of which 3 ms to minimize.
[2025-05-29 18:58:30] [INFO ] Deduced a trap composed of 401 places in 311 ms of which 4 ms to minimize.
[2025-05-29 18:58:31] [INFO ] Deduced a trap composed of 401 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:58:31] [INFO ] Deduced a trap composed of 312 places in 304 ms of which 3 ms to minimize.
[2025-05-29 18:58:31] [INFO ] Deduced a trap composed of 356 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:58:32] [INFO ] Deduced a trap composed of 379 places in 294 ms of which 3 ms to minimize.
[2025-05-29 18:58:32] [INFO ] Deduced a trap composed of 378 places in 315 ms of which 3 ms to minimize.
[2025-05-29 18:58:32] [INFO ] Deduced a trap composed of 334 places in 278 ms of which 3 ms to minimize.
[2025-05-29 18:58:33] [INFO ] Deduced a trap composed of 335 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:58:33] [INFO ] Deduced a trap composed of 403 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:58:33] [INFO ] Deduced a trap composed of 312 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:58:34] [INFO ] Deduced a trap composed of 357 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:58:34] [INFO ] Deduced a trap composed of 342 places in 321 ms of which 3 ms to minimize.
[2025-05-29 18:58:34] [INFO ] Deduced a trap composed of 313 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:58:35] [INFO ] Deduced a trap composed of 391 places in 376 ms of which 3 ms to minimize.
[2025-05-29 18:58:35] [INFO ] Deduced a trap composed of 379 places in 364 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/513 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:58:43] [INFO ] Deduced a trap composed of 402 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:58:44] [INFO ] Deduced a trap composed of 358 places in 290 ms of which 3 ms to minimize.
[2025-05-29 18:58:44] [INFO ] Deduced a trap composed of 325 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:58:45] [INFO ] Deduced a trap composed of 312 places in 346 ms of which 3 ms to minimize.
[2025-05-29 18:58:45] [INFO ] Deduced a trap composed of 280 places in 327 ms of which 3 ms to minimize.
[2025-05-29 18:58:45] [INFO ] Deduced a trap composed of 268 places in 325 ms of which 3 ms to minimize.
[2025-05-29 18:58:46] [INFO ] Deduced a trap composed of 334 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:58:46] [INFO ] Deduced a trap composed of 348 places in 338 ms of which 3 ms to minimize.
[2025-05-29 18:58:46] [INFO ] Deduced a trap composed of 334 places in 327 ms of which 4 ms to minimize.
[2025-05-29 18:58:47] [INFO ] Deduced a trap composed of 334 places in 313 ms of which 3 ms to minimize.
[2025-05-29 18:58:47] [INFO ] Deduced a trap composed of 288 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:58:47] [INFO ] Deduced a trap composed of 327 places in 342 ms of which 3 ms to minimize.
[2025-05-29 18:58:48] [INFO ] Deduced a trap composed of 337 places in 322 ms of which 4 ms to minimize.
[2025-05-29 18:58:48] [INFO ] Deduced a trap composed of 304 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:58:48] [INFO ] Deduced a trap composed of 314 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:58:49] [INFO ] Deduced a trap composed of 281 places in 325 ms of which 3 ms to minimize.
[2025-05-29 18:58:49] [INFO ] Deduced a trap composed of 241 places in 349 ms of which 4 ms to minimize.
[2025-05-29 18:58:49] [INFO ] Deduced a trap composed of 268 places in 318 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/513 variables, 18/81 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:59:00] [INFO ] Deduced a trap composed of 333 places in 341 ms of which 3 ms to minimize.
[2025-05-29 18:59:01] [INFO ] Deduced a trap composed of 371 places in 350 ms of which 3 ms to minimize.
[2025-05-29 18:59:01] [INFO ] Deduced a trap composed of 379 places in 341 ms of which 3 ms to minimize.
[2025-05-29 18:59:02] [INFO ] Deduced a trap composed of 321 places in 343 ms of which 3 ms to minimize.
[2025-05-29 18:59:02] [INFO ] Deduced a trap composed of 313 places in 334 ms of which 4 ms to minimize.
[2025-05-29 18:59:02] [INFO ] Deduced a trap composed of 253 places in 348 ms of which 3 ms to minimize.
[2025-05-29 18:59:03] [INFO ] Deduced a trap composed of 263 places in 341 ms of which 3 ms to minimize.
[2025-05-29 18:59:03] [INFO ] Deduced a trap composed of 288 places in 324 ms of which 3 ms to minimize.
[2025-05-29 18:59:03] [INFO ] Deduced a trap composed of 266 places in 334 ms of which 3 ms to minimize.
[2025-05-29 18:59:04] [INFO ] Deduced a trap composed of 347 places in 327 ms of which 3 ms to minimize.
[2025-05-29 18:59:04] [INFO ] Deduced a trap composed of 293 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:59:04] [INFO ] Deduced a trap composed of 236 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:59:05] [INFO ] Deduced a trap composed of 314 places in 347 ms of which 3 ms to minimize.
[2025-05-29 18:59:05] [INFO ] Deduced a trap composed of 332 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:59:05] [INFO ] Deduced a trap composed of 269 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:59:06] [INFO ] Deduced a trap composed of 380 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:59:06] [INFO ] Deduced a trap composed of 313 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:59:06] [INFO ] Deduced a trap composed of 335 places in 313 ms of which 3 ms to minimize.
[2025-05-29 18:59:07] [INFO ] Deduced a trap composed of 310 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:59:07] [INFO ] Deduced a trap composed of 333 places in 322 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/513 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:59:16] [INFO ] Deduced a trap composed of 314 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:59:16] [INFO ] Deduced a trap composed of 292 places in 298 ms of which 3 ms to minimize.
[2025-05-29 18:59:17] [INFO ] Deduced a trap composed of 271 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:59:17] [INFO ] Deduced a trap composed of 378 places in 278 ms of which 3 ms to minimize.
[2025-05-29 18:59:17] [INFO ] Deduced a trap composed of 334 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:59:18] [INFO ] Deduced a trap composed of 335 places in 314 ms of which 3 ms to minimize.
[2025-05-29 18:59:18] [INFO ] Deduced a trap composed of 335 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:59:18] [INFO ] Deduced a trap composed of 291 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:59:19] [INFO ] Deduced a trap composed of 291 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:59:19] [INFO ] Deduced a trap composed of 268 places in 301 ms of which 3 ms to minimize.
[2025-05-29 18:59:19] [INFO ] Deduced a trap composed of 268 places in 319 ms of which 3 ms to minimize.
[2025-05-29 18:59:20] [INFO ] Deduced a trap composed of 245 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:59:20] [INFO ] Deduced a trap composed of 314 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:59:20] [INFO ] Deduced a trap composed of 314 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:59:21] [INFO ] Deduced a trap composed of 337 places in 320 ms of which 3 ms to minimize.
[2025-05-29 18:59:21] [INFO ] Deduced a trap composed of 356 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:59:21] [INFO ] Deduced a trap composed of 335 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:59:22] [INFO ] Deduced a trap composed of 336 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:59:22] [INFO ] Deduced a trap composed of 313 places in 318 ms of which 3 ms to minimize.
[2025-05-29 18:59:22] [INFO ] Deduced a trap composed of 336 places in 299 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/513 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:59:32] [INFO ] Deduced a trap composed of 333 places in 297 ms of which 3 ms to minimize.
[2025-05-29 18:59:32] [INFO ] Deduced a trap composed of 312 places in 292 ms of which 3 ms to minimize.
[2025-05-29 18:59:32] [INFO ] Deduced a trap composed of 333 places in 296 ms of which 3 ms to minimize.
[2025-05-29 18:59:33] [INFO ] Deduced a trap composed of 310 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:59:33] [INFO ] Deduced a trap composed of 312 places in 309 ms of which 3 ms to minimize.
[2025-05-29 18:59:33] [INFO ] Deduced a trap composed of 289 places in 325 ms of which 3 ms to minimize.
[2025-05-29 18:59:34] [INFO ] Deduced a trap composed of 265 places in 312 ms of which 3 ms to minimize.
[2025-05-29 18:59:34] [INFO ] Deduced a trap composed of 310 places in 299 ms of which 3 ms to minimize.
[2025-05-29 18:59:34] [INFO ] Deduced a trap composed of 313 places in 296 ms of which 3 ms to minimize.
[2025-05-29 18:59:34] [INFO ] Deduced a trap composed of 333 places in 315 ms of which 3 ms to minimize.
[2025-05-29 18:59:35] [INFO ] Deduced a trap composed of 310 places in 308 ms of which 3 ms to minimize.
[2025-05-29 18:59:35] [INFO ] Deduced a trap composed of 312 places in 317 ms of which 3 ms to minimize.
[2025-05-29 18:59:35] [INFO ] Deduced a trap composed of 312 places in 313 ms of which 3 ms to minimize.
[2025-05-29 18:59:36] [INFO ] Deduced a trap composed of 290 places in 298 ms of which 3 ms to minimize.
[2025-05-29 18:59:36] [INFO ] Deduced a trap composed of 289 places in 290 ms of which 3 ms to minimize.
[2025-05-29 18:59:36] [INFO ] Deduced a trap composed of 244 places in 313 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/513 variables, 16/137 constraints. Problems are: Problem set: 0 solved, 572 unsolved
[2025-05-29 18:59:49] [INFO ] Deduced a trap composed of 356 places in 311 ms of which 3 ms to minimize.
[2025-05-29 18:59:49] [INFO ] Deduced a trap composed of 333 places in 286 ms of which 4 ms to minimize.
[2025-05-29 18:59:49] [INFO ] Deduced a trap composed of 359 places in 316 ms of which 3 ms to minimize.
[2025-05-29 18:59:50] [INFO ] Deduced a trap composed of 310 places in 306 ms of which 3 ms to minimize.
[2025-05-29 18:59:50] [INFO ] Deduced a trap composed of 287 places in 303 ms of which 3 ms to minimize.
[2025-05-29 18:59:50] [INFO ] Deduced a trap composed of 334 places in 300 ms of which 3 ms to minimize.
[2025-05-29 18:59:51] [INFO ] Deduced a trap composed of 358 places in 295 ms of which 3 ms to minimize.
[2025-05-29 18:59:51] [INFO ] Deduced a trap composed of 288 places in 286 ms of which 3 ms to minimize.
[2025-05-29 18:59:51] [INFO ] Deduced a trap composed of 288 places in 314 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/513 variables, 9/146 constraints. Problems are: Problem set: 0 solved, 572 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 513/4298 variables, and 146 constraints, problems are : Problem set: 0 solved, 572 unsolved in 105015 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 0/13 constraints, State Equation: 0/528 constraints, ReadFeed: 0/181 constraints, PredecessorRefiner: 0/572 constraints, Known Traps: 133/213 constraints]
After SMT, in 212589ms problems are : Problem set: 0 solved, 572 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 206 out of 528 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 528/528 places, 3770/3770 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 526 transition count 3768
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 526 transition count 3768
Applied a total of 4 rules in 73 ms. Remains 526 /528 variables (removed 2) and now considering 3768/3770 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 526/528 places, 3768/3770 transitions.
RANDOM walk for 1992407 steps (4 resets) in 120008 ms. (16 steps per ms) remains 563/572 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4001 steps (8 resets) in 98 ms. (40 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4000 steps (8 resets) in 82 ms. (48 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 78 ms. (50 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 71 ms. (55 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 51 ms. (76 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 563/563 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 554/563 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4001 steps (8 resets) in 94 ms. (42 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4002 steps (8 resets) in 75 ms. (52 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4003 steps (8 resets) in 98 ms. (40 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 554/554 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 553/554 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 59 ms. (66 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 47 ms. (83 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 85 ms. (46 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4001 steps (8 resets) in 44 ms. (88 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4001 steps (8 resets) in 92 ms. (43 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4001 steps (8 resets) in 57 ms. (68 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4001 steps (8 resets) in 82 ms. (48 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4001 steps (8 resets) in 82 ms. (48 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 90 ms. (43 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 90 ms. (43 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4000 steps (8 resets) in 91 ms. (43 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4001 steps (8 resets) in 107 ms. (37 steps per ms) remains 553/553 properties
BEST_FIRST walk for 4001 steps (8 resets) in 86 ms. (45 steps per ms) remains 551/553 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4003 steps (8 resets) in 64 ms. (61 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4001 steps (8 resets) in 56 ms. (70 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4001 steps (8 resets) in 79 ms. (50 steps per ms) remains 551/551 properties
BEST_FIRST walk for 4001 steps (8 resets) in 71 ms. (55 steps per ms) remains 550/551 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4001 steps (8 resets) in 70 ms. (56 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 79 ms. (50 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 65 ms. (60 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 74 ms. (53 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 41 ms. (95 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 80 ms. (49 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4001 steps (8 resets) in 88 ms. (44 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 100 ms. (39 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4001 steps (8 resets) in 76 ms. (51 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 86 ms. (46 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 102 ms. (38 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4001 steps (8 resets) in 53 ms. (74 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 74 ms. (53 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4001 steps (8 resets) in 82 ms. (48 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 56 ms. (70 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 52 ms. (75 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4003 steps (8 resets) in 54 ms. (72 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 550/550 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 549/550 properties
BEST_FIRST walk for 4001 steps (8 resets) in 81 ms. (48 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 73 ms. (54 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 63 ms. (62 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 88 ms. (44 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 49 ms. (80 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 72 ms. (54 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 76 ms. (51 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4000 steps (8 resets) in 52 ms. (75 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 86 ms. (45 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 89 ms. (44 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 88 ms. (44 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 85 ms. (46 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 57 ms. (69 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 71 ms. (55 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 72 ms. (54 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 75 ms. (52 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 68 ms. (58 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 73 ms. (54 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 90 ms. (43 steps per ms) remains 549/549 properties
BEST_FIRST walk for 4001 steps (8 resets) in 78 ms. (50 steps per ms) remains 549/549 properties
Probabilistic random walk after 1000001 steps, saw 768587 distinct states, run finished after 46663 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 3768 rows 526 cols
[2025-05-29 19:01:24] [INFO ] Computed 26 invariants in 17 ms
[2025-05-29 19:01:24] [INFO ] State equation strengthened by 179 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/202 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (OVERLAPS) 309/511 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2025-05-29 19:01:38] [INFO ] Deduced a trap composed of 399 places in 306 ms of which 3 ms to minimize.
[2025-05-29 19:01:38] [INFO ] Deduced a trap composed of 422 places in 305 ms of which 3 ms to minimize.
[2025-05-29 19:01:39] [INFO ] Deduced a trap composed of 354 places in 292 ms of which 3 ms to minimize.
[2025-05-29 19:01:39] [INFO ] Deduced a trap composed of 353 places in 308 ms of which 4 ms to minimize.
[2025-05-29 19:01:39] [INFO ] Deduced a trap composed of 358 places in 307 ms of which 3 ms to minimize.
[2025-05-29 19:01:40] [INFO ] Deduced a trap composed of 334 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:01:40] [INFO ] Deduced a trap composed of 311 places in 275 ms of which 3 ms to minimize.
[2025-05-29 19:01:41] [INFO ] Deduced a trap composed of 382 places in 317 ms of which 3 ms to minimize.
[2025-05-29 19:01:41] [INFO ] Deduced a trap composed of 355 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:01:41] [INFO ] Deduced a trap composed of 381 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:01:42] [INFO ] Deduced a trap composed of 380 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:01:42] [INFO ] Deduced a trap composed of 292 places in 327 ms of which 3 ms to minimize.
[2025-05-29 19:01:42] [INFO ] Deduced a trap composed of 355 places in 315 ms of which 4 ms to minimize.
[2025-05-29 19:01:43] [INFO ] Deduced a trap composed of 377 places in 317 ms of which 3 ms to minimize.
[2025-05-29 19:01:43] [INFO ] Deduced a trap composed of 332 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:01:43] [INFO ] Deduced a trap composed of 364 places in 310 ms of which 3 ms to minimize.
[2025-05-29 19:01:44] [INFO ] Deduced a trap composed of 308 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:01:44] [INFO ] Deduced a trap composed of 309 places in 314 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/511 variables, 18/31 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2025-05-29 19:01:54] [INFO ] Deduced a trap composed of 422 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:01:54] [INFO ] Deduced a trap composed of 377 places in 284 ms of which 3 ms to minimize.
[2025-05-29 19:01:54] [INFO ] Deduced a trap composed of 377 places in 307 ms of which 3 ms to minimize.
[2025-05-29 19:01:55] [INFO ] Deduced a trap composed of 400 places in 310 ms of which 3 ms to minimize.
[2025-05-29 19:01:55] [INFO ] Deduced a trap composed of 442 places in 299 ms of which 3 ms to minimize.
[2025-05-29 19:01:55] [INFO ] Deduced a trap composed of 398 places in 298 ms of which 3 ms to minimize.
[2025-05-29 19:01:56] [INFO ] Deduced a trap composed of 443 places in 303 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/511 variables, 7/38 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/511 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (OVERLAPS) 15/526 variables, 13/51 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2025-05-29 19:02:12] [INFO ] Deduced a trap composed of 161 places in 453 ms of which 3 ms to minimize.
[2025-05-29 19:02:12] [INFO ] Deduced a trap composed of 172 places in 499 ms of which 3 ms to minimize.
[2025-05-29 19:02:13] [INFO ] Deduced a trap composed of 163 places in 511 ms of which 3 ms to minimize.
[2025-05-29 19:02:13] [INFO ] Deduced a trap composed of 225 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:02:14] [INFO ] Deduced a trap composed of 212 places in 452 ms of which 3 ms to minimize.
[2025-05-29 19:02:14] [INFO ] Deduced a trap composed of 143 places in 458 ms of which 3 ms to minimize.
[2025-05-29 19:02:15] [INFO ] Deduced a trap composed of 69 places in 460 ms of which 4 ms to minimize.
[2025-05-29 19:02:15] [INFO ] Deduced a trap composed of 136 places in 447 ms of which 3 ms to minimize.
[2025-05-29 19:02:16] [INFO ] Deduced a trap composed of 143 places in 453 ms of which 3 ms to minimize.
[2025-05-29 19:02:16] [INFO ] Deduced a trap composed of 118 places in 479 ms of which 3 ms to minimize.
[2025-05-29 19:02:17] [INFO ] Deduced a trap composed of 153 places in 499 ms of which 3 ms to minimize.
[2025-05-29 19:02:17] [INFO ] Deduced a trap composed of 111 places in 498 ms of which 3 ms to minimize.
[2025-05-29 19:02:18] [INFO ] Deduced a trap composed of 100 places in 499 ms of which 3 ms to minimize.
[2025-05-29 19:02:18] [INFO ] Deduced a trap composed of 78 places in 488 ms of which 3 ms to minimize.
[2025-05-29 19:02:19] [INFO ] Deduced a trap composed of 54 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:02:19] [INFO ] Deduced a trap composed of 57 places in 494 ms of which 7 ms to minimize.
[2025-05-29 19:02:20] [INFO ] Deduced a trap composed of 124 places in 461 ms of which 3 ms to minimize.
[2025-05-29 19:02:20] [INFO ] Deduced a trap composed of 178 places in 496 ms of which 3 ms to minimize.
[2025-05-29 19:02:21] [INFO ] Deduced a trap composed of 216 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:02:21] [INFO ] Deduced a trap composed of 204 places in 498 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/526 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2025-05-29 19:02:28] [INFO ] Deduced a trap composed of 102 places in 506 ms of which 3 ms to minimize.
[2025-05-29 19:02:29] [INFO ] Deduced a trap composed of 188 places in 512 ms of which 4 ms to minimize.
[2025-05-29 19:02:29] [INFO ] Deduced a trap composed of 144 places in 506 ms of which 4 ms to minimize.
[2025-05-29 19:02:30] [INFO ] Deduced a trap composed of 134 places in 471 ms of which 3 ms to minimize.
[2025-05-29 19:02:30] [INFO ] Deduced a trap composed of 66 places in 516 ms of which 3 ms to minimize.
[2025-05-29 19:02:31] [INFO ] Deduced a trap composed of 114 places in 501 ms of which 3 ms to minimize.
[2025-05-29 19:02:32] [INFO ] Deduced a trap composed of 130 places in 494 ms of which 3 ms to minimize.
[2025-05-29 19:02:32] [INFO ] Deduced a trap composed of 128 places in 497 ms of which 4 ms to minimize.
[2025-05-29 19:02:33] [INFO ] Deduced a trap composed of 162 places in 505 ms of which 3 ms to minimize.
[2025-05-29 19:02:33] [INFO ] Deduced a trap composed of 138 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:02:34] [INFO ] Deduced a trap composed of 73 places in 492 ms of which 4 ms to minimize.
[2025-05-29 19:02:34] [INFO ] Deduced a trap composed of 131 places in 486 ms of which 3 ms to minimize.
[2025-05-29 19:02:35] [INFO ] Deduced a trap composed of 122 places in 488 ms of which 3 ms to minimize.
[2025-05-29 19:02:35] [INFO ] Deduced a trap composed of 120 places in 468 ms of which 3 ms to minimize.
[2025-05-29 19:02:36] [INFO ] Deduced a trap composed of 174 places in 473 ms of which 3 ms to minimize.
[2025-05-29 19:02:36] [INFO ] Deduced a trap composed of 138 places in 494 ms of which 3 ms to minimize.
[2025-05-29 19:02:37] [INFO ] Deduced a trap composed of 121 places in 499 ms of which 4 ms to minimize.
[2025-05-29 19:02:37] [INFO ] Deduced a trap composed of 85 places in 473 ms of which 3 ms to minimize.
[2025-05-29 19:02:38] [INFO ] Deduced a trap composed of 110 places in 475 ms of which 3 ms to minimize.
[2025-05-29 19:02:38] [INFO ] Deduced a trap composed of 68 places in 473 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/526 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2025-05-29 19:02:41] [INFO ] Deduced a trap composed of 102 places in 469 ms of which 3 ms to minimize.
[2025-05-29 19:02:41] [INFO ] Deduced a trap composed of 155 places in 456 ms of which 3 ms to minimize.
[2025-05-29 19:02:42] [INFO ] Deduced a trap composed of 100 places in 504 ms of which 3 ms to minimize.
[2025-05-29 19:02:42] [INFO ] Deduced a trap composed of 113 places in 471 ms of which 3 ms to minimize.
[2025-05-29 19:02:43] [INFO ] Deduced a trap composed of 68 places in 508 ms of which 3 ms to minimize.
[2025-05-29 19:02:43] [INFO ] Deduced a trap composed of 50 places in 509 ms of which 3 ms to minimize.
[2025-05-29 19:02:44] [INFO ] Deduced a trap composed of 232 places in 516 ms of which 3 ms to minimize.
[2025-05-29 19:02:44] [INFO ] Deduced a trap composed of 231 places in 506 ms of which 3 ms to minimize.
[2025-05-29 19:02:45] [INFO ] Deduced a trap composed of 243 places in 511 ms of which 4 ms to minimize.
[2025-05-29 19:02:45] [INFO ] Deduced a trap composed of 247 places in 506 ms of which 4 ms to minimize.
[2025-05-29 19:02:46] [INFO ] Deduced a trap composed of 216 places in 496 ms of which 4 ms to minimize.
[2025-05-29 19:02:46] [INFO ] Deduced a trap composed of 234 places in 508 ms of which 4 ms to minimize.
[2025-05-29 19:02:47] [INFO ] Deduced a trap composed of 207 places in 483 ms of which 3 ms to minimize.
[2025-05-29 19:02:47] [INFO ] Deduced a trap composed of 177 places in 505 ms of which 3 ms to minimize.
[2025-05-29 19:02:49] [INFO ] Deduced a trap composed of 216 places in 478 ms of which 3 ms to minimize.
[2025-05-29 19:02:49] [INFO ] Deduced a trap composed of 263 places in 500 ms of which 3 ms to minimize.
[2025-05-29 19:02:50] [INFO ] Deduced a trap composed of 196 places in 499 ms of which 3 ms to minimize.
[2025-05-29 19:02:50] [INFO ] Deduced a trap composed of 195 places in 503 ms of which 3 ms to minimize.
[2025-05-29 19:02:51] [INFO ] Deduced a trap composed of 138 places in 492 ms of which 3 ms to minimize.
[2025-05-29 19:02:51] [INFO ] Deduced a trap composed of 139 places in 470 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/526 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2025-05-29 19:02:55] [INFO ] Deduced a trap composed of 74 places in 475 ms of which 3 ms to minimize.
[2025-05-29 19:02:56] [INFO ] Deduced a trap composed of 91 places in 510 ms of which 4 ms to minimize.
[2025-05-29 19:02:56] [INFO ] Deduced a trap composed of 59 places in 506 ms of which 3 ms to minimize.
[2025-05-29 19:02:58] [INFO ] Deduced a trap composed of 183 places in 505 ms of which 3 ms to minimize.
[2025-05-29 19:02:58] [INFO ] Deduced a trap composed of 141 places in 508 ms of which 4 ms to minimize.
[2025-05-29 19:02:59] [INFO ] Deduced a trap composed of 150 places in 513 ms of which 3 ms to minimize.
[2025-05-29 19:02:59] [INFO ] Deduced a trap composed of 163 places in 515 ms of which 4 ms to minimize.
[2025-05-29 19:03:00] [INFO ] Deduced a trap composed of 135 places in 514 ms of which 3 ms to minimize.
[2025-05-29 19:03:00] [INFO ] Deduced a trap composed of 121 places in 508 ms of which 3 ms to minimize.
[2025-05-29 19:03:01] [INFO ] Deduced a trap composed of 130 places in 515 ms of which 4 ms to minimize.
[2025-05-29 19:03:03] [INFO ] Deduced a trap composed of 119 places in 516 ms of which 4 ms to minimize.
[2025-05-29 19:03:03] [INFO ] Deduced a trap composed of 48 places in 506 ms of which 4 ms to minimize.
[2025-05-29 19:03:04] [INFO ] Deduced a trap composed of 140 places in 512 ms of which 3 ms to minimize.
[2025-05-29 19:03:05] [INFO ] Deduced a trap composed of 145 places in 506 ms of which 3 ms to minimize.
[2025-05-29 19:03:05] [INFO ] Deduced a trap composed of 83 places in 513 ms of which 3 ms to minimize.
[2025-05-29 19:03:06] [INFO ] Deduced a trap composed of 162 places in 513 ms of which 3 ms to minimize.
[2025-05-29 19:03:06] [INFO ] Deduced a trap composed of 150 places in 508 ms of which 3 ms to minimize.
[2025-05-29 19:03:07] [INFO ] Deduced a trap composed of 88 places in 512 ms of which 3 ms to minimize.
[2025-05-29 19:03:07] [INFO ] Deduced a trap composed of 166 places in 474 ms of which 4 ms to minimize.
[2025-05-29 19:03:08] [INFO ] Deduced a trap composed of 191 places in 480 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/526 variables, 20/131 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2025-05-29 19:03:16] [INFO ] Deduced a trap composed of 88 places in 515 ms of which 3 ms to minimize.
[2025-05-29 19:03:16] [INFO ] Deduced a trap composed of 223 places in 516 ms of which 3 ms to minimize.
[2025-05-29 19:03:17] [INFO ] Deduced a trap composed of 176 places in 509 ms of which 4 ms to minimize.
[2025-05-29 19:03:17] [INFO ] Deduced a trap composed of 105 places in 511 ms of which 3 ms to minimize.
[2025-05-29 19:03:18] [INFO ] Deduced a trap composed of 264 places in 516 ms of which 4 ms to minimize.
[2025-05-29 19:03:18] [INFO ] Deduced a trap composed of 103 places in 467 ms of which 3 ms to minimize.
[2025-05-29 19:03:19] [INFO ] Deduced a trap composed of 120 places in 518 ms of which 3 ms to minimize.
[2025-05-29 19:03:19] [INFO ] Deduced a trap composed of 110 places in 508 ms of which 4 ms to minimize.
[2025-05-29 19:03:20] [INFO ] Deduced a trap composed of 117 places in 456 ms of which 3 ms to minimize.
[2025-05-29 19:03:20] [INFO ] Deduced a trap composed of 259 places in 458 ms of which 3 ms to minimize.
[2025-05-29 19:03:21] [INFO ] Deduced a trap composed of 124 places in 500 ms of which 3 ms to minimize.
[2025-05-29 19:03:21] [INFO ] Deduced a trap composed of 241 places in 455 ms of which 3 ms to minimize.
[2025-05-29 19:03:22] [INFO ] Deduced a trap composed of 193 places in 503 ms of which 3 ms to minimize.
[2025-05-29 19:03:22] [INFO ] Deduced a trap composed of 205 places in 458 ms of which 3 ms to minimize.
[2025-05-29 19:03:23] [INFO ] Deduced a trap composed of 215 places in 450 ms of which 3 ms to minimize.
[2025-05-29 19:03:23] [INFO ] Deduced a trap composed of 250 places in 504 ms of which 4 ms to minimize.
[2025-05-29 19:03:24] [INFO ] Deduced a trap composed of 153 places in 445 ms of which 3 ms to minimize.
[2025-05-29 19:03:25] [INFO ] Deduced a trap composed of 119 places in 459 ms of which 3 ms to minimize.
[2025-05-29 19:03:26] [INFO ] Deduced a trap composed of 158 places in 461 ms of which 3 ms to minimize.
[2025-05-29 19:03:27] [INFO ] Deduced a trap composed of 95 places in 509 ms of which 3 ms to minimize.
SMT process timed out in 122691ms, After SMT, problems are : Problem set: 0 solved, 549 unsolved
Fused 549 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 202 out of 526 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 526/526 places, 3768/3768 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 523 transition count 3765
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 523 transition count 3765
Applied a total of 6 rules in 79 ms. Remains 523 /526 variables (removed 3) and now considering 3765/3768 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 523/526 places, 3765/3768 transitions.
RANDOM walk for 1776400 steps (4 resets) in 120004 ms. (14 steps per ms) remains 547/549 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 68 ms. (58 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 99 ms. (40 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 82 ms. (48 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4001 steps (8 resets) in 55 ms. (71 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4001 steps (8 resets) in 39 ms. (100 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 98 ms. (40 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 61 ms. (64 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 84 ms. (47 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 58 ms. (67 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4000 steps (8 resets) in 80 ms. (49 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4001 steps (8 resets) in 72 ms. (54 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 66 ms. (59 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4000 steps (8 resets) in 98 ms. (40 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4001 steps (8 resets) in 59 ms. (66 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 96 ms. (41 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 83 ms. (47 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 547/547 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 547/547 properties
Probabilistic random walk after 1000001 steps, saw 768563 distinct states, run finished after 46200 ms. (steps per millisecond=21 ) properties seen :0
// Phase 1: matrix 3765 rows 523 cols
[2025-05-29 19:04:45] [INFO ] Computed 26 invariants in 20 ms
[2025-05-29 19:04:45] [INFO ] State equation strengthened by 176 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 1 (OVERLAPS) 308/508 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:04:58] [INFO ] Deduced a trap composed of 419 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:04:59] [INFO ] Deduced a trap composed of 397 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:04:59] [INFO ] Deduced a trap composed of 396 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:04:59] [INFO ] Deduced a trap composed of 374 places in 310 ms of which 3 ms to minimize.
[2025-05-29 19:05:00] [INFO ] Deduced a trap composed of 397 places in 310 ms of which 3 ms to minimize.
[2025-05-29 19:05:00] [INFO ] Deduced a trap composed of 374 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:05:00] [INFO ] Deduced a trap composed of 330 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:05:01] [INFO ] Deduced a trap composed of 332 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:05:01] [INFO ] Deduced a trap composed of 286 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:05:01] [INFO ] Deduced a trap composed of 309 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:05:02] [INFO ] Deduced a trap composed of 421 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:05:02] [INFO ] Deduced a trap composed of 289 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:05:03] [INFO ] Deduced a trap composed of 398 places in 309 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 13/26 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:05:05] [INFO ] Deduced a trap composed of 443 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:05:05] [INFO ] Deduced a trap composed of 376 places in 317 ms of which 3 ms to minimize.
[2025-05-29 19:05:05] [INFO ] Deduced a trap composed of 444 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:05:06] [INFO ] Deduced a trap composed of 374 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:05:06] [INFO ] Deduced a trap composed of 397 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:05:06] [INFO ] Deduced a trap composed of 360 places in 318 ms of which 3 ms to minimize.
[2025-05-29 19:05:07] [INFO ] Deduced a trap composed of 320 places in 316 ms of which 3 ms to minimize.
[2025-05-29 19:05:07] [INFO ] Deduced a trap composed of 425 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:05:07] [INFO ] Deduced a trap composed of 424 places in 319 ms of which 3 ms to minimize.
[2025-05-29 19:05:08] [INFO ] Deduced a trap composed of 424 places in 316 ms of which 3 ms to minimize.
[2025-05-29 19:05:08] [INFO ] Deduced a trap composed of 424 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:05:08] [INFO ] Deduced a trap composed of 424 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:05:09] [INFO ] Deduced a trap composed of 424 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:05:09] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 3 ms to minimize.
[2025-05-29 19:05:09] [INFO ] Deduced a trap composed of 395 places in 323 ms of which 3 ms to minimize.
[2025-05-29 19:05:10] [INFO ] Deduced a trap composed of 397 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:05:10] [INFO ] Deduced a trap composed of 397 places in 304 ms of which 3 ms to minimize.
[2025-05-29 19:05:11] [INFO ] Deduced a trap composed of 398 places in 297 ms of which 3 ms to minimize.
[2025-05-29 19:05:11] [INFO ] Deduced a trap composed of 377 places in 301 ms of which 3 ms to minimize.
[2025-05-29 19:05:11] [INFO ] Deduced a trap composed of 399 places in 296 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/508 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/508 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 547 unsolved
At refinement iteration 5 (OVERLAPS) 15/523 variables, 13/59 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:05:26] [INFO ] Deduced a trap composed of 177 places in 510 ms of which 3 ms to minimize.
[2025-05-29 19:05:26] [INFO ] Deduced a trap composed of 155 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:05:27] [INFO ] Deduced a trap composed of 233 places in 466 ms of which 4 ms to minimize.
[2025-05-29 19:05:28] [INFO ] Deduced a trap composed of 119 places in 516 ms of which 4 ms to minimize.
[2025-05-29 19:05:28] [INFO ] Deduced a trap composed of 140 places in 487 ms of which 3 ms to minimize.
[2025-05-29 19:05:29] [INFO ] Deduced a trap composed of 113 places in 517 ms of which 3 ms to minimize.
[2025-05-29 19:05:29] [INFO ] Deduced a trap composed of 116 places in 516 ms of which 4 ms to minimize.
[2025-05-29 19:05:30] [INFO ] Deduced a trap composed of 131 places in 507 ms of which 3 ms to minimize.
[2025-05-29 19:05:30] [INFO ] Deduced a trap composed of 175 places in 462 ms of which 4 ms to minimize.
[2025-05-29 19:05:31] [INFO ] Deduced a trap composed of 158 places in 457 ms of which 3 ms to minimize.
[2025-05-29 19:05:31] [INFO ] Deduced a trap composed of 206 places in 504 ms of which 3 ms to minimize.
[2025-05-29 19:05:32] [INFO ] Deduced a trap composed of 229 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:05:32] [INFO ] Deduced a trap composed of 255 places in 505 ms of which 3 ms to minimize.
[2025-05-29 19:05:33] [INFO ] Deduced a trap composed of 178 places in 446 ms of which 3 ms to minimize.
[2025-05-29 19:05:33] [INFO ] Deduced a trap composed of 175 places in 450 ms of which 3 ms to minimize.
[2025-05-29 19:05:34] [INFO ] Deduced a trap composed of 275 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:05:34] [INFO ] Deduced a trap composed of 192 places in 451 ms of which 3 ms to minimize.
[2025-05-29 19:05:35] [INFO ] Deduced a trap composed of 48 places in 447 ms of which 3 ms to minimize.
[2025-05-29 19:05:35] [INFO ] Deduced a trap composed of 75 places in 448 ms of which 3 ms to minimize.
[2025-05-29 19:05:36] [INFO ] Deduced a trap composed of 135 places in 494 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/523 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:05:45] [INFO ] Deduced a trap composed of 132 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:05:45] [INFO ] Deduced a trap composed of 96 places in 514 ms of which 3 ms to minimize.
[2025-05-29 19:05:46] [INFO ] Deduced a trap composed of 177 places in 489 ms of which 4 ms to minimize.
[2025-05-29 19:05:46] [INFO ] Deduced a trap composed of 135 places in 507 ms of which 3 ms to minimize.
[2025-05-29 19:05:47] [INFO ] Deduced a trap composed of 156 places in 504 ms of which 3 ms to minimize.
[2025-05-29 19:05:47] [INFO ] Deduced a trap composed of 134 places in 508 ms of which 3 ms to minimize.
[2025-05-29 19:05:48] [INFO ] Deduced a trap composed of 132 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:05:48] [INFO ] Deduced a trap composed of 146 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:05:49] [INFO ] Deduced a trap composed of 98 places in 449 ms of which 4 ms to minimize.
[2025-05-29 19:05:50] [INFO ] Deduced a trap composed of 135 places in 448 ms of which 3 ms to minimize.
[2025-05-29 19:05:50] [INFO ] Deduced a trap composed of 216 places in 495 ms of which 3 ms to minimize.
[2025-05-29 19:05:51] [INFO ] Deduced a trap composed of 90 places in 442 ms of which 3 ms to minimize.
[2025-05-29 19:05:51] [INFO ] Deduced a trap composed of 200 places in 446 ms of which 3 ms to minimize.
[2025-05-29 19:05:52] [INFO ] Deduced a trap composed of 83 places in 509 ms of which 4 ms to minimize.
[2025-05-29 19:05:52] [INFO ] Deduced a trap composed of 156 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:05:53] [INFO ] Deduced a trap composed of 307 places in 509 ms of which 3 ms to minimize.
[2025-05-29 19:05:53] [INFO ] Deduced a trap composed of 127 places in 469 ms of which 3 ms to minimize.
[2025-05-29 19:05:54] [INFO ] Deduced a trap composed of 131 places in 452 ms of which 3 ms to minimize.
[2025-05-29 19:05:54] [INFO ] Deduced a trap composed of 217 places in 457 ms of which 3 ms to minimize.
[2025-05-29 19:05:54] [INFO ] Deduced a trap composed of 206 places in 454 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/523 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:05:57] [INFO ] Deduced a trap composed of 205 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:05:57] [INFO ] Deduced a trap composed of 166 places in 500 ms of which 3 ms to minimize.
[2025-05-29 19:05:58] [INFO ] Deduced a trap composed of 164 places in 457 ms of which 3 ms to minimize.
[2025-05-29 19:05:58] [INFO ] Deduced a trap composed of 186 places in 456 ms of which 3 ms to minimize.
[2025-05-29 19:05:59] [INFO ] Deduced a trap composed of 194 places in 501 ms of which 4 ms to minimize.
[2025-05-29 19:05:59] [INFO ] Deduced a trap composed of 173 places in 489 ms of which 3 ms to minimize.
[2025-05-29 19:06:00] [INFO ] Deduced a trap composed of 128 places in 496 ms of which 4 ms to minimize.
[2025-05-29 19:06:00] [INFO ] Deduced a trap composed of 116 places in 498 ms of which 4 ms to minimize.
[2025-05-29 19:06:01] [INFO ] Deduced a trap composed of 181 places in 496 ms of which 4 ms to minimize.
[2025-05-29 19:06:01] [INFO ] Deduced a trap composed of 158 places in 500 ms of which 4 ms to minimize.
[2025-05-29 19:06:02] [INFO ] Deduced a trap composed of 164 places in 507 ms of which 4 ms to minimize.
[2025-05-29 19:06:02] [INFO ] Deduced a trap composed of 200 places in 461 ms of which 3 ms to minimize.
[2025-05-29 19:06:03] [INFO ] Deduced a trap composed of 168 places in 480 ms of which 3 ms to minimize.
[2025-05-29 19:06:03] [INFO ] Deduced a trap composed of 161 places in 470 ms of which 4 ms to minimize.
[2025-05-29 19:06:04] [INFO ] Deduced a trap composed of 154 places in 447 ms of which 3 ms to minimize.
[2025-05-29 19:06:04] [INFO ] Deduced a trap composed of 62 places in 504 ms of which 3 ms to minimize.
[2025-05-29 19:06:05] [INFO ] Deduced a trap composed of 189 places in 499 ms of which 3 ms to minimize.
[2025-05-29 19:06:05] [INFO ] Deduced a trap composed of 165 places in 446 ms of which 3 ms to minimize.
[2025-05-29 19:06:06] [INFO ] Deduced a trap composed of 154 places in 498 ms of which 3 ms to minimize.
[2025-05-29 19:06:06] [INFO ] Deduced a trap composed of 175 places in 474 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/523 variables, 20/119 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:06:10] [INFO ] Deduced a trap composed of 197 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:06:11] [INFO ] Deduced a trap composed of 72 places in 490 ms of which 3 ms to minimize.
[2025-05-29 19:06:12] [INFO ] Deduced a trap composed of 73 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:06:12] [INFO ] Deduced a trap composed of 120 places in 495 ms of which 3 ms to minimize.
[2025-05-29 19:06:13] [INFO ] Deduced a trap composed of 222 places in 502 ms of which 4 ms to minimize.
[2025-05-29 19:06:13] [INFO ] Deduced a trap composed of 244 places in 514 ms of which 4 ms to minimize.
[2025-05-29 19:06:14] [INFO ] Deduced a trap composed of 129 places in 505 ms of which 3 ms to minimize.
[2025-05-29 19:06:14] [INFO ] Deduced a trap composed of 178 places in 500 ms of which 3 ms to minimize.
[2025-05-29 19:06:15] [INFO ] Deduced a trap composed of 177 places in 498 ms of which 3 ms to minimize.
[2025-05-29 19:06:15] [INFO ] Deduced a trap composed of 93 places in 502 ms of which 4 ms to minimize.
[2025-05-29 19:06:16] [INFO ] Deduced a trap composed of 124 places in 517 ms of which 3 ms to minimize.
[2025-05-29 19:06:16] [INFO ] Deduced a trap composed of 127 places in 501 ms of which 3 ms to minimize.
[2025-05-29 19:06:17] [INFO ] Deduced a trap composed of 108 places in 505 ms of which 3 ms to minimize.
[2025-05-29 19:06:17] [INFO ] Deduced a trap composed of 129 places in 496 ms of which 3 ms to minimize.
[2025-05-29 19:06:18] [INFO ] Deduced a trap composed of 195 places in 504 ms of which 3 ms to minimize.
[2025-05-29 19:06:19] [INFO ] Deduced a trap composed of 87 places in 501 ms of which 3 ms to minimize.
[2025-05-29 19:06:19] [INFO ] Deduced a trap composed of 168 places in 506 ms of which 3 ms to minimize.
[2025-05-29 19:06:20] [INFO ] Deduced a trap composed of 143 places in 501 ms of which 3 ms to minimize.
[2025-05-29 19:06:21] [INFO ] Deduced a trap composed of 174 places in 453 ms of which 4 ms to minimize.
[2025-05-29 19:06:22] [INFO ] Deduced a trap composed of 147 places in 504 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/523 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:06:38] [INFO ] Deduced a trap composed of 121 places in 507 ms of which 3 ms to minimize.
[2025-05-29 19:06:39] [INFO ] Deduced a trap composed of 171 places in 508 ms of which 4 ms to minimize.
[2025-05-29 19:06:39] [INFO ] Deduced a trap composed of 96 places in 507 ms of which 3 ms to minimize.
[2025-05-29 19:06:40] [INFO ] Deduced a trap composed of 119 places in 520 ms of which 3 ms to minimize.
[2025-05-29 19:06:40] [INFO ] Deduced a trap composed of 130 places in 514 ms of which 3 ms to minimize.
[2025-05-29 19:06:41] [INFO ] Deduced a trap composed of 134 places in 510 ms of which 3 ms to minimize.
[2025-05-29 19:06:41] [INFO ] Deduced a trap composed of 133 places in 503 ms of which 4 ms to minimize.
[2025-05-29 19:06:42] [INFO ] Deduced a trap composed of 101 places in 518 ms of which 3 ms to minimize.
[2025-05-29 19:06:43] [INFO ] Deduced a trap composed of 175 places in 509 ms of which 3 ms to minimize.
[2025-05-29 19:06:43] [INFO ] Deduced a trap composed of 124 places in 515 ms of which 3 ms to minimize.
[2025-05-29 19:06:44] [INFO ] Deduced a trap composed of 211 places in 505 ms of which 4 ms to minimize.
[2025-05-29 19:06:44] [INFO ] Deduced a trap composed of 129 places in 471 ms of which 3 ms to minimize.
[2025-05-29 19:06:45] [INFO ] Deduced a trap composed of 116 places in 506 ms of which 3 ms to minimize.
[2025-05-29 19:06:45] [INFO ] Deduced a trap composed of 158 places in 466 ms of which 4 ms to minimize.
[2025-05-29 19:06:46] [INFO ] Deduced a trap composed of 163 places in 504 ms of which 3 ms to minimize.
[2025-05-29 19:06:46] [INFO ] Deduced a trap composed of 189 places in 496 ms of which 3 ms to minimize.
[2025-05-29 19:06:47] [INFO ] Deduced a trap composed of 248 places in 489 ms of which 3 ms to minimize.
[2025-05-29 19:06:47] [INFO ] Deduced a trap composed of 217 places in 502 ms of which 3 ms to minimize.
[2025-05-29 19:06:48] [INFO ] Deduced a trap composed of 194 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:06:50] [INFO ] Deduced a trap composed of 179 places in 487 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/523 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 547 unsolved
[2025-05-29 19:06:58] [INFO ] Deduced a trap composed of 92 places in 496 ms of which 3 ms to minimize.
[2025-05-29 19:06:59] [INFO ] Deduced a trap composed of 106 places in 498 ms of which 3 ms to minimize.
[2025-05-29 19:06:59] [INFO ] Deduced a trap composed of 97 places in 496 ms of which 3 ms to minimize.
[2025-05-29 19:07:00] [INFO ] Deduced a trap composed of 121 places in 494 ms of which 3 ms to minimize.
[2025-05-29 19:07:00] [INFO ] Deduced a trap composed of 70 places in 505 ms of which 4 ms to minimize.
[2025-05-29 19:07:01] [INFO ] Deduced a trap composed of 93 places in 469 ms of which 4 ms to minimize.
[2025-05-29 19:07:01] [INFO ] Deduced a trap composed of 106 places in 495 ms of which 3 ms to minimize.
[2025-05-29 19:07:02] [INFO ] Deduced a trap composed of 118 places in 493 ms of which 3 ms to minimize.
[2025-05-29 19:07:02] [INFO ] Deduced a trap composed of 147 places in 496 ms of which 3 ms to minimize.
SMT process timed out in 137695ms, After SMT, problems are : Problem set: 0 solved, 547 unsolved
Fused 547 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 200 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 3765/3765 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 522 transition count 3764
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 522 transition count 3764
Applied a total of 2 rules in 69 ms. Remains 522 /523 variables (removed 1) and now considering 3764/3765 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 522/523 places, 3764/3765 transitions.
RANDOM walk for 1891235 steps (4 resets) in 120004 ms. (15 steps per ms) remains 545/547 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 57 ms. (69 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 62 ms. (63 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 83 ms. (47 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 91 ms. (43 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4001 steps (8 resets) in 87 ms. (45 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 70 ms. (56 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 59 ms. (66 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 88 ms. (44 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 46 ms. (85 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 64 ms. (61 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4000 steps (8 resets) in 92 ms. (43 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 81 ms. (48 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4004 steps (8 resets) in 84 ms. (47 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4001 steps (8 resets) in 92 ms. (43 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 76 ms. (51 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 70 ms. (56 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4001 steps (8 resets) in 85 ms. (46 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4001 steps (8 resets) in 75 ms. (52 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 79 ms. (50 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 45 ms. (87 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 105 ms. (37 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 87 ms. (45 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 65 ms. (60 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 99 ms. (40 steps per ms) remains 545/545 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 545/545 properties
Probabilistic random walk after 1000000 steps, saw 775153 distinct states, run finished after 49234 ms. (steps per millisecond=20 ) properties seen :0
// Phase 1: matrix 3764 rows 522 cols
[2025-05-29 19:08:23] [INFO ] Computed 26 invariants in 15 ms
[2025-05-29 19:08:23] [INFO ] State equation strengthened by 175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 307/507 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:08:36] [INFO ] Deduced a trap composed of 396 places in 301 ms of which 4 ms to minimize.
[2025-05-29 19:08:36] [INFO ] Deduced a trap composed of 396 places in 293 ms of which 3 ms to minimize.
[2025-05-29 19:08:37] [INFO ] Deduced a trap composed of 395 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:08:37] [INFO ] Deduced a trap composed of 420 places in 294 ms of which 3 ms to minimize.
[2025-05-29 19:08:37] [INFO ] Deduced a trap composed of 376 places in 291 ms of which 3 ms to minimize.
[2025-05-29 19:08:38] [INFO ] Deduced a trap composed of 331 places in 292 ms of which 3 ms to minimize.
[2025-05-29 19:08:38] [INFO ] Deduced a trap composed of 419 places in 295 ms of which 3 ms to minimize.
[2025-05-29 19:08:38] [INFO ] Deduced a trap composed of 327 places in 291 ms of which 3 ms to minimize.
[2025-05-29 19:08:39] [INFO ] Deduced a trap composed of 377 places in 298 ms of which 4 ms to minimize.
[2025-05-29 19:08:39] [INFO ] Deduced a trap composed of 329 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:08:39] [INFO ] Deduced a trap composed of 376 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:08:40] [INFO ] Deduced a trap composed of 311 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:08:40] [INFO ] Deduced a trap composed of 396 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:08:40] [INFO ] Deduced a trap composed of 329 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:08:41] [INFO ] Deduced a trap composed of 375 places in 293 ms of which 3 ms to minimize.
[2025-05-29 19:08:41] [INFO ] Deduced a trap composed of 374 places in 290 ms of which 3 ms to minimize.
[2025-05-29 19:08:41] [INFO ] Deduced a trap composed of 354 places in 292 ms of which 3 ms to minimize.
[2025-05-29 19:08:42] [INFO ] Deduced a trap composed of 332 places in 291 ms of which 3 ms to minimize.
[2025-05-29 19:08:42] [INFO ] Deduced a trap composed of 319 places in 298 ms of which 3 ms to minimize.
[2025-05-29 19:08:42] [INFO ] Deduced a trap composed of 258 places in 291 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 20/33 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:08:50] [INFO ] Deduced a trap composed of 308 places in 309 ms of which 4 ms to minimize.
[2025-05-29 19:08:50] [INFO ] Deduced a trap composed of 307 places in 286 ms of which 3 ms to minimize.
[2025-05-29 19:08:51] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:08:51] [INFO ] Deduced a trap composed of 304 places in 289 ms of which 3 ms to minimize.
[2025-05-29 19:08:51] [INFO ] Deduced a trap composed of 333 places in 307 ms of which 3 ms to minimize.
[2025-05-29 19:08:52] [INFO ] Deduced a trap composed of 311 places in 293 ms of which 3 ms to minimize.
[2025-05-29 19:08:52] [INFO ] Deduced a trap composed of 330 places in 311 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 7/40 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:09:06] [INFO ] Deduced a trap composed of 396 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:09:06] [INFO ] Deduced a trap composed of 351 places in 317 ms of which 3 ms to minimize.
[2025-05-29 19:09:06] [INFO ] Deduced a trap composed of 352 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:09:07] [INFO ] Deduced a trap composed of 330 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:09:07] [INFO ] Deduced a trap composed of 330 places in 300 ms of which 3 ms to minimize.
[2025-05-29 19:09:07] [INFO ] Deduced a trap composed of 353 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:09:08] [INFO ] Deduced a trap composed of 351 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:09:08] [INFO ] Deduced a trap composed of 352 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:09:08] [INFO ] Deduced a trap composed of 351 places in 310 ms of which 3 ms to minimize.
[2025-05-29 19:09:09] [INFO ] Deduced a trap composed of 374 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:09:09] [INFO ] Deduced a trap composed of 330 places in 313 ms of which 4 ms to minimize.
[2025-05-29 19:09:09] [INFO ] Deduced a trap composed of 348 places in 305 ms of which 3 ms to minimize.
[2025-05-29 19:09:09] [INFO ] Deduced a trap composed of 286 places in 291 ms of which 3 ms to minimize.
[2025-05-29 19:09:10] [INFO ] Deduced a trap composed of 353 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:09:10] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:09:10] [INFO ] Deduced a trap composed of 308 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:09:11] [INFO ] Deduced a trap composed of 331 places in 297 ms of which 3 ms to minimize.
[2025-05-29 19:09:11] [INFO ] Deduced a trap composed of 308 places in 318 ms of which 3 ms to minimize.
[2025-05-29 19:09:11] [INFO ] Deduced a trap composed of 286 places in 287 ms of which 3 ms to minimize.
[2025-05-29 19:09:12] [INFO ] Deduced a trap composed of 352 places in 295 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/507 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:09:20] [INFO ] Deduced a trap composed of 289 places in 302 ms of which 3 ms to minimize.
[2025-05-29 19:09:21] [INFO ] Deduced a trap composed of 376 places in 299 ms of which 3 ms to minimize.
[2025-05-29 19:09:21] [INFO ] Deduced a trap composed of 311 places in 322 ms of which 3 ms to minimize.
[2025-05-29 19:09:21] [INFO ] Deduced a trap composed of 349 places in 298 ms of which 3 ms to minimize.
[2025-05-29 19:09:22] [INFO ] Deduced a trap composed of 333 places in 312 ms of which 4 ms to minimize.
[2025-05-29 19:09:22] [INFO ] Deduced a trap composed of 326 places in 320 ms of which 4 ms to minimize.
[2025-05-29 19:09:22] [INFO ] Deduced a trap composed of 371 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:09:23] [INFO ] Deduced a trap composed of 349 places in 297 ms of which 3 ms to minimize.
[2025-05-29 19:09:23] [INFO ] Deduced a trap composed of 351 places in 280 ms of which 3 ms to minimize.
[2025-05-29 19:09:23] [INFO ] Deduced a trap composed of 303 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:09:24] [INFO ] Deduced a trap composed of 348 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:09:24] [INFO ] Deduced a trap composed of 258 places in 327 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/507 variables, 12/72 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:09:34] [INFO ] Deduced a trap composed of 376 places in 317 ms of which 3 ms to minimize.
[2025-05-29 19:09:34] [INFO ] Deduced a trap composed of 376 places in 305 ms of which 3 ms to minimize.
[2025-05-29 19:09:35] [INFO ] Deduced a trap composed of 397 places in 310 ms of which 3 ms to minimize.
[2025-05-29 19:09:35] [INFO ] Deduced a trap composed of 354 places in 292 ms of which 3 ms to minimize.
[2025-05-29 19:09:35] [INFO ] Deduced a trap composed of 397 places in 291 ms of which 3 ms to minimize.
[2025-05-29 19:09:36] [INFO ] Deduced a trap composed of 354 places in 322 ms of which 4 ms to minimize.
[2025-05-29 19:09:36] [INFO ] Deduced a trap composed of 310 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:09:36] [INFO ] Deduced a trap composed of 332 places in 294 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 8/80 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:09:51] [INFO ] Deduced a trap composed of 395 places in 299 ms of which 3 ms to minimize.
[2025-05-29 19:09:51] [INFO ] Deduced a trap composed of 263 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:09:52] [INFO ] Deduced a trap composed of 374 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:09:52] [INFO ] Deduced a trap composed of 351 places in 306 ms of which 3 ms to minimize.
[2025-05-29 19:09:52] [INFO ] Deduced a trap composed of 283 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:09:53] [INFO ] Deduced a trap composed of 307 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:09:53] [INFO ] Deduced a trap composed of 328 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:09:53] [INFO ] Deduced a trap composed of 282 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:09:54] [INFO ] Deduced a trap composed of 282 places in 301 ms of which 3 ms to minimize.
[2025-05-29 19:09:54] [INFO ] Deduced a trap composed of 260 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:09:54] [INFO ] Deduced a trap composed of 281 places in 289 ms of which 3 ms to minimize.
[2025-05-29 19:09:55] [INFO ] Deduced a trap composed of 237 places in 307 ms of which 3 ms to minimize.
[2025-05-29 19:09:55] [INFO ] Deduced a trap composed of 320 places in 301 ms of which 3 ms to minimize.
[2025-05-29 19:09:55] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 3 ms to minimize.
[2025-05-29 19:09:56] [INFO ] Deduced a trap composed of 304 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:09:56] [INFO ] Deduced a trap composed of 263 places in 312 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/507 variables, 16/96 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:10:06] [INFO ] Deduced a trap composed of 285 places in 290 ms of which 3 ms to minimize.
[2025-05-29 19:10:07] [INFO ] Deduced a trap composed of 310 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:10:07] [INFO ] Deduced a trap composed of 308 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:10:07] [INFO ] Deduced a trap composed of 263 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:10:08] [INFO ] Deduced a trap composed of 328 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:10:08] [INFO ] Deduced a trap composed of 372 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:10:09] [INFO ] Deduced a trap composed of 327 places in 318 ms of which 3 ms to minimize.
[2025-05-29 19:10:09] [INFO ] Deduced a trap composed of 304 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:10:09] [INFO ] Deduced a trap composed of 269 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:10:09] [INFO ] Deduced a trap composed of 304 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:10:10] [INFO ] Deduced a trap composed of 258 places in 312 ms of which 3 ms to minimize.
[2025-05-29 19:10:10] [INFO ] Deduced a trap composed of 304 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:10:10] [INFO ] Deduced a trap composed of 292 places in 296 ms of which 4 ms to minimize.
[2025-05-29 19:10:11] [INFO ] Deduced a trap composed of 304 places in 296 ms of which 3 ms to minimize.
[2025-05-29 19:10:11] [INFO ] Deduced a trap composed of 235 places in 294 ms of which 3 ms to minimize.
[2025-05-29 19:10:11] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 3 ms to minimize.
[2025-05-29 19:10:12] [INFO ] Deduced a trap composed of 281 places in 293 ms of which 3 ms to minimize.
[2025-05-29 19:10:12] [INFO ] Deduced a trap composed of 281 places in 291 ms of which 3 ms to minimize.
[2025-05-29 19:10:12] [INFO ] Deduced a trap composed of 281 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:10:13] [INFO ] Deduced a trap composed of 282 places in 298 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/507 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:10:22] [INFO ] Deduced a trap composed of 327 places in 316 ms of which 4 ms to minimize.
[2025-05-29 19:10:23] [INFO ] Deduced a trap composed of 327 places in 311 ms of which 3 ms to minimize.
[2025-05-29 19:10:23] [INFO ] Deduced a trap composed of 327 places in 284 ms of which 3 ms to minimize.
[2025-05-29 19:10:23] [INFO ] Deduced a trap composed of 309 places in 292 ms of which 3 ms to minimize.
[2025-05-29 19:10:24] [INFO ] Deduced a trap composed of 265 places in 316 ms of which 2 ms to minimize.
[2025-05-29 19:10:24] [INFO ] Deduced a trap composed of 328 places in 292 ms of which 3 ms to minimize.
[2025-05-29 19:10:24] [INFO ] Deduced a trap composed of 305 places in 295 ms of which 3 ms to minimize.
[2025-05-29 19:10:25] [INFO ] Deduced a trap composed of 282 places in 292 ms of which 3 ms to minimize.
[2025-05-29 19:10:25] [INFO ] Deduced a trap composed of 327 places in 285 ms of which 3 ms to minimize.
[2025-05-29 19:10:25] [INFO ] Deduced a trap composed of 327 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:10:26] [INFO ] Deduced a trap composed of 282 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:10:26] [INFO ] Deduced a trap composed of 310 places in 310 ms of which 5 ms to minimize.
[2025-05-29 19:10:26] [INFO ] Deduced a trap composed of 281 places in 311 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/507 variables, 13/129 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:10:42] [INFO ] Deduced a trap composed of 335 places in 283 ms of which 3 ms to minimize.
[2025-05-29 19:10:42] [INFO ] Deduced a trap composed of 309 places in 319 ms of which 3 ms to minimize.
[2025-05-29 19:10:42] [INFO ] Deduced a trap composed of 305 places in 278 ms of which 3 ms to minimize.
[2025-05-29 19:10:42] [INFO ] Deduced a trap composed of 282 places in 280 ms of which 3 ms to minimize.
[2025-05-29 19:10:43] [INFO ] Deduced a trap composed of 315 places in 297 ms of which 3 ms to minimize.
[2025-05-29 19:10:43] [INFO ] Deduced a trap composed of 360 places in 283 ms of which 3 ms to minimize.
[2025-05-29 19:10:43] [INFO ] Deduced a trap composed of 281 places in 284 ms of which 3 ms to minimize.
[2025-05-29 19:10:44] [INFO ] Deduced a trap composed of 326 places in 285 ms of which 3 ms to minimize.
[2025-05-29 19:10:44] [INFO ] Deduced a trap composed of 294 places in 290 ms of which 3 ms to minimize.
[2025-05-29 19:10:44] [INFO ] Deduced a trap composed of 354 places in 287 ms of which 2 ms to minimize.
[2025-05-29 19:10:45] [INFO ] Deduced a trap composed of 332 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:10:45] [INFO ] Deduced a trap composed of 329 places in 303 ms of which 3 ms to minimize.
[2025-05-29 19:10:45] [INFO ] Deduced a trap composed of 234 places in 306 ms of which 3 ms to minimize.
[2025-05-29 19:10:46] [INFO ] Deduced a trap composed of 280 places in 318 ms of which 4 ms to minimize.
[2025-05-29 19:10:46] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 3 ms to minimize.
[2025-05-29 19:10:46] [INFO ] Deduced a trap composed of 265 places in 317 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/507 variables, 16/145 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 507/4286 variables, and 145 constraints, problems are : Problem set: 0 solved, 545 unsolved in 150033 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 0/13 constraints, State Equation: 0/522 constraints, ReadFeed: 0/175 constraints, PredecessorRefiner: 545/545 constraints, Known Traps: 132/132 constraints]
Escalating to Integer solving :Problem set: 0 solved, 545 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 1 (OVERLAPS) 307/507 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 132/145 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/507 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 545 unsolved
At refinement iteration 4 (OVERLAPS) 15/522 variables, 13/158 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:11:11] [INFO ] Deduced a trap composed of 205 places in 493 ms of which 4 ms to minimize.
[2025-05-29 19:11:12] [INFO ] Deduced a trap composed of 75 places in 496 ms of which 3 ms to minimize.
[2025-05-29 19:11:12] [INFO ] Deduced a trap composed of 191 places in 491 ms of which 3 ms to minimize.
[2025-05-29 19:11:13] [INFO ] Deduced a trap composed of 198 places in 481 ms of which 3 ms to minimize.
[2025-05-29 19:11:13] [INFO ] Deduced a trap composed of 182 places in 484 ms of which 3 ms to minimize.
[2025-05-29 19:11:14] [INFO ] Deduced a trap composed of 199 places in 468 ms of which 3 ms to minimize.
[2025-05-29 19:11:14] [INFO ] Deduced a trap composed of 98 places in 474 ms of which 3 ms to minimize.
[2025-05-29 19:11:15] [INFO ] Deduced a trap composed of 148 places in 501 ms of which 3 ms to minimize.
[2025-05-29 19:11:15] [INFO ] Deduced a trap composed of 110 places in 497 ms of which 4 ms to minimize.
[2025-05-29 19:11:16] [INFO ] Deduced a trap composed of 122 places in 473 ms of which 4 ms to minimize.
[2025-05-29 19:11:16] [INFO ] Deduced a trap composed of 154 places in 482 ms of which 4 ms to minimize.
[2025-05-29 19:11:17] [INFO ] Deduced a trap composed of 167 places in 475 ms of which 3 ms to minimize.
[2025-05-29 19:11:17] [INFO ] Deduced a trap composed of 100 places in 471 ms of which 3 ms to minimize.
[2025-05-29 19:11:18] [INFO ] Deduced a trap composed of 74 places in 461 ms of which 3 ms to minimize.
[2025-05-29 19:11:18] [INFO ] Deduced a trap composed of 119 places in 457 ms of which 3 ms to minimize.
[2025-05-29 19:11:19] [INFO ] Deduced a trap composed of 140 places in 503 ms of which 3 ms to minimize.
[2025-05-29 19:11:19] [INFO ] Deduced a trap composed of 149 places in 504 ms of which 3 ms to minimize.
[2025-05-29 19:11:20] [INFO ] Deduced a trap composed of 87 places in 501 ms of which 3 ms to minimize.
[2025-05-29 19:11:20] [INFO ] Deduced a trap composed of 208 places in 500 ms of which 3 ms to minimize.
[2025-05-29 19:11:21] [INFO ] Deduced a trap composed of 101 places in 512 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/522 variables, 20/178 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:11:22] [INFO ] Deduced a trap composed of 154 places in 498 ms of which 4 ms to minimize.
[2025-05-29 19:11:23] [INFO ] Deduced a trap composed of 179 places in 501 ms of which 4 ms to minimize.
[2025-05-29 19:11:23] [INFO ] Deduced a trap composed of 63 places in 506 ms of which 4 ms to minimize.
[2025-05-29 19:11:24] [INFO ] Deduced a trap composed of 132 places in 513 ms of which 3 ms to minimize.
[2025-05-29 19:11:24] [INFO ] Deduced a trap composed of 72 places in 462 ms of which 3 ms to minimize.
[2025-05-29 19:11:25] [INFO ] Deduced a trap composed of 165 places in 482 ms of which 4 ms to minimize.
[2025-05-29 19:11:26] [INFO ] Deduced a trap composed of 125 places in 480 ms of which 3 ms to minimize.
[2025-05-29 19:11:26] [INFO ] Deduced a trap composed of 134 places in 528 ms of which 3 ms to minimize.
[2025-05-29 19:11:27] [INFO ] Deduced a trap composed of 151 places in 508 ms of which 4 ms to minimize.
[2025-05-29 19:11:27] [INFO ] Deduced a trap composed of 150 places in 506 ms of which 4 ms to minimize.
[2025-05-29 19:11:28] [INFO ] Deduced a trap composed of 177 places in 476 ms of which 4 ms to minimize.
[2025-05-29 19:11:28] [INFO ] Deduced a trap composed of 203 places in 480 ms of which 4 ms to minimize.
[2025-05-29 19:11:29] [INFO ] Deduced a trap composed of 167 places in 512 ms of which 3 ms to minimize.
[2025-05-29 19:11:29] [INFO ] Deduced a trap composed of 139 places in 485 ms of which 4 ms to minimize.
[2025-05-29 19:11:30] [INFO ] Deduced a trap composed of 169 places in 470 ms of which 3 ms to minimize.
[2025-05-29 19:11:30] [INFO ] Deduced a trap composed of 141 places in 481 ms of which 3 ms to minimize.
[2025-05-29 19:11:31] [INFO ] Deduced a trap composed of 188 places in 473 ms of which 4 ms to minimize.
[2025-05-29 19:11:31] [INFO ] Deduced a trap composed of 163 places in 521 ms of which 3 ms to minimize.
[2025-05-29 19:11:32] [INFO ] Deduced a trap composed of 114 places in 511 ms of which 4 ms to minimize.
[2025-05-29 19:11:32] [INFO ] Deduced a trap composed of 192 places in 511 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/522 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:11:47] [INFO ] Deduced a trap composed of 182 places in 465 ms of which 3 ms to minimize.
[2025-05-29 19:11:48] [INFO ] Deduced a trap composed of 252 places in 513 ms of which 4 ms to minimize.
[2025-05-29 19:11:48] [INFO ] Deduced a trap composed of 177 places in 482 ms of which 3 ms to minimize.
[2025-05-29 19:11:49] [INFO ] Deduced a trap composed of 169 places in 515 ms of which 3 ms to minimize.
[2025-05-29 19:11:49] [INFO ] Deduced a trap composed of 192 places in 523 ms of which 3 ms to minimize.
[2025-05-29 19:11:50] [INFO ] Deduced a trap composed of 181 places in 520 ms of which 4 ms to minimize.
[2025-05-29 19:11:51] [INFO ] Deduced a trap composed of 167 places in 520 ms of which 3 ms to minimize.
[2025-05-29 19:11:51] [INFO ] Deduced a trap composed of 175 places in 525 ms of which 3 ms to minimize.
[2025-05-29 19:11:52] [INFO ] Deduced a trap composed of 144 places in 524 ms of which 3 ms to minimize.
[2025-05-29 19:11:52] [INFO ] Deduced a trap composed of 95 places in 517 ms of which 4 ms to minimize.
[2025-05-29 19:11:53] [INFO ] Deduced a trap composed of 163 places in 513 ms of which 3 ms to minimize.
[2025-05-29 19:11:53] [INFO ] Deduced a trap composed of 218 places in 509 ms of which 3 ms to minimize.
[2025-05-29 19:11:54] [INFO ] Deduced a trap composed of 194 places in 503 ms of which 4 ms to minimize.
[2025-05-29 19:11:54] [INFO ] Deduced a trap composed of 201 places in 479 ms of which 3 ms to minimize.
[2025-05-29 19:11:55] [INFO ] Deduced a trap composed of 214 places in 513 ms of which 3 ms to minimize.
[2025-05-29 19:11:56] [INFO ] Deduced a trap composed of 201 places in 508 ms of which 3 ms to minimize.
[2025-05-29 19:11:56] [INFO ] Deduced a trap composed of 136 places in 485 ms of which 3 ms to minimize.
[2025-05-29 19:11:57] [INFO ] Deduced a trap composed of 133 places in 523 ms of which 3 ms to minimize.
[2025-05-29 19:11:57] [INFO ] Deduced a trap composed of 142 places in 513 ms of which 4 ms to minimize.
[2025-05-29 19:11:58] [INFO ] Deduced a trap composed of 75 places in 471 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/522 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 545 unsolved
[2025-05-29 19:12:12] [INFO ] Deduced a trap composed of 164 places in 514 ms of which 3 ms to minimize.
[2025-05-29 19:12:13] [INFO ] Deduced a trap composed of 174 places in 521 ms of which 3 ms to minimize.
[2025-05-29 19:12:13] [INFO ] Deduced a trap composed of 118 places in 477 ms of which 3 ms to minimize.
[2025-05-29 19:12:14] [INFO ] Deduced a trap composed of 163 places in 482 ms of which 3 ms to minimize.
[2025-05-29 19:12:14] [INFO ] Deduced a trap composed of 129 places in 469 ms of which 3 ms to minimize.
[2025-05-29 19:12:15] [INFO ] Deduced a trap composed of 196 places in 478 ms of which 3 ms to minimize.
[2025-05-29 19:12:15] [INFO ] Deduced a trap composed of 126 places in 491 ms of which 3 ms to minimize.
[2025-05-29 19:12:16] [INFO ] Deduced a trap composed of 168 places in 504 ms of which 4 ms to minimize.
[2025-05-29 19:12:16] [INFO ] Deduced a trap composed of 142 places in 590 ms of which 3 ms to minimize.
[2025-05-29 19:12:17] [INFO ] Deduced a trap composed of 174 places in 516 ms of which 3 ms to minimize.
[2025-05-29 19:12:18] [INFO ] Deduced a trap composed of 144 places in 524 ms of which 3 ms to minimize.
[2025-05-29 19:12:18] [INFO ] Deduced a trap composed of 134 places in 530 ms of which 4 ms to minimize.
[2025-05-29 19:12:19] [INFO ] Deduced a trap composed of 180 places in 526 ms of which 3 ms to minimize.
[2025-05-29 19:12:19] [INFO ] Deduced a trap composed of 153 places in 530 ms of which 3 ms to minimize.
[2025-05-29 19:12:20] [INFO ] Deduced a trap composed of 177 places in 532 ms of which 3 ms to minimize.
[2025-05-29 19:12:20] [INFO ] Deduced a trap composed of 206 places in 528 ms of which 3 ms to minimize.
[2025-05-29 19:12:21] [INFO ] Deduced a trap composed of 193 places in 518 ms of which 3 ms to minimize.
[2025-05-29 19:12:21] [INFO ] Deduced a trap composed of 147 places in 519 ms of which 3 ms to minimize.
[2025-05-29 19:12:22] [INFO ] Deduced a trap composed of 163 places in 528 ms of which 3 ms to minimize.
[2025-05-29 19:12:22] [INFO ] Deduced a trap composed of 118 places in 524 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/522 variables, 20/238 constraints. Problems are: Problem set: 0 solved, 545 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 522/4286 variables, and 238 constraints, problems are : Problem set: 0 solved, 545 unsolved in 150023 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/522 constraints, ReadFeed: 0/175 constraints, PredecessorRefiner: 0/545 constraints, Known Traps: 212/212 constraints]
After SMT, in 302511ms problems are : Problem set: 0 solved, 545 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 200 out of 522 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 522/522 places, 3764/3764 transitions.
Applied a total of 0 rules in 54 ms. Remains 522 /522 variables (removed 0) and now considering 3764/3764 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 522/522 places, 3764/3764 transitions.
RANDOM walk for 3749939 steps (8 resets) in 120004 ms. (31 steps per ms) remains 541/545 properties
BEST_FIRST walk for 4003 steps (8 resets) in 97 ms. (40 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 92 ms. (43 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 43 ms. (90 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 67 ms. (58 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 93 ms. (42 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 84 ms. (47 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 78 ms. (50 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 93 ms. (42 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 105 ms. (37 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 77 ms. (51 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 102 ms. (38 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 92 ms. (43 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4000 steps (8 resets) in 97 ms. (40 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 89 ms. (44 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4000 steps (8 resets) in 80 ms. (49 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 83 ms. (47 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 85 ms. (46 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 94 ms. (42 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 92 ms. (43 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4000 steps (8 resets) in 61 ms. (64 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 87 ms. (45 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 91 ms. (43 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 81 ms. (48 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 97 ms. (40 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 82 ms. (48 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 95 ms. (41 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 88 ms. (44 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 91 ms. (43 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 96 ms. (41 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 90 ms. (43 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 100 ms. (39 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 47 ms. (83 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 67 ms. (58 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4002 steps (8 resets) in 66 ms. (59 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 50 ms. (78 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4003 steps (8 resets) in 86 ms. (46 steps per ms) remains 541/541 properties
BEST_FIRST walk for 4001 steps (8 resets) in 87 ms. (45 steps per ms) remains 541/541 properties
Probabilistic random walk after 1000000 steps, saw 775153 distinct states, run finished after 51001 ms. (steps per millisecond=19 ) properties seen :0
[2025-05-29 19:14:48] [INFO ] Invariant cache hit.
[2025-05-29 19:14:48] [INFO ] State equation strengthened by 175 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/198 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 541 unsolved
At refinement iteration 1 (OVERLAPS) 309/507 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 541 unsolved
[2025-05-29 19:15:01] [INFO ] Deduced a trap composed of 396 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:15:01] [INFO ] Deduced a trap composed of 418 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:15:02] [INFO ] Deduced a trap composed of 396 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:15:02] [INFO ] Deduced a trap composed of 395 places in 317 ms of which 4 ms to minimize.
[2025-05-29 19:15:02] [INFO ] Deduced a trap composed of 331 places in 308 ms of which 3 ms to minimize.
[2025-05-29 19:15:03] [INFO ] Deduced a trap composed of 331 places in 306 ms of which 3 ms to minimize.
[2025-05-29 19:15:03] [INFO ] Deduced a trap composed of 354 places in 309 ms of which 3 ms to minimize.
[2025-05-29 19:15:03] [INFO ] Deduced a trap composed of 352 places in 317 ms of which 3 ms to minimize.
[2025-05-29 19:15:04] [INFO ] Deduced a trap composed of 309 places in 314 ms of which 3 ms to minimize.
[2025-05-29 19:15:04] [INFO ] Deduced a trap composed of 353 places in 313 ms of which 3 ms to minimize.
[2025-05-29 19:15:04] [INFO ] Deduced a trap composed of 374 places in 319 ms of which 3 ms to minimize.
[2025-05-29 19:15:05] [INFO ] Deduced a trap composed of 375 places in 533 ms of which 3 ms to minimize.
[2025-05-29 19:15:05] [INFO ] Deduced a trap composed of 332 places in 282 ms of which 3 ms to minimize.
[2025-05-29 19:15:06] [INFO ] Deduced a trap composed of 376 places in 280 ms of which 3 ms to minimize.
[2025-05-29 19:15:06] [INFO ] Deduced a trap composed of 376 places in 320 ms of which 3 ms to minimize.
[2025-05-29 19:15:06] [INFO ] Deduced a trap composed of 351 places in 315 ms of which 3 ms to minimize.
[2025-05-29 19:15:07] [INFO ] Deduced a trap composed of 328 places in 279 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/507 variables, 17/30 constraints. Problems are: Problem set: 0 solved, 541 unsolved

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="Anderson-PT-12"
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 Anderson-PT-12, 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 r014-tall-174853743400134"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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