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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 8.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K 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.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K 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 65K 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.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 1.3M 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 1748542778081

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-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-05-29 18:19:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-05-29 18:19:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-29 18:19:39] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-05-29 18:19:39] [INFO ] Transformed 621 places.
[2025-05-29 18:19:39] [INFO ] Transformed 2480 transitions.
[2025-05-29 18:19:39] [INFO ] Found NUPN structural information;
[2025-05-29 18:19:39] [INFO ] Parsed PT model containing 621 places and 2480 transitions and 9560 arcs in 278 ms.
Built sparse matrix representations for Structural reductions in 14 ms.21698KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 621/621 places, 2480/2480 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 121 ms. Remains 621 /621 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 136 ms. Remains : 621/621 places, 2480/2480 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 621/621 places, 2480/2480 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 70 ms. Remains 621 /621 variables (removed 0) and now considering 2480/2480 (removed 0) transitions.
// Phase 1: matrix 2480 rows 621 cols
[2025-05-29 18:19:40] [INFO ] Computed 23 invariants in 74 ms
[2025-05-29 18:19:40] [INFO ] Implicit Places using invariants in 457 ms returned []
[2025-05-29 18:19:40] [INFO ] Invariant cache hit.
[2025-05-29 18:19:41] [INFO ] State equation strengthened by 90 read => feed constraints.
[2025-05-29 18:19:41] [INFO ] Implicit Places using invariants and state equation in 1173 ms returned []
Implicit Place search using SMT with State Equation took 1664 ms to find 0 implicit places.
[2025-05-29 18:19:41] [INFO ] Redundant transitions in 165 ms returned []
Running 2470 sub problems to find dead transitions.
[2025-05-29 18:19:41] [INFO ] Invariant cache hit.
[2025-05-29 18:19:41] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/621 variables, 621/621 constraints. Problems are: Problem set: 0 solved, 2470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/621 variables, 11/632 constraints. Problems are: Problem set: 0 solved, 2470 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/621 variables, 12/644 constraints. Problems are: Problem set: 0 solved, 2470 unsolved
[2025-05-29 18:20:15] [INFO ] Deduced a trap composed of 342 places in 435 ms of which 37 ms to minimize.
[2025-05-29 18:20:15] [INFO ] Deduced a trap composed of 259 places in 430 ms of which 5 ms to minimize.
[2025-05-29 18:20:16] [INFO ] Deduced a trap composed of 264 places in 387 ms of which 9 ms to minimize.
[2025-05-29 18:20:16] [INFO ] Deduced a trap composed of 282 places in 378 ms of which 5 ms to minimize.
[2025-05-29 18:20:17] [INFO ] Deduced a trap composed of 324 places in 379 ms of which 4 ms to minimize.
[2025-05-29 18:20:18] [INFO ] Deduced a trap composed of 104 places in 409 ms of which 4 ms to minimize.
[2025-05-29 18:20:19] [INFO ] Deduced a trap composed of 339 places in 399 ms of which 4 ms to minimize.
[2025-05-29 18:20:19] [INFO ] Deduced a trap composed of 358 places in 383 ms of which 4 ms to minimize.
[2025-05-29 18:20:19] [INFO ] Deduced a trap composed of 133 places in 402 ms of which 4 ms to minimize.
SMT process timed out in 38056ms, After SMT, problems are : Problem set: 0 solved, 2470 unsolved
Search for dead transitions found 0 dead transitions in 38097ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 40025 ms. Remains : 621/621 places, 2480/2480 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3827 ms (no deadlock found). (steps per millisecond=326 )
Random directed walk for 1250000 steps, including 0 resets, run took 3520 ms (no deadlock found). (steps per millisecond=355 )
[2025-05-29 18:20:27] [INFO ] Invariant cache hit.
[2025-05-29 18:20:27] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2025-05-29 18:20:29] [INFO ] [Real]Absence check using 11 positive and 12 generalized place invariants in 1499 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 2 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 48 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2025-05-29 18:20:29] [INFO ] Computed 23 invariants in 34 ms
[2025-05-29 18:20:30] [INFO ] Implicit Places using invariants in 1615 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1621 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 19 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2025-05-29 18:20:30] [INFO ] Computed 22 invariants in 18 ms
[2025-05-29 18:20:31] [INFO ] Implicit Places using invariants in 920 ms returned []
[2025-05-29 18:20:31] [INFO ] Invariant cache hit.
[2025-05-29 18:20:32] [INFO ] State equation strengthened by 170 read => feed constraints.
[2025-05-29 18:20:35] [INFO ] Implicit Places using invariants and state equation in 3497 ms returned []
Implicit Place search using SMT with State Equation took 4421 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6110 ms. Remains : 430/621 places, 2290/2480 transitions.
Initial state reduction rules removed 10 formulas.
RANDOM walk for 40000 steps (8 resets) in 5933 ms. (6 steps per ms) remains 1220/2280 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 26 ms. (4 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 19 ms. (6 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1220/1220 properties
BEST_FIRST walk for 124 steps (8 resets) in 15 ms. (7 steps per ms) remains 1220/1220 properties
[2025-05-29 18:20:37] [INFO ] Invariant cache hit.
[2025-05-29 18:20:37] [INFO ] State equation strengthened by 170 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 193/2720 variables, and 194 constraints, problems are : Problem set: 0 solved, 1220 unsolved in 5048 ms.
Refiners :[Domain max(s): 193/430 constraints, Positive P Invariants (semi-flows): 0/11 constraints, Generalized P Invariants (flows): 1/11 constraints, State Equation: 0/430 constraints, ReadFeed: 0/170 constraints, PredecessorRefiner: 1220/1220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/193 variables, 193/193 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/193 variables, 1/194 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/193 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
At refinement iteration 3 (OVERLAPS) 237/430 variables, 11/205 constraints. Problems are: Problem set: 0 solved, 1220 unsolved
SMT process timed out in 13623ms, After SMT, problems are : Problem set: 0 solved, 1220 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 193 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 2290/2290 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 396 transition count 2256
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 396 transition count 2256
Applied a total of 68 rules in 69 ms. Remains 396 /430 variables (removed 34) and now considering 2256/2290 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 396/430 places, 2256/2290 transitions.
RANDOM walk for 2960924 steps (8 resets) in 120004 ms. (24 steps per ms) remains 544/1220 properties
BEST_FIRST walk for 4002 steps (8 resets) in 61 ms. (64 steps per ms) remains 544/544 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 544/544 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 544/544 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 544/544 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 543/544 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 496/543 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4003 steps (8 resets) in 50 ms. (78 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 496/496 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 487/496 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 487/487 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 487/487 properties
BEST_FIRST walk for 4003 steps (8 resets) in 51 ms. (76 steps per ms) remains 487/487 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 487/487 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 431/487 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 417/431 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 405/417 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4003 steps (8 resets) in 43 ms. (90 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 405/405 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 404/405 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 389/404 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4000 steps (8 resets) in 36 ms. (108 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4001 steps (8 resets) in 37 ms. (105 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 389/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 386/389 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 386/386 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 386/386 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 386/386 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 386/386 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 386/386 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 386/386 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 382/386 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 379/382 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 379/379 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 378/379 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 378/378 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 370/378 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 364/370 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 364/364 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 361/364 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 361/361 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 361/361 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 361/361 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 360/361 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 360/360 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 348/360 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 348/348 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 348/348 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 348/348 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 348/348 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 348/348 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 343/348 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 343/343 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 297/343 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 297/297 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 296/297 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 296/296 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 296/296 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 296/296 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 296/296 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 296/296 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 296/296 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 296/296 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 291/296 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 291/291 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 290/291 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 290/290 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 281/290 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 281/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 280/281 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 280/280 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 262/280 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 262/262 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 253/262 properties
BEST_FIRST walk for 4001 steps (8 resets) in 21 ms. (181 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4001 steps (8 resets) in 23 ms. (166 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 253/253 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 252/253 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 252/252 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 251/252 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4000 steps (8 resets) in 23 ms. (166 steps per ms) remains 251/251 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 248/251 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 248/248 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 248/248 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 248/248 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 248/248 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 248/248 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 246/248 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4000 steps (8 resets) in 20 ms. (190 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 246/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 240/246 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 240/240 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 240/240 properties
BEST_FIRST walk for 4001 steps (8 resets) in 22 ms. (173 steps per ms) remains 240/240 properties
BEST_FIRST walk for 4000 steps (8 resets) in 24 ms. (160 steps per ms) remains 240/240 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 240/240 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 229/240 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 229/229 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 229/229 properties
// Phase 1: matrix 2256 rows 396 cols
[2025-05-29 18:21:23] [INFO ] Computed 22 invariants in 9 ms
[2025-05-29 18:21:23] [INFO ] State equation strengthened by 146 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 1 (OVERLAPS) 277/383 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 18:21:26] [INFO ] Deduced a trap composed of 329 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 310 places in 185 ms of which 3 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 291 places in 188 ms of which 2 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 329 places in 183 ms of which 2 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 329 places in 189 ms of which 3 ms to minimize.
[2025-05-29 18:21:27] [INFO ] Deduced a trap composed of 253 places in 189 ms of which 3 ms to minimize.
[2025-05-29 18:21:28] [INFO ] Deduced a trap composed of 255 places in 187 ms of which 3 ms to minimize.
[2025-05-29 18:21:28] [INFO ] Deduced a trap composed of 272 places in 187 ms of which 2 ms to minimize.
[2025-05-29 18:21:28] [INFO ] Deduced a trap composed of 271 places in 189 ms of which 2 ms to minimize.
[2025-05-29 18:21:29] [INFO ] Deduced a trap composed of 237 places in 186 ms of which 2 ms to minimize.
[2025-05-29 18:21:29] [INFO ] Deduced a trap composed of 272 places in 187 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/383 variables, 11/22 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 18:21:31] [INFO ] Deduced a trap composed of 273 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:21:31] [INFO ] Deduced a trap composed of 237 places in 183 ms of which 3 ms to minimize.
[2025-05-29 18:21:32] [INFO ] Deduced a trap composed of 310 places in 184 ms of which 3 ms to minimize.
[2025-05-29 18:21:32] [INFO ] Deduced a trap composed of 292 places in 187 ms of which 2 ms to minimize.
[2025-05-29 18:21:32] [INFO ] Deduced a trap composed of 254 places in 184 ms of which 2 ms to minimize.
[2025-05-29 18:21:32] [INFO ] Deduced a trap composed of 241 places in 181 ms of which 2 ms to minimize.
[2025-05-29 18:21:33] [INFO ] Deduced a trap composed of 255 places in 231 ms of which 2 ms to minimize.
[2025-05-29 18:21:33] [INFO ] Deduced a trap composed of 258 places in 189 ms of which 3 ms to minimize.
[2025-05-29 18:21:33] [INFO ] Deduced a trap composed of 236 places in 186 ms of which 2 ms to minimize.
[2025-05-29 18:21:33] [INFO ] Deduced a trap composed of 255 places in 183 ms of which 3 ms to minimize.
[2025-05-29 18:21:33] [INFO ] Deduced a trap composed of 237 places in 183 ms of which 3 ms to minimize.
[2025-05-29 18:21:34] [INFO ] Deduced a trap composed of 255 places in 178 ms of which 2 ms to minimize.
[2025-05-29 18:21:34] [INFO ] Deduced a trap composed of 219 places in 189 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/383 variables, 13/35 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 18:21:37] [INFO ] Deduced a trap composed of 253 places in 184 ms of which 2 ms to minimize.
[2025-05-29 18:21:38] [INFO ] Deduced a trap composed of 239 places in 178 ms of which 2 ms to minimize.
[2025-05-29 18:21:38] [INFO ] Deduced a trap composed of 290 places in 187 ms of which 3 ms to minimize.
[2025-05-29 18:21:38] [INFO ] Deduced a trap composed of 273 places in 179 ms of which 2 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 257 places in 185 ms of which 3 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 253 places in 184 ms of which 2 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 253 places in 183 ms of which 2 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 273 places in 183 ms of which 2 ms to minimize.
[2025-05-29 18:21:39] [INFO ] Deduced a trap composed of 236 places in 179 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 255 places in 182 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 235 places in 185 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 254 places in 183 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 252 places in 182 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 272 places in 185 ms of which 2 ms to minimize.
[2025-05-29 18:21:40] [INFO ] Deduced a trap composed of 263 places in 182 ms of which 2 ms to minimize.
[2025-05-29 18:21:41] [INFO ] Deduced a trap composed of 236 places in 183 ms of which 3 ms to minimize.
[2025-05-29 18:21:41] [INFO ] Deduced a trap composed of 217 places in 188 ms of which 2 ms to minimize.
[2025-05-29 18:21:41] [INFO ] Deduced a trap composed of 217 places in 182 ms of which 3 ms to minimize.
[2025-05-29 18:21:41] [INFO ] Deduced a trap composed of 217 places in 182 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/383 variables, 19/54 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 18:21:42] [INFO ] Deduced a trap composed of 272 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:21:42] [INFO ] Deduced a trap composed of 272 places in 187 ms of which 2 ms to minimize.
[2025-05-29 18:21:42] [INFO ] Deduced a trap composed of 280 places in 189 ms of which 3 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 297 places in 186 ms of which 2 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 284 places in 193 ms of which 3 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 282 places in 183 ms of which 3 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 282 places in 188 ms of which 2 ms to minimize.
[2025-05-29 18:21:43] [INFO ] Deduced a trap composed of 282 places in 186 ms of which 3 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 274 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 275 places in 193 ms of which 3 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 256 places in 190 ms of which 2 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 256 places in 193 ms of which 3 ms to minimize.
[2025-05-29 18:21:44] [INFO ] Deduced a trap composed of 272 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:21:45] [INFO ] Deduced a trap composed of 233 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:21:45] [INFO ] Deduced a trap composed of 260 places in 186 ms of which 2 ms to minimize.
[2025-05-29 18:21:45] [INFO ] Deduced a trap composed of 244 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:21:45] [INFO ] Deduced a trap composed of 254 places in 187 ms of which 2 ms to minimize.
[2025-05-29 18:21:46] [INFO ] Deduced a trap composed of 260 places in 186 ms of which 2 ms to minimize.
[2025-05-29 18:21:46] [INFO ] Deduced a trap composed of 252 places in 184 ms of which 2 ms to minimize.
[2025-05-29 18:21:46] [INFO ] Deduced a trap composed of 244 places in 180 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/383 variables, 20/74 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 18:21:48] [INFO ] Deduced a trap composed of 255 places in 190 ms of which 2 ms to minimize.
[2025-05-29 18:21:48] [INFO ] Deduced a trap composed of 237 places in 183 ms of which 2 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 255 places in 181 ms of which 2 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 236 places in 190 ms of which 2 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 218 places in 189 ms of which 3 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 255 places in 182 ms of which 3 ms to minimize.
[2025-05-29 18:21:49] [INFO ] Deduced a trap composed of 254 places in 185 ms of which 2 ms to minimize.
[2025-05-29 18:21:50] [INFO ] Deduced a trap composed of 236 places in 185 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/383 variables, 8/82 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/383 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 229 unsolved
At refinement iteration 8 (OVERLAPS) 13/396 variables, 11/93 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 18:21:55] [INFO ] Deduced a trap composed of 170 places in 290 ms of which 3 ms to minimize.
[2025-05-29 18:21:55] [INFO ] Deduced a trap composed of 158 places in 286 ms of which 2 ms to minimize.
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 155 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 149 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:21:56] [INFO ] Deduced a trap composed of 174 places in 294 ms of which 2 ms to minimize.
[2025-05-29 18:21:57] [INFO ] Deduced a trap composed of 116 places in 294 ms of which 2 ms to minimize.
[2025-05-29 18:21:57] [INFO ] Deduced a trap composed of 128 places in 293 ms of which 2 ms to minimize.
[2025-05-29 18:21:57] [INFO ] Deduced a trap composed of 124 places in 286 ms of which 3 ms to minimize.
[2025-05-29 18:21:58] [INFO ] Deduced a trap composed of 122 places in 300 ms of which 2 ms to minimize.
[2025-05-29 18:21:58] [INFO ] Deduced a trap composed of 130 places in 291 ms of which 2 ms to minimize.
[2025-05-29 18:21:58] [INFO ] Deduced a trap composed of 130 places in 288 ms of which 2 ms to minimize.
[2025-05-29 18:21:58] [INFO ] Deduced a trap composed of 160 places in 288 ms of which 3 ms to minimize.
[2025-05-29 18:21:59] [INFO ] Deduced a trap composed of 68 places in 282 ms of which 2 ms to minimize.
[2025-05-29 18:21:59] [INFO ] Deduced a trap composed of 121 places in 283 ms of which 2 ms to minimize.
[2025-05-29 18:21:59] [INFO ] Deduced a trap composed of 145 places in 288 ms of which 2 ms to minimize.
[2025-05-29 18:22:00] [INFO ] Deduced a trap composed of 86 places in 278 ms of which 3 ms to minimize.
[2025-05-29 18:22:00] [INFO ] Deduced a trap composed of 93 places in 278 ms of which 3 ms to minimize.
[2025-05-29 18:22:00] [INFO ] Deduced a trap composed of 135 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:22:01] [INFO ] Deduced a trap composed of 139 places in 282 ms of which 2 ms to minimize.
[2025-05-29 18:22:01] [INFO ] Deduced a trap composed of 135 places in 285 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/396 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 229 unsolved
[2025-05-29 18:22:03] [INFO ] Deduced a trap composed of 146 places in 290 ms of which 2 ms to minimize.
[2025-05-29 18:22:04] [INFO ] Deduced a trap composed of 153 places in 291 ms of which 3 ms to minimize.
[2025-05-29 18:22:04] [INFO ] Deduced a trap composed of 138 places in 279 ms of which 2 ms to minimize.
[2025-05-29 18:22:04] [INFO ] Deduced a trap composed of 129 places in 284 ms of which 3 ms to minimize.
[2025-05-29 18:22:05] [INFO ] Deduced a trap composed of 166 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:22:05] [INFO ] Deduced a trap composed of 87 places in 279 ms of which 3 ms to minimize.
[2025-05-29 18:22:05] [INFO ] Deduced a trap composed of 107 places in 279 ms of which 3 ms to minimize.
[2025-05-29 18:22:06] [INFO ] Deduced a trap composed of 160 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:22:06] [INFO ] Deduced a trap composed of 76 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:22:06] [INFO ] Deduced a trap composed of 105 places in 281 ms of which 3 ms to minimize.
[2025-05-29 18:22:06] [INFO ] Deduced a trap composed of 174 places in 282 ms of which 3 ms to minimize.
[2025-05-29 18:22:07] [INFO ] Deduced a trap composed of 154 places in 284 ms of which 2 ms to minimize.
[2025-05-29 18:22:07] [INFO ] Deduced a trap composed of 158 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:22:08] [INFO ] Deduced a trap composed of 150 places in 281 ms of which 3 ms to minimize.
[2025-05-29 18:22:08] [INFO ] Deduced a trap composed of 114 places in 284 ms of which 3 ms to minimize.
[2025-05-29 18:22:08] [INFO ] Deduced a trap composed of 142 places in 286 ms of which 3 ms to minimize.
[2025-05-29 18:22:09] [INFO ] Deduced a trap composed of 123 places in 301 ms of which 3 ms to minimize.
SMT process timed out in 45954ms, After SMT, problems are : Problem set: 0 solved, 229 unsolved
Fused 229 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 106 out of 396 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 396/396 places, 2256/2256 transitions.
Discarding 55 places :
Symmetric choice reduction at 0 with 55 rule applications. Total rules 55 place count 341 transition count 2057
Iterating global reduction 0 with 55 rules applied. Total rules applied 110 place count 341 transition count 2057
Applied a total of 110 rules in 56 ms. Remains 341 /396 variables (removed 55) and now considering 2057/2256 (removed 199) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 341/396 places, 2057/2256 transitions.
RANDOM walk for 4000000 steps (8 resets) in 53744 ms. (74 steps per ms) remains 219/229 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 218/219 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 216/218 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40002 steps (8 resets) in 198 ms. (201 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40003 steps (8 resets) in 175 ms. (227 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 214/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 209/214 properties
BEST_FIRST walk for 40002 steps (8 resets) in 182 ms. (218 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 209/209 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 203/209 properties
BEST_FIRST walk for 40003 steps (8 resets) in 188 ms. (211 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40003 steps (8 resets) in 179 ms. (222 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40002 steps (8 resets) in 168 ms. (236 steps per ms) remains 194/203 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 194/194 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 193/194 properties
BEST_FIRST walk for 40004 steps (8 resets) in 190 ms. (209 steps per ms) remains 192/193 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 134 ms. (296 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 199 ms. (200 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 170 ms. (233 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40004 steps (8 resets) in 178 ms. (223 steps per ms) remains 192/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 178 ms. (223 steps per ms) remains 188/192 properties
BEST_FIRST walk for 40002 steps (8 resets) in 181 ms. (219 steps per ms) remains 186/188 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 185/186 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 185/185 properties
BEST_FIRST walk for 40002 steps (8 resets) in 165 ms. (240 steps per ms) remains 185/185 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 185/185 properties
BEST_FIRST walk for 40002 steps (8 resets) in 179 ms. (222 steps per ms) remains 185/185 properties
BEST_FIRST walk for 40003 steps (8 resets) in 176 ms. (226 steps per ms) remains 185/185 properties
BEST_FIRST walk for 40003 steps (8 resets) in 209 ms. (190 steps per ms) remains 184/185 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40003 steps (8 resets) in 167 ms. (238 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 174/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 174/174 properties
BEST_FIRST walk for 40002 steps (8 resets) in 161 ms. (246 steps per ms) remains 173/174 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 171/173 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40001 steps (8 resets) in 158 ms. (251 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 167/171 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 165/167 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 164/165 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 164/164 properties
BEST_FIRST walk for 40003 steps (8 resets) in 168 ms. (236 steps per ms) remains 163/164 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 161/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 160/161 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 160/160 properties
BEST_FIRST walk for 40002 steps (8 resets) in 160 ms. (248 steps per ms) remains 159/160 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 157/159 properties
BEST_FIRST walk for 40003 steps (8 resets) in 161 ms. (246 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40002 steps (8 resets) in 166 ms. (239 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40003 steps (8 resets) in 165 ms. (240 steps per ms) remains 156/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40002 steps (8 resets) in 167 ms. (238 steps per ms) remains 155/156 properties
BEST_FIRST walk for 40003 steps (8 resets) in 155 ms. (256 steps per ms) remains 153/155 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 118 ms. (336 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40001 steps (8 resets) in 155 ms. (256 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40002 steps (8 resets) in 157 ms. (253 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 153/153 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 152/153 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 152/152 properties
BEST_FIRST walk for 40003 steps (8 resets) in 145 ms. (273 steps per ms) remains 147/152 properties
BEST_FIRST walk for 40002 steps (8 resets) in 113 ms. (350 steps per ms) remains 147/147 properties
BEST_FIRST walk for 40003 steps (8 resets) in 114 ms. (347 steps per ms) remains 147/147 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 146/147 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 146/146 properties
BEST_FIRST walk for 40003 steps (8 resets) in 158 ms. (251 steps per ms) remains 145/146 properties
BEST_FIRST walk for 40001 steps (8 resets) in 141 ms. (281 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 145/145 properties
BEST_FIRST walk for 40002 steps (8 resets) in 146 ms. (272 steps per ms) remains 144/145 properties
BEST_FIRST walk for 40002 steps (8 resets) in 158 ms. (251 steps per ms) remains 144/144 properties
BEST_FIRST walk for 40003 steps (8 resets) in 153 ms. (259 steps per ms) remains 143/144 properties
BEST_FIRST walk for 40003 steps (8 resets) in 159 ms. (250 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40001 steps (8 resets) in 146 ms. (272 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 143/143 properties
BEST_FIRST walk for 40003 steps (8 resets) in 137 ms. (289 steps per ms) remains 142/143 properties
BEST_FIRST walk for 40001 steps (8 resets) in 149 ms. (266 steps per ms) remains 141/142 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40001 steps (8 resets) in 153 ms. (259 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 150 ms. (264 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 152 ms. (261 steps per ms) remains 141/141 properties
BEST_FIRST walk for 40003 steps (8 resets) in 148 ms. (268 steps per ms) remains 138/141 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 115 ms. (344 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 112 ms. (354 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 137 ms. (289 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 157 ms. (253 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 138 ms. (287 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 140 ms. (283 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 138/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 155 ms. (256 steps per ms) remains 135/138 properties
BEST_FIRST walk for 40002 steps (8 resets) in 111 ms. (357 steps per ms) remains 135/135 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 134/135 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 134/134 properties
BEST_FIRST walk for 40001 steps (8 resets) in 150 ms. (264 steps per ms) remains 133/134 properties
BEST_FIRST walk for 40002 steps (8 resets) in 149 ms. (266 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (8 resets) in 148 ms. (268 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (8 resets) in 146 ms. (272 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40001 steps (8 resets) in 154 ms. (258 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (8 resets) in 144 ms. (275 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (8 resets) in 147 ms. (270 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40002 steps (8 resets) in 152 ms. (261 steps per ms) remains 133/133 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 129/133 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 129/129 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 129/129 properties
// Phase 1: matrix 2057 rows 341 cols
[2025-05-29 18:22:31] [INFO ] Computed 22 invariants in 16 ms
[2025-05-29 18:22:31] [INFO ] State equation strengthened by 99 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/325 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:22:32] [INFO ] Deduced a trap composed of 168 places in 166 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 16/341 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:22:35] [INFO ] Deduced a trap composed of 103 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:22:35] [INFO ] Deduced a trap composed of 96 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:22:35] [INFO ] Deduced a trap composed of 56 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:22:36] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:22:36] [INFO ] Deduced a trap composed of 49 places in 251 ms of which 4 ms to minimize.
[2025-05-29 18:22:37] [INFO ] Deduced a trap composed of 81 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:22:37] [INFO ] Deduced a trap composed of 83 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:22:38] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:22:38] [INFO ] Deduced a trap composed of 84 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:22:38] [INFO ] Deduced a trap composed of 95 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:22:38] [INFO ] Deduced a trap composed of 107 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:22:39] [INFO ] Deduced a trap composed of 65 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:22:39] [INFO ] Deduced a trap composed of 101 places in 249 ms of which 3 ms to minimize.
[2025-05-29 18:22:39] [INFO ] Deduced a trap composed of 67 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:22:40] [INFO ] Deduced a trap composed of 85 places in 244 ms of which 3 ms to minimize.
[2025-05-29 18:22:40] [INFO ] Deduced a trap composed of 122 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:22:40] [INFO ] Deduced a trap composed of 104 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:22:40] [INFO ] Deduced a trap composed of 60 places in 241 ms of which 2 ms to minimize.
[2025-05-29 18:22:41] [INFO ] Deduced a trap composed of 129 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:22:41] [INFO ] Deduced a trap composed of 108 places in 246 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:22:41] [INFO ] Deduced a trap composed of 92 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:22:42] [INFO ] Deduced a trap composed of 61 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:22:42] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:22:42] [INFO ] Deduced a trap composed of 82 places in 241 ms of which 2 ms to minimize.
[2025-05-29 18:22:42] [INFO ] Deduced a trap composed of 95 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 67 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 118 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 98 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:22:43] [INFO ] Deduced a trap composed of 57 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:22:44] [INFO ] Deduced a trap composed of 58 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:22:44] [INFO ] Deduced a trap composed of 103 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:22:44] [INFO ] Deduced a trap composed of 137 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:22:45] [INFO ] Deduced a trap composed of 93 places in 247 ms of which 3 ms to minimize.
[2025-05-29 18:22:45] [INFO ] Deduced a trap composed of 114 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:22:45] [INFO ] Deduced a trap composed of 107 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:22:45] [INFO ] Deduced a trap composed of 45 places in 252 ms of which 3 ms to minimize.
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 121 places in 251 ms of which 3 ms to minimize.
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 113 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 108 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:22:46] [INFO ] Deduced a trap composed of 112 places in 251 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 20/63 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:22:48] [INFO ] Deduced a trap composed of 66 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 120 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 138 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:22:49] [INFO ] Deduced a trap composed of 78 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:22:50] [INFO ] Deduced a trap composed of 132 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:22:50] [INFO ] Deduced a trap composed of 104 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:22:50] [INFO ] Deduced a trap composed of 97 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:22:50] [INFO ] Deduced a trap composed of 57 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 44 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 71 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 112 places in 238 ms of which 2 ms to minimize.
[2025-05-29 18:22:51] [INFO ] Deduced a trap composed of 43 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:22:52] [INFO ] Deduced a trap composed of 76 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:22:52] [INFO ] Deduced a trap composed of 75 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:22:52] [INFO ] Deduced a trap composed of 72 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:22:53] [INFO ] Deduced a trap composed of 113 places in 251 ms of which 3 ms to minimize.
[2025-05-29 18:22:54] [INFO ] Deduced a trap composed of 120 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:22:54] [INFO ] Deduced a trap composed of 52 places in 241 ms of which 2 ms to minimize.
[2025-05-29 18:22:54] [INFO ] Deduced a trap composed of 83 places in 246 ms of which 3 ms to minimize.
[2025-05-29 18:22:54] [INFO ] Deduced a trap composed of 70 places in 258 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 144 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 84 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:22:56] [INFO ] Deduced a trap composed of 80 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:22:57] [INFO ] Deduced a trap composed of 75 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:22:57] [INFO ] Deduced a trap composed of 68 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:22:57] [INFO ] Deduced a trap composed of 105 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:22:57] [INFO ] Deduced a trap composed of 56 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:22:58] [INFO ] Deduced a trap composed of 39 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:22:58] [INFO ] Deduced a trap composed of 165 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:22:58] [INFO ] Deduced a trap composed of 125 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:22:58] [INFO ] Deduced a trap composed of 60 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:22:59] [INFO ] Deduced a trap composed of 108 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:22:59] [INFO ] Deduced a trap composed of 94 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:22:59] [INFO ] Deduced a trap composed of 110 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:00] [INFO ] Deduced a trap composed of 84 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:23:00] [INFO ] Deduced a trap composed of 120 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:23:00] [INFO ] Deduced a trap composed of 101 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:23:00] [INFO ] Deduced a trap composed of 72 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:23:01] [INFO ] Deduced a trap composed of 93 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:23:01] [INFO ] Deduced a trap composed of 101 places in 246 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:23:04] [INFO ] Deduced a trap composed of 100 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:23:04] [INFO ] Deduced a trap composed of 102 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:23:04] [INFO ] Deduced a trap composed of 88 places in 285 ms of which 2 ms to minimize.
[2025-05-29 18:23:04] [INFO ] Deduced a trap composed of 80 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:23:05] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:23:05] [INFO ] Deduced a trap composed of 84 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:05] [INFO ] Deduced a trap composed of 73 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:23:05] [INFO ] Deduced a trap composed of 146 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:23:06] [INFO ] Deduced a trap composed of 133 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:23:06] [INFO ] Deduced a trap composed of 108 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:23:06] [INFO ] Deduced a trap composed of 100 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:23:07] [INFO ] Deduced a trap composed of 113 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:23:07] [INFO ] Deduced a trap composed of 121 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:23:07] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:23:07] [INFO ] Deduced a trap composed of 50 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:23:08] [INFO ] Deduced a trap composed of 97 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:23:08] [INFO ] Deduced a trap composed of 96 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:23:08] [INFO ] Deduced a trap composed of 86 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:08] [INFO ] Deduced a trap composed of 97 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:23:09] [INFO ] Deduced a trap composed of 77 places in 249 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:23:13] [INFO ] Deduced a trap composed of 72 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:23:13] [INFO ] Deduced a trap composed of 68 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:23:14] [INFO ] Deduced a trap composed of 114 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:14] [INFO ] Deduced a trap composed of 122 places in 251 ms of which 3 ms to minimize.
[2025-05-29 18:23:14] [INFO ] Deduced a trap composed of 100 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:15] [INFO ] Deduced a trap composed of 79 places in 253 ms of which 3 ms to minimize.
[2025-05-29 18:23:15] [INFO ] Deduced a trap composed of 93 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:23:15] [INFO ] Deduced a trap composed of 110 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:23:16] [INFO ] Deduced a trap composed of 149 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:23:16] [INFO ] Deduced a trap composed of 151 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:23:17] [INFO ] Deduced a trap composed of 132 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:23:17] [INFO ] Deduced a trap composed of 93 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:18] [INFO ] Deduced a trap composed of 123 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:18] [INFO ] Deduced a trap composed of 54 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:23:18] [INFO ] Deduced a trap composed of 56 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:19] [INFO ] Deduced a trap composed of 101 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:23:19] [INFO ] Deduced a trap composed of 124 places in 245 ms of which 3 ms to minimize.
[2025-05-29 18:23:19] [INFO ] Deduced a trap composed of 107 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:20] [INFO ] Deduced a trap composed of 86 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:20] [INFO ] Deduced a trap composed of 88 places in 249 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:23:22] [INFO ] Deduced a trap composed of 101 places in 272 ms of which 3 ms to minimize.
[2025-05-29 18:23:23] [INFO ] Deduced a trap composed of 118 places in 266 ms of which 3 ms to minimize.
[2025-05-29 18:23:24] [INFO ] Deduced a trap composed of 100 places in 258 ms of which 2 ms to minimize.
[2025-05-29 18:23:24] [INFO ] Deduced a trap composed of 69 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:23:25] [INFO ] Deduced a trap composed of 92 places in 255 ms of which 3 ms to minimize.
[2025-05-29 18:23:25] [INFO ] Deduced a trap composed of 99 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:23:25] [INFO ] Deduced a trap composed of 44 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:23:26] [INFO ] Deduced a trap composed of 115 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:23:26] [INFO ] Deduced a trap composed of 49 places in 250 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 9/152 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 98 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 93 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:31] [INFO ] Deduced a trap composed of 43 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:23:32] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:23:32] [INFO ] Deduced a trap composed of 123 places in 265 ms of which 2 ms to minimize.
[2025-05-29 18:23:32] [INFO ] Deduced a trap composed of 53 places in 262 ms of which 2 ms to minimize.
[2025-05-29 18:23:33] [INFO ] Deduced a trap composed of 103 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:23:33] [INFO ] Deduced a trap composed of 102 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:23:33] [INFO ] Deduced a trap composed of 53 places in 252 ms of which 3 ms to minimize.
[2025-05-29 18:23:34] [INFO ] Deduced a trap composed of 68 places in 252 ms of which 3 ms to minimize.
[2025-05-29 18:23:34] [INFO ] Deduced a trap composed of 131 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:23:35] [INFO ] Deduced a trap composed of 88 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 102 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:23:36] [INFO ] Deduced a trap composed of 75 places in 249 ms of which 3 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 83 places in 255 ms of which 3 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 130 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 121 places in 259 ms of which 3 ms to minimize.
[2025-05-29 18:23:37] [INFO ] Deduced a trap composed of 110 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:38] [INFO ] Deduced a trap composed of 100 places in 247 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 19/171 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 341/2398 variables, and 171 constraints, problems are : Problem set: 0 solved, 129 unsolved in 75011 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/341 constraints, ReadFeed: 0/99 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 149/149 constraints]
Escalating to Integer solving :Problem set: 0 solved, 129 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (OVERLAPS) 254/325 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/325 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/325 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (OVERLAPS) 16/341 variables, 11/23 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 148/171 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:23:49] [INFO ] Deduced a trap composed of 60 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:49] [INFO ] Deduced a trap composed of 55 places in 255 ms of which 3 ms to minimize.
[2025-05-29 18:23:51] [INFO ] Deduced a trap composed of 95 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:23:51] [INFO ] Deduced a trap composed of 93 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:52] [INFO ] Deduced a trap composed of 79 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:23:52] [INFO ] Deduced a trap composed of 84 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:23:53] [INFO ] Deduced a trap composed of 97 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 79 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 124 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 133 places in 250 ms of which 3 ms to minimize.
[2025-05-29 18:23:54] [INFO ] Deduced a trap composed of 105 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:23:55] [INFO ] Deduced a trap composed of 67 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:23:55] [INFO ] Deduced a trap composed of 118 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:23:55] [INFO ] Deduced a trap composed of 99 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:23:55] [INFO ] Deduced a trap composed of 112 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:23:56] [INFO ] Deduced a trap composed of 77 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:23:56] [INFO ] Deduced a trap composed of 63 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:23:56] [INFO ] Deduced a trap composed of 98 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:23:59] [INFO ] Deduced a trap composed of 92 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:23:59] [INFO ] Deduced a trap composed of 53 places in 255 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 20/191 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:24:10] [INFO ] Deduced a trap composed of 49 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:24:11] [INFO ] Deduced a trap composed of 75 places in 260 ms of which 3 ms to minimize.
[2025-05-29 18:24:11] [INFO ] Deduced a trap composed of 57 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:24:11] [INFO ] Deduced a trap composed of 84 places in 267 ms of which 2 ms to minimize.
[2025-05-29 18:24:12] [INFO ] Deduced a trap composed of 57 places in 256 ms of which 2 ms to minimize.
[2025-05-29 18:24:12] [INFO ] Deduced a trap composed of 79 places in 260 ms of which 2 ms to minimize.
[2025-05-29 18:24:12] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 3 ms to minimize.
[2025-05-29 18:24:13] [INFO ] Deduced a trap composed of 62 places in 259 ms of which 2 ms to minimize.
[2025-05-29 18:24:13] [INFO ] Deduced a trap composed of 86 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:24:13] [INFO ] Deduced a trap composed of 47 places in 245 ms of which 2 ms to minimize.
[2025-05-29 18:24:14] [INFO ] Deduced a trap composed of 43 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:24:14] [INFO ] Deduced a trap composed of 91 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:24:14] [INFO ] Deduced a trap composed of 74 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:24:14] [INFO ] Deduced a trap composed of 120 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:24:15] [INFO ] Deduced a trap composed of 100 places in 264 ms of which 3 ms to minimize.
[2025-05-29 18:24:15] [INFO ] Deduced a trap composed of 75 places in 244 ms of which 2 ms to minimize.
[2025-05-29 18:24:15] [INFO ] Deduced a trap composed of 105 places in 247 ms of which 2 ms to minimize.
[2025-05-29 18:24:15] [INFO ] Deduced a trap composed of 84 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:24:16] [INFO ] Deduced a trap composed of 80 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:24:16] [INFO ] Deduced a trap composed of 111 places in 250 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/341 variables, 20/211 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:24:26] [INFO ] Deduced a trap composed of 125 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:24:26] [INFO ] Deduced a trap composed of 116 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:24:26] [INFO ] Deduced a trap composed of 86 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:24:26] [INFO ] Deduced a trap composed of 109 places in 255 ms of which 2 ms to minimize.
[2025-05-29 18:24:27] [INFO ] Deduced a trap composed of 69 places in 256 ms of which 3 ms to minimize.
[2025-05-29 18:24:27] [INFO ] Deduced a trap composed of 102 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:24:27] [INFO ] Deduced a trap composed of 106 places in 261 ms of which 2 ms to minimize.
[2025-05-29 18:24:28] [INFO ] Deduced a trap composed of 79 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:24:29] [INFO ] Deduced a trap composed of 67 places in 253 ms of which 2 ms to minimize.
[2025-05-29 18:24:30] [INFO ] Deduced a trap composed of 66 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:24:30] [INFO ] Deduced a trap composed of 100 places in 266 ms of which 2 ms to minimize.
[2025-05-29 18:24:30] [INFO ] Deduced a trap composed of 52 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:24:30] [INFO ] Deduced a trap composed of 130 places in 251 ms of which 3 ms to minimize.
[2025-05-29 18:24:31] [INFO ] Deduced a trap composed of 72 places in 248 ms of which 2 ms to minimize.
[2025-05-29 18:24:31] [INFO ] Deduced a trap composed of 106 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:24:33] [INFO ] Deduced a trap composed of 51 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:24:34] [INFO ] Deduced a trap composed of 55 places in 274 ms of which 2 ms to minimize.
[2025-05-29 18:24:34] [INFO ] Deduced a trap composed of 90 places in 254 ms of which 3 ms to minimize.
[2025-05-29 18:24:34] [INFO ] Deduced a trap composed of 95 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:24:34] [INFO ] Deduced a trap composed of 73 places in 253 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/341 variables, 20/231 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-05-29 18:24:45] [INFO ] Deduced a trap composed of 113 places in 250 ms of which 2 ms to minimize.
[2025-05-29 18:24:45] [INFO ] Deduced a trap composed of 69 places in 248 ms of which 3 ms to minimize.
[2025-05-29 18:24:45] [INFO ] Deduced a trap composed of 59 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:24:46] [INFO ] Deduced a trap composed of 68 places in 249 ms of which 2 ms to minimize.
[2025-05-29 18:24:46] [INFO ] Deduced a trap composed of 90 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:24:46] [INFO ] Deduced a trap composed of 45 places in 242 ms of which 2 ms to minimize.
[2025-05-29 18:24:46] [INFO ] Deduced a trap composed of 59 places in 234 ms of which 2 ms to minimize.
[2025-05-29 18:24:47] [INFO ] Deduced a trap composed of 88 places in 247 ms of which 3 ms to minimize.
[2025-05-29 18:24:47] [INFO ] Deduced a trap composed of 99 places in 240 ms of which 2 ms to minimize.
[2025-05-29 18:24:47] [INFO ] Deduced a trap composed of 80 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 94 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:24:48] [INFO ] Deduced a trap composed of 96 places in 243 ms of which 2 ms to minimize.
[2025-05-29 18:24:55] [INFO ] Deduced a trap composed of 57 places in 246 ms of which 2 ms to minimize.
[2025-05-29 18:24:55] [INFO ] Deduced a trap composed of 81 places in 251 ms of which 2 ms to minimize.
[2025-05-29 18:24:55] [INFO ] Deduced a trap composed of 122 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:24:56] [INFO ] Deduced a trap composed of 82 places in 257 ms of which 2 ms to minimize.
[2025-05-29 18:24:56] [INFO ] Deduced a trap composed of 93 places in 252 ms of which 2 ms to minimize.
[2025-05-29 18:24:56] [INFO ] Deduced a trap composed of 108 places in 254 ms of which 2 ms to minimize.
[2025-05-29 18:24:57] [INFO ] Deduced a trap composed of 52 places in 236 ms of which 2 ms to minimize.
[2025-05-29 18:24:57] [INFO ] Deduced a trap composed of 101 places in 252 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 20/251 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 341/2398 variables, and 251 constraints, problems are : Problem set: 0 solved, 129 unsolved in 75012 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/341 constraints, ReadFeed: 0/99 constraints, PredecessorRefiner: 0/129 constraints, Known Traps: 229/229 constraints]
After SMT, in 150405ms problems are : Problem set: 0 solved, 129 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 71 out of 341 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 341/341 places, 2057/2057 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 315 transition count 1689
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 315 transition count 1689
Applied a total of 52 rules in 44 ms. Remains 315 /341 variables (removed 26) and now considering 1689/2057 (removed 368) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 315/341 places, 1689/2057 transitions.
RANDOM walk for 4000000 steps (8 resets) in 38422 ms. (104 steps per ms) remains 127/129 properties
BEST_FIRST walk for 40002 steps (8 resets) in 388 ms. (102 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40001 steps (8 resets) in 125 ms. (317 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40002 steps (8 resets) in 141 ms. (281 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40001 steps (8 resets) in 137 ms. (289 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 127/127 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 125/127 properties
BEST_FIRST walk for 40003 steps (8 resets) in 139 ms. (285 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (8 resets) in 212 ms. (187 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (8 resets) in 231 ms. (172 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (8 resets) in 225 ms. (177 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40003 steps (8 resets) in 266 ms. (149 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (8 resets) in 142 ms. (279 steps per ms) remains 125/125 properties
BEST_FIRST walk for 40002 steps (8 resets) in 186 ms. (213 steps per ms) remains 124/125 properties
BEST_FIRST walk for 40002 steps (8 resets) in 196 ms. (203 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40001 steps (8 resets) in 159 ms. (250 steps per ms) remains 124/124 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 123/124 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 261 ms. (152 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 156 ms. (254 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 156 ms. (254 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 208 ms. (191 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 260 ms. (153 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 222 ms. (179 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 200 ms. (199 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 256 ms. (155 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 221 ms. (180 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (8 resets) in 184 ms. (216 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 224 ms. (177 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40001 steps (8 resets) in 189 ms. (210 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 123/123 properties
BEST_FIRST walk for 40004 steps (8 resets) in 166 ms. (239 steps per ms) remains 121/123 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 119/121 properties
BEST_FIRST walk for 40003 steps (8 resets) in 311 ms. (128 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40002 steps (8 resets) in 187 ms. (212 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 215 ms. (185 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40002 steps (8 resets) in 272 ms. (146 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40002 steps (8 resets) in 270 ms. (147 steps per ms) remains 119/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 118/119 properties
BEST_FIRST walk for 40003 steps (8 resets) in 203 ms. (196 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40003 steps (8 resets) in 260 ms. (153 steps per ms) remains 118/118 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 117/118 properties
BEST_FIRST walk for 40002 steps (8 resets) in 215 ms. (185 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40001 steps (8 resets) in 215 ms. (185 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 117/117 properties
BEST_FIRST walk for 40002 steps (8 resets) in 223 ms. (178 steps per ms) remains 113/117 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 154 ms. (258 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40002 steps (8 resets) in 247 ms. (161 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 113/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 110/113 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40002 steps (8 resets) in 228 ms. (174 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40001 steps (8 resets) in 174 ms. (228 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (8 resets) in 178 ms. (223 steps per ms) remains 110/110 properties
BEST_FIRST walk for 40003 steps (8 resets) in 196 ms. (203 steps per ms) remains 109/110 properties
BEST_FIRST walk for 40002 steps (8 resets) in 297 ms. (134 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 150 ms. (264 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 109/109 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 108/109 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 185 ms. (215 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 173 ms. (229 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 108/108 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 106/108 properties
BEST_FIRST walk for 40002 steps (8 resets) in 162 ms. (245 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 322 ms. (123 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 219 ms. (181 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40001 steps (8 resets) in 187 ms. (212 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 245 ms. (162 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40001 steps (8 resets) in 280 ms. (142 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 309 ms. (129 steps per ms) remains 106/106 properties
// Phase 1: matrix 1689 rows 315 cols
[2025-05-29 18:25:20] [INFO ] Computed 22 invariants in 8 ms
[2025-05-29 18:25:20] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 1 (OVERLAPS) 234/299 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:21] [INFO ] Deduced a trap composed of 221 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:21] [INFO ] Deduced a trap composed of 197 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 236 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 203 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 193 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 190 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 219 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 160 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:22] [INFO ] Deduced a trap composed of 215 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 213 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 174 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 210 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 201 places in 135 ms of which 1 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 211 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:23] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/299 variables, 15/26 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 204 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 173 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 240 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 156 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:24] [INFO ] Deduced a trap composed of 222 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 191 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 192 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 212 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 216 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 240 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:25:25] [INFO ] Deduced a trap composed of 224 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 191 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 224 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 205 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 217 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 231 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:26] [INFO ] Deduced a trap composed of 224 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 194 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 225 places in 143 ms of which 1 ms to minimize.
[2025-05-29 18:25:27] [INFO ] Deduced a trap composed of 228 places in 137 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/299 variables, 20/46 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 187 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 199 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 177 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 208 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 196 places in 143 ms of which 1 ms to minimize.
[2025-05-29 18:25:28] [INFO ] Deduced a trap composed of 190 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 212 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 209 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 199 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 182 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:29] [INFO ] Deduced a trap composed of 228 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 224 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 199 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 206 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 209 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 217 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 196 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:30] [INFO ] Deduced a trap composed of 167 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:31] [INFO ] Deduced a trap composed of 208 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:25:31] [INFO ] Deduced a trap composed of 197 places in 134 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/299 variables, 20/66 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:31] [INFO ] Deduced a trap composed of 225 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 222 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 164 places in 140 ms of which 1 ms to minimize.
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 203 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 206 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 208 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:32] [INFO ] Deduced a trap composed of 164 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:25:33] [INFO ] Deduced a trap composed of 176 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:33] [INFO ] Deduced a trap composed of 182 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:25:33] [INFO ] Deduced a trap composed of 194 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:33] [INFO ] Deduced a trap composed of 224 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:25:33] [INFO ] Deduced a trap composed of 181 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:25:33] [INFO ] Deduced a trap composed of 204 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:34] [INFO ] Deduced a trap composed of 201 places in 140 ms of which 1 ms to minimize.
[2025-05-29 18:25:34] [INFO ] Deduced a trap composed of 167 places in 145 ms of which 1 ms to minimize.
[2025-05-29 18:25:34] [INFO ] Deduced a trap composed of 166 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:34] [INFO ] Deduced a trap composed of 150 places in 133 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/299 variables, 17/83 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:34] [INFO ] Deduced a trap composed of 188 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 207 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 155 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 208 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 156 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 198 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 186 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:35] [INFO ] Deduced a trap composed of 212 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 213 places in 141 ms of which 1 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 203 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 187 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 220 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 205 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:36] [INFO ] Deduced a trap composed of 175 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 192 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 194 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 214 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 203 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:25:37] [INFO ] Deduced a trap composed of 172 places in 141 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:39] [INFO ] Deduced a trap composed of 192 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:39] [INFO ] Deduced a trap composed of 195 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:39] [INFO ] Deduced a trap composed of 160 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:25:39] [INFO ] Deduced a trap composed of 188 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:39] [INFO ] Deduced a trap composed of 159 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:40] [INFO ] Deduced a trap composed of 192 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:40] [INFO ] Deduced a trap composed of 202 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:40] [INFO ] Deduced a trap composed of 188 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:40] [INFO ] Deduced a trap composed of 176 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:25:40] [INFO ] Deduced a trap composed of 174 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 182 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 179 places in 140 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/299 variables, 12/115 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 189 places in 146 ms of which 3 ms to minimize.
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 185 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:41] [INFO ] Deduced a trap composed of 176 places in 139 ms of which 1 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 164 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 195 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 190 places in 135 ms of which 1 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 174 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:25:42] [INFO ] Deduced a trap composed of 158 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:43] [INFO ] Deduced a trap composed of 183 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:43] [INFO ] Deduced a trap composed of 177 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:43] [INFO ] Deduced a trap composed of 179 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:44] [INFO ] Deduced a trap composed of 194 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:44] [INFO ] Deduced a trap composed of 160 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:25:44] [INFO ] Deduced a trap composed of 177 places in 135 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/299 variables, 14/129 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:45] [INFO ] Deduced a trap composed of 187 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:45] [INFO ] Deduced a trap composed of 176 places in 139 ms of which 1 ms to minimize.
[2025-05-29 18:25:45] [INFO ] Deduced a trap composed of 148 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:25:45] [INFO ] Deduced a trap composed of 166 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:25:45] [INFO ] Deduced a trap composed of 206 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:45] [INFO ] Deduced a trap composed of 190 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:46] [INFO ] Deduced a trap composed of 187 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:25:46] [INFO ] Deduced a trap composed of 162 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:25:46] [INFO ] Deduced a trap composed of 180 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:46] [INFO ] Deduced a trap composed of 200 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:46] [INFO ] Deduced a trap composed of 185 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:46] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:46] [INFO ] Deduced a trap composed of 151 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:47] [INFO ] Deduced a trap composed of 199 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:25:47] [INFO ] Deduced a trap composed of 197 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:47] [INFO ] Deduced a trap composed of 194 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:47] [INFO ] Deduced a trap composed of 168 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:25:47] [INFO ] Deduced a trap composed of 179 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:47] [INFO ] Deduced a trap composed of 195 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:48] [INFO ] Deduced a trap composed of 184 places in 140 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/299 variables, 20/149 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 218 places in 140 ms of which 1 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 189 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 189 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 220 places in 140 ms of which 1 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 165 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 194 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:49] [INFO ] Deduced a trap composed of 167 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 156 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 170 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 182 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 169 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:50] [INFO ] Deduced a trap composed of 176 places in 140 ms of which 1 ms to minimize.
[2025-05-29 18:25:51] [INFO ] Deduced a trap composed of 184 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:25:51] [INFO ] Deduced a trap composed of 194 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:51] [INFO ] Deduced a trap composed of 189 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:25:51] [INFO ] Deduced a trap composed of 169 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:51] [INFO ] Deduced a trap composed of 183 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:51] [INFO ] Deduced a trap composed of 189 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:51] [INFO ] Deduced a trap composed of 210 places in 139 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/299 variables, 20/169 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:52] [INFO ] Deduced a trap composed of 215 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:53] [INFO ] Deduced a trap composed of 200 places in 136 ms of which 1 ms to minimize.
[2025-05-29 18:25:53] [INFO ] Deduced a trap composed of 185 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:53] [INFO ] Deduced a trap composed of 203 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:53] [INFO ] Deduced a trap composed of 187 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:25:53] [INFO ] Deduced a trap composed of 186 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:53] [INFO ] Deduced a trap composed of 203 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:25:54] [INFO ] Deduced a trap composed of 183 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:54] [INFO ] Deduced a trap composed of 209 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:25:54] [INFO ] Deduced a trap composed of 163 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:54] [INFO ] Deduced a trap composed of 201 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:25:54] [INFO ] Deduced a trap composed of 200 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:54] [INFO ] Deduced a trap composed of 182 places in 144 ms of which 1 ms to minimize.
[2025-05-29 18:25:55] [INFO ] Deduced a trap composed of 184 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:55] [INFO ] Deduced a trap composed of 199 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:55] [INFO ] Deduced a trap composed of 200 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:55] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:55] [INFO ] Deduced a trap composed of 179 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:25:55] [INFO ] Deduced a trap composed of 171 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:55] [INFO ] Deduced a trap composed of 164 places in 138 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/299 variables, 20/189 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:25:56] [INFO ] Deduced a trap composed of 144 places in 148 ms of which 1 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 203 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 199 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 179 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 215 places in 150 ms of which 2 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 212 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:57] [INFO ] Deduced a trap composed of 207 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 191 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 199 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 182 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 197 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 184 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:25:58] [INFO ] Deduced a trap composed of 200 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:25:59] [INFO ] Deduced a trap composed of 165 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:25:59] [INFO ] Deduced a trap composed of 173 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:25:59] [INFO ] Deduced a trap composed of 169 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:59] [INFO ] Deduced a trap composed of 148 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:25:59] [INFO ] Deduced a trap composed of 210 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:25:59] [INFO ] Deduced a trap composed of 169 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:25:59] [INFO ] Deduced a trap composed of 198 places in 135 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/299 variables, 20/209 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:01] [INFO ] Deduced a trap composed of 160 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:26:01] [INFO ] Deduced a trap composed of 198 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:26:01] [INFO ] Deduced a trap composed of 151 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 161 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 170 places in 140 ms of which 3 ms to minimize.
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 159 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 194 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:26:02] [INFO ] Deduced a trap composed of 177 places in 142 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/299 variables, 8/217 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:03] [INFO ] Deduced a trap composed of 213 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:26:03] [INFO ] Deduced a trap composed of 208 places in 135 ms of which 1 ms to minimize.
[2025-05-29 18:26:03] [INFO ] Deduced a trap composed of 212 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:26:04] [INFO ] Deduced a trap composed of 213 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:26:05] [INFO ] Deduced a trap composed of 188 places in 148 ms of which 1 ms to minimize.
[2025-05-29 18:26:05] [INFO ] Deduced a trap composed of 171 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:26:05] [INFO ] Deduced a trap composed of 167 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:26:05] [INFO ] Deduced a trap composed of 164 places in 135 ms of which 1 ms to minimize.
[2025-05-29 18:26:05] [INFO ] Deduced a trap composed of 157 places in 139 ms of which 1 ms to minimize.
[2025-05-29 18:26:05] [INFO ] Deduced a trap composed of 158 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:26:06] [INFO ] Deduced a trap composed of 141 places in 146 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/299 variables, 11/228 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 162 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 162 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:26:07] [INFO ] Deduced a trap composed of 168 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:26:08] [INFO ] Deduced a trap composed of 178 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:26:08] [INFO ] Deduced a trap composed of 164 places in 144 ms of which 1 ms to minimize.
[2025-05-29 18:26:08] [INFO ] Deduced a trap composed of 147 places in 139 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/299 variables, 6/234 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 106 unsolved
At refinement iteration 17 (OVERLAPS) 16/315 variables, 11/245 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:11] [INFO ] Deduced a trap composed of 112 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:12] [INFO ] Deduced a trap composed of 113 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:26:12] [INFO ] Deduced a trap composed of 103 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:26:12] [INFO ] Deduced a trap composed of 96 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:26:12] [INFO ] Deduced a trap composed of 97 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:26:13] [INFO ] Deduced a trap composed of 88 places in 235 ms of which 1 ms to minimize.
[2025-05-29 18:26:13] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:13] [INFO ] Deduced a trap composed of 95 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:13] [INFO ] Deduced a trap composed of 72 places in 223 ms of which 2 ms to minimize.
[2025-05-29 18:26:14] [INFO ] Deduced a trap composed of 71 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:26:14] [INFO ] Deduced a trap composed of 102 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:26:14] [INFO ] Deduced a trap composed of 107 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:26:14] [INFO ] Deduced a trap composed of 104 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:15] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:26:15] [INFO ] Deduced a trap composed of 90 places in 217 ms of which 2 ms to minimize.
[2025-05-29 18:26:15] [INFO ] Deduced a trap composed of 88 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:26:16] [INFO ] Deduced a trap composed of 94 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:26:16] [INFO ] Deduced a trap composed of 68 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:26:16] [INFO ] Deduced a trap composed of 54 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:26:16] [INFO ] Deduced a trap composed of 55 places in 209 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/315 variables, 20/265 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:20] [INFO ] Deduced a trap composed of 121 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:21] [INFO ] Deduced a trap composed of 100 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:26:21] [INFO ] Deduced a trap composed of 97 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:26:21] [INFO ] Deduced a trap composed of 80 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:26:21] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:26:22] [INFO ] Deduced a trap composed of 68 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:26:22] [INFO ] Deduced a trap composed of 86 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:22] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:26:22] [INFO ] Deduced a trap composed of 70 places in 212 ms of which 1 ms to minimize.
[2025-05-29 18:26:23] [INFO ] Deduced a trap composed of 110 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:23] [INFO ] Deduced a trap composed of 120 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:23] [INFO ] Deduced a trap composed of 103 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:24] [INFO ] Deduced a trap composed of 109 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:24] [INFO ] Deduced a trap composed of 60 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:26:25] [INFO ] Deduced a trap composed of 118 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:26:25] [INFO ] Deduced a trap composed of 89 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 128 places in 216 ms of which 3 ms to minimize.
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 105 places in 216 ms of which 1 ms to minimize.
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 121 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:26] [INFO ] Deduced a trap composed of 112 places in 211 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/315 variables, 20/285 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:29] [INFO ] Deduced a trap composed of 66 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:26:29] [INFO ] Deduced a trap composed of 103 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:26:29] [INFO ] Deduced a trap composed of 101 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:26:30] [INFO ] Deduced a trap composed of 101 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:26:30] [INFO ] Deduced a trap composed of 81 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:26:30] [INFO ] Deduced a trap composed of 99 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:30] [INFO ] Deduced a trap composed of 124 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:26:31] [INFO ] Deduced a trap composed of 122 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:31] [INFO ] Deduced a trap composed of 85 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:26:31] [INFO ] Deduced a trap composed of 90 places in 211 ms of which 1 ms to minimize.
[2025-05-29 18:26:31] [INFO ] Deduced a trap composed of 83 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:26:32] [INFO ] Deduced a trap composed of 76 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:26:32] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:26:32] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:26:32] [INFO ] Deduced a trap composed of 84 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:26:32] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:26:33] [INFO ] Deduced a trap composed of 103 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:26:33] [INFO ] Deduced a trap composed of 77 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:26:33] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:33] [INFO ] Deduced a trap composed of 94 places in 214 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/315 variables, 20/305 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:35] [INFO ] Deduced a trap composed of 89 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:26:36] [INFO ] Deduced a trap composed of 85 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:36] [INFO ] Deduced a trap composed of 85 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:26:37] [INFO ] Deduced a trap composed of 135 places in 222 ms of which 2 ms to minimize.
[2025-05-29 18:26:37] [INFO ] Deduced a trap composed of 91 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:37] [INFO ] Deduced a trap composed of 88 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:38] [INFO ] Deduced a trap composed of 100 places in 220 ms of which 2 ms to minimize.
[2025-05-29 18:26:38] [INFO ] Deduced a trap composed of 91 places in 224 ms of which 2 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 90 places in 219 ms of which 1 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 93 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 54 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:39] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:40] [INFO ] Deduced a trap composed of 68 places in 215 ms of which 1 ms to minimize.
[2025-05-29 18:26:40] [INFO ] Deduced a trap composed of 85 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:26:40] [INFO ] Deduced a trap composed of 66 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:26:40] [INFO ] Deduced a trap composed of 147 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:26:41] [INFO ] Deduced a trap composed of 144 places in 214 ms of which 1 ms to minimize.
[2025-05-29 18:26:41] [INFO ] Deduced a trap composed of 119 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:41] [INFO ] Deduced a trap composed of 115 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:42] [INFO ] Deduced a trap composed of 69 places in 209 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/315 variables, 20/325 constraints. Problems are: Problem set: 0 solved, 106 unsolved
[2025-05-29 18:26:47] [INFO ] Deduced a trap composed of 101 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:26:48] [INFO ] Deduced a trap composed of 75 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:26:48] [INFO ] Deduced a trap composed of 47 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:26:49] [INFO ] Deduced a trap composed of 94 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:26:49] [INFO ] Deduced a trap composed of 87 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:26:49] [INFO ] Deduced a trap composed of 93 places in 218 ms of which 2 ms to minimize.
[2025-05-29 18:26:50] [INFO ] Deduced a trap composed of 55 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:50] [INFO ] Deduced a trap composed of 55 places in 214 ms of which 1 ms to minimize.
[2025-05-29 18:26:50] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:26:50] [INFO ] Deduced a trap composed of 86 places in 227 ms of which 2 ms to minimize.
SMT process timed out in 90336ms, After SMT, problems are : Problem set: 0 solved, 106 unsolved
Fused 106 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 65 out of 315 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 315/315 places, 1689/1689 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 310 transition count 1594
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 310 transition count 1594
Applied a total of 10 rules in 33 ms. Remains 310 /315 variables (removed 5) and now considering 1594/1689 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 310/315 places, 1594/1689 transitions.
RANDOM walk for 4000000 steps (8 resets) in 49587 ms. (80 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 194 ms. (205 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 184 ms. (216 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 192 ms. (207 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 271 ms. (147 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 164 ms. (242 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 164 ms. (242 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 265 ms. (150 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 159 ms. (250 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 155 ms. (256 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 249 ms. (160 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 189 ms. (210 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 173 ms. (229 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 174 ms. (228 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 106/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 104/106 properties
BEST_FIRST walk for 40002 steps (8 resets) in 215 ms. (185 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 228 ms. (174 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 187 ms. (212 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 258 ms. (154 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40001 steps (8 resets) in 223 ms. (178 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 259 ms. (153 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 200 ms. (199 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 189 ms. (210 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 263 ms. (151 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 279 ms. (142 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 347 ms. (114 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 194 ms. (205 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 272 ms. (146 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 171 ms. (232 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 207 ms. (192 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 180 ms. (221 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 252 ms. (158 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 197 ms. (202 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 193 ms. (206 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 236 ms. (168 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 201 ms. (198 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 237 ms. (168 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 261 ms. (152 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 211 ms. (188 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 190 ms. (209 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 242 ms. (164 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40000 steps (8 resets) in 164 ms. (242 steps per ms) remains 104/104 properties
Interrupted probabilistic random walk after 4028821 steps, run timeout after 57001 ms. (steps per millisecond=70 ) properties seen :0 out of 104
Probabilistic random walk after 4028821 steps, saw 2736000 distinct states, run finished after 57008 ms. (steps per millisecond=70 ) properties seen :0
// Phase 1: matrix 1594 rows 310 cols
[2025-05-29 18:28:07] [INFO ] Computed 22 invariants in 7 ms
[2025-05-29 18:28:07] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 229/294 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:09] [INFO ] Deduced a trap composed of 200 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:28:09] [INFO ] Deduced a trap composed of 221 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:09] [INFO ] Deduced a trap composed of 207 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:28:09] [INFO ] Deduced a trap composed of 204 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:28:09] [INFO ] Deduced a trap composed of 191 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:28:09] [INFO ] Deduced a trap composed of 194 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 210 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 173 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 177 places in 131 ms of which 1 ms to minimize.
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 174 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 189 places in 134 ms of which 1 ms to minimize.
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 195 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:28:10] [INFO ] Deduced a trap composed of 177 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:28:11] [INFO ] Deduced a trap composed of 168 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:11] [INFO ] Deduced a trap composed of 176 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:28:11] [INFO ] Deduced a trap composed of 177 places in 127 ms of which 1 ms to minimize.
[2025-05-29 18:28:11] [INFO ] Deduced a trap composed of 184 places in 124 ms of which 1 ms to minimize.
[2025-05-29 18:28:11] [INFO ] Deduced a trap composed of 186 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:11] [INFO ] Deduced a trap composed of 147 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:11] [INFO ] Deduced a trap composed of 147 places in 133 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 20/31 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:12] [INFO ] Deduced a trap composed of 201 places in 137 ms of which 1 ms to minimize.
[2025-05-29 18:28:12] [INFO ] Deduced a trap composed of 187 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:28:12] [INFO ] Deduced a trap composed of 200 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:28:13] [INFO ] Deduced a trap composed of 179 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:13] [INFO ] Deduced a trap composed of 167 places in 127 ms of which 1 ms to minimize.
[2025-05-29 18:28:13] [INFO ] Deduced a trap composed of 162 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:28:13] [INFO ] Deduced a trap composed of 188 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:28:13] [INFO ] Deduced a trap composed of 161 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:28:13] [INFO ] Deduced a trap composed of 197 places in 125 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 191 places in 137 ms of which 1 ms to minimize.
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 207 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 192 places in 127 ms of which 1 ms to minimize.
[2025-05-29 18:28:15] [INFO ] Deduced a trap composed of 179 places in 124 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 216 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 172 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 206 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 190 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:16] [INFO ] Deduced a trap composed of 187 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 188 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 207 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 176 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 196 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 193 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 178 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:28:17] [INFO ] Deduced a trap composed of 189 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 175 places in 126 ms of which 1 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 175 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 186 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 174 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 159 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 177 places in 127 ms of which 1 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:18] [INFO ] Deduced a trap composed of 162 places in 126 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 20/64 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 175 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 194 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 166 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 176 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 178 places in 125 ms of which 1 ms to minimize.
[2025-05-29 18:28:19] [INFO ] Deduced a trap composed of 196 places in 127 ms of which 1 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 206 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 183 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 177 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 201 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 212 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 190 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:28:20] [INFO ] Deduced a trap composed of 187 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 163 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 183 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 177 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 166 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 186 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 175 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:28:21] [INFO ] Deduced a trap composed of 172 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 20/84 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 148 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 150 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 162 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 176 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 161 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:28:23] [INFO ] Deduced a trap composed of 149 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 169 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 162 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 171 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 160 places in 130 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 10/94 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:24] [INFO ] Deduced a trap composed of 186 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 174 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 185 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 173 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 191 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 184 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 188 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:28:25] [INFO ] Deduced a trap composed of 188 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:28:26] [INFO ] Deduced a trap composed of 180 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:28:26] [INFO ] Deduced a trap composed of 189 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:28:26] [INFO ] Deduced a trap composed of 186 places in 134 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 11/105 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:28] [INFO ] Deduced a trap composed of 171 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:28:28] [INFO ] Deduced a trap composed of 169 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:28:28] [INFO ] Deduced a trap composed of 146 places in 133 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (OVERLAPS) 16/310 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:30] [INFO ] Deduced a trap composed of 133 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:30] [INFO ] Deduced a trap composed of 139 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:30] [INFO ] Deduced a trap composed of 131 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:28:30] [INFO ] Deduced a trap composed of 140 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:28:31] [INFO ] Deduced a trap composed of 107 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:28:31] [INFO ] Deduced a trap composed of 119 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:31] [INFO ] Deduced a trap composed of 113 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:28:31] [INFO ] Deduced a trap composed of 77 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:32] [INFO ] Deduced a trap composed of 75 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:32] [INFO ] Deduced a trap composed of 81 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:32] [INFO ] Deduced a trap composed of 77 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:28:32] [INFO ] Deduced a trap composed of 63 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:28:33] [INFO ] Deduced a trap composed of 79 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:33] [INFO ] Deduced a trap composed of 93 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:28:33] [INFO ] Deduced a trap composed of 87 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:33] [INFO ] Deduced a trap composed of 78 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:33] [INFO ] Deduced a trap composed of 134 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:28:34] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:28:34] [INFO ] Deduced a trap composed of 120 places in 208 ms of which 1 ms to minimize.
[2025-05-29 18:28:34] [INFO ] Deduced a trap composed of 95 places in 203 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 20/139 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 91 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:36] [INFO ] Deduced a trap composed of 82 places in 193 ms of which 2 ms to minimize.
[2025-05-29 18:28:37] [INFO ] Deduced a trap composed of 75 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:28:37] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:28:37] [INFO ] Deduced a trap composed of 61 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:28:37] [INFO ] Deduced a trap composed of 64 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:28:37] [INFO ] Deduced a trap composed of 39 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:28:38] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:28:38] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:28:38] [INFO ] Deduced a trap composed of 95 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:28:38] [INFO ] Deduced a trap composed of 75 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:28:38] [INFO ] Deduced a trap composed of 72 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:28:39] [INFO ] Deduced a trap composed of 74 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:28:39] [INFO ] Deduced a trap composed of 105 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:28:39] [INFO ] Deduced a trap composed of 71 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:28:39] [INFO ] Deduced a trap composed of 73 places in 203 ms of which 1 ms to minimize.
[2025-05-29 18:28:40] [INFO ] Deduced a trap composed of 86 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:40] [INFO ] Deduced a trap composed of 88 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:28:40] [INFO ] Deduced a trap composed of 80 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:40] [INFO ] Deduced a trap composed of 78 places in 198 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 20/159 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:41] [INFO ] Deduced a trap composed of 95 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:28:41] [INFO ] Deduced a trap composed of 96 places in 206 ms of which 1 ms to minimize.
[2025-05-29 18:28:41] [INFO ] Deduced a trap composed of 89 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 82 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 92 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 99 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 116 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:42] [INFO ] Deduced a trap composed of 97 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 106 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 97 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 129 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:43] [INFO ] Deduced a trap composed of 128 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:28:44] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 1 ms to minimize.
[2025-05-29 18:28:44] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 1 ms to minimize.
[2025-05-29 18:28:44] [INFO ] Deduced a trap composed of 74 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:44] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:28:45] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:28:45] [INFO ] Deduced a trap composed of 60 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:28:45] [INFO ] Deduced a trap composed of 82 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:28:45] [INFO ] Deduced a trap composed of 70 places in 210 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 20/179 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:48] [INFO ] Deduced a trap composed of 95 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:48] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:48] [INFO ] Deduced a trap composed of 90 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:48] [INFO ] Deduced a trap composed of 113 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:48] [INFO ] Deduced a trap composed of 121 places in 209 ms of which 1 ms to minimize.
[2025-05-29 18:28:49] [INFO ] Deduced a trap composed of 121 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:28:49] [INFO ] Deduced a trap composed of 101 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:28:49] [INFO ] Deduced a trap composed of 66 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:28:49] [INFO ] Deduced a trap composed of 112 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 113 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 90 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 71 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:28:50] [INFO ] Deduced a trap composed of 71 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:28:51] [INFO ] Deduced a trap composed of 90 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:28:51] [INFO ] Deduced a trap composed of 81 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:51] [INFO ] Deduced a trap composed of 114 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:28:51] [INFO ] Deduced a trap composed of 80 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:52] [INFO ] Deduced a trap composed of 81 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:28:52] [INFO ] Deduced a trap composed of 78 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:28:52] [INFO ] Deduced a trap composed of 76 places in 209 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 20/199 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 82 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 47 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 101 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:28:58] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 80 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:28:59] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:29:00] [INFO ] Deduced a trap composed of 56 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 93 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 67 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:29:01] [INFO ] Deduced a trap composed of 74 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 49 places in 208 ms of which 1 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 96 places in 219 ms of which 2 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 69 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:29:02] [INFO ] Deduced a trap composed of 63 places in 207 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/310 variables, 15/214 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 71 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 74 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 76 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 120 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:29:07] [INFO ] Deduced a trap composed of 65 places in 197 ms of which 3 ms to minimize.
[2025-05-29 18:29:08] [INFO ] Deduced a trap composed of 55 places in 194 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/310 variables, 6/220 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/310 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 19 (OVERLAPS) 1594/1904 variables, 310/530 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1904 variables, 92/622 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1904 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 22 (OVERLAPS) 0/1904 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 104 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1904/1904 variables, and 622 constraints, problems are : Problem set: 0 solved, 104 unsolved in 105017 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 310/310 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 198/198 constraints]
Escalating to Integer solving :Problem set: 0 solved, 104 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 1 (OVERLAPS) 229/294 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 97/108 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 4 (OVERLAPS) 16/310 variables, 11/119 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/310 variables, 101/220 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:29:57] [INFO ] Deduced a trap composed of 95 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:29:57] [INFO ] Deduced a trap composed of 83 places in 211 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/310 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 104 unsolved
[2025-05-29 18:30:06] [INFO ] Deduced a trap composed of 76 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:30:06] [INFO ] Deduced a trap composed of 81 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:30:07] [INFO ] Deduced a trap composed of 92 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:30:07] [INFO ] Deduced a trap composed of 83 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:30:07] [INFO ] Deduced a trap composed of 89 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:30:09] [INFO ] Deduced a trap composed of 104 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:30:09] [INFO ] Deduced a trap composed of 110 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:30:09] [INFO ] Deduced a trap composed of 77 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 86 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 113 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 81 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 67 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:30:10] [INFO ] Deduced a trap composed of 89 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:30:11] [INFO ] Deduced a trap composed of 104 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:30:11] [INFO ] Deduced a trap composed of 81 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:30:11] [INFO ] Deduced a trap composed of 95 places in 209 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/310 variables, 16/238 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/310 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 9 (OVERLAPS) 1594/1904 variables, 310/548 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1904 variables, 92/640 constraints. Problems are: Problem set: 0 solved, 104 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1904 variables, 104/744 constraints. Problems are: Problem set: 0 solved, 104 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1904/1904 variables, and 744 constraints, problems are : Problem set: 0 solved, 104 unsolved in 105022 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 310/310 constraints, ReadFeed: 92/92 constraints, PredecessorRefiner: 104/104 constraints, Known Traps: 216/216 constraints]
After SMT, in 210449ms problems are : Problem set: 0 solved, 104 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1594/1594 transitions.
Applied a total of 0 rules in 38 ms. Remains 310 /310 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 310/310 places, 1594/1594 transitions.
RANDOM walk for 4000000 steps (8 resets) in 34029 ms. (117 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40003 steps (8 resets) in 149 ms. (266 steps per ms) remains 104/104 properties
BEST_FIRST walk for 40004 steps (8 resets) in 197 ms. (202 steps per ms) remains 103/104 properties
BEST_FIRST walk for 40002 steps (8 resets) in 188 ms. (211 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 199 ms. (200 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (8 resets) in 271 ms. (147 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (8 resets) in 202 ms. (197 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (8 resets) in 307 ms. (129 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (8 resets) in 280 ms. (142 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (8 resets) in 239 ms. (166 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 283 ms. (140 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 278 ms. (143 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 268 ms. (148 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 307 ms. (129 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (8 resets) in 278 ms. (143 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40001 steps (8 resets) in 257 ms. (155 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (8 resets) in 307 ms. (129 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 218 ms. (182 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 226 ms. (176 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 289 ms. (137 steps per ms) remains 103/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 281 ms. (141 steps per ms) remains 102/103 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 257 ms. (155 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 308 ms. (129 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 209 ms. (190 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 251 ms. (158 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 385 ms. (103 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 276 ms. (144 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 252 ms. (158 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 225 ms. (177 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 328 ms. (121 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 353 ms. (113 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 336 ms. (118 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40001 steps (8 resets) in 325 ms. (122 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 235 ms. (169 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 241 ms. (165 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40002 steps (8 resets) in 334 ms. (119 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 282 ms. (141 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 244 ms. (163 steps per ms) remains 102/102 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 101/102 properties
BEST_FIRST walk for 40003 steps (8 resets) in 172 ms. (231 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 266 ms. (149 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 328 ms. (121 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40001 steps (8 resets) in 286 ms. (139 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 265 ms. (150 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 287 ms. (138 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 267 ms. (149 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 283 ms. (140 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 276 ms. (144 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40003 steps (8 resets) in 263 ms. (151 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 365 ms. (109 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40002 steps (8 resets) in 362 ms. (110 steps per ms) remains 101/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 99/101 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 201 ms. (198 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 184 ms. (216 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 258 ms. (154 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 154 ms. (258 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 274 ms. (145 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 222 ms. (179 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 244 ms. (163 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 375 ms. (106 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 245 ms. (162 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 307 ms. (129 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 309 ms. (129 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 293 ms. (136 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 250 ms. (159 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 249 ms. (160 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 248 ms. (160 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40003 steps (8 resets) in 255 ms. (156 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40002 steps (8 resets) in 277 ms. (143 steps per ms) remains 99/99 properties
BEST_FIRST walk for 40001 steps (8 resets) in 322 ms. (123 steps per ms) remains 99/99 properties
Interrupted probabilistic random walk after 3529642 steps, run timeout after 54001 ms. (steps per millisecond=65 ) properties seen :0 out of 99
Probabilistic random walk after 3529642 steps, saw 2390169 distinct states, run finished after 54001 ms. (steps per millisecond=65 ) properties seen :0
[2025-05-29 18:32:51] [INFO ] Invariant cache hit.
[2025-05-29 18:32:51] [INFO ] State equation strengthened by 92 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (OVERLAPS) 231/294 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 200 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 200 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 202 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 185 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:32:52] [INFO ] Deduced a trap composed of 206 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 160 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 188 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 190 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 195 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 199 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 202 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:32:53] [INFO ] Deduced a trap composed of 201 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 187 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 191 places in 144 ms of which 6 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 192 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 191 places in 136 ms of which 1 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 172 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:32:54] [INFO ] Deduced a trap composed of 200 places in 130 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/294 variables, 18/29 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 173 places in 134 ms of which 1 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 185 places in 133 ms of which 1 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 166 places in 131 ms of which 1 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 161 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:32:55] [INFO ] Deduced a trap composed of 158 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 179 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 186 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 167 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 183 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 204 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:32:56] [INFO ] Deduced a trap composed of 180 places in 126 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 172 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 199 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 198 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 193 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 191 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 175 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:32:57] [INFO ] Deduced a trap composed of 191 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:32:58] [INFO ] Deduced a trap composed of 217 places in 140 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/294 variables, 20/49 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:32:58] [INFO ] Deduced a trap composed of 176 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 175 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 159 places in 122 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 175 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 142 places in 124 ms of which 1 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 164 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 158 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 155 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:32:59] [INFO ] Deduced a trap composed of 160 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 144 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 200 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 181 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 180 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 170 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 183 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:33:00] [INFO ] Deduced a trap composed of 160 places in 132 ms of which 1 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 178 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 180 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 177 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 179 places in 139 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/294 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 220 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:33:01] [INFO ] Deduced a trap composed of 203 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 237 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 193 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 235 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 190 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 196 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:33:02] [INFO ] Deduced a trap composed of 180 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 172 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 179 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 186 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 215 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 185 places in 136 ms of which 1 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 167 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 191 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:33:03] [INFO ] Deduced a trap composed of 204 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 169 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 159 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 182 places in 140 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/294 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 162 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 185 places in 139 ms of which 1 ms to minimize.
[2025-05-29 18:33:04] [INFO ] Deduced a trap composed of 185 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 178 places in 133 ms of which 1 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 165 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 190 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 192 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 191 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:33:05] [INFO ] Deduced a trap composed of 169 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 178 places in 137 ms of which 1 ms to minimize.
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 176 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 168 places in 136 ms of which 1 ms to minimize.
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 161 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 168 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:33:06] [INFO ] Deduced a trap composed of 181 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 177 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 150 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 175 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:33:07] [INFO ] Deduced a trap composed of 176 places in 135 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/294 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:08] [INFO ] Deduced a trap composed of 146 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:33:08] [INFO ] Deduced a trap composed of 203 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:33:08] [INFO ] Deduced a trap composed of 172 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:33:08] [INFO ] Deduced a trap composed of 188 places in 125 ms of which 1 ms to minimize.
[2025-05-29 18:33:08] [INFO ] Deduced a trap composed of 194 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:09] [INFO ] Deduced a trap composed of 193 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:33:09] [INFO ] Deduced a trap composed of 197 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:33:09] [INFO ] Deduced a trap composed of 191 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:33:09] [INFO ] Deduced a trap composed of 179 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:33:09] [INFO ] Deduced a trap composed of 205 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:33:09] [INFO ] Deduced a trap composed of 201 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:33:09] [INFO ] Deduced a trap composed of 190 places in 140 ms of which 2 ms to minimize.
[2025-05-29 18:33:10] [INFO ] Deduced a trap composed of 196 places in 132 ms of which 1 ms to minimize.
[2025-05-29 18:33:10] [INFO ] Deduced a trap composed of 182 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:33:10] [INFO ] Deduced a trap composed of 192 places in 133 ms of which 1 ms to minimize.
[2025-05-29 18:33:10] [INFO ] Deduced a trap composed of 160 places in 135 ms of which 3 ms to minimize.
[2025-05-29 18:33:10] [INFO ] Deduced a trap composed of 156 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:33:10] [INFO ] Deduced a trap composed of 169 places in 135 ms of which 1 ms to minimize.
[2025-05-29 18:33:10] [INFO ] Deduced a trap composed of 187 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:33:11] [INFO ] Deduced a trap composed of 190 places in 138 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (OVERLAPS) 16/310 variables, 11/140 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:13] [INFO ] Deduced a trap composed of 139 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:33:13] [INFO ] Deduced a trap composed of 129 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:33:13] [INFO ] Deduced a trap composed of 136 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 131 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 134 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 134 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:14] [INFO ] Deduced a trap composed of 124 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:15] [INFO ] Deduced a trap composed of 103 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:15] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:33:15] [INFO ] Deduced a trap composed of 100 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:15] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:33:16] [INFO ] Deduced a trap composed of 102 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:33:16] [INFO ] Deduced a trap composed of 58 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:16] [INFO ] Deduced a trap composed of 88 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:16] [INFO ] Deduced a trap composed of 94 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:16] [INFO ] Deduced a trap composed of 86 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:17] [INFO ] Deduced a trap composed of 84 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:17] [INFO ] Deduced a trap composed of 79 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:17] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:17] [INFO ] Deduced a trap composed of 55 places in 341 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/310 variables, 20/160 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:20] [INFO ] Deduced a trap composed of 78 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:20] [INFO ] Deduced a trap composed of 78 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:33:20] [INFO ] Deduced a trap composed of 80 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:20] [INFO ] Deduced a trap composed of 80 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:21] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:21] [INFO ] Deduced a trap composed of 93 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:21] [INFO ] Deduced a trap composed of 76 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:33:21] [INFO ] Deduced a trap composed of 104 places in 212 ms of which 1 ms to minimize.
[2025-05-29 18:33:22] [INFO ] Deduced a trap composed of 152 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:33:22] [INFO ] Deduced a trap composed of 140 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:22] [INFO ] Deduced a trap composed of 128 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:22] [INFO ] Deduced a trap composed of 130 places in 211 ms of which 1 ms to minimize.
[2025-05-29 18:33:23] [INFO ] Deduced a trap composed of 133 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:23] [INFO ] Deduced a trap composed of 132 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:33:23] [INFO ] Deduced a trap composed of 126 places in 205 ms of which 1 ms to minimize.
[2025-05-29 18:33:23] [INFO ] Deduced a trap composed of 120 places in 203 ms of which 3 ms to minimize.
[2025-05-29 18:33:23] [INFO ] Deduced a trap composed of 75 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:33:24] [INFO ] Deduced a trap composed of 128 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:33:24] [INFO ] Deduced a trap composed of 131 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:24] [INFO ] Deduced a trap composed of 129 places in 214 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/310 variables, 20/180 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:26] [INFO ] Deduced a trap composed of 73 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:26] [INFO ] Deduced a trap composed of 135 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:33:26] [INFO ] Deduced a trap composed of 80 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:33:26] [INFO ] Deduced a trap composed of 150 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:27] [INFO ] Deduced a trap composed of 102 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:27] [INFO ] Deduced a trap composed of 143 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:33:27] [INFO ] Deduced a trap composed of 130 places in 201 ms of which 1 ms to minimize.
[2025-05-29 18:33:27] [INFO ] Deduced a trap composed of 97 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:33:28] [INFO ] Deduced a trap composed of 97 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:33:28] [INFO ] Deduced a trap composed of 91 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:28] [INFO ] Deduced a trap composed of 148 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:28] [INFO ] Deduced a trap composed of 87 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:33:29] [INFO ] Deduced a trap composed of 117 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:29] [INFO ] Deduced a trap composed of 95 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:33:29] [INFO ] Deduced a trap composed of 119 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:29] [INFO ] Deduced a trap composed of 117 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:30] [INFO ] Deduced a trap composed of 78 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:33:30] [INFO ] Deduced a trap composed of 89 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:33:30] [INFO ] Deduced a trap composed of 94 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:33:30] [INFO ] Deduced a trap composed of 80 places in 211 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/310 variables, 20/200 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:37] [INFO ] Deduced a trap composed of 90 places in 216 ms of which 2 ms to minimize.
[2025-05-29 18:33:37] [INFO ] Deduced a trap composed of 107 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:33:37] [INFO ] Deduced a trap composed of 120 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:33:37] [INFO ] Deduced a trap composed of 98 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:37] [INFO ] Deduced a trap composed of 99 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:38] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 1 ms to minimize.
[2025-05-29 18:33:38] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:38] [INFO ] Deduced a trap composed of 106 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:39] [INFO ] Deduced a trap composed of 115 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:39] [INFO ] Deduced a trap composed of 87 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:39] [INFO ] Deduced a trap composed of 70 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:33:39] [INFO ] Deduced a trap composed of 47 places in 204 ms of which 1 ms to minimize.
[2025-05-29 18:33:39] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:40] [INFO ] Deduced a trap composed of 117 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:40] [INFO ] Deduced a trap composed of 87 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:40] [INFO ] Deduced a trap composed of 73 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:41] [INFO ] Deduced a trap composed of 83 places in 212 ms of which 3 ms to minimize.
[2025-05-29 18:33:41] [INFO ] Deduced a trap composed of 80 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:42] [INFO ] Deduced a trap composed of 87 places in 212 ms of which 2 ms to minimize.
[2025-05-29 18:33:42] [INFO ] Deduced a trap composed of 55 places in 211 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/310 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:46] [INFO ] Deduced a trap composed of 92 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:33:46] [INFO ] Deduced a trap composed of 90 places in 215 ms of which 2 ms to minimize.
[2025-05-29 18:33:46] [INFO ] Deduced a trap composed of 89 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:47] [INFO ] Deduced a trap composed of 92 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:47] [INFO ] Deduced a trap composed of 90 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:47] [INFO ] Deduced a trap composed of 98 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:47] [INFO ] Deduced a trap composed of 93 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:48] [INFO ] Deduced a trap composed of 103 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:48] [INFO ] Deduced a trap composed of 82 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:33:48] [INFO ] Deduced a trap composed of 88 places in 209 ms of which 1 ms to minimize.
[2025-05-29 18:33:49] [INFO ] Deduced a trap composed of 41 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:33:49] [INFO ] Deduced a trap composed of 112 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:33:49] [INFO ] Deduced a trap composed of 86 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:33:50] [INFO ] Deduced a trap composed of 119 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:50] [INFO ] Deduced a trap composed of 90 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:33:51] [INFO ] Deduced a trap composed of 57 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:33:51] [INFO ] Deduced a trap composed of 86 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:33:51] [INFO ] Deduced a trap composed of 74 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:33:51] [INFO ] Deduced a trap composed of 79 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:33:52] [INFO ] Deduced a trap composed of 94 places in 208 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/310 variables, 20/240 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:33:57] [INFO ] Deduced a trap composed of 94 places in 204 ms of which 1 ms to minimize.
[2025-05-29 18:33:57] [INFO ] Deduced a trap composed of 101 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:33:58] [INFO ] Deduced a trap composed of 96 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:33:58] [INFO ] Deduced a trap composed of 113 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:58] [INFO ] Deduced a trap composed of 126 places in 207 ms of which 1 ms to minimize.
[2025-05-29 18:33:58] [INFO ] Deduced a trap composed of 53 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:33:59] [INFO ] Deduced a trap composed of 80 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:33:59] [INFO ] Deduced a trap composed of 75 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:34:00] [INFO ] Deduced a trap composed of 73 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:34:00] [INFO ] Deduced a trap composed of 72 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:34:01] [INFO ] Deduced a trap composed of 92 places in 210 ms of which 2 ms to minimize.
[2025-05-29 18:34:01] [INFO ] Deduced a trap composed of 110 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:34:01] [INFO ] Deduced a trap composed of 97 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:34:02] [INFO ] Deduced a trap composed of 69 places in 213 ms of which 2 ms to minimize.
[2025-05-29 18:34:02] [INFO ] Deduced a trap composed of 40 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:34:02] [INFO ] Deduced a trap composed of 101 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:34:03] [INFO ] Deduced a trap composed of 66 places in 206 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/310 variables, 17/257 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 91 places in 212 ms of which 1 ms to minimize.
[2025-05-29 18:34:10] [INFO ] Deduced a trap composed of 65 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 103 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:34:11] [INFO ] Deduced a trap composed of 76 places in 263 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 96 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 113 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:34:12] [INFO ] Deduced a trap composed of 108 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:34:13] [INFO ] Deduced a trap composed of 49 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 107 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 121 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:34:15] [INFO ] Deduced a trap composed of 126 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 108 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 71 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 112 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:34:16] [INFO ] Deduced a trap composed of 116 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 81 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 1 ms to minimize.
[2025-05-29 18:34:17] [INFO ] Deduced a trap composed of 96 places in 205 ms of which 2 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 103 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:34:18] [INFO ] Deduced a trap composed of 115 places in 200 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/310 variables, 20/277 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:34:29] [INFO ] Deduced a trap composed of 119 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:34:30] [INFO ] Deduced a trap composed of 122 places in 221 ms of which 2 ms to minimize.
[2025-05-29 18:34:30] [INFO ] Deduced a trap composed of 50 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:34:38] [INFO ] Deduced a trap composed of 100 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:34:38] [INFO ] Deduced a trap composed of 95 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:34:39] [INFO ] Deduced a trap composed of 117 places in 204 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/310 variables, 6/283 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2025-05-29 18:34:49] [INFO ] Deduced a trap composed of 100 places in 214 ms of which 2 ms to minimize.
[2025-05-29 18:34:49] [INFO ] Deduced a trap composed of 91 places in 201 ms of which 1 ms to minimize.
[2025-05-29 18:34:49] [INFO ] Deduced a trap composed of 62 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:34:49] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:34:51] [INFO ] Deduced a trap composed of 81 places in 201 ms of which 2 ms to minimize.
SMT process timed out in 120506ms, After SMT, problems are : Problem set: 0 solved, 99 unsolved
Fused 99 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 63 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 1594/1594 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 308 transition count 1574
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 308 transition count 1574
Applied a total of 4 rules in 27 ms. Remains 308 /310 variables (removed 2) and now considering 1574/1594 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 308/310 places, 1574/1594 transitions.
RANDOM walk for 4000000 steps (8 resets) in 60978 ms. (65 steps per ms) remains 98/99 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1988 ms. (201 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1692 ms. (236 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2192 ms. (182 steps per ms) remains 98/98 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2242 ms. (178 steps per ms) remains 95/98 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2187 ms. (182 steps per ms) remains 95/95 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2294 ms. (174 steps per ms) remains 94/95 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1757 ms. (227 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2020 ms. (197 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2278 ms. (175 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400001 steps (8 resets) in 2261 ms. (176 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2107 ms. (189 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2117 ms. (188 steps per ms) remains 94/94 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2123 ms. (188 steps per ms) remains 93/94 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2358 ms. (169 steps per ms) remains 93/93 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2103 ms. (190 steps per ms) remains 90/93 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2143 ms. (186 steps per ms) remains 90/90 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1911 ms. (209 steps per ms) remains 87/90 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2176 ms. (183 steps per ms) remains 86/87 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2421 ms. (165 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2197 ms. (181 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2176 ms. (183 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2307 ms. (173 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2135 ms. (187 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1936 ms. (206 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2091 ms. (191 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1787 ms. (223 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2177 ms. (183 steps per ms) remains 86/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2224 ms. (179 steps per ms) remains 85/86 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2448 ms. (163 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2418 ms. (165 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1616 ms. (247 steps per ms) remains 85/85 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2106 ms. (189 steps per ms) remains 83/85 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1908 ms. (209 steps per ms) remains 83/83 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1922 ms. (208 steps per ms) remains 81/83 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2229 ms. (179 steps per ms) remains 80/81 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2105 ms. (189 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2431 ms. (164 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1799 ms. (222 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2234 ms. (178 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2194 ms. (182 steps per ms) remains 80/80 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1555 ms. (257 steps per ms) remains 79/80 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1983 ms. (201 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2055 ms. (194 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2027 ms. (197 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2047 ms. (195 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2102 ms. (190 steps per ms) remains 79/79 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2325 ms. (171 steps per ms) remains 77/79 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2253 ms. (177 steps per ms) remains 76/77 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1968 ms. (203 steps per ms) remains 76/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2160 ms. (185 steps per ms) remains 74/76 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2227 ms. (179 steps per ms) remains 71/74 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2114 ms. (189 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1958 ms. (204 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1668 ms. (239 steps per ms) remains 71/71 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1562 ms. (255 steps per ms) remains 70/71 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1954 ms. (204 steps per ms) remains 70/70 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1813 ms. (220 steps per ms) remains 68/70 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2333 ms. (171 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2357 ms. (169 steps per ms) remains 68/68 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2117 ms. (188 steps per ms) remains 66/68 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2200 ms. (181 steps per ms) remains 63/66 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2013 ms. (198 steps per ms) remains 62/63 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2078 ms. (192 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2156 ms. (185 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2143 ms. (186 steps per ms) remains 60/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2182 ms. (183 steps per ms) remains 59/60 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2166 ms. (184 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1748 ms. (228 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1910 ms. (209 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2184 ms. (183 steps per ms) remains 59/59 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2164 ms. (184 steps per ms) remains 58/59 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1509 ms. (264 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2160 ms. (185 steps per ms) remains 58/58 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2226 ms. (179 steps per ms) remains 55/58 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2007 ms. (199 steps per ms) remains 55/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1826 ms. (218 steps per ms) remains 53/55 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2165 ms. (184 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2148 ms. (186 steps per ms) remains 53/53 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1911 ms. (209 steps per ms) remains 53/53 properties
// Phase 1: matrix 1574 rows 308 cols
[2025-05-29 18:36:03] [INFO ] Computed 22 invariants in 5 ms
[2025-05-29 18:36:03] [INFO ] State equation strengthened by 91 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 235/280 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 27/307 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:04] [INFO ] Deduced a trap composed of 65 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:04] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:04] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:05] [INFO ] Deduced a trap composed of 114 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:05] [INFO ] Deduced a trap composed of 92 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:36:05] [INFO ] Deduced a trap composed of 96 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:05] [INFO ] Deduced a trap composed of 75 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:36:05] [INFO ] Deduced a trap composed of 70 places in 193 ms of which 2 ms to minimize.
[2025-05-29 18:36:06] [INFO ] Deduced a trap composed of 51 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:36:06] [INFO ] Deduced a trap composed of 83 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:36:06] [INFO ] Deduced a trap composed of 93 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:06] [INFO ] Deduced a trap composed of 48 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:06] [INFO ] Deduced a trap composed of 110 places in 195 ms of which 2 ms to minimize.
[2025-05-29 18:36:07] [INFO ] Deduced a trap composed of 111 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:07] [INFO ] Deduced a trap composed of 121 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:07] [INFO ] Deduced a trap composed of 104 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:36:07] [INFO ] Deduced a trap composed of 104 places in 197 ms of which 1 ms to minimize.
[2025-05-29 18:36:07] [INFO ] Deduced a trap composed of 166 places in 216 ms of which 1 ms to minimize.
[2025-05-29 18:36:08] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:08] [INFO ] Deduced a trap composed of 124 places in 207 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:09] [INFO ] Deduced a trap composed of 54 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:09] [INFO ] Deduced a trap composed of 117 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:09] [INFO ] Deduced a trap composed of 76 places in 193 ms of which 2 ms to minimize.
[2025-05-29 18:36:09] [INFO ] Deduced a trap composed of 51 places in 200 ms of which 1 ms to minimize.
[2025-05-29 18:36:09] [INFO ] Deduced a trap composed of 127 places in 192 ms of which 2 ms to minimize.
[2025-05-29 18:36:10] [INFO ] Deduced a trap composed of 57 places in 206 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 6/47 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/307 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (OVERLAPS) 1/308 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:11] [INFO ] Deduced a trap composed of 150 places in 208 ms of which 2 ms to minimize.
[2025-05-29 18:36:11] [INFO ] Deduced a trap composed of 102 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:12] [INFO ] Deduced a trap composed of 67 places in 205 ms of which 1 ms to minimize.
[2025-05-29 18:36:12] [INFO ] Deduced a trap composed of 114 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:36:12] [INFO ] Deduced a trap composed of 106 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:36:12] [INFO ] Deduced a trap composed of 53 places in 203 ms of which 1 ms to minimize.
[2025-05-29 18:36:13] [INFO ] Deduced a trap composed of 98 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:13] [INFO ] Deduced a trap composed of 94 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:13] [INFO ] Deduced a trap composed of 78 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:13] [INFO ] Deduced a trap composed of 82 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:13] [INFO ] Deduced a trap composed of 48 places in 199 ms of which 1 ms to minimize.
[2025-05-29 18:36:14] [INFO ] Deduced a trap composed of 115 places in 198 ms of which 1 ms to minimize.
[2025-05-29 18:36:14] [INFO ] Deduced a trap composed of 115 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:14] [INFO ] Deduced a trap composed of 114 places in 198 ms of which 1 ms to minimize.
[2025-05-29 18:36:14] [INFO ] Deduced a trap composed of 97 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:14] [INFO ] Deduced a trap composed of 124 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:36:15] [INFO ] Deduced a trap composed of 133 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:15] [INFO ] Deduced a trap composed of 83 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:15] [INFO ] Deduced a trap composed of 134 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:36:15] [INFO ] Deduced a trap composed of 123 places in 195 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:16] [INFO ] Deduced a trap composed of 69 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:16] [INFO ] Deduced a trap composed of 80 places in 206 ms of which 2 ms to minimize.
[2025-05-29 18:36:16] [INFO ] Deduced a trap composed of 93 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:36:16] [INFO ] Deduced a trap composed of 101 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:17] [INFO ] Deduced a trap composed of 92 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:17] [INFO ] Deduced a trap composed of 69 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:17] [INFO ] Deduced a trap composed of 50 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:17] [INFO ] Deduced a trap composed of 100 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:17] [INFO ] Deduced a trap composed of 103 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:18] [INFO ] Deduced a trap composed of 105 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:18] [INFO ] Deduced a trap composed of 79 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:36:18] [INFO ] Deduced a trap composed of 78 places in 209 ms of which 2 ms to minimize.
[2025-05-29 18:36:19] [INFO ] Deduced a trap composed of 76 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:36:19] [INFO ] Deduced a trap composed of 112 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:19] [INFO ] Deduced a trap composed of 80 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:19] [INFO ] Deduced a trap composed of 99 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:19] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:20] [INFO ] Deduced a trap composed of 102 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:36:20] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:20] [INFO ] Deduced a trap composed of 61 places in 200 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:21] [INFO ] Deduced a trap composed of 56 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:36:21] [INFO ] Deduced a trap composed of 87 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:22] [INFO ] Deduced a trap composed of 59 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:22] [INFO ] Deduced a trap composed of 109 places in 211 ms of which 2 ms to minimize.
[2025-05-29 18:36:22] [INFO ] Deduced a trap composed of 73 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:36:22] [INFO ] Deduced a trap composed of 49 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:36:23] [INFO ] Deduced a trap composed of 54 places in 199 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 7/95 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:24] [INFO ] Deduced a trap composed of 75 places in 213 ms of which 1 ms to minimize.
[2025-05-29 18:36:25] [INFO ] Deduced a trap composed of 46 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:25] [INFO ] Deduced a trap composed of 44 places in 205 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 3/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/308 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (OVERLAPS) 1574/1882 variables, 308/406 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1882 variables, 91/497 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1882 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (OVERLAPS) 0/1882 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1882/1882 variables, and 497 constraints, problems are : Problem set: 0 solved, 53 unsolved in 40453 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 308/308 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 76/76 constraints]
Escalating to Integer solving :Problem set: 0 solved, 53 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/45 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 1 (OVERLAPS) 235/280 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/280 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 3 (OVERLAPS) 27/307 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 60/81 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 6 (OVERLAPS) 1/308 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 16/98 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:46] [INFO ] Deduced a trap composed of 106 places in 204 ms of which 2 ms to minimize.
[2025-05-29 18:36:46] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 1 ms to minimize.
[2025-05-29 18:36:46] [INFO ] Deduced a trap composed of 104 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:47] [INFO ] Deduced a trap composed of 88 places in 207 ms of which 2 ms to minimize.
[2025-05-29 18:36:47] [INFO ] Deduced a trap composed of 72 places in 194 ms of which 2 ms to minimize.
[2025-05-29 18:36:47] [INFO ] Deduced a trap composed of 59 places in 194 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/308 variables, 6/104 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:48] [INFO ] Deduced a trap composed of 83 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:48] [INFO ] Deduced a trap composed of 103 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:36:48] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 3/107 constraints. Problems are: Problem set: 0 solved, 53 unsolved
[2025-05-29 18:36:51] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 2 ms to minimize.
[2025-05-29 18:36:51] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:36:51] [INFO ] Deduced a trap composed of 67 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:52] [INFO ] Deduced a trap composed of 96 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:52] [INFO ] Deduced a trap composed of 107 places in 201 ms of which 2 ms to minimize.
[2025-05-29 18:36:52] [INFO ] Deduced a trap composed of 77 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:36:52] [INFO ] Deduced a trap composed of 66 places in 197 ms of which 3 ms to minimize.
[2025-05-29 18:36:52] [INFO ] Deduced a trap composed of 95 places in 196 ms of which 2 ms to minimize.
[2025-05-29 18:36:53] [INFO ] Deduced a trap composed of 104 places in 200 ms of which 2 ms to minimize.
[2025-05-29 18:36:53] [INFO ] Deduced a trap composed of 78 places in 199 ms of which 2 ms to minimize.
[2025-05-29 18:36:53] [INFO ] Deduced a trap composed of 85 places in 198 ms of which 2 ms to minimize.
[2025-05-29 18:36:53] [INFO ] Deduced a trap composed of 118 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:53] [INFO ] Deduced a trap composed of 84 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:54] [INFO ] Deduced a trap composed of 94 places in 197 ms of which 2 ms to minimize.
[2025-05-29 18:36:54] [INFO ] Deduced a trap composed of 69 places in 194 ms of which 2 ms to minimize.
[2025-05-29 18:36:54] [INFO ] Deduced a trap composed of 68 places in 197 ms of which 1 ms to minimize.
[2025-05-29 18:36:54] [INFO ] Deduced a trap composed of 88 places in 194 ms of which 1 ms to minimize.
[2025-05-29 18:36:54] [INFO ] Deduced a trap composed of 95 places in 202 ms of which 2 ms to minimize.
[2025-05-29 18:36:55] [INFO ] Deduced a trap composed of 72 places in 203 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 19/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/308 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 12 (OVERLAPS) 1574/1882 variables, 308/434 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1882 variables, 91/525 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1882 variables, 53/578 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1882 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 53 unsolved
At refinement iteration 16 (OVERLAPS) 0/1882 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 53 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1882/1882 variables, and 578 constraints, problems are : Problem set: 0 solved, 53 unsolved in 39727 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 308/308 constraints, ReadFeed: 91/91 constraints, PredecessorRefiner: 53/53 constraints, Known Traps: 104/104 constraints]
After SMT, in 80305ms problems are : Problem set: 0 solved, 53 unsolved
Parikh walk visited 3 properties in 2237 ms.
Support contains 43 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1574/1574 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 291 transition count 1269
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 291 transition count 1269
Applied a total of 34 rules in 23 ms. Remains 291 /308 variables (removed 17) and now considering 1269/1574 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 291/308 places, 1269/1574 transitions.
RANDOM walk for 4000000 steps (8 resets) in 51818 ms. (77 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1770 ms. (225 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2070 ms. (193 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2044 ms. (195 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1427 ms. (280 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1991 ms. (200 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1942 ms. (205 steps per ms) remains 50/50 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1800 ms. (222 steps per ms) remains 49/50 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2484 ms. (160 steps per ms) remains 48/49 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2090 ms. (191 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1874 ms. (213 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1584 ms. (252 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1912 ms. (209 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1968 ms. (203 steps per ms) remains 48/48 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1427 ms. (280 steps per ms) remains 46/48 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1894 ms. (211 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1558 ms. (256 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2085 ms. (191 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1937 ms. (206 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1655 ms. (241 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1942 ms. (205 steps per ms) remains 46/46 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1431 ms. (279 steps per ms) remains 45/46 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1413 ms. (282 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1986 ms. (201 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1841 ms. (217 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1710 ms. (233 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1669 ms. (239 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1490 ms. (268 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1670 ms. (239 steps per ms) remains 45/45 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1787 ms. (223 steps per ms) remains 44/45 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1855 ms. (215 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2098 ms. (190 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400000 steps (8 resets) in 2067 ms. (193 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1922 ms. (208 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400002 steps (8 resets) in 2006 ms. (199 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2014 ms. (198 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1199 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1824 ms. (219 steps per ms) remains 44/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2023 ms. (197 steps per ms) remains 43/44 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1774 ms. (225 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1820 ms. (219 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2045 ms. (195 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2057 ms. (194 steps per ms) remains 43/43 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1623 ms. (246 steps per ms) remains 42/43 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1333 ms. (299 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1551 ms. (257 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1663 ms. (240 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1826 ms. (218 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1845 ms. (216 steps per ms) remains 42/42 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1784 ms. (224 steps per ms) remains 42/42 properties
// Phase 1: matrix 1269 rows 291 cols
[2025-05-29 18:38:12] [INFO ] Computed 22 invariants in 5 ms
[2025-05-29 18:38:12] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 224/263 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 27/290 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:12] [INFO ] Deduced a trap composed of 101 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:38:13] [INFO ] Deduced a trap composed of 91 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:38:13] [INFO ] Deduced a trap composed of 73 places in 161 ms of which 1 ms to minimize.
[2025-05-29 18:38:13] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 1 ms to minimize.
[2025-05-29 18:38:13] [INFO ] Deduced a trap composed of 91 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:38:13] [INFO ] Deduced a trap composed of 63 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:14] [INFO ] Deduced a trap composed of 78 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:14] [INFO ] Deduced a trap composed of 88 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:38:14] [INFO ] Deduced a trap composed of 119 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:38:14] [INFO ] Deduced a trap composed of 75 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:14] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:38:14] [INFO ] Deduced a trap composed of 76 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:38:15] [INFO ] Deduced a trap composed of 82 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:15] [INFO ] Deduced a trap composed of 78 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:38:15] [INFO ] Deduced a trap composed of 82 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:38:15] [INFO ] Deduced a trap composed of 77 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:38:15] [INFO ] Deduced a trap composed of 104 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:38:16] [INFO ] Deduced a trap composed of 85 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:38:16] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:38:16] [INFO ] Deduced a trap composed of 67 places in 164 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:16] [INFO ] Deduced a trap composed of 90 places in 169 ms of which 1 ms to minimize.
[2025-05-29 18:38:16] [INFO ] Deduced a trap composed of 87 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:38:16] [INFO ] Deduced a trap composed of 88 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 112 places in 164 ms of which 1 ms to minimize.
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 110 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 101 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 125 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:38:17] [INFO ] Deduced a trap composed of 59 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:38:18] [INFO ] Deduced a trap composed of 59 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:18] [INFO ] Deduced a trap composed of 99 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:38:18] [INFO ] Deduced a trap composed of 95 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:38:18] [INFO ] Deduced a trap composed of 93 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:18] [INFO ] Deduced a trap composed of 102 places in 171 ms of which 1 ms to minimize.
[2025-05-29 18:38:18] [INFO ] Deduced a trap composed of 90 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:38:19] [INFO ] Deduced a trap composed of 105 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:38:19] [INFO ] Deduced a trap composed of 91 places in 167 ms of which 1 ms to minimize.
[2025-05-29 18:38:19] [INFO ] Deduced a trap composed of 54 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:38:19] [INFO ] Deduced a trap composed of 114 places in 163 ms of which 2 ms to minimize.
[2025-05-29 18:38:19] [INFO ] Deduced a trap composed of 107 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:38:20] [INFO ] Deduced a trap composed of 70 places in 167 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:20] [INFO ] Deduced a trap composed of 112 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:38:20] [INFO ] Deduced a trap composed of 130 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:38:20] [INFO ] Deduced a trap composed of 124 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:38:21] [INFO ] Deduced a trap composed of 121 places in 163 ms of which 1 ms to minimize.
[2025-05-29 18:38:21] [INFO ] Deduced a trap composed of 51 places in 174 ms of which 2 ms to minimize.
[2025-05-29 18:38:21] [INFO ] Deduced a trap composed of 83 places in 173 ms of which 2 ms to minimize.
[2025-05-29 18:38:21] [INFO ] Deduced a trap composed of 109 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 67 places in 177 ms of which 2 ms to minimize.
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 61 places in 165 ms of which 1 ms to minimize.
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 106 places in 170 ms of which 1 ms to minimize.
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 68 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 92 places in 172 ms of which 2 ms to minimize.
[2025-05-29 18:38:22] [INFO ] Deduced a trap composed of 100 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:38:23] [INFO ] Deduced a trap composed of 71 places in 166 ms of which 2 ms to minimize.
[2025-05-29 18:38:23] [INFO ] Deduced a trap composed of 97 places in 161 ms of which 1 ms to minimize.
[2025-05-29 18:38:23] [INFO ] Deduced a trap composed of 106 places in 159 ms of which 1 ms to minimize.
[2025-05-29 18:38:23] [INFO ] Deduced a trap composed of 108 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:38:23] [INFO ] Deduced a trap composed of 91 places in 161 ms of which 2 ms to minimize.
[2025-05-29 18:38:24] [INFO ] Deduced a trap composed of 45 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:38:24] [INFO ] Deduced a trap composed of 123 places in 151 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 20/81 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:25] [INFO ] Deduced a trap composed of 80 places in 170 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/290 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:26] [INFO ] Deduced a trap composed of 80 places in 184 ms of which 1 ms to minimize.
[2025-05-29 18:38:26] [INFO ] Deduced a trap composed of 108 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:38:27] [INFO ] Deduced a trap composed of 101 places in 166 ms of which 1 ms to minimize.
[2025-05-29 18:38:27] [INFO ] Deduced a trap composed of 63 places in 169 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/290 variables, 4/86 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:30] [INFO ] Deduced a trap composed of 114 places in 168 ms of which 1 ms to minimize.
[2025-05-29 18:38:30] [INFO ] Deduced a trap composed of 113 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:38:30] [INFO ] Deduced a trap composed of 103 places in 165 ms of which 2 ms to minimize.
[2025-05-29 18:38:30] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 1 ms to minimize.
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 60 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 77 places in 176 ms of which 2 ms to minimize.
[2025-05-29 18:38:31] [INFO ] Deduced a trap composed of 45 places in 168 ms of which 2 ms to minimize.
[2025-05-29 18:38:32] [INFO ] Deduced a trap composed of 124 places in 167 ms of which 2 ms to minimize.
[2025-05-29 18:38:32] [INFO ] Deduced a trap composed of 50 places in 172 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/290 variables, 9/95 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:35] [INFO ] Deduced a trap composed of 77 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:38:35] [INFO ] Deduced a trap composed of 111 places in 164 ms of which 2 ms to minimize.
[2025-05-29 18:38:35] [INFO ] Deduced a trap composed of 66 places in 163 ms of which 1 ms to minimize.
[2025-05-29 18:38:36] [INFO ] Deduced a trap composed of 48 places in 164 ms of which 1 ms to minimize.
[2025-05-29 18:38:36] [INFO ] Deduced a trap composed of 94 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:38:36] [INFO ] Deduced a trap composed of 91 places in 166 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/290 variables, 6/101 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:40] [INFO ] Deduced a trap composed of 75 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:38:40] [INFO ] Deduced a trap composed of 80 places in 166 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/290 variables, 2/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/290 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (OVERLAPS) 1/291 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:45] [INFO ] Deduced a trap composed of 87 places in 183 ms of which 2 ms to minimize.
[2025-05-29 18:38:45] [INFO ] Deduced a trap composed of 109 places in 180 ms of which 2 ms to minimize.
[2025-05-29 18:38:45] [INFO ] Deduced a trap composed of 110 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:38:45] [INFO ] Deduced a trap composed of 61 places in 172 ms of which 1 ms to minimize.
[2025-05-29 18:38:46] [INFO ] Deduced a trap composed of 39 places in 175 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/291 variables, 5/109 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:47] [INFO ] Deduced a trap composed of 103 places in 178 ms of which 2 ms to minimize.
[2025-05-29 18:38:47] [INFO ] Deduced a trap composed of 78 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:38:47] [INFO ] Deduced a trap composed of 96 places in 174 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/291 variables, 3/112 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 57 places in 170 ms of which 2 ms to minimize.
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 48 places in 176 ms of which 2 ms to minimize.
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 123 places in 172 ms of which 2 ms to minimize.
[2025-05-29 18:38:48] [INFO ] Deduced a trap composed of 114 places in 167 ms of which 1 ms to minimize.
[2025-05-29 18:38:49] [INFO ] Deduced a trap composed of 94 places in 170 ms of which 1 ms to minimize.
[2025-05-29 18:38:49] [INFO ] Deduced a trap composed of 93 places in 175 ms of which 2 ms to minimize.
[2025-05-29 18:38:49] [INFO ] Deduced a trap composed of 73 places in 169 ms of which 2 ms to minimize.
[2025-05-29 18:38:49] [INFO ] Deduced a trap composed of 110 places in 178 ms of which 2 ms to minimize.
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 88 places in 172 ms of which 1 ms to minimize.
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 80 places in 171 ms of which 1 ms to minimize.
[2025-05-29 18:38:50] [INFO ] Deduced a trap composed of 86 places in 182 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/291 variables, 11/123 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:38:51] [INFO ] Deduced a trap composed of 39 places in 169 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/291 variables, 1/124 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/291 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 19 (OVERLAPS) 1269/1560 variables, 291/415 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1560 variables, 90/505 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1560 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 22 (OVERLAPS) 0/1560 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1560/1560 variables, and 505 constraints, problems are : Problem set: 0 solved, 42 unsolved in 48064 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 291/291 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 102/102 constraints]
Escalating to Integer solving :Problem set: 0 solved, 42 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (OVERLAPS) 224/263 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (OVERLAPS) 27/290 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/290 variables, 100/121 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/290 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 6 (OVERLAPS) 1/291 variables, 1/122 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 2/124 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 82 places in 177 ms of which 2 ms to minimize.
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 82 places in 171 ms of which 2 ms to minimize.
[2025-05-29 18:39:02] [INFO ] Deduced a trap composed of 58 places in 169 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 3/127 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2025-05-29 18:39:03] [INFO ] Deduced a trap composed of 116 places in 175 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/291 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 11 (OVERLAPS) 1269/1560 variables, 291/419 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1560 variables, 90/509 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1560 variables, 42/551 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1560 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 15 (OVERLAPS) 0/1560 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 42 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1560/1560 variables, and 551 constraints, problems are : Problem set: 0 solved, 42 unsolved in 21593 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 291/291 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 106/106 constraints]
After SMT, in 69740ms problems are : Problem set: 0 solved, 42 unsolved
Parikh walk visited 9 properties in 5547 ms.
Support contains 33 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 1269/1269 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 281 transition count 1079
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 281 transition count 1079
Applied a total of 20 rules in 21 ms. Remains 281 /291 variables (removed 10) and now considering 1079/1269 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 281/291 places, 1079/1269 transitions.
RANDOM walk for 4000000 steps (8 resets) in 48445 ms. (82 steps per ms) remains 32/33 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1963 ms. (203 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1806 ms. (221 steps per ms) remains 32/32 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1646 ms. (242 steps per ms) remains 31/32 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1604 ms. (249 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1909 ms. (209 steps per ms) remains 31/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1861 ms. (214 steps per ms) remains 30/31 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2075 ms. (192 steps per ms) remains 29/30 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1664 ms. (240 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1712 ms. (233 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1994 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1839 ms. (217 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1635 ms. (244 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 2024 ms. (197 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1644 ms. (243 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1674 ms. (238 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1805 ms. (221 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1801 ms. (221 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1191 ms. (335 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1722 ms. (232 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1461 ms. (273 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1954 ms. (204 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2039 ms. (196 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1791 ms. (223 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1809 ms. (220 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1724 ms. (231 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1779 ms. (224 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1823 ms. (219 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400000 steps (8 resets) in 1880 ms. (212 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1894 ms. (211 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1451 ms. (275 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2026 ms. (197 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1945 ms. (205 steps per ms) remains 29/29 properties
// Phase 1: matrix 1079 rows 281 cols
[2025-05-29 18:40:01] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:40:01] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 223/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 27/280 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-29 18:40:01] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:40:02] [INFO ] Deduced a trap composed of 73 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:40:02] [INFO ] Deduced a trap composed of 120 places in 142 ms of which 2 ms to minimize.
[2025-05-29 18:40:02] [INFO ] Deduced a trap composed of 78 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:40:02] [INFO ] Deduced a trap composed of 69 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:40:02] [INFO ] Deduced a trap composed of 104 places in 143 ms of which 1 ms to minimize.
[2025-05-29 18:40:02] [INFO ] Deduced a trap composed of 72 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:40:02] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 8/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 6 (OVERLAPS) 1/281 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-29 18:40:03] [INFO ] Deduced a trap composed of 78 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:40:03] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:40:04] [INFO ] Deduced a trap composed of 106 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:40:04] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 1 ms to minimize.
[2025-05-29 18:40:04] [INFO ] Deduced a trap composed of 119 places in 147 ms of which 1 ms to minimize.
[2025-05-29 18:40:04] [INFO ] Deduced a trap composed of 61 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:40:04] [INFO ] Deduced a trap composed of 77 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:40:04] [INFO ] Deduced a trap composed of 122 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:40:04] [INFO ] Deduced a trap composed of 81 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 74 places in 156 ms of which 1 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 111 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 1 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 89 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:40:05] [INFO ] Deduced a trap composed of 79 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 92 places in 162 ms of which 1 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 97 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 83 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:40:06] [INFO ] Deduced a trap composed of 59 places in 150 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/281 variables, 20/50 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 97 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 76 places in 162 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 93 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 76 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 110 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:40:07] [INFO ] Deduced a trap composed of 91 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:40:08] [INFO ] Deduced a trap composed of 96 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:40:08] [INFO ] Deduced a trap composed of 93 places in 160 ms of which 2 ms to minimize.
[2025-05-29 18:40:08] [INFO ] Deduced a trap composed of 83 places in 153 ms of which 1 ms to minimize.
[2025-05-29 18:40:08] [INFO ] Deduced a trap composed of 92 places in 157 ms of which 2 ms to minimize.
[2025-05-29 18:40:08] [INFO ] Deduced a trap composed of 81 places in 154 ms of which 2 ms to minimize.
[2025-05-29 18:40:08] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/281 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (OVERLAPS) 1079/1360 variables, 281/343 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1360 variables, 90/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1360 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (OVERLAPS) 0/1360 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1360/1360 variables, and 433 constraints, problems are : Problem set: 0 solved, 29 unsolved in 9905 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 281/281 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 223/253 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 3 (OVERLAPS) 27/280 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 37/58 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-29 18:40:11] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:40:11] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 148 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 144 places in 155 ms of which 1 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 67 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 120 places in 149 ms of which 2 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 152 places in 151 ms of which 2 ms to minimize.
[2025-05-29 18:40:12] [INFO ] Deduced a trap composed of 61 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:40:13] [INFO ] Deduced a trap composed of 84 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:40:13] [INFO ] Deduced a trap composed of 83 places in 159 ms of which 2 ms to minimize.
[2025-05-29 18:40:13] [INFO ] Deduced a trap composed of 83 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:40:13] [INFO ] Deduced a trap composed of 121 places in 152 ms of which 1 ms to minimize.
[2025-05-29 18:40:13] [INFO ] Deduced a trap composed of 89 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:40:13] [INFO ] Deduced a trap composed of 119 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 87 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 81 places in 149 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 16/74 constraints. Problems are: Problem set: 0 solved, 29 unsolved
[2025-05-29 18:40:14] [INFO ] Deduced a trap composed of 39 places in 155 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 8 (OVERLAPS) 1/281 variables, 1/76 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/281 variables, 3/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/281 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 11 (OVERLAPS) 1079/1360 variables, 281/360 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1360 variables, 90/450 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1360 variables, 29/479 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1360 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 15 (OVERLAPS) 0/1360 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 29 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1360/1360 variables, and 479 constraints, problems are : Problem set: 0 solved, 29 unsolved in 11140 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 281/281 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 57/57 constraints]
After SMT, in 21100ms problems are : Problem set: 0 solved, 29 unsolved
Parikh walk visited 0 properties in 3291 ms.
Support contains 30 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 1079/1079 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 278 transition count 1022
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 278 transition count 1022
Applied a total of 6 rules in 22 ms. Remains 278 /281 variables (removed 3) and now considering 1022/1079 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 278/281 places, 1022/1079 transitions.
RANDOM walk for 4000000 steps (8 resets) in 53196 ms. (75 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1755 ms. (227 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1605 ms. (249 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1738 ms. (230 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2010 ms. (198 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1999 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1538 ms. (259 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1434 ms. (278 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1644 ms. (243 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1589 ms. (251 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1712 ms. (233 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1811 ms. (220 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1539 ms. (259 steps per ms) remains 29/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1290 ms. (309 steps per ms) remains 28/29 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1844 ms. (216 steps per ms) remains 27/28 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1578 ms. (253 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1735 ms. (230 steps per ms) remains 27/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1575 ms. (253 steps per ms) remains 26/27 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1753 ms. (228 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1592 ms. (251 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1980 ms. (201 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1781 ms. (224 steps per ms) remains 26/26 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1913 ms. (208 steps per ms) remains 25/26 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1976 ms. (202 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1716 ms. (232 steps per ms) remains 25/25 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1661 ms. (240 steps per ms) remains 24/25 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1835 ms. (217 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2056 ms. (194 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1480 ms. (270 steps per ms) remains 24/24 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1929 ms. (207 steps per ms) remains 24/24 properties
// Phase 1: matrix 1022 rows 278 cols
[2025-05-29 18:40:58] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:40:58] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 225/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 27/277 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-29 18:40:58] [INFO ] Deduced a trap composed of 140 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 95 places in 143 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-29 18:40:59] [INFO ] Deduced a trap composed of 84 places in 150 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/277 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 1/278 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 72 places in 156 ms of which 2 ms to minimize.
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 63 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 90 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 78 places in 155 ms of which 2 ms to minimize.
[2025-05-29 18:41:00] [INFO ] Deduced a trap composed of 89 places in 148 ms of which 2 ms to minimize.
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 39 places in 149 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 6/31 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 122 places in 158 ms of which 2 ms to minimize.
[2025-05-29 18:41:01] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 24 unsolved
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 106 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 2 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 53 places in 144 ms of which 1 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 107 places in 147 ms of which 2 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 92 places in 146 ms of which 1 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 81 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:41:02] [INFO ] Deduced a trap composed of 69 places in 147 ms of which 1 ms to minimize.
[2025-05-29 18:41:03] [INFO ] Deduced a trap composed of 91 places in 145 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 8/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (OVERLAPS) 1022/1300 variables, 278/319 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1300 variables, 90/409 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1300 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 15 (OVERLAPS) 0/1300 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1300/1300 variables, and 409 constraints, problems are : Problem set: 0 solved, 24 unsolved in 7758 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 278/278 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (OVERLAPS) 225/250 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 27/277 variables, 11/21 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 17/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/277 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 1/278 variables, 1/39 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 2/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/278 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 9 (OVERLAPS) 1022/1300 variables, 278/319 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1300 variables, 90/409 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1300 variables, 24/433 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1300 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 13 (OVERLAPS) 0/1300 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1300/1300 variables, and 433 constraints, problems are : Problem set: 0 solved, 24 unsolved in 4529 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 278/278 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 19/19 constraints]
After SMT, in 12334ms problems are : Problem set: 0 solved, 24 unsolved
Parikh walk visited 1 properties in 2981 ms.
Support contains 24 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 1022/1022 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 272 transition count 908
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 272 transition count 908
Applied a total of 12 rules in 14 ms. Remains 272 /278 variables (removed 6) and now considering 908/1022 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 272/278 places, 908/1022 transitions.
RANDOM walk for 4000000 steps (8 resets) in 54255 ms. (73 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1354 ms. (295 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1647 ms. (242 steps per ms) remains 23/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1641 ms. (243 steps per ms) remains 22/23 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1843 ms. (216 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1865 ms. (214 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1527 ms. (261 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1675 ms. (238 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1781 ms. (224 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1556 ms. (256 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1917 ms. (208 steps per ms) remains 22/22 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1886 ms. (211 steps per ms) remains 21/22 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1439 ms. (277 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1925 ms. (207 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1428 ms. (279 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1541 ms. (259 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1552 ms. (257 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1512 ms. (264 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1837 ms. (217 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1689 ms. (236 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1267 ms. (315 steps per ms) remains 21/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1938 ms. (206 steps per ms) remains 20/21 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1777 ms. (224 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1493 ms. (267 steps per ms) remains 20/20 properties
// Phase 1: matrix 908 rows 272 cols
[2025-05-29 18:41:41] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:41:41] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 200/221 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 49/270 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-05-29 18:41:42] [INFO ] Deduced a trap composed of 135 places in 134 ms of which 1 ms to minimize.
[2025-05-29 18:41:42] [INFO ] Deduced a trap composed of 96 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:41:42] [INFO ] Deduced a trap composed of 86 places in 123 ms of which 1 ms to minimize.
[2025-05-29 18:41:42] [INFO ] Deduced a trap composed of 69 places in 131 ms of which 1 ms to minimize.
[2025-05-29 18:41:42] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 3 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 90 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 60 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 124 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 80 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 78 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:41:43] [INFO ] Deduced a trap composed of 76 places in 125 ms of which 1 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 59 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 82 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 70 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 114 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 105 places in 132 ms of which 1 ms to minimize.
[2025-05-29 18:41:44] [INFO ] Deduced a trap composed of 90 places in 129 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/272 variables, 2/42 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 123 places in 139 ms of which 1 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 112 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:41:45] [INFO ] Deduced a trap composed of 106 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 108 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 65 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 104 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 75 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 52 places in 133 ms of which 1 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 92 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:41:46] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:41:47] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:41:47] [INFO ] Deduced a trap composed of 124 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:41:47] [INFO ] Deduced a trap composed of 78 places in 140 ms of which 1 ms to minimize.
[2025-05-29 18:41:47] [INFO ] Deduced a trap composed of 97 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:41:47] [INFO ] Deduced a trap composed of 93 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:41:47] [INFO ] Deduced a trap composed of 90 places in 135 ms of which 1 ms to minimize.
[2025-05-29 18:41:48] [INFO ] Deduced a trap composed of 85 places in 143 ms of which 2 ms to minimize.
[2025-05-29 18:41:48] [INFO ] Deduced a trap composed of 97 places in 145 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-05-29 18:41:48] [INFO ] Deduced a trap composed of 125 places in 146 ms of which 2 ms to minimize.
[2025-05-29 18:41:48] [INFO ] Deduced a trap composed of 141 places in 145 ms of which 2 ms to minimize.
[2025-05-29 18:41:48] [INFO ] Deduced a trap composed of 92 places in 152 ms of which 2 ms to minimize.
[2025-05-29 18:41:48] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:41:48] [INFO ] Deduced a trap composed of 129 places in 139 ms of which 2 ms to minimize.
[2025-05-29 18:41:49] [INFO ] Deduced a trap composed of 102 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:41:49] [INFO ] Deduced a trap composed of 99 places in 143 ms of which 1 ms to minimize.
[2025-05-29 18:41:49] [INFO ] Deduced a trap composed of 143 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:41:49] [INFO ] Deduced a trap composed of 90 places in 137 ms of which 1 ms to minimize.
[2025-05-29 18:41:49] [INFO ] Deduced a trap composed of 81 places in 136 ms of which 1 ms to minimize.
[2025-05-29 18:41:49] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 2 ms to minimize.
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 121 places in 142 ms of which 1 ms to minimize.
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 96 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 84 places in 137 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 14/76 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 76 places in 144 ms of which 2 ms to minimize.
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 2 ms to minimize.
[2025-05-29 18:41:50] [INFO ] Deduced a trap composed of 76 places in 138 ms of which 2 ms to minimize.
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 121 places in 134 ms of which 1 ms to minimize.
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 100 places in 135 ms of which 2 ms to minimize.
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 97 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 81 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 90 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 69 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:41:51] [INFO ] Deduced a trap composed of 84 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:41:52] [INFO ] Deduced a trap composed of 92 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:41:52] [INFO ] Deduced a trap composed of 69 places in 140 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 12/88 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (OVERLAPS) 908/1180 variables, 272/360 constraints. Problems are: Problem set: 0 solved, 20 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 90/450 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1180 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/1180 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1180/1180 variables, and 450 constraints, problems are : Problem set: 0 solved, 20 unsolved in 11625 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 272/272 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 66/66 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 200/221 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 49/270 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 58/78 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 2/272 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 8/88 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 908/1180 variables, 272/360 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1180 variables, 90/450 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1180 variables, 20/470 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1180 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (OVERLAPS) 0/1180 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1180/1180 variables, and 470 constraints, problems are : Problem set: 0 solved, 20 unsolved in 4220 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 272/272 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 66/66 constraints]
After SMT, in 15892ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 0 properties in 6227 ms.
Support contains 21 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 908/908 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 270 transition count 870
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 270 transition count 870
Applied a total of 4 rules in 12 ms. Remains 270 /272 variables (removed 2) and now considering 870/908 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 270/272 places, 870/908 transitions.
RANDOM walk for 4000000 steps (8 resets) in 54775 ms. (73 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1848 ms. (216 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1547 ms. (258 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 2136 ms. (187 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1670 ms. (239 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1923 ms. (207 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1800 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1825 ms. (219 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1849 ms. (216 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1930 ms. (207 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1774 ms. (225 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1894 ms. (211 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1580 ms. (253 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1971 ms. (202 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1879 ms. (212 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1854 ms. (215 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1655 ms. (241 steps per ms) remains 20/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1605 ms. (249 steps per ms) remains 19/20 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1591 ms. (251 steps per ms) remains 18/19 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1673 ms. (238 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1522 ms. (262 steps per ms) remains 18/18 properties
// Phase 1: matrix 870 rows 270 cols
[2025-05-29 18:42:32] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:42:32] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 200/219 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 49/268 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-29 18:42:32] [INFO ] Deduced a trap composed of 124 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:42:32] [INFO ] Deduced a trap composed of 105 places in 139 ms of which 1 ms to minimize.
[2025-05-29 18:42:32] [INFO ] Deduced a trap composed of 52 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 101 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 120 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 96 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 100 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 115 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 107 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:42:33] [INFO ] Deduced a trap composed of 76 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 87 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 54 places in 131 ms of which 1 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 53 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 89 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:42:34] [INFO ] Deduced a trap composed of 72 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 88 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 75 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 68 places in 136 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 20/40 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 101 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 83 places in 130 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 88 places in 125 ms of which 1 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 79 places in 131 ms of which 2 ms to minimize.
[2025-05-29 18:42:35] [INFO ] Deduced a trap composed of 79 places in 134 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 86 places in 136 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 105 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 116 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 108 places in 130 ms of which 1 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 65 places in 133 ms of which 2 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 96 places in 127 ms of which 1 ms to minimize.
[2025-05-29 18:42:36] [INFO ] Deduced a trap composed of 86 places in 132 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 91 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 76 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 66 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 87 places in 125 ms of which 1 ms to minimize.
[2025-05-29 18:42:37] [INFO ] Deduced a trap composed of 98 places in 129 ms of which 2 ms to minimize.
[2025-05-29 18:42:38] [INFO ] Deduced a trap composed of 84 places in 127 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/270 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 870/1140 variables, 270/332 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1140 variables, 90/422 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1140 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 18 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/1140 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1140/1140 variables, and 422 constraints, problems are : Problem set: 0 solved, 18 unsolved in 7412 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 270/270 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 200/219 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/219 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (OVERLAPS) 49/268 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 40/60 constraints. Problems are: Problem set: 0 solved, 18 unsolved
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 104 places in 127 ms of which 1 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 91 places in 131 ms of which 1 ms to minimize.
[2025-05-29 18:42:40] [INFO ] Deduced a trap composed of 51 places in 126 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 3/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 2/270 variables, 2/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/270 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 870/1140 variables, 270/335 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1140 variables, 90/425 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1140 variables, 18/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1140 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/1140 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 443 constraints, problems are : Problem set: 0 solved, 18 unsolved in 3505 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 270/270 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 43/43 constraints]
After SMT, in 10948ms problems are : Problem set: 0 solved, 18 unsolved
Parikh walk visited 0 properties in 1096 ms.
Support contains 19 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 870/870 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 268 transition count 832
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 268 transition count 832
Applied a total of 4 rules in 10 ms. Remains 268 /270 variables (removed 2) and now considering 832/870 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 268/270 places, 832/870 transitions.
RANDOM walk for 4000000 steps (8 resets) in 53811 ms. (74 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1543 ms. (259 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1841 ms. (217 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1394 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1463 ms. (273 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1644 ms. (243 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1539 ms. (259 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1593 ms. (250 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1822 ms. (219 steps per ms) remains 18/18 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1818 ms. (219 steps per ms) remains 17/18 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1440 ms. (277 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1720 ms. (232 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1626 ms. (245 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1796 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1855 ms. (215 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1447 ms. (276 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400001 steps (8 resets) in 1507 ms. (265 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400003 steps (8 resets) in 1336 ms. (299 steps per ms) remains 17/17 properties
BEST_FIRST walk for 400002 steps (8 resets) in 1633 ms. (244 steps per ms) remains 17/17 properties
Interrupted probabilistic random walk after 6710761 steps, run timeout after 81001 ms. (steps per millisecond=82 ) properties seen :9 out of 17
Probabilistic random walk after 6710761 steps, saw 3951707 distinct states, run finished after 81001 ms. (steps per millisecond=82 ) properties seen :9
// Phase 1: matrix 832 rows 268 cols
[2025-05-29 18:44:32] [INFO ] Computed 22 invariants in 4 ms
[2025-05-29 18:44:32] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 110/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 139/258 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 10/268 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2025-05-29 18:44:32] [INFO ] Deduced a trap composed of 123 places in 135 ms of which 1 ms to minimize.
[2025-05-29 18:44:32] [INFO ] Deduced a trap composed of 112 places in 125 ms of which 2 ms to minimize.
[2025-05-29 18:44:32] [INFO ] Deduced a trap composed of 85 places in 125 ms of which 1 ms to minimize.
[2025-05-29 18:44:33] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 1 ms to minimize.
[2025-05-29 18:44:33] [INFO ] Deduced a trap composed of 47 places in 129 ms of which 1 ms to minimize.
[2025-05-29 18:44:33] [INFO ] Deduced a trap composed of 74 places in 127 ms of which 2 ms to minimize.
[2025-05-29 18:44:33] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 832/1100 variables, 268/297 constraints. Problems are: Problem set: 0 solved, 8 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1100 variables, 90/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1100 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 0/1100 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1100/1100 variables, and 387 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1656 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 268/268 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 110/119 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/119 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 139/258 variables, 11/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/258 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 10/268 variables, 6/22 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 7/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 832/1100 variables, 268/297 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1100 variables, 90/387 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1100 variables, 8/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1100 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 0/1100 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1100/1100 variables, and 395 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1212 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 268/268 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 7/7 constraints]
After SMT, in 2886ms problems are : Problem set: 0 solved, 8 unsolved
Parikh walk visited 0 properties in 1273 ms.
Support contains 9 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 832/832 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 258 transition count 642
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 258 transition count 642
Applied a total of 20 rules in 10 ms. Remains 258 /268 variables (removed 10) and now considering 642/832 (removed 190) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 258/268 places, 642/832 transitions.
RANDOM walk for 4000000 steps (8 resets) in 36695 ms. (109 steps per ms) remains 8/8 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 12251 ms. (326 steps per ms) remains 7/8 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 11496 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 11985 ms. (333 steps per ms) remains 6/7 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10822 ms. (369 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000001 steps (8 resets) in 11032 ms. (362 steps per ms) remains 5/6 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 10056 ms. (397 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000002 steps (8 resets) in 10314 ms. (387 steps per ms) remains 3/4 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 9987 ms. (400 steps per ms) remains 2/3 properties
// Phase 1: matrix 642 rows 258 cols
[2025-05-29 18:45:15] [INFO ] Computed 22 invariants in 3 ms
[2025-05-29 18:45:15] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 227/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/238 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/257 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/258 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2025-05-29 18:45:16] [INFO ] Deduced a trap composed of 83 places in 123 ms of which 2 ms to minimize.
[2025-05-29 18:45:16] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/258 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 642/900 variables, 258/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 90/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/900 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 900/900 variables, and 372 constraints, problems are : Problem set: 0 solved, 2 unsolved in 579 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 227/230 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/230 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/238 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/238 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 19/257 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/257 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/257 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 1/258 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/258 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 642/900 variables, 258/282 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/900 variables, 90/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/900 variables, 2/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/900 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/900 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 900/900 variables, and 374 constraints, problems are : Problem set: 0 solved, 2 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 258/258 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1018ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 148 ms.
Support contains 3 out of 258 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 258/258 places, 642/642 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 252 transition count 528
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 252 transition count 528
Applied a total of 12 rules in 12 ms. Remains 252 /258 variables (removed 6) and now considering 528/642 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 252/258 places, 528/642 transitions.
RANDOM walk for 4000000 steps (8 resets) in 17154 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000003 steps (8 resets) in 7630 ms. (524 steps per ms) remains 2/2 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 7401 ms. (540 steps per ms) remains 1/2 properties
// Phase 1: matrix 528 rows 252 cols
[2025-05-29 18:45:27] [INFO ] Computed 22 invariants in 7 ms
[2025-05-29 18:45:27] [INFO ] State equation strengthened by 90 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 18:45:27] [INFO ] Deduced a trap composed of 178 places in 91 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/243 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/252 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-05-29 18:45:27] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 528/780 variables, 252/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 90/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 0/780 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 780/780 variables, and 366 constraints, problems are : Problem set: 0 solved, 1 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 232/234 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 9/243 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/243 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 9/252 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 528/780 variables, 252/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/780 variables, 90/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/780 variables, 1/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/780 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/780 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 780/780 variables, and 367 constraints, problems are : Problem set: 0 solved, 1 unsolved in 321 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 252/252 constraints, ReadFeed: 90/90 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 800ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 528/528 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 251 transition count 509
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 251 transition count 509
Applied a total of 2 rules in 20 ms. Remains 251 /252 variables (removed 1) and now considering 509/528 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 251/252 places, 509/528 transitions.
RANDOM walk for 4000000 steps (8 resets) in 5583 ms. (716 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2360 ms. (1694 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 833535 steps, run visited all 1 properties in 1852 ms. (steps per millisecond=450 )
Probabilistic random walk after 833535 steps, saw 597888 distinct states, run finished after 1865 ms. (steps per millisecond=446 ) properties seen :1
Able to resolve query QuasiLiveness after proving 2290 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 621/621 places, 2480/2480 transitions.
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 90 Pre rules applied. Total rules applied 0 place count 621 transition count 2390
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 531 transition count 2390
Applied a total of 180 rules in 36 ms. Remains 531 /621 variables (removed 90) and now considering 2390/2480 (removed 90) transitions.
// Phase 1: matrix 2390 rows 531 cols
[2025-05-29 18:45:32] [INFO ] Computed 23 invariants in 10 ms
[2025-05-29 18:45:33] [INFO ] Implicit Places using invariants in 1624 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1627 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 530/621 places, 2390/2480 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 530 transition count 2290
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 430 transition count 2290
Applied a total of 200 rules in 15 ms. Remains 430 /530 variables (removed 100) and now considering 2290/2390 (removed 100) transitions.
// Phase 1: matrix 2290 rows 430 cols
[2025-05-29 18:45:33] [INFO ] Computed 22 invariants in 9 ms
[2025-05-29 18:45:34] [INFO ] Implicit Places using invariants in 963 ms returned []
[2025-05-29 18:45:34] [INFO ] Invariant cache hit.
[2025-05-29 18:45:35] [INFO ] State equation strengthened by 170 read => feed constraints.
[2025-05-29 18:45:38] [INFO ] Implicit Places using invariants and state equation in 3565 ms returned []
Implicit Place search using SMT with State Equation took 4530 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 430/621 places, 2290/2480 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 6208 ms. Remains : 430/621 places, 2290/2480 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :2290 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 2290 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 1559141 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Anderson-PT-10

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 621
TRANSITIONS: 2480
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 9560
NUPN UNITS: 13
LOADING TIME: 1.07

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

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

Process ID: 5372
MODEL NAME: /home/mcc/execution/model
621 places, 2480 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-10"
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-10, 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-174853743400124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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