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.r224-tall-174902009800208.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 ShieldRVt-PT-050B, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r224-tall-174902009800208
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1008K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 8.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K 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.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 5 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 614K May 29 14:33 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 StableMarking

=== Now, execution of the tool begins

BK_START 1749106812078

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=ShieldRVt-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-05 07:00:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-05 07:00:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:00:13] [INFO ] Load time of PNML (sax parser for PT used): 169 ms
[2025-06-05 07:00:13] [INFO ] Transformed 2503 places.
[2025-06-05 07:00:13] [INFO ] Transformed 2503 transitions.
[2025-06-05 07:00:13] [INFO ] Found NUPN structural information;
[2025-06-05 07:00:13] [INFO ] Parsed PT model containing 2503 places and 2503 transitions and 5906 arcs in 329 ms.
Structural test allowed to assert that 1001 places are NOT stable. Took 21 ms.
RANDOM walk for 40000 steps (8 resets) in 5059 ms. (7 steps per ms) remains 1152/1502 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 18 ms. (6 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 15 ms. (7 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 26 ms. (4 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 121 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 122 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 122 steps (8 resets) in 13 ms. (8 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 5 ms. (20 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 122 steps (8 resets) in 6 ms. (17 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 7 ms. (15 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 122 steps (8 resets) in 12 ms. (9 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 10 ms. (11 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 123 steps (8 resets) in 8 ms. (13 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 122 steps (8 resets) in 9 ms. (12 steps per ms) remains 1152/1152 properties
BEST_FIRST walk for 121 steps (8 resets) in 6 ms. (17 steps per ms) remains 1152/1152 properties
// Phase 1: matrix 2503 rows 2503 cols
[2025-06-05 07:00:15] [INFO ] Computed 201 invariants in 33 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1152 variables, 1152/1152 constraints. Problems are: Problem set: 0 solved, 1152 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1152/5006 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1152 unsolved in 5124 ms.
Refiners :[Domain max(s): 1152/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 1152/1152 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1152 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1152 variables, 1152/1152 constraints. Problems are: Problem set: 0 solved, 1152 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1152/5006 variables, and 1152 constraints, problems are : Problem set: 0 solved, 1152 unsolved in 5033 ms.
Refiners :[Domain max(s): 1152/2503 constraints, Positive P Invariants (semi-flows): 0/201 constraints, State Equation: 0/2503 constraints, PredecessorRefiner: 0/1152 constraints, Known Traps: 0/0 constraints]
After SMT, in 10652ms problems are : Problem set: 0 solved, 1152 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1152 out of 2503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2503/2503 places, 2503/2503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 494 transitions
Trivial Post-agglo rules discarded 494 transitions
Performed 494 trivial Post agglomeration. Transition count delta: 494
Iterating post reduction 0 with 494 rules applied. Total rules applied 494 place count 2503 transition count 2009
Reduce places removed 494 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 496 rules applied. Total rules applied 990 place count 2009 transition count 2007
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 991 place count 2008 transition count 2007
Performed 50 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 50 Pre rules applied. Total rules applied 991 place count 2008 transition count 1957
Deduced a syphon composed of 50 places in 22 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1091 place count 1958 transition count 1957
Discarding 74 places :
Symmetric choice reduction at 3 with 74 rule applications. Total rules 1165 place count 1884 transition count 1883
Iterating global reduction 3 with 74 rules applied. Total rules applied 1239 place count 1884 transition count 1883
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 1239 place count 1884 transition count 1854
Deduced a syphon composed of 29 places in 19 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 1297 place count 1855 transition count 1854
Performed 418 Post agglomeration using F-continuation condition.Transition count delta: 418
Deduced a syphon composed of 418 places in 15 ms
Reduce places removed 418 places and 0 transitions.
Iterating global reduction 3 with 836 rules applied. Total rules applied 2133 place count 1437 transition count 1436
Renaming transitions due to excessive name length > 1024 char.
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 31 places in 12 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 2195 place count 1406 transition count 1463
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2196 place count 1406 transition count 1462
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 2199 place count 1406 transition count 1459
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 2202 place count 1403 transition count 1459
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 2203 place count 1403 transition count 1458
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2204 place count 1402 transition count 1457
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2205 place count 1401 transition count 1457
Applied a total of 2205 rules in 702 ms. Remains 1401 /2503 variables (removed 1102) and now considering 1457/2503 (removed 1046) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 712 ms. Remains : 1401/2503 places, 1457/2503 transitions.
RANDOM walk for 2175204 steps (533 resets) in 120004 ms. (18 steps per ms) remains 741/1152 properties
BEST_FIRST walk for 4003 steps (8 resets) in 67 ms. (58 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4003 steps (8 resets) in 44 ms. (88 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (9 resets) in 37 ms. (105 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4003 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4003 steps (8 resets) in 41 ms. (95 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4002 steps (8 resets) in 40 ms. (97 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 741/741 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 741/741 properties
// Phase 1: matrix 1457 rows 1401 cols
[2025-06-05 07:00:57] [INFO ] Computed 200 invariants in 5 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 130/871 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 741 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 871/2858 variables, and 103 constraints, problems are : Problem set: 0 solved, 741 unsolved in 45022 ms.
Refiners :[Positive P Invariants (semi-flows): 103/200 constraints, State Equation: 0/1401 constraints, PredecessorRefiner: 741/741 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 741 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/741 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 741 unsolved
At refinement iteration 1 (OVERLAPS) 130/871 variables, 103/103 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2025-06-05 07:01:50] [INFO ] Deduced a trap composed of 24 places in 302 ms of which 40 ms to minimize.
[2025-06-05 07:01:51] [INFO ] Deduced a trap composed of 24 places in 104 ms of which 3 ms to minimize.
[2025-06-05 07:01:51] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
[2025-06-05 07:01:51] [INFO ] Deduced a trap composed of 18 places in 100 ms of which 2 ms to minimize.
[2025-06-05 07:01:52] [INFO ] Deduced a trap composed of 20 places in 94 ms of which 2 ms to minimize.
[2025-06-05 07:01:52] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 2 ms to minimize.
[2025-06-05 07:01:52] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2025-06-05 07:01:53] [INFO ] Deduced a trap composed of 22 places in 106 ms of which 2 ms to minimize.
[2025-06-05 07:01:53] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2025-06-05 07:01:53] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 2 ms to minimize.
[2025-06-05 07:01:54] [INFO ] Deduced a trap composed of 18 places in 111 ms of which 3 ms to minimize.
[2025-06-05 07:01:54] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2025-06-05 07:01:54] [INFO ] Deduced a trap composed of 32 places in 107 ms of which 3 ms to minimize.
[2025-06-05 07:01:54] [INFO ] Deduced a trap composed of 38 places in 104 ms of which 2 ms to minimize.
[2025-06-05 07:01:55] [INFO ] Deduced a trap composed of 18 places in 112 ms of which 3 ms to minimize.
[2025-06-05 07:01:55] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2025-06-05 07:01:55] [INFO ] Deduced a trap composed of 38 places in 107 ms of which 2 ms to minimize.
[2025-06-05 07:01:56] [INFO ] Deduced a trap composed of 24 places in 112 ms of which 2 ms to minimize.
[2025-06-05 07:01:56] [INFO ] Deduced a trap composed of 32 places in 110 ms of which 3 ms to minimize.
[2025-06-05 07:01:56] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/871 variables, 20/123 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2025-06-05 07:01:58] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 2 ms to minimize.
[2025-06-05 07:02:00] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2025-06-05 07:02:00] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 2 ms to minimize.
[2025-06-05 07:02:00] [INFO ] Deduced a trap composed of 48 places in 106 ms of which 2 ms to minimize.
[2025-06-05 07:02:01] [INFO ] Deduced a trap composed of 38 places in 118 ms of which 3 ms to minimize.
[2025-06-05 07:02:01] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 2 ms to minimize.
[2025-06-05 07:02:01] [INFO ] Deduced a trap composed of 42 places in 113 ms of which 2 ms to minimize.
[2025-06-05 07:02:02] [INFO ] Deduced a trap composed of 42 places in 108 ms of which 3 ms to minimize.
[2025-06-05 07:02:02] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 3 ms to minimize.
[2025-06-05 07:02:02] [INFO ] Deduced a trap composed of 42 places in 114 ms of which 2 ms to minimize.
[2025-06-05 07:02:03] [INFO ] Deduced a trap composed of 30 places in 120 ms of which 3 ms to minimize.
[2025-06-05 07:02:03] [INFO ] Deduced a trap composed of 42 places in 115 ms of which 2 ms to minimize.
[2025-06-05 07:02:03] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2025-06-05 07:02:04] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 5 ms to minimize.
[2025-06-05 07:02:04] [INFO ] Deduced a trap composed of 24 places in 127 ms of which 2 ms to minimize.
[2025-06-05 07:02:04] [INFO ] Deduced a trap composed of 32 places in 118 ms of which 3 ms to minimize.
[2025-06-05 07:02:04] [INFO ] Deduced a trap composed of 28 places in 123 ms of which 3 ms to minimize.
[2025-06-05 07:02:04] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 3 ms to minimize.
[2025-06-05 07:02:05] [INFO ] Deduced a trap composed of 24 places in 129 ms of which 3 ms to minimize.
[2025-06-05 07:02:05] [INFO ] Deduced a trap composed of 18 places in 121 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/871 variables, 20/143 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2025-06-05 07:02:06] [INFO ] Deduced a trap composed of 50 places in 136 ms of which 3 ms to minimize.
[2025-06-05 07:02:07] [INFO ] Deduced a trap composed of 24 places in 108 ms of which 2 ms to minimize.
[2025-06-05 07:02:08] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
[2025-06-05 07:02:08] [INFO ] Deduced a trap composed of 32 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:02:08] [INFO ] Deduced a trap composed of 24 places in 95 ms of which 2 ms to minimize.
[2025-06-05 07:02:09] [INFO ] Deduced a trap composed of 32 places in 105 ms of which 3 ms to minimize.
[2025-06-05 07:02:09] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 3 ms to minimize.
[2025-06-05 07:02:09] [INFO ] Deduced a trap composed of 48 places in 95 ms of which 2 ms to minimize.
[2025-06-05 07:02:09] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2025-06-05 07:02:09] [INFO ] Deduced a trap composed of 28 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:02:09] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 3 ms to minimize.
[2025-06-05 07:02:10] [INFO ] Deduced a trap composed of 32 places in 85 ms of which 2 ms to minimize.
[2025-06-05 07:02:10] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 2 ms to minimize.
[2025-06-05 07:02:12] [INFO ] Deduced a trap composed of 18 places in 115 ms of which 2 ms to minimize.
[2025-06-05 07:02:12] [INFO ] Deduced a trap composed of 62 places in 121 ms of which 3 ms to minimize.
[2025-06-05 07:02:12] [INFO ] Deduced a trap composed of 38 places in 120 ms of which 5 ms to minimize.
[2025-06-05 07:02:13] [INFO ] Deduced a trap composed of 38 places in 121 ms of which 3 ms to minimize.
[2025-06-05 07:02:13] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 3 ms to minimize.
[2025-06-05 07:02:13] [INFO ] Deduced a trap composed of 48 places in 116 ms of which 2 ms to minimize.
[2025-06-05 07:02:14] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/871 variables, 20/163 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2025-06-05 07:02:17] [INFO ] Deduced a trap composed of 38 places in 99 ms of which 2 ms to minimize.
[2025-06-05 07:02:17] [INFO ] Deduced a trap composed of 42 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:02:17] [INFO ] Deduced a trap composed of 38 places in 89 ms of which 1 ms to minimize.
[2025-06-05 07:02:17] [INFO ] Deduced a trap composed of 42 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:02:18] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 2 ms to minimize.
[2025-06-05 07:02:18] [INFO ] Deduced a trap composed of 42 places in 130 ms of which 3 ms to minimize.
[2025-06-05 07:02:18] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2025-06-05 07:02:18] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 2 ms to minimize.
[2025-06-05 07:02:18] [INFO ] Deduced a trap composed of 30 places in 119 ms of which 3 ms to minimize.
[2025-06-05 07:02:20] [INFO ] Deduced a trap composed of 58 places in 94 ms of which 1 ms to minimize.
[2025-06-05 07:02:20] [INFO ] Deduced a trap composed of 48 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:02:20] [INFO ] Deduced a trap composed of 46 places in 88 ms of which 2 ms to minimize.
[2025-06-05 07:02:20] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:02:20] [INFO ] Deduced a trap composed of 48 places in 93 ms of which 2 ms to minimize.
[2025-06-05 07:02:21] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:02:21] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:02:21] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2025-06-05 07:02:22] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:02:24] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2025-06-05 07:02:24] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/871 variables, 20/183 constraints. Problems are: Problem set: 0 solved, 741 unsolved
[2025-06-05 07:02:24] [INFO ] Deduced a trap composed of 36 places in 236 ms of which 5 ms to minimize.
[2025-06-05 07:02:26] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
[2025-06-05 07:02:26] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 2 ms to minimize.
[2025-06-05 07:02:27] [INFO ] Deduced a trap composed of 48 places in 121 ms of which 2 ms to minimize.
[2025-06-05 07:02:27] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 2 ms to minimize.
[2025-06-05 07:02:27] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 3 ms to minimize.
SMT process timed out in 90330ms, After SMT, problems are : Problem set: 0 solved, 741 unsolved
Fused 741 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 741 out of 1401 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1401/1401 places, 1457/1457 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 1401 transition count 1346
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 1290 transition count 1346
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 53 Pre rules applied. Total rules applied 222 place count 1290 transition count 1293
Deduced a syphon composed of 53 places in 3 ms
Reduce places removed 53 places and 0 transitions.
Iterating global reduction 2 with 106 rules applied. Total rules applied 328 place count 1237 transition count 1293
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 362 place count 1203 transition count 1259
Iterating global reduction 2 with 34 rules applied. Total rules applied 396 place count 1203 transition count 1259
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 396 place count 1203 transition count 1225
Deduced a syphon composed of 34 places in 3 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 464 place count 1169 transition count 1225
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 2 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 632 place count 1085 transition count 1141
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: -40
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 714 place count 1044 transition count 1181
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 716 place count 1044 transition count 1179
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 717 place count 1044 transition count 1178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 718 place count 1043 transition count 1178
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 719 place count 1043 transition count 1177
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 720 place count 1043 transition count 1177
Applied a total of 720 rules in 204 ms. Remains 1043 /1401 variables (removed 358) and now considering 1177/1457 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 1043/1401 places, 1177/1457 transitions.
RANDOM walk for 2476522 steps (645 resets) in 120004 ms. (20 steps per ms) remains 561/741 properties
BEST_FIRST walk for 4003 steps (8 resets) in 52 ms. (75 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 42 ms. (93 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 34 ms. (114 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 48 ms. (81 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4002 steps (8 resets) in 37 ms. (105 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 60 ms. (65 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 561/561 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 561/561 properties
// Phase 1: matrix 1177 rows 1043 cols
[2025-06-05 07:02:58] [INFO ] Computed 200 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 195/756 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/756 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 3 (OVERLAPS) 765/1521 variables, 756/846 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1521 variables, 0/846 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 5 (OVERLAPS) 102/1623 variables, 45/891 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1623 variables, 1/892 constraints. Problems are: Problem set: 0 solved, 561 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1623/2220 variables, and 892 constraints, problems are : Problem set: 0 solved, 561 unsolved in 75025 ms.
Refiners :[Positive P Invariants (semi-flows): 91/200 constraints, State Equation: 801/1043 constraints, PredecessorRefiner: 561/561 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 561 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/561 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 561 unsolved
At refinement iteration 1 (OVERLAPS) 195/756 variables, 90/90 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:18] [INFO ] Deduced a trap composed of 54 places in 165 ms of which 4 ms to minimize.
[2025-06-05 07:04:18] [INFO ] Deduced a trap composed of 46 places in 164 ms of which 4 ms to minimize.
[2025-06-05 07:04:19] [INFO ] Deduced a trap composed of 34 places in 165 ms of which 4 ms to minimize.
[2025-06-05 07:04:19] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2025-06-05 07:04:19] [INFO ] Deduced a trap composed of 54 places in 161 ms of which 3 ms to minimize.
[2025-06-05 07:04:19] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 4 ms to minimize.
[2025-06-05 07:04:19] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:04:19] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:04:20] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:04:20] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:04:20] [INFO ] Deduced a trap composed of 18 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:04:20] [INFO ] Deduced a trap composed of 20 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:04:20] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:04:20] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
[2025-06-05 07:04:21] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:04:21] [INFO ] Deduced a trap composed of 24 places in 57 ms of which 2 ms to minimize.
[2025-06-05 07:04:21] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 1 ms to minimize.
[2025-06-05 07:04:21] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2025-06-05 07:04:21] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:04:21] [INFO ] Deduced a trap composed of 40 places in 66 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/756 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:22] [INFO ] Deduced a trap composed of 42 places in 159 ms of which 3 ms to minimize.
[2025-06-05 07:04:22] [INFO ] Deduced a trap composed of 59 places in 161 ms of which 4 ms to minimize.
[2025-06-05 07:04:22] [INFO ] Deduced a trap composed of 54 places in 160 ms of which 4 ms to minimize.
[2025-06-05 07:04:22] [INFO ] Deduced a trap composed of 44 places in 150 ms of which 4 ms to minimize.
[2025-06-05 07:04:23] [INFO ] Deduced a trap composed of 34 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:04:24] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2025-06-05 07:04:25] [INFO ] Deduced a trap composed of 38 places in 85 ms of which 2 ms to minimize.
[2025-06-05 07:04:25] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 3 ms to minimize.
[2025-06-05 07:04:25] [INFO ] Deduced a trap composed of 34 places in 88 ms of which 3 ms to minimize.
[2025-06-05 07:04:25] [INFO ] Deduced a trap composed of 18 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:04:26] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
[2025-06-05 07:04:26] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 2 ms to minimize.
[2025-06-05 07:04:26] [INFO ] Deduced a trap composed of 34 places in 98 ms of which 2 ms to minimize.
[2025-06-05 07:04:26] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 2 ms to minimize.
[2025-06-05 07:04:27] [INFO ] Deduced a trap composed of 24 places in 102 ms of which 3 ms to minimize.
[2025-06-05 07:04:27] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:04:27] [INFO ] Deduced a trap composed of 42 places in 100 ms of which 2 ms to minimize.
[2025-06-05 07:04:27] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2025-06-05 07:04:28] [INFO ] Deduced a trap composed of 42 places in 102 ms of which 3 ms to minimize.
[2025-06-05 07:04:28] [INFO ] Deduced a trap composed of 24 places in 98 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/756 variables, 20/130 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:28] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2025-06-05 07:04:29] [INFO ] Deduced a trap composed of 35 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:04:29] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:04:29] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:04:30] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:04:30] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:04:30] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:04:30] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:04:31] [INFO ] Deduced a trap composed of 44 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:04:31] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:04:31] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:04:32] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2025-06-05 07:04:33] [INFO ] Deduced a trap composed of 24 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:04:33] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 2 ms to minimize.
[2025-06-05 07:04:33] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:04:33] [INFO ] Deduced a trap composed of 58 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:04:33] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 3 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/756 variables, 20/150 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 2 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:04:34] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:04:35] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:04:35] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 0 ms to minimize.
[2025-06-05 07:04:35] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2025-06-05 07:04:35] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:04:35] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:04:36] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2025-06-05 07:04:36] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:04:36] [INFO ] Deduced a trap composed of 50 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:04:36] [INFO ] Deduced a trap composed of 52 places in 64 ms of which 1 ms to minimize.
[2025-06-05 07:04:36] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 1 ms to minimize.
[2025-06-05 07:04:36] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2025-06-05 07:04:36] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:04:37] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:04:38] [INFO ] Deduced a trap composed of 38 places in 95 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/756 variables, 20/170 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:39] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:04:39] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:04:41] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:04:41] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:04:41] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:04:41] [INFO ] Deduced a trap composed of 24 places in 89 ms of which 2 ms to minimize.
[2025-06-05 07:04:42] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 2 ms to minimize.
[2025-06-05 07:04:42] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:04:43] [INFO ] Deduced a trap composed of 86 places in 108 ms of which 2 ms to minimize.
[2025-06-05 07:04:44] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 3 ms to minimize.
[2025-06-05 07:04:44] [INFO ] Deduced a trap composed of 29 places in 109 ms of which 3 ms to minimize.
[2025-06-05 07:04:44] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 2 ms to minimize.
[2025-06-05 07:04:44] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 3 ms to minimize.
[2025-06-05 07:04:45] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 3 ms to minimize.
[2025-06-05 07:04:45] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 3 ms to minimize.
[2025-06-05 07:04:45] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 2 ms to minimize.
[2025-06-05 07:04:45] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2025-06-05 07:04:46] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 3 ms to minimize.
[2025-06-05 07:04:46] [INFO ] Deduced a trap composed of 29 places in 111 ms of which 2 ms to minimize.
[2025-06-05 07:04:46] [INFO ] Deduced a trap composed of 28 places in 119 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/756 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:46] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:04:46] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 46 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 48 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 46 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:04:47] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:04:48] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2025-06-05 07:04:49] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:04:49] [INFO ] Deduced a trap composed of 28 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:04:49] [INFO ] Deduced a trap composed of 34 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:04:50] [INFO ] Deduced a trap composed of 52 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:04:50] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:04:50] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/756 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 36 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2025-06-05 07:04:51] [INFO ] Deduced a trap composed of 46 places in 44 ms of which 0 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 57 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 52 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 50 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 48 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 44 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 44 places in 43 ms of which 0 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 48 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:04:52] [INFO ] Deduced a trap composed of 46 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:04:53] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:04:53] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 1 ms to minimize.
[2025-06-05 07:04:53] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:04:53] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/756 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:04:55] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:04:56] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:04:56] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:04:56] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:04:57] [INFO ] Deduced a trap composed of 38 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:04:57] [INFO ] Deduced a trap composed of 42 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:04:57] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:04:57] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 3 ms to minimize.
[2025-06-05 07:04:58] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 3 ms to minimize.
[2025-06-05 07:04:58] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2025-06-05 07:04:58] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:04:58] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:04:58] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:04:58] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:04:59] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:04:59] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:04:59] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 3 ms to minimize.
[2025-06-05 07:04:59] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2025-06-05 07:05:00] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 3 ms to minimize.
[2025-06-05 07:05:00] [INFO ] Deduced a trap composed of 32 places in 99 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/756 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:05:02] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:05:02] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 0 ms to minimize.
[2025-06-05 07:05:02] [INFO ] Deduced a trap composed of 42 places in 36 ms of which 0 ms to minimize.
[2025-06-05 07:05:02] [INFO ] Deduced a trap composed of 40 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:05:03] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2025-06-05 07:05:03] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:05:03] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 2 ms to minimize.
[2025-06-05 07:05:03] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:05:03] [INFO ] Deduced a trap composed of 52 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:05:03] [INFO ] Deduced a trap composed of 36 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:05:04] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2025-06-05 07:05:04] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:05:04] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2025-06-05 07:05:04] [INFO ] Deduced a trap composed of 38 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:05:04] [INFO ] Deduced a trap composed of 44 places in 88 ms of which 2 ms to minimize.
[2025-06-05 07:05:04] [INFO ] Deduced a trap composed of 70 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:05:05] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 3 ms to minimize.
[2025-06-05 07:05:05] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:05:05] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:05:05] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/756 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:05:06] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:05:07] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
[2025-06-05 07:05:07] [INFO ] Deduced a trap composed of 28 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:05:07] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:05:07] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 3 ms to minimize.
[2025-06-05 07:05:08] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2025-06-05 07:05:08] [INFO ] Deduced a trap composed of 28 places in 103 ms of which 2 ms to minimize.
[2025-06-05 07:05:08] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:05:08] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2025-06-05 07:05:08] [INFO ] Deduced a trap composed of 42 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:05:08] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2025-06-05 07:05:09] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2025-06-05 07:05:09] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 1 ms to minimize.
[2025-06-05 07:05:10] [INFO ] Deduced a trap composed of 24 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:05:10] [INFO ] Deduced a trap composed of 34 places in 63 ms of which 2 ms to minimize.
[2025-06-05 07:05:10] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:05:10] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:05:11] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:05:11] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:05:11] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/756 variables, 20/290 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:05:12] [INFO ] Deduced a trap composed of 28 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:05:12] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:05:12] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:05:13] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:05:13] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:05:13] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:05:13] [INFO ] Deduced a trap composed of 38 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:05:13] [INFO ] Deduced a trap composed of 150 places in 103 ms of which 2 ms to minimize.
[2025-06-05 07:05:14] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 2 ms to minimize.
[2025-06-05 07:05:14] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 3 ms to minimize.
[2025-06-05 07:05:14] [INFO ] Deduced a trap composed of 152 places in 105 ms of which 2 ms to minimize.
[2025-06-05 07:05:14] [INFO ] Deduced a trap composed of 157 places in 104 ms of which 2 ms to minimize.
[2025-06-05 07:05:14] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:05:14] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:05:15] [INFO ] Deduced a trap composed of 28 places in 99 ms of which 2 ms to minimize.
[2025-06-05 07:05:15] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2025-06-05 07:05:15] [INFO ] Deduced a trap composed of 152 places in 102 ms of which 3 ms to minimize.
[2025-06-05 07:05:15] [INFO ] Deduced a trap composed of 64 places in 96 ms of which 2 ms to minimize.
[2025-06-05 07:05:15] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 2 ms to minimize.
[2025-06-05 07:05:15] [INFO ] Deduced a trap composed of 76 places in 106 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/756 variables, 20/310 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:05:17] [INFO ] Deduced a trap composed of 42 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:05:17] [INFO ] Deduced a trap composed of 48 places in 109 ms of which 3 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 150 places in 108 ms of which 2 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 3 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 50 places in 103 ms of which 3 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 2 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 3 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 58 places in 98 ms of which 2 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 48 places in 105 ms of which 2 ms to minimize.
[2025-06-05 07:05:18] [INFO ] Deduced a trap composed of 58 places in 101 ms of which 2 ms to minimize.
[2025-06-05 07:05:19] [INFO ] Deduced a trap composed of 72 places in 108 ms of which 3 ms to minimize.
[2025-06-05 07:05:19] [INFO ] Deduced a trap composed of 180 places in 105 ms of which 2 ms to minimize.
[2025-06-05 07:05:19] [INFO ] Deduced a trap composed of 68 places in 100 ms of which 3 ms to minimize.
[2025-06-05 07:05:19] [INFO ] Deduced a trap composed of 58 places in 108 ms of which 2 ms to minimize.
[2025-06-05 07:05:19] [INFO ] Deduced a trap composed of 56 places in 102 ms of which 2 ms to minimize.
[2025-06-05 07:05:19] [INFO ] Deduced a trap composed of 70 places in 98 ms of which 3 ms to minimize.
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 82 places in 102 ms of which 3 ms to minimize.
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 72 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 68 places in 104 ms of which 3 ms to minimize.
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 192 places in 102 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/756 variables, 20/330 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:05:20] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:05:22] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:05:23] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:05:23] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 0 ms to minimize.
[2025-06-05 07:05:24] [INFO ] Deduced a trap composed of 38 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:05:24] [INFO ] Deduced a trap composed of 49 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:05:24] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 2 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 106 places in 100 ms of which 3 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:05:25] [INFO ] Deduced a trap composed of 56 places in 101 ms of which 2 ms to minimize.
[2025-06-05 07:05:26] [INFO ] Deduced a trap composed of 38 places in 93 ms of which 3 ms to minimize.
[2025-06-05 07:05:26] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:05:26] [INFO ] Deduced a trap composed of 48 places in 91 ms of which 3 ms to minimize.
[2025-06-05 07:05:27] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 2 ms to minimize.
[2025-06-05 07:05:27] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/756 variables, 20/350 constraints. Problems are: Problem set: 0 solved, 561 unsolved
[2025-06-05 07:05:27] [INFO ] Deduced a trap composed of 18 places in 155 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 756/2220 variables, and 351 constraints, problems are : Problem set: 0 solved, 561 unsolved in 75014 ms.
Refiners :[Positive P Invariants (semi-flows): 90/200 constraints, State Equation: 0/1043 constraints, PredecessorRefiner: 0/561 constraints, Known Traps: 261/261 constraints]
After SMT, in 150173ms problems are : Problem set: 0 solved, 561 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 561 out of 1043 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1043/1043 places, 1177/1177 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 1043 transition count 1133
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 999 transition count 1133
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 88 place count 999 transition count 1105
Deduced a syphon composed of 28 places in 2 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 144 place count 971 transition count 1105
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 155 place count 960 transition count 1094
Iterating global reduction 2 with 11 rules applied. Total rules applied 166 place count 960 transition count 1094
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 166 place count 960 transition count 1083
Deduced a syphon composed of 11 places in 2 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 188 place count 949 transition count 1083
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 266 place count 910 transition count 1044
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 290 place count 898 transition count 1051
Free-agglomeration rule applied 8 times.
Iterating global reduction 2 with 8 rules applied. Total rules applied 298 place count 898 transition count 1043
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 306 place count 890 transition count 1043
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 309 place count 890 transition count 1040
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 311 place count 890 transition count 1040
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 312 place count 890 transition count 1039
Applied a total of 312 rules in 116 ms. Remains 890 /1043 variables (removed 153) and now considering 1039/1177 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 116 ms. Remains : 890/1043 places, 1039/1177 transitions.
RANDOM walk for 3233281 steps (848 resets) in 120004 ms. (26 steps per ms) remains 394/561 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 471 ms. (84 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (9 resets) in 331 ms. (120 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 523 ms. (76 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 411 ms. (97 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 383 ms. (104 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 392 ms. (101 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 349 ms. (114 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (9 resets) in 464 ms. (86 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 460 ms. (86 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 443 ms. (90 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 371 ms. (107 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 392 ms. (101 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 397 ms. (100 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 440 ms. (90 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 429 ms. (93 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 471 ms. (84 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 364 ms. (109 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 516 ms. (77 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 376 ms. (106 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 392 ms. (101 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (9 resets) in 502 ms. (79 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 376 ms. (106 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (9 resets) in 398 ms. (100 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (10 resets) in 482 ms. (82 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 354 ms. (112 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 512 ms. (77 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 491 ms. (81 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40003 steps (8 resets) in 366 ms. (109 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40004 steps (9 resets) in 470 ms. (84 steps per ms) remains 394/394 properties
BEST_FIRST walk for 40001 steps (9 resets) in 378 ms. (105 steps per ms) remains 394/394 properties
// Phase 1: matrix 1039 rows 890 cols
[2025-06-05 07:06:05] [INFO ] Computed 200 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/394 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 1 (OVERLAPS) 103/497 variables, 59/59 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/497 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 3 (OVERLAPS) 499/996 variables, 497/556 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/996 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 5 (OVERLAPS) 34/1030 variables, 15/571 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1030 variables, 0/571 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 7 (OVERLAPS) 28/1058 variables, 5/576 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1058 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 9 (OVERLAPS) 31/1089 variables, 32/608 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1089 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 11 (OVERLAPS) 12/1101 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1101 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 13 (OVERLAPS) 22/1123 variables, 16/626 constraints. Problems are: Problem set: 0 solved, 394 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1123 variables, 0/626 constraints. Problems are: Problem set: 0 solved, 394 unsolved
Error getting values : (error "ParserException while parsing response: ((t42 0.0)
(t44 0.0)
(t45 0.0)
(t46 1.0)
(t47 1.0)
(t48 1.0)
(t49 1.0)
(t50 0.0)
(t51 0.0)
(t52 0.0)
(t53 0.0)
(t60 0.0)
(t64 0.0)
(t66 0.0)
(t68 1.0)
(t69 1.0)
(t70 1.0)
(t71 1.0)
(t72 0.0)
(t73 0.0)
(t74 0.0)
(t75 0.0)
(t76 1.0)
(t77 (/ 85.0 86.0))
(t78 (/ 85.0 86.0))
(t79 (/ 85.0 86.0))
(t80 (/ 85.0 86.0))
(t81 0.0)
(t82 0.0)
(t83 0.0)
(t84 0.0)
(t85 0.0)
(t86 0.0)
(t87 0.0)
(t88 0.0)
(t89 0.0)
(t90 0.0)
(t91 0.0)
(t92 0.0)
(t93 0.0)
(t94 0.0)
(t95 0.0)
(t96 0.0)
(t97 0.0)
(t98 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 90068ms, After SMT, problems are : Problem set: 0 solved, 394 unsolved
Fused 394 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 394 out of 890 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 890/890 places, 1039/1039 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 890 transition count 992
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 843 transition count 992
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 94 place count 843 transition count 970
Deduced a syphon composed of 22 places in 2 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 138 place count 821 transition count 970
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 148 place count 811 transition count 960
Iterating global reduction 2 with 10 rules applied. Total rules applied 158 place count 811 transition count 960
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 158 place count 811 transition count 950
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 178 place count 801 transition count 950
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 258 place count 761 transition count 910
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 288 place count 746 transition count 922
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 291 place count 746 transition count 919
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 294 place count 743 transition count 919
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 295 place count 743 transition count 918
Applied a total of 295 rules in 95 ms. Remains 743 /890 variables (removed 147) and now considering 918/1039 (removed 121) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 743/890 places, 918/1039 transitions.
RANDOM walk for 2235056 steps (585 resets) in 120004 ms. (18 steps per ms) remains 393/394 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (9 resets) in 385 ms. (103 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 435 ms. (91 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (10 resets) in 383 ms. (104 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 326 ms. (122 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 462 ms. (86 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 465 ms. (85 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 376 ms. (106 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (9 resets) in 377 ms. (105 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 390 ms. (102 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 339 ms. (117 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 507 ms. (78 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 366 ms. (109 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (9 resets) in 344 ms. (115 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 402 ms. (99 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (9 resets) in 386 ms. (103 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 432 ms. (92 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 408 ms. (97 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 380 ms. (104 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 425 ms. (93 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 365 ms. (109 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (10 resets) in 373 ms. (106 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 398 ms. (100 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 401 ms. (99 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40002 steps (8 resets) in 405 ms. (98 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (10 resets) in 428 ms. (93 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 409 ms. (97 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 411 ms. (97 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40002 steps (8 resets) in 355 ms. (112 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (10 resets) in 480 ms. (83 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 359 ms. (111 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 393/393 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 393/393 properties
Interrupted probabilistic random walk after 2453625 steps, run timeout after 105001 ms. (steps per millisecond=23 ) properties seen :27 out of 393
Probabilistic random walk after 2453625 steps, saw 1854735 distinct states, run finished after 105006 ms. (steps per millisecond=23 ) properties seen :27
// Phase 1: matrix 918 rows 743 cols
[2025-06-05 07:09:56] [INFO ] Computed 200 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/366 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (OVERLAPS) 60/426 variables, 52/52 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/426 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 3 (OVERLAPS) 427/853 variables, 426/478 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/853 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (OVERLAPS) 21/874 variables, 8/486 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/874 variables, 0/486 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (OVERLAPS) 13/887 variables, 4/490 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/887 variables, 2/492 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/887 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 10 (OVERLAPS) 18/905 variables, 15/507 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/905 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/905 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 13 (OVERLAPS) 5/910 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/910 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 15 (OVERLAPS) 31/941 variables, 15/524 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/941 variables, 3/527 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/941 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 18 (OVERLAPS) 1/942 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/942 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/942 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 0.0)
(t1 0.0)
(t2 (/ 2.0 11.0))
(t3 0.0)
(t4 0.0)
(t5 (/ 2.0 11.0))
(t6 (/ 2.0 11.0))
(t7 (/ 2.0 11.0))
(t8 (/ 2.0 11.0))
(t9 0.0)
(t10 0.0)
(t11 0.0)
(t12 (/ 2.0 11.0))
(t13 0.0)
(t14 0.0)
(t15 0.0)
(t16 0.0)
(t17 0.0)
(t18 (/ 2.0 11.0))
(t19 0.0)
(t20 0.0)
(t21 (/ 2.0 11.0))
(t22 0.0)
(t23 0.0)
(t24 0.0)
(t25 0.0)
(t26 0.0)
(t27 (/ 1.0 10.0))
(t28 (/ 1.0 11.0))
(t29 (/ 4.0 55.0))
(t30 (/ 7.0 110.0))
(t31 0.0)
(t32 (/ 1.0 110.0))
(t33 0.0)
(t34 0.0)
(t35 (/ 9.0 55.0))
(t36 (/ 17.0 110.0))
(t37 (/ 3.0 22.0))
(t38 (/ 7.0 55.0))
(t39 0.0)
(t40 (/ 1.0 110.0))
(t41 0.0)
(t42 0.0)
(t43 (/ 1.0 22.0))
(t44 (/ 3.0 110.0))
(t45 (/ 1.0 55.0))
(t46 0.0)
(t47 (/ 1.0 110.0))
(t48 0.0)
(t49 (/ 1.0 110.0))
(t50 (/ 1.0 110.0))
(t51 (/ 1.0 110.0))
(t52 (/ 1.0 110.0))
(t53 0.0)
(t54 0.0)
(t55 0.0)
(t56 0.0)
(t57 (/ 6.0 55.0))
(t58 (/ 6.0 55.0))
(t59 (/ 6.0 55.0))
(t60 (/ 6.0 55.0))
(t61 0.0)
(t62 0.0)
(t63 0.0)
(t64 (/ 1.0 110.0))
(t65 (/ 6.0 55.0))
(t66 (/ 1.0 10.0))
(t67 (/ 9.0 110.0))
(t68 (/ 4.0 55.0))
(t69 0.0)
(t70 (/ 1.0 110.0))
(t71 0.0)
(t72 0.0)
(t73 (/ 1.0 10.0))
(t74 (/ 9.0 110.0))
(t75 (/ 4.0 55.0))
(t76 (/ 3.0 55.0))
(t77 (/ 1.0 110.0))
(t78 0.0)
(t79 0.0)
(t80 (/ 1.0 22.0))
(t81 (/ 3.0 110.0))
(t82 (/ 1.0 55.0))
(t83 0.0)
(t84 (/ 1.0 110.0))
(t85 0.0)
(t86 (/timeout
3.0 55.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
SMT process timed out in 105117ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Fused 366 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 366 out of 743 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 743/743 places, 918/918 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 743 transition count 909
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 734 transition count 909
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 18 place count 734 transition count 907
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 732 transition count 907
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 731 transition count 906
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 731 transition count 906
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24 place count 731 transition count 905
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 26 place count 730 transition count 905
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 44 place count 721 transition count 896
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 52 place count 717 transition count 900
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 717 transition count 899
Applied a total of 53 rules in 46 ms. Remains 717 /743 variables (removed 26) and now considering 899/918 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 717/743 places, 899/918 transitions.
RANDOM walk for 1967324 steps (514 resets) in 120009 ms. (16 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 386 ms. (103 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 374 ms. (106 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 426 ms. (93 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 460 ms. (86 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40002 steps (8 resets) in 386 ms. (103 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 476 ms. (83 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40002 steps (8 resets) in 348 ms. (114 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40002 steps (8 resets) in 418 ms. (95 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 371 ms. (107 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 430 ms. (92 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 397 ms. (100 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (9 resets) in 347 ms. (114 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 382 ms. (104 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40002 steps (8 resets) in 397 ms. (100 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 389 ms. (102 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 391 ms. (102 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (9 resets) in 563 ms. (70 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 355 ms. (112 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 468 ms. (85 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 316 ms. (126 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40002 steps (8 resets) in 463 ms. (86 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 449 ms. (88 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 455 ms. (87 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 469 ms. (85 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 398 ms. (100 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 342 ms. (116 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 404 ms. (98 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 328 ms. (121 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 419 ms. (95 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 424 ms. (94 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 413 ms. (96 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 411 ms. (97 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (10 resets) in 367 ms. (108 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (9 resets) in 390 ms. (102 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40003 steps (8 resets) in 322 ms. (123 steps per ms) remains 366/366 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 366/366 properties
Interrupted probabilistic random walk after 2682536 steps, run timeout after 108001 ms. (steps per millisecond=24 ) properties seen :30 out of 366
Probabilistic random walk after 2682536 steps, saw 2046173 distinct states, run finished after 108002 ms. (steps per millisecond=24 ) properties seen :30
// Phase 1: matrix 899 rows 717 cols
[2025-06-05 07:14:05] [INFO ] Computed 200 invariants in 3 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/336 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 1 (OVERLAPS) 81/417 variables, 51/51 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/417 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 3 (OVERLAPS) 424/841 variables, 417/468 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/841 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 5 (OVERLAPS) 26/867 variables, 12/480 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/867 variables, 5/485 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/867 variables, 0/485 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 8 (OVERLAPS) 21/888 variables, 8/493 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/888 variables, 4/497 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/888 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 11 (OVERLAPS) 21/909 variables, 8/505 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/909 variables, 4/509 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/909 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 14 (OVERLAPS) 20/929 variables, 8/517 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/929 variables, 4/521 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/929 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 17 (OVERLAPS) 21/950 variables, 8/529 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/950 variables, 4/533 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/950 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 20 (OVERLAPS) 19/969 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/969 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/969 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 23 (OVERLAPS) 19/988 variables, 8/553 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/988 variables, 4/557 constraints. Problems are: Problem set: 0 solved, 336 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/988 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 336 unsolved
SMT process timed out in 120081ms, After SMT, problems are : Problem set: 0 solved, 336 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 336 out of 717 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 717/717 places, 899/899 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 717 transition count 892
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 710 transition count 892
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 14 place count 710 transition count 886
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 704 transition count 886
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 42 place count 696 transition count 878
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 50 place count 692 transition count 880
Applied a total of 50 rules in 27 ms. Remains 692 /717 variables (removed 25) and now considering 880/899 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 692/717 places, 880/899 transitions.
RANDOM walk for 4000000 steps (1048 resets) in 99262 ms. (40 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 400 ms. (99 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 375 ms. (106 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (9 resets) in 382 ms. (104 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (10 resets) in 363 ms. (109 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 345 ms. (115 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40002 steps (8 resets) in 379 ms. (105 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 393 ms. (101 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (9 resets) in 425 ms. (93 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 370 ms. (107 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 441 ms. (90 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 358 ms. (111 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 431 ms. (92 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 354 ms. (112 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (10 resets) in 309 ms. (129 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 383 ms. (104 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (9 resets) in 367 ms. (108 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 358 ms. (111 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (9 resets) in 412 ms. (96 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (9 resets) in 365 ms. (109 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (9 resets) in 364 ms. (109 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 341 ms. (116 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 414 ms. (96 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 391 ms. (102 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 327 ms. (121 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (9 resets) in 444 ms. (89 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 384 ms. (103 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 451 ms. (88 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 366 ms. (109 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 347 ms. (114 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 371 ms. (107 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (9 resets) in 403 ms. (99 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40001 steps (8 resets) in 388 ms. (102 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 337 ms. (118 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 449 ms. (88 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 313 ms. (127 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (9 resets) in 395 ms. (101 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 356 ms. (112 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 358 ms. (111 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 400 ms. (99 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40003 steps (8 resets) in 455 ms. (87 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (8 resets) in 378 ms. (105 steps per ms) remains 336/336 properties
BEST_FIRST walk for 40004 steps (9 resets) in 392 ms. (101 steps per ms) remains 336/336 properties
Interrupted probabilistic random walk after 2362474 steps, run timeout after 93001 ms. (steps per millisecond=25 ) properties seen :18 out of 336
Probabilistic random walk after 2362474 steps, saw 1799186 distinct states, run finished after 93001 ms. (steps per millisecond=25 ) properties seen :18
// Phase 1: matrix 880 rows 692 cols
[2025-06-05 07:18:10] [INFO ] Computed 200 invariants in 4 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 63/381 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 3 (OVERLAPS) 387/768 variables, 381/428 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 5 (OVERLAPS) 34/802 variables, 13/441 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/802 variables, 3/444 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/802 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 8 (OVERLAPS) 2/804 variables, 2/446 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/804 variables, 2/448 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/804 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 11 (OVERLAPS) 19/823 variables, 8/456 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/823 variables, 4/460 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/823 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 14 (OVERLAPS) 21/844 variables, 8/468 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/844 variables, 4/472 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/844 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 17 (OVERLAPS) 21/865 variables, 8/480 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/865 variables, 4/484 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/865 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 20 (OVERLAPS) 20/885 variables, 8/492 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/885 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/885 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 23 (OVERLAPS) 21/906 variables, 8/504 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/906 variables, 4/508 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/906 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 26 (OVERLAPS) 19/925 variables, 8/516 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/925 variables, 4/520 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/925 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 29 (OVERLAPS) 19/944 variables, 8/528 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/944 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/944 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 32 (OVERLAPS) 20/964 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/964 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/964 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 35 (OVERLAPS) 16/980 variables, 8/552 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/980 variables, 4/556 constraints. Problems are: Problem set: 0 solved, 318 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 980/1572 variables, and 556 constraints, problems are : Problem set: 0 solved, 318 unsolved in 135009 ms.
Refiners :[Positive P Invariants (semi-flows): 88/200 constraints, State Equation: 468/692 constraints, PredecessorRefiner: 318/318 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 318 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/318 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 318 unsolved
At refinement iteration 1 (OVERLAPS) 63/381 variables, 47/47 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:26] [INFO ] Deduced a trap composed of 20 places in 88 ms of which 3 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 14 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:20:27] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 2 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:20:28] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:20:29] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/381 variables, 20/67 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:29] [INFO ] Deduced a trap composed of 74 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:20:29] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:20:29] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:20:29] [INFO ] Deduced a trap composed of 26 places in 88 ms of which 2 ms to minimize.
[2025-06-05 07:20:29] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:20:29] [INFO ] Deduced a trap composed of 32 places in 27 ms of which 1 ms to minimize.
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 30 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 0 ms to minimize.
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 44 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:20:30] [INFO ] Deduced a trap composed of 18 places in 64 ms of which 2 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 64 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 34 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 28 places in 65 ms of which 1 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 32 places in 60 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/381 variables, 20/87 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 30 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:20:31] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 0 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 38 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 0 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:32] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:20:33] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:20:33] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:33] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:20:34] [INFO ] Deduced a trap composed of 18 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:20:34] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:20:34] [INFO ] Deduced a trap composed of 28 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/381 variables, 20/107 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:34] [INFO ] Deduced a trap composed of 28 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:20:34] [INFO ] Deduced a trap composed of 26 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:20:35] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 28 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 1 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:20:36] [INFO ] Deduced a trap composed of 42 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 32 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:20:37] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:20:38] [INFO ] Deduced a trap composed of 50 places in 96 ms of which 2 ms to minimize.
[2025-06-05 07:20:38] [INFO ] Deduced a trap composed of 32 places in 93 ms of which 2 ms to minimize.
[2025-06-05 07:20:38] [INFO ] Deduced a trap composed of 40 places in 96 ms of which 2 ms to minimize.
[2025-06-05 07:20:38] [INFO ] Deduced a trap composed of 18 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/381 variables, 20/127 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:39] [INFO ] Deduced a trap composed of 39 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:20:39] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:20:39] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
[2025-06-05 07:20:39] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:20:40] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
[2025-06-05 07:20:40] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:20:40] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:20:40] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:20:40] [INFO ] Deduced a trap composed of 42 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:20:40] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 2 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 24 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 32 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 51 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:20:41] [INFO ] Deduced a trap composed of 34 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 38 places in 36 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 32 places in 33 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 30 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 36 ms of which 0 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 32 ms of which 0 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:20:42] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2025-06-05 07:20:43] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2025-06-05 07:20:43] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 1 ms to minimize.
[2025-06-05 07:20:44] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 2 ms to minimize.
[2025-06-05 07:20:44] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:20:44] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 2 ms to minimize.
[2025-06-05 07:20:44] [INFO ] Deduced a trap composed of 32 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:20:44] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:20:44] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 20/167 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:45] [INFO ] Deduced a trap composed of 32 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:20:46] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:20:46] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:20:46] [INFO ] Deduced a trap composed of 46 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:20:46] [INFO ] Deduced a trap composed of 42 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:20:46] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:20:46] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:20:47] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 0 ms to minimize.
[2025-06-05 07:20:47] [INFO ] Deduced a trap composed of 24 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:48] [INFO ] Deduced a trap composed of 30 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:20:50] [INFO ] Deduced a trap composed of 14 places in 35 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/381 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:51] [INFO ] Deduced a trap composed of 50 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:20:51] [INFO ] Deduced a trap composed of 52 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 74 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 64 places in 86 ms of which 1 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 52 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 56 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:20:52] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:20:53] [INFO ] Deduced a trap composed of 62 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:20:53] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:20:53] [INFO ] Deduced a trap composed of 64 places in 74 ms of which 4 ms to minimize.
[2025-06-05 07:20:53] [INFO ] Deduced a trap composed of 30 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:20:53] [INFO ] Deduced a trap composed of 28 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:20:53] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:20:53] [INFO ] Deduced a trap composed of 62 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/381 variables, 20/198 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:54] [INFO ] Deduced a trap composed of 38 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:20:54] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:20:54] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 1 ms to minimize.
[2025-06-05 07:20:54] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 64 places in 66 ms of which 1 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 34 places in 44 ms of which 0 ms to minimize.
[2025-06-05 07:20:55] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 0 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 42 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 24 places in 36 ms of which 1 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 28 places in 61 ms of which 2 ms to minimize.
[2025-06-05 07:20:56] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/381 variables, 15/213 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:20:58] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:20:59] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 2 ms to minimize.
[2025-06-05 07:21:00] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 2 ms to minimize.
[2025-06-05 07:21:00] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2025-06-05 07:21:00] [INFO ] Deduced a trap composed of 48 places in 83 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/381 variables, 9/222 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:00] [INFO ] Deduced a trap composed of 38 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:21:00] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:21:02] [INFO ] Deduced a trap composed of 50 places in 58 ms of which 2 ms to minimize.
[2025-06-05 07:21:02] [INFO ] Deduced a trap composed of 52 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:02] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:02] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:21:02] [INFO ] Deduced a trap composed of 34 places in 87 ms of which 1 ms to minimize.
[2025-06-05 07:21:02] [INFO ] Deduced a trap composed of 50 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 4 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 38 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 42 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:03] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/381 variables, 15/237 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:05] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:05] [INFO ] Deduced a trap composed of 42 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:21:05] [INFO ] Deduced a trap composed of 49 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:21:05] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 2 ms to minimize.
[2025-06-05 07:21:06] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:21:06] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:06] [INFO ] Deduced a trap composed of 42 places in 88 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/381 variables, 7/244 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:09] [INFO ] Deduced a trap composed of 38 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:21:09] [INFO ] Deduced a trap composed of 44 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:21:09] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:21:10] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:21:10] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:10] [INFO ] Deduced a trap composed of 52 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:21:10] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/381 variables, 7/251 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 40 places in 57 ms of which 2 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 42 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 52 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:21:12] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 64 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 56 places in 92 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 54 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:21:13] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/381 variables, 17/268 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:15] [INFO ] Deduced a trap composed of 52 places in 66 ms of which 2 ms to minimize.
[2025-06-05 07:21:15] [INFO ] Deduced a trap composed of 44 places in 46 ms of which 0 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 46 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 2 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 48 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 2 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:21:16] [INFO ] Deduced a trap composed of 58 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 40 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 54 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 66 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 1 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 2 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 64 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:21:17] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/381 variables, 20/288 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:18] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:21:18] [INFO ] Deduced a trap composed of 38 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:21:18] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 1 ms to minimize.
[2025-06-05 07:21:18] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:21:18] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:21:18] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:19] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 1 ms to minimize.
[2025-06-05 07:21:19] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:19] [INFO ] Deduced a trap composed of 44 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:21:19] [INFO ] Deduced a trap composed of 50 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:21:19] [INFO ] Deduced a trap composed of 56 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 42 places in 93 ms of which 2 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 28 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 32 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 38 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:21:20] [INFO ] Deduced a trap composed of 32 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/381 variables, 20/308 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 55 places in 59 ms of which 2 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 48 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 52 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 50 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 40 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 50 places in 51 ms of which 2 ms to minimize.
[2025-06-05 07:21:21] [INFO ] Deduced a trap composed of 54 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 54 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 38 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 2 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/381 variables, 20/328 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 42 places in 37 ms of which 0 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 40 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:21:22] [INFO ] Deduced a trap composed of 44 places in 30 ms of which 0 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 34 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 34 places in 31 ms of which 1 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 0 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 30 places in 30 ms of which 1 ms to minimize.
[2025-06-05 07:21:23] [INFO ] Deduced a trap composed of 36 places in 30 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/381 variables, 10/338 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:25] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2025-06-05 07:21:26] [INFO ] Deduced a trap composed of 44 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 1 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 58 places in 89 ms of which 2 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 62 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:21:27] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 52 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 60 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 42 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 48 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 48 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 54 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 54 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 44 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 60 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:21:28] [INFO ] Deduced a trap composed of 50 places in 48 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/381 variables, 20/358 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:21:29] [INFO ] Deduced a trap composed of 32 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 2 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 50 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 70 places in 68 ms of which 1 ms to minimize.
[2025-06-05 07:21:30] [INFO ] Deduced a trap composed of 64 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 70 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 48 places in 64 ms of which 2 ms to minimize.
[2025-06-05 07:21:31] [INFO ] Deduced a trap composed of 64 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 52 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 2 ms to minimize.
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/381 variables, 20/378 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:32] [INFO ] Deduced a trap composed of 24 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 32 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 42 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 68 places in 80 ms of which 1 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:21:33] [INFO ] Deduced a trap composed of 56 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 74 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 80 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 74 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:21:34] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 70 places in 78 ms of which 1 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:35] [INFO ] Deduced a trap composed of 70 places in 77 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/381 variables, 20/398 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 38 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 40 places in 31 ms of which 0 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 48 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 48 places in 37 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:36] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 62 places in 42 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 62 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 64 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 56 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 64 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 64 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 64 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:21:37] [INFO ] Deduced a trap composed of 56 places in 41 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/381 variables, 20/418 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 56 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 66 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 74 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:39] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 68 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 80 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 1 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 78 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:21:40] [INFO ] Deduced a trap composed of 74 places in 72 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/381 variables, 20/438 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:42] [INFO ] Deduced a trap composed of 60 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:42] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:43] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:21:43] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:43] [INFO ] Deduced a trap composed of 64 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:21:43] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:43] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2025-06-05 07:21:43] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:21:43] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 58 places in 83 ms of which 1 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 1 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 50 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 48 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:21:44] [INFO ] Deduced a trap composed of 48 places in 74 ms of which 2 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/381 variables, 20/458 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:46] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:46] [INFO ] Deduced a trap composed of 30 places in 39 ms of which 1 ms to minimize.
[2025-06-05 07:21:46] [INFO ] Deduced a trap composed of 36 places in 41 ms of which 1 ms to minimize.
[2025-06-05 07:21:46] [INFO ] Deduced a trap composed of 52 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:21:46] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 0 ms to minimize.
[2025-06-05 07:21:46] [INFO ] Deduced a trap composed of 54 places in 36 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 64 places in 59 ms of which 2 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 62 places in 58 ms of which 2 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 46 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 48 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:47] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 2 ms to minimize.
[2025-06-05 07:21:48] [INFO ] Deduced a trap composed of 62 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:21:48] [INFO ] Deduced a trap composed of 62 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:48] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/381 variables, 20/478 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:49] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:49] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:21:49] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:21:49] [INFO ] Deduced a trap composed of 54 places in 43 ms of which 1 ms to minimize.
[2025-06-05 07:21:49] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 54 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 56 places in 51 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 58 places in 52 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 58 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 88 places in 86 ms of which 2 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 68 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:50] [INFO ] Deduced a trap composed of 68 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:21:51] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:51] [INFO ] Deduced a trap composed of 48 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:21:51] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:21:51] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/381 variables, 20/498 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:52] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 66 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 64 places in 64 ms of which 1 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 52 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 2 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 94 places in 89 ms of which 2 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 106 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 50 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:21:53] [INFO ] Deduced a trap composed of 99 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:21:54] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:21:54] [INFO ] Deduced a trap composed of 70 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:21:54] [INFO ] Deduced a trap composed of 86 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:21:54] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:21:55] [INFO ] Deduced a trap composed of 30 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:21:55] [INFO ] Deduced a trap composed of 34 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:21:55] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2025-06-05 07:21:55] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:21:55] [INFO ] Deduced a trap composed of 46 places in 81 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/381 variables, 20/518 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 72 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 72 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 58 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 58 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 64 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 2 ms to minimize.
[2025-06-05 07:21:57] [INFO ] Deduced a trap composed of 70 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 68 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 100 places in 89 ms of which 2 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 62 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 98 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 72 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:21:58] [INFO ] Deduced a trap composed of 106 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:21:59] [INFO ] Deduced a trap composed of 108 places in 81 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/381 variables, 20/538 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:21:59] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:21:59] [INFO ] Deduced a trap composed of 58 places in 40 ms of which 1 ms to minimize.
[2025-06-05 07:21:59] [INFO ] Deduced a trap composed of 54 places in 38 ms of which 1 ms to minimize.
[2025-06-05 07:21:59] [INFO ] Deduced a trap composed of 58 places in 39 ms of which 0 ms to minimize.
[2025-06-05 07:22:01] [INFO ] Deduced a trap composed of 64 places in 52 ms of which 2 ms to minimize.
[2025-06-05 07:22:01] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:22:01] [INFO ] Deduced a trap composed of 58 places in 44 ms of which 1 ms to minimize.
[2025-06-05 07:22:01] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:22:01] [INFO ] Deduced a trap composed of 52 places in 47 ms of which 2 ms to minimize.
[2025-06-05 07:22:01] [INFO ] Deduced a trap composed of 54 places in 46 ms of which 1 ms to minimize.
[2025-06-05 07:22:02] [INFO ] Deduced a trap composed of 18 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:22:02] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/381 variables, 12/550 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 78 places in 61 ms of which 2 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 78 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 82 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 80 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 82 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 80 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 82 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 84 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 84 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 82 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:22:05] [INFO ] Deduced a trap composed of 84 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:22:06] [INFO ] Deduced a trap composed of 80 places in 63 ms of which 1 ms to minimize.
[2025-06-05 07:22:06] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:22:06] [INFO ] Deduced a trap composed of 82 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:22:06] [INFO ] Deduced a trap composed of 78 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:22:06] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 1 ms to minimize.
[2025-06-05 07:22:06] [INFO ] Deduced a trap composed of 84 places in 56 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/381 variables, 20/570 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:07] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 0 ms to minimize.
[2025-06-05 07:22:08] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 2 ms to minimize.
[2025-06-05 07:22:08] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:22:08] [INFO ] Deduced a trap composed of 66 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:22:08] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:08] [INFO ] Deduced a trap composed of 70 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 72 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 78 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 88 places in 90 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 94 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 86 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 80 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 88 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 92 places in 95 ms of which 2 ms to minimize.
[2025-06-05 07:22:09] [INFO ] Deduced a trap composed of 80 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:22:10] [INFO ] Deduced a trap composed of 86 places in 95 ms of which 6 ms to minimize.
[2025-06-05 07:22:10] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 1 ms to minimize.
[2025-06-05 07:22:10] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/381 variables, 20/590 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:11] [INFO ] Deduced a trap composed of 28 places in 85 ms of which 2 ms to minimize.
[2025-06-05 07:22:11] [INFO ] Deduced a trap composed of 52 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:22:11] [INFO ] Deduced a trap composed of 64 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 70 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 69 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 34 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 36 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 84 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 66 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 104 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:22:12] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 68 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 64 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 92 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 70 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:13] [INFO ] Deduced a trap composed of 68 places in 75 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/381 variables, 20/610 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:14] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2025-06-05 07:22:15] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:22:15] [INFO ] Deduced a trap composed of 88 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:15] [INFO ] Deduced a trap composed of 84 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:15] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:15] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 90 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 66 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 90 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 80 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 70 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 1 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 68 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 86 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:22:16] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2025-06-05 07:22:17] [INFO ] Deduced a trap composed of 98 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:17] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 1 ms to minimize.
At refinement iteration 35 (INCLUDED_ONLY) 0/381 variables, 20/630 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:17] [INFO ] Deduced a trap composed of 72 places in 68 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 72 places in 58 ms of which 2 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 68 places in 62 ms of which 2 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 2 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 2 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 68 places in 59 ms of which 2 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 68 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 70 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 70 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2025-06-05 07:22:18] [INFO ] Deduced a trap composed of 70 places in 59 ms of which 2 ms to minimize.
[2025-06-05 07:22:19] [INFO ] Deduced a trap composed of 70 places in 64 ms of which 1 ms to minimize.
[2025-06-05 07:22:19] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 2 ms to minimize.
[2025-06-05 07:22:19] [INFO ] Deduced a trap composed of 70 places in 56 ms of which 1 ms to minimize.
[2025-06-05 07:22:19] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/381 variables, 20/650 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 64 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 68 places in 57 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 2 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 64 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 50 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 84 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:22:21] [INFO ] Deduced a trap composed of 56 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 98 places in 81 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 94 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 79 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 98 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 78 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:22] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:23] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 4 ms to minimize.
[2025-06-05 07:22:23] [INFO ] Deduced a trap composed of 74 places in 80 ms of which 2 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/381 variables, 20/670 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:25] [INFO ] Deduced a trap composed of 92 places in 87 ms of which 2 ms to minimize.
[2025-06-05 07:22:25] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:25] [INFO ] Deduced a trap composed of 72 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:25] [INFO ] Deduced a trap composed of 74 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:25] [INFO ] Deduced a trap composed of 108 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:25] [INFO ] Deduced a trap composed of 112 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:22:25] [INFO ] Deduced a trap composed of 92 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 84 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 92 places in 84 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 88 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 90 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 94 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 102 places in 80 ms of which 1 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 102 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 112 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 102 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:26] [INFO ] Deduced a trap composed of 110 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:22:27] [INFO ] Deduced a trap composed of 100 places in 71 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/381 variables, 20/690 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:27] [INFO ] Deduced a trap composed of 90 places in 79 ms of which 1 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 98 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 104 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 106 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 106 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 106 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 112 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 104 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 108 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 110 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:22:28] [INFO ] Deduced a trap composed of 108 places in 72 ms of which 1 ms to minimize.
[2025-06-05 07:22:29] [INFO ] Deduced a trap composed of 114 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:22:29] [INFO ] Deduced a trap composed of 108 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:22:29] [INFO ] Deduced a trap composed of 106 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:22:29] [INFO ] Deduced a trap composed of 106 places in 74 ms of which 1 ms to minimize.
[2025-06-05 07:22:29] [INFO ] Deduced a trap composed of 106 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:22:29] [INFO ] Deduced a trap composed of 108 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:29] [INFO ] Deduced a trap composed of 94 places in 70 ms of which 1 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/381 variables, 20/710 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 2 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 58 places in 79 ms of which 1 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 54 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 60 places in 82 ms of which 1 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 54 places in 79 ms of which 2 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 52 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:31] [INFO ] Deduced a trap composed of 54 places in 76 ms of which 1 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 64 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 52 places in 89 ms of which 1 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 48 places in 67 ms of which 2 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 112 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 108 places in 64 ms of which 1 ms to minimize.
[2025-06-05 07:22:32] [INFO ] Deduced a trap composed of 102 places in 60 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/381 variables, 20/730 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:34] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-05 07:22:34] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 80 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 76 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 82 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 76 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 98 places in 73 ms of which 1 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 100 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 96 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 98 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 100 places in 75 ms of which 1 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 102 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:35] [INFO ] Deduced a trap composed of 90 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:22:36] [INFO ] Deduced a trap composed of 100 places in 73 ms of which 2 ms to minimize.
[2025-06-05 07:22:36] [INFO ] Deduced a trap composed of 88 places in 71 ms of which 2 ms to minimize.
[2025-06-05 07:22:36] [INFO ] Deduced a trap composed of 98 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:22:36] [INFO ] Deduced a trap composed of 92 places in 69 ms of which 2 ms to minimize.
[2025-06-05 07:22:36] [INFO ] Deduced a trap composed of 100 places in 65 ms of which 2 ms to minimize.
[2025-06-05 07:22:36] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
At refinement iteration 41 (INCLUDED_ONLY) 0/381 variables, 20/750 constraints. Problems are: Problem set: 0 solved, 318 unsolved
[2025-06-05 07:22:37] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2025-06-05 07:22:38] [INFO ] Deduced a trap composed of 52 places in 70 ms of which 2 ms to minimize.
[2025-06-05 07:22:38] [INFO ] Deduced a trap composed of 44 places in 61 ms of which 1 ms to minimize.
[2025-06-05 07:22:38] [INFO ] Deduced a trap composed of 52 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:22:38] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 2 ms to minimize.
[2025-06-05 07:22:38] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:22:38] [INFO ] Deduced a trap composed of 56 places in 48 ms of which 1 ms to minimize.
[2025-06-05 07:22:38] [INFO ] Deduced a trap composed of 54 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:22:39] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 1 ms to minimize.
[2025-06-05 07:22:39] [INFO ] Deduced a trap composed of 108 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:22:39] [INFO ] Deduced a trap composed of 108 places in 78 ms of which 2 ms to minimize.
[2025-06-05 07:22:39] [INFO ] Deduced a trap composed of 80 places in 76 ms of which 2 ms to minimize.
[2025-06-05 07:22:39] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 2 ms to minimize.
[2025-06-05 07:22:39] [INFO ] Deduced a trap composed of 48 places in 75 ms of which 2 ms to minimize.
[2025-06-05 07:22:39] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 2 ms to minimize.
[2025-06-05 07:22:40] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 2 ms to minimize.
[2025-06-05 07:22:40] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 381/1572 variables, and 767 constraints, problems are : Problem set: 0 solved, 318 unsolved in 135010 ms.
Refiners :[Positive P Invariants (semi-flows): 47/200 constraints, State Equation: 0/692 constraints, PredecessorRefiner: 0/318 constraints, Known Traps: 720/720 constraints]
After SMT, in 270099ms problems are : Problem set: 0 solved, 318 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 318 out of 692 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 692/692 places, 880/880 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 692 transition count 877
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 689 transition count 877
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 6 place count 689 transition count 873
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 14 place count 685 transition count 873
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 30 place count 677 transition count 865
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 676 transition count 866
Applied a total of 32 rules in 25 ms. Remains 676 /692 variables (removed 16) and now considering 866/880 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 676/692 places, 866/880 transitions.
RANDOM walk for 4000000 steps (1062 resets) in 94289 ms. (42 steps per ms) remains 303/318 properties
BEST_FIRST walk for 40003 steps (10 resets) in 278 ms. (143 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40002 steps (9 resets) in 422 ms. (94 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 432 ms. (92 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 427 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 405 ms. (98 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40002 steps (8 resets) in 463 ms. (86 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 361 ms. (110 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 416 ms. (95 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (9 resets) in 409 ms. (97 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 433 ms. (92 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 355 ms. (112 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40002 steps (8 resets) in 460 ms. (86 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 438 ms. (91 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 435 ms. (91 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 394 ms. (101 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 429 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (10 resets) in 447 ms. (89 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 399 ms. (100 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (9 resets) in 441 ms. (90 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 448 ms. (89 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 422 ms. (94 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 367 ms. (108 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (9 resets) in 410 ms. (97 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (9 resets) in 383 ms. (104 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (9 resets) in 358 ms. (111 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 463 ms. (86 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (9 resets) in 366 ms. (109 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 452 ms. (88 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 407 ms. (98 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 435 ms. (91 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 344 ms. (115 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 455 ms. (87 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 357 ms. (111 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 383 ms. (104 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (9 resets) in 374 ms. (106 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 437 ms. (91 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (10 resets) in 433 ms. (92 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40003 steps (8 resets) in 391 ms. (102 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 417 ms. (95 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 443 ms. (90 steps per ms) remains 303/303 properties
BEST_FIRST walk for 40004 steps (8 resets) in 450 ms. (88 steps per ms) remains 303/303 properties
Interrupted probabilistic random walk after 1715806 steps, run timeout after 87001 ms. (steps per millisecond=19 ) properties seen :10 out of 303
Probabilistic random walk after 1715806 steps, saw 1296351 distinct states, run finished after 87001 ms. (steps per millisecond=19 ) properties seen :10
// Phase 1: matrix 866 rows 676 cols
[2025-06-05 07:24:37] [INFO ] Computed 200 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/293 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 68/361 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/361 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 371/732 variables, 361/406 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/732 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 5 (OVERLAPS) 42/774 variables, 19/425 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/774 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/774 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 8 (OVERLAPS) 19/793 variables, 8/440 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/793 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/793 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 11 (OVERLAPS) 21/814 variables, 8/452 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/814 variables, 4/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/814 variables, 0/456 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 14 (OVERLAPS) 21/835 variables, 8/464 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/835 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/835 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 17 (OVERLAPS) 20/855 variables, 8/476 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/855 variables, 4/480 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/855 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 20 (OVERLAPS) 21/876 variables, 8/488 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/876 variables, 4/492 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/876 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 23 (OVERLAPS) 19/895 variables, 8/500 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/895 variables, 4/504 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/895 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 26 (OVERLAPS) 19/914 variables, 8/512 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/914 variables, 4/516 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/914 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 29 (OVERLAPS) 20/934 variables, 8/524 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/934 variables, 4/528 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/934 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 32 (OVERLAPS) 16/950 variables, 8/536 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/950 variables, 4/540 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/950 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 35 (OVERLAPS) 19/969 variables, 8/548 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/969 variables, 4/552 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/969 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 38 (OVERLAPS) 21/990 variables, 8/560 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/990 variables, 4/564 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/990 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 41 (OVERLAPS) 20/1010 variables, 8/572 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1010 variables, 4/576 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/1010 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 293 unsolved
At refinement iteration 44 (OVERLAPS) 21/1031 variables, 8/584 constraints. Problems are: Problem set: 0 solved, 293 unsolved
SMT process timed out in 150050ms, After SMT, problems are : Problem set: 0 solved, 293 unsolved
Fused 293 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 293 out of 676 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 676/676 places, 866/866 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 676 transition count 861
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 671 transition count 861
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 10 place count 671 transition count 855
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 665 transition count 855
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 36 place count 658 transition count 848
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 42 place count 655 transition count 850
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 655 transition count 850
Applied a total of 43 rules in 33 ms. Remains 655 /676 variables (removed 21) and now considering 850/866 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 655/676 places, 850/866 transitions.
RANDOM walk for 2265053 steps (574 resets) in 120004 ms. (18 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 476 ms. (83 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (8 resets) in 407 ms. (98 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 365 ms. (109 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 410 ms. (97 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 419 ms. (95 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 436 ms. (91 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 420 ms. (95 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (10 resets) in 340 ms. (117 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 446 ms. (89 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 373 ms. (106 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (8 resets) in 383 ms. (104 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 387 ms. (103 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (9 resets) in 387 ms. (103 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 381 ms. (104 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (9 resets) in 419 ms. (95 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 434 ms. (91 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 388 ms. (102 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 367 ms. (108 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 408 ms. (97 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 442 ms. (90 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 385 ms. (103 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (10 resets) in 430 ms. (92 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 372 ms. (107 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 485 ms. (82 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 353 ms. (113 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (9 resets) in 434 ms. (91 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40002 steps (8 resets) in 424 ms. (94 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 457 ms. (87 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 333 ms. (119 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 439 ms. (90 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 389 ms. (102 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 380 ms. (104 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 415 ms. (96 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 387 ms. (103 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (9 resets) in 442 ms. (90 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 389 ms. (102 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (9 resets) in 428 ms. (93 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (9 resets) in 390 ms. (102 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 357 ms. (111 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 435 ms. (91 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 425 ms. (93 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 393 ms. (101 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 447 ms. (89 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (9 resets) in 389 ms. (102 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40004 steps (8 resets) in 434 ms. (91 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 439 ms. (90 steps per ms) remains 293/293 properties
BEST_FIRST walk for 40003 steps (8 resets) in 436 ms. (91 steps per ms) remains 293/293 properties
Interrupted probabilistic random walk after 2198753 steps, run timeout after 105001 ms. (steps per millisecond=20 ) properties seen :4 out of 293
Probabilistic random walk after 2198753 steps, saw 1662202 distinct states, run finished after 105002 ms. (steps per millisecond=20 ) properties seen :4
// Phase 1: matrix 850 rows 655 cols
[2025-06-05 07:29:28] [INFO ] Computed 200 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/289 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 1 (OVERLAPS) 50/339 variables, 43/43 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/339 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 3 (OVERLAPS) 346/685 variables, 339/382 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/685 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 5 (OVERLAPS) 29/714 variables, 10/392 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/714 variables, 3/395 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/714 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 8 (OVERLAPS) 2/716 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/716 variables, 2/399 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/716 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 11 (OVERLAPS) 21/737 variables, 8/407 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/737 variables, 4/411 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/737 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 289 unsolved
At refinement iteration 14 (OVERLAPS) 19/756 variables, 8/419 constraints. Problems are: Problem set: 0 solved, 289 unsolved

BK_TIME_CONFINEMENT_REACHED

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination StableMarking -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="ShieldRVt-PT-050B"
export BK_EXAMINATION="StableMarking"
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 ShieldRVt-PT-050B, examination is StableMarking"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r224-tall-174902009800208"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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