MCC'2025- Execution of r084-tall-174860080700504

About the Execution of 2024-gold for EisenbergMcGuire-PT-09

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

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r084-tall-174860080700504.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
Input is EisenbergMcGuire-PT-09, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r084-tall-174860080700504
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 2.3M May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1748743275866

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 02:01:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 02:01:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 02:01:17] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2025-06-01 02:01:17] [INFO ] Transformed 891 places.
[2025-06-01 02:01:17] [INFO ] Transformed 3888 transitions.
[2025-06-01 02:01:17] [INFO ] Found NUPN structural information;
[2025-06-01 02:01:17] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 496 ms.
Built sparse matrix representations for Structural reductions in 20 ms.48161KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 296 ms. Remains 891 /891 variables (removed 0) and now considering 3888/3888 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 312 ms. Remains : 891/891 places, 3888/3888 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 228 ms. Remains 891 /891 variables (removed 0) and now considering 3888/3888 (removed 0) transitions.
[2025-06-01 02:01:18] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2025-06-01 02:01:19] [INFO ] Computed 28 invariants in 31 ms
[2025-06-01 02:01:19] [INFO ] Implicit Places using invariants in 614 ms returned []
[2025-06-01 02:01:19] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
[2025-06-01 02:01:19] [INFO ] Invariant cache hit.
[2025-06-01 02:01:20] [INFO ] State equation strengthened by 932 read => feed constraints.
[2025-06-01 02:01:20] [INFO ] Implicit Places using invariants and state equation in 806 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2025-06-01 02:01:20] [INFO ] Redundant transitions in 225 ms returned []
Running 3879 sub problems to find dead transitions.
[2025-06-01 02:01:20] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
[2025-06-01 02:01:20] [INFO ] Invariant cache hit.
[2025-06-01 02:01:20] [INFO ] State equation strengthened by 932 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/891 variables, 891/891 constraints. Problems are: Problem set: 0 solved, 3879 unsolved
SMT process timed out in 33470ms, After SMT, problems are : Problem set: 0 solved, 3879 unsolved
Search for dead transitions found 0 dead transitions in 33543ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 35513 ms. Remains : 891/891 places, 3888/3888 transitions.
Random walk for 1250000 steps, including 0 resets, run took 4646 ms (no deadlock found). (steps per millisecond=269 )
Random directed walk for 1250000 steps, including 0 resets, run took 5992 ms (no deadlock found). (steps per millisecond=208 )
[2025-06-01 02:02:04] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
[2025-06-01 02:02:04] [INFO ] Invariant cache hit.
[2025-06-01 02:02:05] [INFO ] [Real]Absence check using 19 positive place invariants in 40 ms returned sat
[2025-06-01 02:02:05] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 154 ms returned sat
[2025-06-01 02:02:07] [INFO ] [Real]Absence check using state equation in 1800 ms returned sat
[2025-06-01 02:02:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 02:02:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 24 ms returned sat
[2025-06-01 02:02:08] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 69 ms returned sat
[2025-06-01 02:02:10] [INFO ] [Nat]Absence check using state equation in 1909 ms returned sat
[2025-06-01 02:02:10] [INFO ] State equation strengthened by 932 read => feed constraints.
[2025-06-01 02:02:10] [INFO ] [Nat]Added 932 Read/Feed constraints in 209 ms returned sat
[2025-06-01 02:02:11] [INFO ] Deduced a trap composed of 3 places in 679 ms of which 93 ms to minimize.
[2025-06-01 02:02:12] [INFO ] Deduced a trap composed of 48 places in 587 ms of which 7 ms to minimize.
[2025-06-01 02:02:12] [INFO ] Deduced a trap composed of 126 places in 509 ms of which 5 ms to minimize.
[2025-06-01 02:02:13] [INFO ] Deduced a trap composed of 16 places in 591 ms of which 6 ms to minimize.
[2025-06-01 02:02:14] [INFO ] Deduced a trap composed of 95 places in 591 ms of which 6 ms to minimize.
[2025-06-01 02:02:14] [INFO ] Deduced a trap composed of 93 places in 578 ms of which 6 ms to minimize.
[2025-06-01 02:02:15] [INFO ] Deduced a trap composed of 3 places in 572 ms of which 6 ms to minimize.
[2025-06-01 02:02:16] [INFO ] Deduced a trap composed of 3 places in 592 ms of which 5 ms to minimize.
[2025-06-01 02:02:17] [INFO ] Deduced a trap composed of 63 places in 583 ms of which 6 ms to minimize.
[2025-06-01 02:02:17] [INFO ] Deduced a trap composed of 131 places in 517 ms of which 5 ms to minimize.
[2025-06-01 02:02:18] [INFO ] Deduced a trap composed of 35 places in 602 ms of which 6 ms to minimize.
[2025-06-01 02:02:19] [INFO ] Deduced a trap composed of 123 places in 604 ms of which 6 ms to minimize.
[2025-06-01 02:02:19] [INFO ] Deduced a trap composed of 36 places in 580 ms of which 6 ms to minimize.
[2025-06-01 02:02:20] [INFO ] Deduced a trap composed of 3 places in 613 ms of which 7 ms to minimize.
[2025-06-01 02:02:21] [INFO ] Deduced a trap composed of 83 places in 594 ms of which 6 ms to minimize.
[2025-06-01 02:02:21] [INFO ] Deduced a trap composed of 52 places in 574 ms of which 6 ms to minimize.
[2025-06-01 02:02:22] [INFO ] Deduced a trap composed of 117 places in 585 ms of which 6 ms to minimize.
[2025-06-01 02:02:23] [INFO ] Deduced a trap composed of 3 places in 561 ms of which 5 ms to minimize.
[2025-06-01 02:02:23] [INFO ] Deduced a trap composed of 100 places in 530 ms of which 5 ms to minimize.
[2025-06-01 02:02:24] [INFO ] Deduced a trap composed of 45 places in 546 ms of which 6 ms to minimize.
[2025-06-01 02:02:25] [INFO ] Deduced a trap composed of 40 places in 561 ms of which 5 ms to minimize.
[2025-06-01 02:02:25] [INFO ] Deduced a trap composed of 3 places in 563 ms of which 6 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 3 places in 590 ms of which 5 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 3 places in 563 ms of which 5 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 24 trap constraints in 16653 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 891/891 places, 3888/3888 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 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 18 place count 882 transition count 3627
Deduced a syphon composed of 252 places in 3 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 522 place count 630 transition count 3627
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 4 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 666 place count 558 transition count 3555
Applied a total of 666 rules in 170 ms. Remains 558 /891 variables (removed 333) and now considering 3555/3888 (removed 333) transitions.
[2025-06-01 02:02:27] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
// Phase 1: matrix 1476 rows 558 cols
[2025-06-01 02:02:27] [INFO ] Computed 28 invariants in 10 ms
[2025-06-01 02:02:28] [INFO ] Implicit Places using invariants in 800 ms returned []
[2025-06-01 02:02:28] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 02:02:28] [INFO ] Invariant cache hit.
[2025-06-01 02:02:28] [INFO ] State equation strengthened by 932 read => feed constraints.
[2025-06-01 02:02:33] [INFO ] Implicit Places using invariants and state equation in 5307 ms returned []
Implicit Place search using SMT with State Equation took 6121 ms to find 0 implicit places.
Running 3546 sub problems to find dead transitions.
[2025-06-01 02:02:33] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 02:02:33] [INFO ] Invariant cache hit.
[2025-06-01 02:02:33] [INFO ] State equation strengthened by 932 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)timeout

(s21 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/558 variables, 558/558 constraints. Problems are: Problem set: 0 solved, 3546 unsolved
SMT process timed out in 32878ms, After SMT, problems are : Problem set: 0 solved, 3546 unsolved
Search for dead transitions found 0 dead transitions in 32918ms
Starting structural reductions in LIVENESS mode, iteration 1 : 558/891 places, 3555/3888 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 39219 ms. Remains : 558/891 places, 3555/3888 transitions.
Initial state reduction rules removed 9 formulas.
RANDOM walk for 40000 steps (8 resets) in 10830 ms. (3 steps per ms) remains 2996/3546 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 30 ms. (4 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 31 ms. (3 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 35 ms. (3 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 30 ms. (4 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 17 ms. (6 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 2996/2996 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 2996/2996 properties
[2025-06-01 02:03:10] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 02:03:10] [INFO ] Invariant cache hit.
[2025-06-01 02:03:10] [INFO ] State equation strengthened by 932 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/433 variables, 433/433 constraints. Problems are: Problem set: 0 solved, 2996 unsolved
SMT process timed out in 7577ms, After SMT, problems are : Problem set: 0 solved, 2996 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 433 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 3555/3555 transitions.
Applied a total of 0 rules in 147 ms. Remains 558 /558 variables (removed 0) and now considering 3555/3555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 558/558 places, 3555/3555 transitions.
RANDOM walk for 803574 steps (0 resets) in 120004 ms. (6 steps per ms) remains 2969/2996 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2967/2969 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 71 ms. (55 steps per ms) remains 2967/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2966/2967 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2966/2966 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2966/2966 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2966/2966 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2965/2966 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2964/2965 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2964/2964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2964/2964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2963/2964 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2963/2963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2962/2963 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2961/2962 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2961/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2960/2961 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2959/2960 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2959/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2957/2959 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2957/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2957/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2957/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2957/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2957/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2957/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2954/2957 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2954/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2954/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2954/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2954/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2954/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2954/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2953/2954 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2953/2953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2953/2953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2951/2953 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2951/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2949/2951 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2949/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2948/2949 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2948/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2947/2948 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2947/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2946/2947 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2946/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2945/2946 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2945/2945 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2945/2945 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2945/2945 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2944/2945 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2944 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2941/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2940/2941 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2940/2940 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2940/2940 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2940/2940 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2940/2940 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2940/2940 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2939/2940 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2939/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2938/2939 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2938/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 194 ms. (20 steps per ms) remains 2937/2938 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2937/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2936/2937 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2936/2936 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2936/2936 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2936/2936 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2935/2936 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2935/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2935 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2934/2934 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2934/2934 properties
Interrupted probabilistic random walk after 769880 steps, run timeout after 102001 ms. (steps per millisecond=7 ) properties seen :626 out of 2934
Probabilistic random walk after 769880 steps, saw 546926 distinct states, run finished after 102009 ms. (steps per millisecond=7 ) properties seen :626
[2025-06-01 02:05:34] [INFO ] Flow matrix only has 1476 transitions (discarded 2079 similar events)
[2025-06-01 02:05:34] [INFO ] Invariant cache hit.
[2025-06-01 02:05:34] [INFO ] State equation strengthened by 932 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/321 variables, 321/321 constraints. Problems are: Problem set: 0 solved, 2308 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/321 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 2308 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/321 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 2308 unsolved
At refinement iteration 3 (OVERLAPS) 237/558 variables, 18/340 constraints. Problems are: Problem set: 0 solved, 2308 unsolved
SMT process timed out in 47031ms, After SMT, problems are : Problem set: 0 solved, 2308 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 321 out of 558 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 558/558 places, 3555/3555 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 551 transition count 3492
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 551 transition count 3492
Applied a total of 14 rules in 203 ms. Remains 551 /558 variables (removed 7) and now considering 3492/3555 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 203 ms. Remains : 551/558 places, 3492/3555 transitions.
RANDOM walk for 1121211 steps (0 resets) in 120004 ms. (9 steps per ms) remains 2307/2308 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 56 ms. (70 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2307/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2306/2307 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2306/2306 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2306/2306 properties
Interrupted probabilistic random walk after 744310 steps, run timeout after 93002 ms. (steps per millisecond=8 ) properties seen :39 out of 2306
Probabilistic random walk after 744310 steps, saw 522323 distinct states, run finished after 93005 ms. (steps per millisecond=8 ) properties seen :39
[2025-06-01 02:08:25] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
// Phase 1: matrix 1413 rows 551 cols
[2025-06-01 02:08:26] [INFO ] Computed 28 invariants in 9 ms
[2025-06-01 02:08:26] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2267 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2267 unsolved
At refinement iteration 2 (OVERLAPS) 247/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2267 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2267 unsolved
[2025-06-01 02:09:20] [INFO ] Deduced a trap composed of 38 places in 400 ms of which 3 ms to minimize.
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 74 places in 414 ms of which 4 ms to minimize.
[2025-06-01 02:09:21] [INFO ] Deduced a trap composed of 178 places in 383 ms of which 3 ms to minimize.
[2025-06-01 02:09:22] [INFO ] Deduced a trap composed of 31 places in 409 ms of which 4 ms to minimize.
[2025-06-01 02:09:22] [INFO ] Deduced a trap composed of 3 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:09:22] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:09:23] [INFO ] Deduced a trap composed of 53 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:09:23] [INFO ] Deduced a trap composed of 178 places in 379 ms of which 3 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 21 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 30 places in 388 ms of which 4 ms to minimize.
[2025-06-01 02:09:24] [INFO ] Deduced a trap composed of 27 places in 377 ms of which 7 ms to minimize.
[2025-06-01 02:09:25] [INFO ] Deduced a trap composed of 21 places in 379 ms of which 4 ms to minimize.
[2025-06-01 02:09:25] [INFO ] Deduced a trap composed of 19 places in 391 ms of which 4 ms to minimize.
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 172 places in 393 ms of which 4 ms to minimize.
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 121 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:09:26] [INFO ] Deduced a trap composed of 136 places in 401 ms of which 4 ms to minimize.
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 140 places in 412 ms of which 3 ms to minimize.
[2025-06-01 02:09:27] [INFO ] Deduced a trap composed of 134 places in 365 ms of which 4 ms to minimize.
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 129 places in 315 ms of which 4 ms to minimize.
[2025-06-01 02:09:28] [INFO ] Deduced a trap composed of 140 places in 355 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2267 unsolved
[2025-06-01 02:09:29] [INFO ] Deduced a trap composed of 57 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 103 places in 385 ms of which 3 ms to minimize.
[2025-06-01 02:09:30] [INFO ] Deduced a trap composed of 55 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 151 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 23 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 109 places in 370 ms of which 4 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 38 places in 389 ms of which 4 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 124 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 110 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 110 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:09:33] [INFO ] Deduced a trap composed of 145 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 86 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 131 places in 436 ms of which 4 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 99 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 139 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 35 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 0 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 36 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 146 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 126 places in 368 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2267 unsolved
[2025-06-01 02:09:38] [INFO ] Deduced a trap composed of 117 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 19 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 127 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:09:39] [INFO ] Deduced a trap composed of 81 places in 375 ms of which 3 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 150 places in 408 ms of which 3 ms to minimize.
[2025-06-01 02:09:40] [INFO ] Deduced a trap composed of 154 places in 388 ms of which 3 ms to minimize.
[2025-06-01 02:09:41] [INFO ] Deduced a trap composed of 146 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:09:41] [INFO ] Deduced a trap composed of 137 places in 383 ms of which 4 ms to minimize.
[2025-06-01 02:09:41] [INFO ] Deduced a trap composed of 145 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:09:42] [INFO ] Deduced a trap composed of 126 places in 442 ms of which 3 ms to minimize.
[2025-06-01 02:09:42] [INFO ] Deduced a trap composed of 113 places in 395 ms of which 3 ms to minimize.
[2025-06-01 02:09:43] [INFO ] Deduced a trap composed of 121 places in 326 ms of which 3 ms to minimize.
SMT process timed out in 77186ms, After SMT, problems are : Problem set: 0 solved, 2267 unsolved
Fused 2267 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 304 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 118 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 983998 steps (0 resets) in 120004 ms. (8 steps per ms) remains 2266/2267 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 60 ms. (65 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
Interrupted probabilistic random walk after 728980 steps, run timeout after 90001 ms. (steps per millisecond=8 ) properties seen :0 out of 2266
Probabilistic random walk after 728980 steps, saw 511900 distinct states, run finished after 90003 ms. (steps per millisecond=8 ) properties seen :0
[2025-06-01 02:11:44] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:11:44] [INFO ] Invariant cache hit.
[2025-06-01 02:11:44] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 2 (OVERLAPS) 247/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:12:40] [INFO ] Deduced a trap composed of 38 places in 399 ms of which 3 ms to minimize.
[2025-06-01 02:12:40] [INFO ] Deduced a trap composed of 43 places in 410 ms of which 4 ms to minimize.
[2025-06-01 02:12:41] [INFO ] Deduced a trap composed of 26 places in 387 ms of which 4 ms to minimize.
[2025-06-01 02:12:41] [INFO ] Deduced a trap composed of 27 places in 425 ms of which 3 ms to minimize.
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 23 places in 395 ms of which 3 ms to minimize.
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 57 places in 425 ms of which 3 ms to minimize.
[2025-06-01 02:12:42] [INFO ] Deduced a trap composed of 31 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:12:43] [INFO ] Deduced a trap composed of 46 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:12:43] [INFO ] Deduced a trap composed of 25 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:12:44] [INFO ] Deduced a trap composed of 29 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:12:44] [INFO ] Deduced a trap composed of 25 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:12:44] [INFO ] Deduced a trap composed of 20 places in 383 ms of which 4 ms to minimize.
[2025-06-01 02:12:45] [INFO ] Deduced a trap composed of 23 places in 401 ms of which 3 ms to minimize.
[2025-06-01 02:12:45] [INFO ] Deduced a trap composed of 27 places in 388 ms of which 4 ms to minimize.
[2025-06-01 02:12:46] [INFO ] Deduced a trap composed of 24 places in 412 ms of which 4 ms to minimize.
[2025-06-01 02:12:46] [INFO ] Deduced a trap composed of 104 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:12:46] [INFO ] Deduced a trap composed of 76 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:12:47] [INFO ] Deduced a trap composed of 102 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:12:47] [INFO ] Deduced a trap composed of 85 places in 322 ms of which 3 ms to minimize.
[2025-06-01 02:12:47] [INFO ] Deduced a trap composed of 99 places in 349 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:12:49] [INFO ] Deduced a trap composed of 41 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:12:49] [INFO ] Deduced a trap composed of 30 places in 390 ms of which 3 ms to minimize.
[2025-06-01 02:12:50] [INFO ] Deduced a trap composed of 91 places in 414 ms of which 3 ms to minimize.
[2025-06-01 02:12:50] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:12:50] [INFO ] Deduced a trap composed of 37 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:12:50] [INFO ] Deduced a trap composed of 25 places in 137 ms of which 1 ms to minimize.
[2025-06-01 02:12:51] [INFO ] Deduced a trap composed of 97 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:12:51] [INFO ] Deduced a trap composed of 92 places in 391 ms of which 3 ms to minimize.
[2025-06-01 02:12:52] [INFO ] Deduced a trap composed of 129 places in 379 ms of which 4 ms to minimize.
[2025-06-01 02:12:52] [INFO ] Deduced a trap composed of 95 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:12:53] [INFO ] Deduced a trap composed of 112 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:12:54] [INFO ] Deduced a trap composed of 81 places in 393 ms of which 3 ms to minimize.
[2025-06-01 02:12:54] [INFO ] Deduced a trap composed of 96 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:12:54] [INFO ] Deduced a trap composed of 67 places in 394 ms of which 3 ms to minimize.
[2025-06-01 02:12:55] [INFO ] Deduced a trap composed of 103 places in 362 ms of which 4 ms to minimize.
[2025-06-01 02:12:55] [INFO ] Deduced a trap composed of 75 places in 390 ms of which 4 ms to minimize.
[2025-06-01 02:12:56] [INFO ] Deduced a trap composed of 67 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:12:56] [INFO ] Deduced a trap composed of 106 places in 373 ms of which 4 ms to minimize.
[2025-06-01 02:12:56] [INFO ] Deduced a trap composed of 107 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:12:57] [INFO ] Deduced a trap composed of 93 places in 401 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:12:58] [INFO ] Deduced a trap composed of 31 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:12:59] [INFO ] Deduced a trap composed of 71 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:12:59] [INFO ] Deduced a trap composed of 45 places in 371 ms of which 4 ms to minimize.
[2025-06-01 02:13:00] [INFO ] Deduced a trap composed of 27 places in 386 ms of which 3 ms to minimize.
[2025-06-01 02:13:00] [INFO ] Deduced a trap composed of 31 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:13:00] [INFO ] Deduced a trap composed of 33 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:13:01] [INFO ] Deduced a trap composed of 76 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:13:01] [INFO ] Deduced a trap composed of 29 places in 231 ms of which 3 ms to minimize.
[2025-06-01 02:13:01] [INFO ] Deduced a trap composed of 25 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:13:02] [INFO ] Deduced a trap composed of 82 places in 359 ms of which 4 ms to minimize.
[2025-06-01 02:13:02] [INFO ] Deduced a trap composed of 77 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:13:02] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 4 ms to minimize.
[2025-06-01 02:13:03] [INFO ] Deduced a trap composed of 74 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:13:03] [INFO ] Deduced a trap composed of 115 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:13:03] [INFO ] Deduced a trap composed of 3 places in 324 ms of which 3 ms to minimize.
[2025-06-01 02:13:04] [INFO ] Deduced a trap composed of 78 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:13:04] [INFO ] Deduced a trap composed of 27 places in 305 ms of which 3 ms to minimize.
[2025-06-01 02:13:04] [INFO ] Deduced a trap composed of 71 places in 306 ms of which 3 ms to minimize.
[2025-06-01 02:13:05] [INFO ] Deduced a trap composed of 86 places in 347 ms of which 3 ms to minimize.
[2025-06-01 02:13:05] [INFO ] Deduced a trap composed of 84 places in 348 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1964 variables, and 88 constraints, problems are : Problem set: 0 solved, 2266 unsolved in 90045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 2266/2266 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2266 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/304 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/304 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 2 (OVERLAPS) 247/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 73 places in 390 ms of which 3 ms to minimize.
[2025-06-01 02:13:39] [INFO ] Deduced a trap composed of 40 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 21 places in 385 ms of which 3 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 3 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:13:40] [INFO ] Deduced a trap composed of 36 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 23 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 3 places in 382 ms of which 4 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 44 places in 364 ms of which 3 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 17 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 19 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 39 places in 231 ms of which 2 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 23 places in 217 ms of which 2 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 33 places in 182 ms of which 1 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 35 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:13:43] [INFO ] Deduced a trap composed of 21 places in 166 ms of which 1 ms to minimize.
[2025-06-01 02:13:44] [INFO ] Deduced a trap composed of 17 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:13:45] [INFO ] Deduced a trap composed of 31 places in 137 ms of which 1 ms to minimize.
[2025-06-01 02:13:48] [INFO ] Deduced a trap composed of 90 places in 423 ms of which 3 ms to minimize.
[2025-06-01 02:13:48] [INFO ] Deduced a trap composed of 61 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:13:49] [INFO ] Deduced a trap composed of 93 places in 391 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 97 places in 295 ms of which 3 ms to minimize.
[2025-06-01 02:13:51] [INFO ] Deduced a trap composed of 73 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:13:52] [INFO ] Deduced a trap composed of 91 places in 407 ms of which 6 ms to minimize.
[2025-06-01 02:13:57] [INFO ] Deduced a trap composed of 84 places in 419 ms of which 4 ms to minimize.
[2025-06-01 02:13:58] [INFO ] Deduced a trap composed of 76 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:13:58] [INFO ] Deduced a trap composed of 112 places in 407 ms of which 4 ms to minimize.
[2025-06-01 02:13:58] [INFO ] Deduced a trap composed of 119 places in 401 ms of which 4 ms to minimize.
[2025-06-01 02:13:59] [INFO ] Deduced a trap composed of 129 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:13:59] [INFO ] Deduced a trap composed of 113 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:14:00] [INFO ] Deduced a trap composed of 108 places in 365 ms of which 4 ms to minimize.
[2025-06-01 02:14:01] [INFO ] Deduced a trap composed of 94 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:14:01] [INFO ] Deduced a trap composed of 69 places in 401 ms of which 4 ms to minimize.
[2025-06-01 02:14:02] [INFO ] Deduced a trap composed of 114 places in 394 ms of which 3 ms to minimize.
[2025-06-01 02:14:02] [INFO ] Deduced a trap composed of 127 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:14:03] [INFO ] Deduced a trap composed of 138 places in 380 ms of which 3 ms to minimize.
[2025-06-01 02:14:03] [INFO ] Deduced a trap composed of 94 places in 420 ms of which 4 ms to minimize.
[2025-06-01 02:14:03] [INFO ] Deduced a trap composed of 107 places in 390 ms of which 4 ms to minimize.
[2025-06-01 02:14:04] [INFO ] Deduced a trap composed of 160 places in 439 ms of which 4 ms to minimize.
[2025-06-01 02:14:04] [INFO ] Deduced a trap composed of 138 places in 423 ms of which 4 ms to minimize.
[2025-06-01 02:14:05] [INFO ] Deduced a trap composed of 106 places in 423 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:14:11] [INFO ] Deduced a trap composed of 35 places in 129 ms of which 1 ms to minimize.
[2025-06-01 02:14:12] [INFO ] Deduced a trap composed of 92 places in 408 ms of which 3 ms to minimize.
[2025-06-01 02:14:12] [INFO ] Deduced a trap composed of 75 places in 415 ms of which 4 ms to minimize.
[2025-06-01 02:14:13] [INFO ] Deduced a trap composed of 97 places in 439 ms of which 3 ms to minimize.
[2025-06-01 02:14:14] [INFO ] Deduced a trap composed of 112 places in 398 ms of which 3 ms to minimize.
[2025-06-01 02:14:14] [INFO ] Deduced a trap composed of 86 places in 451 ms of which 3 ms to minimize.
[2025-06-01 02:14:15] [INFO ] Deduced a trap composed of 82 places in 417 ms of which 4 ms to minimize.
[2025-06-01 02:14:15] [INFO ] Deduced a trap composed of 130 places in 375 ms of which 3 ms to minimize.
[2025-06-01 02:14:16] [INFO ] Deduced a trap composed of 128 places in 379 ms of which 3 ms to minimize.
[2025-06-01 02:14:16] [INFO ] Deduced a trap composed of 120 places in 333 ms of which 3 ms to minimize.
[2025-06-01 02:14:17] [INFO ] Deduced a trap composed of 137 places in 398 ms of which 3 ms to minimize.
[2025-06-01 02:14:18] [INFO ] Deduced a trap composed of 122 places in 381 ms of which 3 ms to minimize.
[2025-06-01 02:14:18] [INFO ] Deduced a trap composed of 107 places in 402 ms of which 3 ms to minimize.
[2025-06-01 02:14:18] [INFO ] Deduced a trap composed of 118 places in 421 ms of which 3 ms to minimize.
[2025-06-01 02:14:19] [INFO ] Deduced a trap composed of 106 places in 397 ms of which 3 ms to minimize.
[2025-06-01 02:14:20] [INFO ] Deduced a trap composed of 118 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:14:20] [INFO ] Deduced a trap composed of 159 places in 376 ms of which 4 ms to minimize.
[2025-06-01 02:14:21] [INFO ] Deduced a trap composed of 163 places in 356 ms of which 4 ms to minimize.
[2025-06-01 02:14:21] [INFO ] Deduced a trap composed of 121 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:14:22] [INFO ] Deduced a trap composed of 129 places in 348 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:14:24] [INFO ] Deduced a trap composed of 68 places in 384 ms of which 3 ms to minimize.
[2025-06-01 02:14:24] [INFO ] Deduced a trap composed of 96 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:14:25] [INFO ] Deduced a trap composed of 93 places in 381 ms of which 3 ms to minimize.
[2025-06-01 02:14:25] [INFO ] Deduced a trap composed of 75 places in 409 ms of which 3 ms to minimize.
[2025-06-01 02:14:26] [INFO ] Deduced a trap composed of 63 places in 413 ms of which 3 ms to minimize.
[2025-06-01 02:14:26] [INFO ] Deduced a trap composed of 106 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:14:27] [INFO ] Deduced a trap composed of 65 places in 420 ms of which 4 ms to minimize.
[2025-06-01 02:14:27] [INFO ] Deduced a trap composed of 71 places in 418 ms of which 4 ms to minimize.
[2025-06-01 02:14:28] [INFO ] Deduced a trap composed of 19 places in 409 ms of which 4 ms to minimize.
[2025-06-01 02:14:28] [INFO ] Deduced a trap composed of 88 places in 404 ms of which 4 ms to minimize.
[2025-06-01 02:14:28] [INFO ] Deduced a trap composed of 84 places in 412 ms of which 3 ms to minimize.
[2025-06-01 02:14:29] [INFO ] Deduced a trap composed of 98 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:14:29] [INFO ] Deduced a trap composed of 64 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:14:30] [INFO ] Deduced a trap composed of 127 places in 395 ms of which 4 ms to minimize.
[2025-06-01 02:14:30] [INFO ] Deduced a trap composed of 123 places in 404 ms of which 4 ms to minimize.
[2025-06-01 02:14:31] [INFO ] Deduced a trap composed of 89 places in 409 ms of which 4 ms to minimize.
[2025-06-01 02:14:31] [INFO ] Deduced a trap composed of 132 places in 427 ms of which 3 ms to minimize.
[2025-06-01 02:14:31] [INFO ] Deduced a trap composed of 93 places in 376 ms of which 7 ms to minimize.
[2025-06-01 02:14:32] [INFO ] Deduced a trap composed of 131 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:14:32] [INFO ] Deduced a trap composed of 110 places in 347 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 2266 unsolved
[2025-06-01 02:14:35] [INFO ] Deduced a trap composed of 104 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:14:35] [INFO ] Deduced a trap composed of 72 places in 387 ms of which 4 ms to minimize.
[2025-06-01 02:14:36] [INFO ] Deduced a trap composed of 102 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:14:36] [INFO ] Deduced a trap composed of 3 places in 341 ms of which 3 ms to minimize.
[2025-06-01 02:14:36] [INFO ] Deduced a trap composed of 109 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:14:37] [INFO ] Deduced a trap composed of 76 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:14:42] [INFO ] Deduced a trap composed of 110 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 136 places in 422 ms of which 4 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 137 places in 423 ms of which 4 ms to minimize.
[2025-06-01 02:14:43] [INFO ] Deduced a trap composed of 119 places in 423 ms of which 3 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 125 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:14:44] [INFO ] Deduced a trap composed of 118 places in 404 ms of which 3 ms to minimize.
[2025-06-01 02:14:45] [INFO ] Deduced a trap composed of 108 places in 394 ms of which 3 ms to minimize.
[2025-06-01 02:14:45] [INFO ] Deduced a trap composed of 91 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:14:45] [INFO ] Deduced a trap composed of 118 places in 321 ms of which 4 ms to minimize.
[2025-06-01 02:14:46] [INFO ] Deduced a trap composed of 145 places in 333 ms of which 3 ms to minimize.
SMT process timed out in 182235ms, After SMT, problems are : Problem set: 0 solved, 2266 unsolved
Fused 2266 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 304 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 133 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 133 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 1127269 steps (0 resets) in 120004 ms. (9 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 115 ms. (34 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 121 ms. (32 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2266/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2264/2266 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 81 ms. (48 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 101 ms. (39 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2264/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2263/2264 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 106 ms. (37 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 89 ms. (44 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 66 ms. (59 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 59 ms. (66 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 91 ms. (43 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2263/2263 properties
Interrupted probabilistic random walk after 757980 steps, run timeout after 96001 ms. (steps per millisecond=7 ) properties seen :0 out of 2263
Probabilistic random walk after 757980 steps, saw 531357 distinct states, run finished after 96003 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-01 02:16:55] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:16:55] [INFO ] Invariant cache hit.
[2025-06-01 02:16:55] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 2 (OVERLAPS) 248/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:17:48] [INFO ] Deduced a trap composed of 38 places in 432 ms of which 4 ms to minimize.
[2025-06-01 02:17:48] [INFO ] Deduced a trap composed of 33 places in 380 ms of which 3 ms to minimize.
[2025-06-01 02:17:49] [INFO ] Deduced a trap composed of 116 places in 351 ms of which 4 ms to minimize.
[2025-06-01 02:17:49] [INFO ] Deduced a trap composed of 53 places in 374 ms of which 4 ms to minimize.
[2025-06-01 02:17:49] [INFO ] Deduced a trap composed of 61 places in 384 ms of which 3 ms to minimize.
[2025-06-01 02:17:50] [INFO ] Deduced a trap composed of 152 places in 399 ms of which 4 ms to minimize.
[2025-06-01 02:17:50] [INFO ] Deduced a trap composed of 28 places in 390 ms of which 3 ms to minimize.
[2025-06-01 02:17:51] [INFO ] Deduced a trap composed of 23 places in 379 ms of which 4 ms to minimize.
[2025-06-01 02:17:51] [INFO ] Deduced a trap composed of 120 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:17:51] [INFO ] Deduced a trap composed of 29 places in 350 ms of which 3 ms to minimize.
[2025-06-01 02:17:52] [INFO ] Deduced a trap composed of 31 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:17:52] [INFO ] Deduced a trap composed of 28 places in 364 ms of which 4 ms to minimize.
[2025-06-01 02:17:53] [INFO ] Deduced a trap composed of 39 places in 374 ms of which 4 ms to minimize.
[2025-06-01 02:17:53] [INFO ] Deduced a trap composed of 35 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:17:53] [INFO ] Deduced a trap composed of 37 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:17:54] [INFO ] Deduced a trap composed of 35 places in 400 ms of which 3 ms to minimize.
[2025-06-01 02:17:55] [INFO ] Deduced a trap composed of 30 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:17:56] [INFO ] Deduced a trap composed of 186 places in 392 ms of which 4 ms to minimize.
[2025-06-01 02:17:56] [INFO ] Deduced a trap composed of 39 places in 386 ms of which 3 ms to minimize.
[2025-06-01 02:17:57] [INFO ] Deduced a trap composed of 163 places in 381 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:17:58] [INFO ] Deduced a trap composed of 5 places in 382 ms of which 4 ms to minimize.
[2025-06-01 02:17:58] [INFO ] Deduced a trap composed of 3 places in 395 ms of which 3 ms to minimize.
[2025-06-01 02:17:59] [INFO ] Deduced a trap composed of 17 places in 254 ms of which 4 ms to minimize.
[2025-06-01 02:17:59] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 6 ms to minimize.
[2025-06-01 02:18:01] [INFO ] Deduced a trap composed of 57 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:18:01] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:18:03] [INFO ] Deduced a trap composed of 57 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:18:03] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 0 ms to minimize.
[2025-06-01 02:18:05] [INFO ] Deduced a trap composed of 93 places in 396 ms of which 3 ms to minimize.
[2025-06-01 02:18:05] [INFO ] Deduced a trap composed of 108 places in 395 ms of which 4 ms to minimize.
[2025-06-01 02:18:06] [INFO ] Deduced a trap composed of 91 places in 425 ms of which 3 ms to minimize.
[2025-06-01 02:18:06] [INFO ] Deduced a trap composed of 132 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:18:07] [INFO ] Deduced a trap composed of 133 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:18:07] [INFO ] Deduced a trap composed of 119 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:18:07] [INFO ] Deduced a trap composed of 119 places in 352 ms of which 4 ms to minimize.
[2025-06-01 02:18:08] [INFO ] Deduced a trap composed of 95 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:18:08] [INFO ] Deduced a trap composed of 104 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:18:09] [INFO ] Deduced a trap composed of 82 places in 381 ms of which 3 ms to minimize.
[2025-06-01 02:18:09] [INFO ] Deduced a trap composed of 75 places in 410 ms of which 3 ms to minimize.
[2025-06-01 02:18:09] [INFO ] Deduced a trap composed of 104 places in 391 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:18:13] [INFO ] Deduced a trap composed of 124 places in 395 ms of which 4 ms to minimize.
[2025-06-01 02:18:13] [INFO ] Deduced a trap composed of 128 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:18:13] [INFO ] Deduced a trap composed of 130 places in 308 ms of which 3 ms to minimize.
[2025-06-01 02:18:14] [INFO ] Deduced a trap composed of 130 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:18:14] [INFO ] Deduced a trap composed of 119 places in 392 ms of which 3 ms to minimize.
[2025-06-01 02:18:15] [INFO ] Deduced a trap composed of 130 places in 408 ms of which 4 ms to minimize.
[2025-06-01 02:18:15] [INFO ] Deduced a trap composed of 130 places in 408 ms of which 3 ms to minimize.
[2025-06-01 02:18:16] [INFO ] Deduced a trap composed of 111 places in 391 ms of which 4 ms to minimize.
[2025-06-01 02:18:16] [INFO ] Deduced a trap composed of 119 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:18:16] [INFO ] Deduced a trap composed of 142 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:18:17] [INFO ] Deduced a trap composed of 156 places in 413 ms of which 3 ms to minimize.
[2025-06-01 02:18:17] [INFO ] Deduced a trap composed of 139 places in 385 ms of which 3 ms to minimize.
[2025-06-01 02:18:18] [INFO ] Deduced a trap composed of 113 places in 426 ms of which 4 ms to minimize.
[2025-06-01 02:18:18] [INFO ] Deduced a trap composed of 90 places in 401 ms of which 4 ms to minimize.
[2025-06-01 02:18:19] [INFO ] Deduced a trap composed of 124 places in 420 ms of which 3 ms to minimize.
[2025-06-01 02:18:19] [INFO ] Deduced a trap composed of 101 places in 389 ms of which 4 ms to minimize.
[2025-06-01 02:18:20] [INFO ] Deduced a trap composed of 115 places in 412 ms of which 3 ms to minimize.
[2025-06-01 02:18:20] [INFO ] Deduced a trap composed of 122 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:18:20] [INFO ] Deduced a trap composed of 120 places in 370 ms of which 4 ms to minimize.
[2025-06-01 02:18:21] [INFO ] Deduced a trap composed of 114 places in 356 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1964 variables, and 88 constraints, problems are : Problem set: 0 solved, 2263 unsolved in 105039 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 2263/2263 constraints, Known Traps: 60/60 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 2 (OVERLAPS) 248/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 60/88 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:19:06] [INFO ] Deduced a trap composed of 31 places in 415 ms of which 4 ms to minimize.
[2025-06-01 02:19:06] [INFO ] Deduced a trap composed of 114 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:19:07] [INFO ] Deduced a trap composed of 21 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:19:07] [INFO ] Deduced a trap composed of 124 places in 401 ms of which 3 ms to minimize.
[2025-06-01 02:19:08] [INFO ] Deduced a trap composed of 27 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:19:08] [INFO ] Deduced a trap composed of 70 places in 396 ms of which 3 ms to minimize.
[2025-06-01 02:19:08] [INFO ] Deduced a trap composed of 108 places in 380 ms of which 3 ms to minimize.
[2025-06-01 02:19:09] [INFO ] Deduced a trap composed of 109 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:19:09] [INFO ] Deduced a trap composed of 79 places in 383 ms of which 3 ms to minimize.
[2025-06-01 02:19:10] [INFO ] Deduced a trap composed of 86 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:19:10] [INFO ] Deduced a trap composed of 109 places in 413 ms of which 4 ms to minimize.
[2025-06-01 02:19:11] [INFO ] Deduced a trap composed of 105 places in 415 ms of which 4 ms to minimize.
[2025-06-01 02:19:11] [INFO ] Deduced a trap composed of 110 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:19:11] [INFO ] Deduced a trap composed of 110 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:19:12] [INFO ] Deduced a trap composed of 105 places in 379 ms of which 3 ms to minimize.
[2025-06-01 02:19:12] [INFO ] Deduced a trap composed of 114 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:19:12] [INFO ] Deduced a trap composed of 125 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:19:13] [INFO ] Deduced a trap composed of 117 places in 413 ms of which 3 ms to minimize.
[2025-06-01 02:19:13] [INFO ] Deduced a trap composed of 42 places in 421 ms of which 3 ms to minimize.
[2025-06-01 02:19:14] [INFO ] Deduced a trap composed of 3 places in 410 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:19:16] [INFO ] Deduced a trap composed of 15 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:19:16] [INFO ] Deduced a trap composed of 121 places in 383 ms of which 4 ms to minimize.
[2025-06-01 02:19:16] [INFO ] Deduced a trap composed of 127 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:19:17] [INFO ] Deduced a trap composed of 97 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:19:17] [INFO ] Deduced a trap composed of 20 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:19:18] [INFO ] Deduced a trap composed of 155 places in 380 ms of which 3 ms to minimize.
[2025-06-01 02:19:18] [INFO ] Deduced a trap composed of 189 places in 392 ms of which 3 ms to minimize.
[2025-06-01 02:19:18] [INFO ] Deduced a trap composed of 115 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 100 places in 390 ms of which 4 ms to minimize.
[2025-06-01 02:19:19] [INFO ] Deduced a trap composed of 122 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:19:20] [INFO ] Deduced a trap composed of 124 places in 426 ms of which 4 ms to minimize.
[2025-06-01 02:19:20] [INFO ] Deduced a trap composed of 133 places in 387 ms of which 4 ms to minimize.
[2025-06-01 02:19:20] [INFO ] Deduced a trap composed of 137 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:19:21] [INFO ] Deduced a trap composed of 137 places in 397 ms of which 3 ms to minimize.
[2025-06-01 02:19:21] [INFO ] Deduced a trap composed of 113 places in 394 ms of which 4 ms to minimize.
[2025-06-01 02:19:22] [INFO ] Deduced a trap composed of 131 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:19:22] [INFO ] Deduced a trap composed of 96 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:19:22] [INFO ] Deduced a trap composed of 215 places in 401 ms of which 4 ms to minimize.
[2025-06-01 02:19:23] [INFO ] Deduced a trap composed of 129 places in 397 ms of which 3 ms to minimize.
[2025-06-01 02:19:23] [INFO ] Deduced a trap composed of 121 places in 382 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:19:26] [INFO ] Deduced a trap composed of 143 places in 397 ms of which 3 ms to minimize.
[2025-06-01 02:19:26] [INFO ] Deduced a trap composed of 33 places in 375 ms of which 3 ms to minimize.
[2025-06-01 02:19:26] [INFO ] Deduced a trap composed of 118 places in 387 ms of which 4 ms to minimize.
[2025-06-01 02:19:27] [INFO ] Deduced a trap composed of 3 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:19:27] [INFO ] Deduced a trap composed of 158 places in 352 ms of which 4 ms to minimize.
[2025-06-01 02:19:28] [INFO ] Deduced a trap composed of 116 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:19:28] [INFO ] Deduced a trap composed of 135 places in 384 ms of which 4 ms to minimize.
[2025-06-01 02:19:28] [INFO ] Deduced a trap composed of 21 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:19:29] [INFO ] Deduced a trap composed of 135 places in 391 ms of which 4 ms to minimize.
[2025-06-01 02:19:29] [INFO ] Deduced a trap composed of 129 places in 379 ms of which 3 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 104 places in 395 ms of which 5 ms to minimize.
[2025-06-01 02:19:30] [INFO ] Deduced a trap composed of 124 places in 383 ms of which 3 ms to minimize.
[2025-06-01 02:19:31] [INFO ] Deduced a trap composed of 117 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:19:31] [INFO ] Deduced a trap composed of 141 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 129 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 92 places in 400 ms of which 4 ms to minimize.
[2025-06-01 02:19:32] [INFO ] Deduced a trap composed of 130 places in 382 ms of which 4 ms to minimize.
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 123 places in 407 ms of which 4 ms to minimize.
[2025-06-01 02:19:33] [INFO ] Deduced a trap composed of 3 places in 391 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 70 places in 354 ms of which 3 ms to minimize.
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 62 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:19:36] [INFO ] Deduced a trap composed of 113 places in 353 ms of which 3 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 90 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 106 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:19:37] [INFO ] Deduced a trap composed of 77 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 83 places in 348 ms of which 4 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 52 places in 339 ms of which 3 ms to minimize.
[2025-06-01 02:19:38] [INFO ] Deduced a trap composed of 28 places in 330 ms of which 3 ms to minimize.
[2025-06-01 02:19:39] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:19:44] [INFO ] Deduced a trap composed of 158 places in 386 ms of which 4 ms to minimize.
[2025-06-01 02:19:44] [INFO ] Deduced a trap composed of 186 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:19:45] [INFO ] Deduced a trap composed of 147 places in 398 ms of which 4 ms to minimize.
[2025-06-01 02:19:45] [INFO ] Deduced a trap composed of 159 places in 418 ms of which 4 ms to minimize.
[2025-06-01 02:19:45] [INFO ] Deduced a trap composed of 176 places in 387 ms of which 4 ms to minimize.
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 151 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:19:46] [INFO ] Deduced a trap composed of 133 places in 352 ms of which 3 ms to minimize.
[2025-06-01 02:19:47] [INFO ] Deduced a trap composed of 132 places in 382 ms of which 4 ms to minimize.
[2025-06-01 02:19:47] [INFO ] Deduced a trap composed of 111 places in 326 ms of which 3 ms to minimize.
[2025-06-01 02:19:47] [INFO ] Deduced a trap composed of 124 places in 373 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:19:50] [INFO ] Deduced a trap composed of 19 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:19:50] [INFO ] Deduced a trap composed of 86 places in 323 ms of which 3 ms to minimize.
[2025-06-01 02:19:50] [INFO ] Deduced a trap composed of 103 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:19:51] [INFO ] Deduced a trap composed of 143 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:19:51] [INFO ] Deduced a trap composed of 112 places in 388 ms of which 4 ms to minimize.
[2025-06-01 02:19:52] [INFO ] Deduced a trap composed of 105 places in 373 ms of which 4 ms to minimize.
[2025-06-01 02:19:52] [INFO ] Deduced a trap composed of 124 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:19:53] [INFO ] Deduced a trap composed of 142 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:19:54] [INFO ] Deduced a trap composed of 101 places in 381 ms of which 4 ms to minimize.
[2025-06-01 02:19:54] [INFO ] Deduced a trap composed of 135 places in 356 ms of which 4 ms to minimize.
[2025-06-01 02:19:55] [INFO ] Deduced a trap composed of 110 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:19:55] [INFO ] Deduced a trap composed of 132 places in 391 ms of which 4 ms to minimize.
[2025-06-01 02:19:55] [INFO ] Deduced a trap composed of 88 places in 394 ms of which 3 ms to minimize.
[2025-06-01 02:19:56] [INFO ] Deduced a trap composed of 115 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:19:56] [INFO ] Deduced a trap composed of 108 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:19:57] [INFO ] Deduced a trap composed of 99 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:19:57] [INFO ] Deduced a trap composed of 109 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:19:59] [INFO ] Deduced a trap composed of 146 places in 423 ms of which 4 ms to minimize.
[2025-06-01 02:19:59] [INFO ] Deduced a trap composed of 153 places in 391 ms of which 4 ms to minimize.
[2025-06-01 02:19:59] [INFO ] Deduced a trap composed of 152 places in 385 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:20:02] [INFO ] Deduced a trap composed of 105 places in 388 ms of which 3 ms to minimize.
[2025-06-01 02:20:03] [INFO ] Deduced a trap composed of 62 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:20:03] [INFO ] Deduced a trap composed of 146 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:20:04] [INFO ] Deduced a trap composed of 62 places in 369 ms of which 4 ms to minimize.
[2025-06-01 02:20:04] [INFO ] Deduced a trap composed of 66 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:20:04] [INFO ] Deduced a trap composed of 28 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:20:05] [INFO ] Deduced a trap composed of 101 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:20:05] [INFO ] Deduced a trap composed of 76 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:20:06] [INFO ] Deduced a trap composed of 89 places in 395 ms of which 3 ms to minimize.
[2025-06-01 02:20:06] [INFO ] Deduced a trap composed of 46 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:20:06] [INFO ] Deduced a trap composed of 66 places in 389 ms of which 3 ms to minimize.
[2025-06-01 02:20:07] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 1 ms to minimize.
[2025-06-01 02:20:11] [INFO ] Deduced a trap composed of 117 places in 359 ms of which 3 ms to minimize.
[2025-06-01 02:20:11] [INFO ] Deduced a trap composed of 85 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:20:11] [INFO ] Deduced a trap composed of 93 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:20:12] [INFO ] Deduced a trap composed of 98 places in 379 ms of which 4 ms to minimize.
[2025-06-01 02:20:12] [INFO ] Deduced a trap composed of 134 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:20:13] [INFO ] Deduced a trap composed of 126 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:20:13] [INFO ] Deduced a trap composed of 114 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:20:13] [INFO ] Deduced a trap composed of 118 places in 359 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:20:16] [INFO ] Deduced a trap composed of 3 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:20:18] [INFO ] Deduced a trap composed of 97 places in 379 ms of which 6 ms to minimize.
[2025-06-01 02:20:18] [INFO ] Deduced a trap composed of 29 places in 79 ms of which 3 ms to minimize.
[2025-06-01 02:20:18] [INFO ] Deduced a trap composed of 120 places in 332 ms of which 3 ms to minimize.
[2025-06-01 02:20:18] [INFO ] Deduced a trap composed of 137 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:20:19] [INFO ] Deduced a trap composed of 87 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:20:19] [INFO ] Deduced a trap composed of 111 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:20:20] [INFO ] Deduced a trap composed of 85 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:20:20] [INFO ] Deduced a trap composed of 84 places in 416 ms of which 3 ms to minimize.
[2025-06-01 02:20:21] [INFO ] Deduced a trap composed of 102 places in 388 ms of which 3 ms to minimize.
[2025-06-01 02:20:21] [INFO ] Deduced a trap composed of 98 places in 386 ms of which 3 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 111 places in 390 ms of which 3 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 118 places in 398 ms of which 3 ms to minimize.
[2025-06-01 02:20:22] [INFO ] Deduced a trap composed of 95 places in 402 ms of which 3 ms to minimize.
[2025-06-01 02:20:23] [INFO ] Deduced a trap composed of 94 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:20:23] [INFO ] Deduced a trap composed of 92 places in 396 ms of which 3 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 73 places in 394 ms of which 4 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 117 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:20:24] [INFO ] Deduced a trap composed of 116 places in 370 ms of which 3 ms to minimize.
[2025-06-01 02:20:25] [INFO ] Deduced a trap composed of 106 places in 371 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1964 variables, and 228 constraints, problems are : Problem set: 0 solved, 2263 unsolved in 105043 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 0/2263 constraints, Known Traps: 200/200 constraints]
After SMT, in 212031ms problems are : Problem set: 0 solved, 2263 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 303 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 118 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 118 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 1107852 steps (0 resets) in 120004 ms. (9 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 78 ms. (50 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 85 ms. (46 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 108 ms. (36 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 79 ms. (50 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 55 ms. (71 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 124 ms. (32 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 98 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 88 ms. (44 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 86 ms. (46 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 93 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 90 ms. (44 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 73 ms. (54 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 99 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 107 ms. (37 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 104 ms. (38 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 65 ms. (60 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2263/2263 properties
Interrupted probabilistic random walk after 745200 steps, run timeout after 93001 ms. (steps per millisecond=8 ) properties seen :0 out of 2263
Probabilistic random walk after 745200 steps, saw 522885 distinct states, run finished after 93003 ms. (steps per millisecond=8 ) properties seen :0
[2025-06-01 02:22:31] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:22:31] [INFO ] Invariant cache hit.
[2025-06-01 02:22:31] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 2 (OVERLAPS) 248/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:23:28] [INFO ] Deduced a trap composed of 38 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:23:29] [INFO ] Deduced a trap composed of 33 places in 364 ms of which 4 ms to minimize.
[2025-06-01 02:23:29] [INFO ] Deduced a trap composed of 116 places in 396 ms of which 3 ms to minimize.
[2025-06-01 02:23:30] [INFO ] Deduced a trap composed of 53 places in 389 ms of which 3 ms to minimize.
[2025-06-01 02:23:30] [INFO ] Deduced a trap composed of 61 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:23:30] [INFO ] Deduced a trap composed of 152 places in 392 ms of which 4 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 28 places in 372 ms of which 4 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 23 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:23:31] [INFO ] Deduced a trap composed of 120 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 29 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:23:32] [INFO ] Deduced a trap composed of 31 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:23:33] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:23:33] [INFO ] Deduced a trap composed of 39 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:23:33] [INFO ] Deduced a trap composed of 35 places in 369 ms of which 3 ms to minimize.
[2025-06-01 02:23:34] [INFO ] Deduced a trap composed of 37 places in 349 ms of which 4 ms to minimize.
[2025-06-01 02:23:34] [INFO ] Deduced a trap composed of 35 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:23:36] [INFO ] Deduced a trap composed of 30 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:23:36] [INFO ] Deduced a trap composed of 186 places in 390 ms of which 4 ms to minimize.
[2025-06-01 02:23:37] [INFO ] Deduced a trap composed of 39 places in 411 ms of which 4 ms to minimize.
[2025-06-01 02:23:37] [INFO ] Deduced a trap composed of 163 places in 400 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:23:38] [INFO ] Deduced a trap composed of 5 places in 395 ms of which 4 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 3 places in 389 ms of which 3 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 17 places in 245 ms of which 2 ms to minimize.
[2025-06-01 02:23:39] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:23:42] [INFO ] Deduced a trap composed of 57 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:23:42] [INFO ] Deduced a trap composed of 29 places in 94 ms of which 1 ms to minimize.
[2025-06-01 02:23:43] [INFO ] Deduced a trap composed of 57 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:23:43] [INFO ] Deduced a trap composed of 23 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:23:45] [INFO ] Deduced a trap composed of 93 places in 389 ms of which 3 ms to minimize.
[2025-06-01 02:23:46] [INFO ] Deduced a trap composed of 108 places in 418 ms of which 3 ms to minimize.
[2025-06-01 02:23:46] [INFO ] Deduced a trap composed of 91 places in 401 ms of which 3 ms to minimize.
[2025-06-01 02:23:47] [INFO ] Deduced a trap composed of 132 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:23:47] [INFO ] Deduced a trap composed of 133 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:23:47] [INFO ] Deduced a trap composed of 119 places in 358 ms of which 3 ms to minimize.
[2025-06-01 02:23:48] [INFO ] Deduced a trap composed of 119 places in 360 ms of which 4 ms to minimize.
[2025-06-01 02:23:48] [INFO ] Deduced a trap composed of 95 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:23:49] [INFO ] Deduced a trap composed of 104 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:23:49] [INFO ] Deduced a trap composed of 82 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:23:49] [INFO ] Deduced a trap composed of 75 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:23:50] [INFO ] Deduced a trap composed of 104 places in 356 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:23:53] [INFO ] Deduced a trap composed of 124 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:23:53] [INFO ] Deduced a trap composed of 128 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:23:54] [INFO ] Deduced a trap composed of 130 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:23:54] [INFO ] Deduced a trap composed of 130 places in 311 ms of which 4 ms to minimize.
[2025-06-01 02:23:55] [INFO ] Deduced a trap composed of 119 places in 384 ms of which 3 ms to minimize.
[2025-06-01 02:23:55] [INFO ] Deduced a trap composed of 130 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:23:56] [INFO ] Deduced a trap composed of 130 places in 429 ms of which 4 ms to minimize.
[2025-06-01 02:23:56] [INFO ] Deduced a trap composed of 111 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:23:56] [INFO ] Deduced a trap composed of 119 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:23:57] [INFO ] Deduced a trap composed of 142 places in 351 ms of which 4 ms to minimize.
[2025-06-01 02:23:57] [INFO ] Deduced a trap composed of 156 places in 393 ms of which 4 ms to minimize.
[2025-06-01 02:23:58] [INFO ] Deduced a trap composed of 139 places in 395 ms of which 6 ms to minimize.
[2025-06-01 02:23:58] [INFO ] Deduced a trap composed of 113 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:23:58] [INFO ] Deduced a trap composed of 90 places in 397 ms of which 4 ms to minimize.
[2025-06-01 02:23:59] [INFO ] Deduced a trap composed of 124 places in 386 ms of which 4 ms to minimize.
[2025-06-01 02:23:59] [INFO ] Deduced a trap composed of 101 places in 410 ms of which 4 ms to minimize.
[2025-06-01 02:24:00] [INFO ] Deduced a trap composed of 115 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:24:00] [INFO ] Deduced a trap composed of 122 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:24:00] [INFO ] Deduced a trap composed of 120 places in 383 ms of which 4 ms to minimize.
[2025-06-01 02:24:01] [INFO ] Deduced a trap composed of 114 places in 381 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/88 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:24:25] [INFO ] Deduced a trap composed of 106 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:24:26] [INFO ] Deduced a trap composed of 105 places in 426 ms of which 5 ms to minimize.
[2025-06-01 02:24:26] [INFO ] Deduced a trap composed of 104 places in 419 ms of which 3 ms to minimize.
[2025-06-01 02:24:26] [INFO ] Deduced a trap composed of 117 places in 408 ms of which 4 ms to minimize.
[2025-06-01 02:24:27] [INFO ] Deduced a trap composed of 119 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:24:27] [INFO ] Deduced a trap composed of 104 places in 418 ms of which 4 ms to minimize.
[2025-06-01 02:24:28] [INFO ] Deduced a trap composed of 135 places in 384 ms of which 4 ms to minimize.
[2025-06-01 02:24:28] [INFO ] Deduced a trap composed of 118 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:24:28] [INFO ] Deduced a trap composed of 103 places in 417 ms of which 4 ms to minimize.
[2025-06-01 02:24:29] [INFO ] Deduced a trap composed of 134 places in 391 ms of which 3 ms to minimize.
[2025-06-01 02:24:29] [INFO ] Deduced a trap composed of 131 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:24:30] [INFO ] Deduced a trap composed of 103 places in 400 ms of which 3 ms to minimize.
[2025-06-01 02:24:30] [INFO ] Deduced a trap composed of 157 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:24:30] [INFO ] Deduced a trap composed of 143 places in 347 ms of which 3 ms to minimize.
[2025-06-01 02:24:31] [INFO ] Deduced a trap composed of 119 places in 343 ms of which 3 ms to minimize.
[2025-06-01 02:24:31] [INFO ] Deduced a trap composed of 94 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:24:32] [INFO ] Deduced a trap composed of 115 places in 395 ms of which 4 ms to minimize.
[2025-06-01 02:24:32] [INFO ] Deduced a trap composed of 109 places in 398 ms of which 3 ms to minimize.
[2025-06-01 02:24:33] [INFO ] Deduced a trap composed of 78 places in 396 ms of which 3 ms to minimize.
[2025-06-01 02:24:33] [INFO ] Deduced a trap composed of 120 places in 356 ms of which 8 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/108 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 551/1964 variables, and 108 constraints, problems are : Problem set: 0 solved, 2263 unsolved in 120045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 2263/2263 constraints, Known Traps: 80/80 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2263 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 2 (OVERLAPS) 248/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/551 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/551 variables, 80/108 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:24:57] [INFO ] Deduced a trap composed of 159 places in 419 ms of which 4 ms to minimize.
[2025-06-01 02:24:57] [INFO ] Deduced a trap composed of 21 places in 424 ms of which 3 ms to minimize.
[2025-06-01 02:24:58] [INFO ] Deduced a trap composed of 68 places in 391 ms of which 3 ms to minimize.
[2025-06-01 02:24:58] [INFO ] Deduced a trap composed of 48 places in 342 ms of which 4 ms to minimize.
[2025-06-01 02:24:58] [INFO ] Deduced a trap composed of 70 places in 373 ms of which 4 ms to minimize.
[2025-06-01 02:24:59] [INFO ] Deduced a trap composed of 33 places in 345 ms of which 3 ms to minimize.
[2025-06-01 02:24:59] [INFO ] Deduced a trap composed of 27 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:25:00] [INFO ] Deduced a trap composed of 96 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:25:00] [INFO ] Deduced a trap composed of 92 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:25:00] [INFO ] Deduced a trap composed of 81 places in 356 ms of which 3 ms to minimize.
[2025-06-01 02:25:01] [INFO ] Deduced a trap composed of 80 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:25:01] [INFO ] Deduced a trap composed of 128 places in 320 ms of which 3 ms to minimize.
[2025-06-01 02:25:01] [INFO ] Deduced a trap composed of 125 places in 381 ms of which 3 ms to minimize.
[2025-06-01 02:25:02] [INFO ] Deduced a trap composed of 126 places in 380 ms of which 3 ms to minimize.
[2025-06-01 02:25:02] [INFO ] Deduced a trap composed of 114 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:25:03] [INFO ] Deduced a trap composed of 149 places in 426 ms of which 3 ms to minimize.
[2025-06-01 02:25:03] [INFO ] Deduced a trap composed of 119 places in 392 ms of which 4 ms to minimize.
[2025-06-01 02:25:04] [INFO ] Deduced a trap composed of 121 places in 389 ms of which 4 ms to minimize.
[2025-06-01 02:25:04] [INFO ] Deduced a trap composed of 128 places in 387 ms of which 3 ms to minimize.
[2025-06-01 02:25:05] [INFO ] Deduced a trap composed of 119 places in 420 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/551 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:25:07] [INFO ] Deduced a trap composed of 19 places in 411 ms of which 4 ms to minimize.
[2025-06-01 02:25:07] [INFO ] Deduced a trap composed of 99 places in 404 ms of which 3 ms to minimize.
[2025-06-01 02:25:08] [INFO ] Deduced a trap composed of 92 places in 409 ms of which 4 ms to minimize.
[2025-06-01 02:25:08] [INFO ] Deduced a trap composed of 40 places in 406 ms of which 3 ms to minimize.
[2025-06-01 02:25:08] [INFO ] Deduced a trap composed of 3 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:25:09] [INFO ] Deduced a trap composed of 117 places in 390 ms of which 3 ms to minimize.
[2025-06-01 02:25:09] [INFO ] Deduced a trap composed of 89 places in 391 ms of which 3 ms to minimize.
[2025-06-01 02:25:10] [INFO ] Deduced a trap composed of 35 places in 402 ms of which 3 ms to minimize.
[2025-06-01 02:25:10] [INFO ] Deduced a trap composed of 3 places in 393 ms of which 3 ms to minimize.
[2025-06-01 02:25:10] [INFO ] Deduced a trap composed of 5 places in 388 ms of which 4 ms to minimize.
[2025-06-01 02:25:11] [INFO ] Deduced a trap composed of 132 places in 394 ms of which 3 ms to minimize.
[2025-06-01 02:25:11] [INFO ] Deduced a trap composed of 138 places in 438 ms of which 3 ms to minimize.
[2025-06-01 02:25:12] [INFO ] Deduced a trap composed of 128 places in 403 ms of which 4 ms to minimize.
[2025-06-01 02:25:12] [INFO ] Deduced a trap composed of 113 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:25:13] [INFO ] Deduced a trap composed of 103 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:25:13] [INFO ] Deduced a trap composed of 112 places in 377 ms of which 3 ms to minimize.
[2025-06-01 02:25:13] [INFO ] Deduced a trap composed of 98 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:25:14] [INFO ] Deduced a trap composed of 141 places in 324 ms of which 3 ms to minimize.
[2025-06-01 02:25:14] [INFO ] Deduced a trap composed of 165 places in 334 ms of which 3 ms to minimize.
[2025-06-01 02:25:14] [INFO ] Deduced a trap composed of 93 places in 323 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/551 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:25:17] [INFO ] Deduced a trap composed of 114 places in 399 ms of which 3 ms to minimize.
[2025-06-01 02:25:17] [INFO ] Deduced a trap composed of 27 places in 410 ms of which 4 ms to minimize.
[2025-06-01 02:25:18] [INFO ] Deduced a trap composed of 34 places in 407 ms of which 4 ms to minimize.
[2025-06-01 02:25:18] [INFO ] Deduced a trap composed of 31 places in 389 ms of which 4 ms to minimize.
[2025-06-01 02:25:18] [INFO ] Deduced a trap composed of 28 places in 389 ms of which 3 ms to minimize.
[2025-06-01 02:25:19] [INFO ] Deduced a trap composed of 94 places in 395 ms of which 3 ms to minimize.
[2025-06-01 02:25:19] [INFO ] Deduced a trap composed of 116 places in 402 ms of which 4 ms to minimize.
[2025-06-01 02:25:20] [INFO ] Deduced a trap composed of 88 places in 392 ms of which 3 ms to minimize.
[2025-06-01 02:25:20] [INFO ] Deduced a trap composed of 101 places in 382 ms of which 4 ms to minimize.
[2025-06-01 02:25:20] [INFO ] Deduced a trap composed of 166 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:25:21] [INFO ] Deduced a trap composed of 94 places in 368 ms of which 3 ms to minimize.
[2025-06-01 02:25:21] [INFO ] Deduced a trap composed of 3 places in 380 ms of which 4 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 101 places in 381 ms of which 3 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 30 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:25:22] [INFO ] Deduced a trap composed of 129 places in 368 ms of which 3 ms to minimize.
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 107 places in 398 ms of which 4 ms to minimize.
[2025-06-01 02:25:23] [INFO ] Deduced a trap composed of 32 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:25:24] [INFO ] Deduced a trap composed of 25 places in 359 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/551 variables, 20/168 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:25:26] [INFO ] Deduced a trap composed of 120 places in 365 ms of which 4 ms to minimize.
[2025-06-01 02:25:26] [INFO ] Deduced a trap composed of 95 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 4 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 3 places in 337 ms of which 3 ms to minimize.
[2025-06-01 02:25:27] [INFO ] Deduced a trap composed of 30 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 28 places in 371 ms of which 4 ms to minimize.
[2025-06-01 02:25:28] [INFO ] Deduced a trap composed of 52 places in 339 ms of which 3 ms to minimize.
[2025-06-01 02:25:29] [INFO ] Deduced a trap composed of 92 places in 377 ms of which 4 ms to minimize.
[2025-06-01 02:25:32] [INFO ] Deduced a trap composed of 204 places in 415 ms of which 5 ms to minimize.
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 194 places in 403 ms of which 3 ms to minimize.
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 155 places in 362 ms of which 3 ms to minimize.
[2025-06-01 02:25:33] [INFO ] Deduced a trap composed of 131 places in 359 ms of which 4 ms to minimize.
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 103 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:25:34] [INFO ] Deduced a trap composed of 146 places in 393 ms of which 4 ms to minimize.
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 140 places in 392 ms of which 4 ms to minimize.
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 146 places in 388 ms of which 4 ms to minimize.
[2025-06-01 02:25:35] [INFO ] Deduced a trap composed of 148 places in 361 ms of which 4 ms to minimize.
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 122 places in 331 ms of which 3 ms to minimize.
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 124 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:25:36] [INFO ] Deduced a trap composed of 128 places in 323 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/551 variables, 20/188 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:25:39] [INFO ] Deduced a trap composed of 28 places in 305 ms of which 3 ms to minimize.
[2025-06-01 02:25:39] [INFO ] Deduced a trap composed of 36 places in 318 ms of which 3 ms to minimize.
[2025-06-01 02:25:42] [INFO ] Deduced a trap composed of 118 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:25:42] [INFO ] Deduced a trap composed of 129 places in 340 ms of which 3 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 128 places in 365 ms of which 3 ms to minimize.
[2025-06-01 02:25:43] [INFO ] Deduced a trap composed of 102 places in 407 ms of which 4 ms to minimize.
[2025-06-01 02:25:44] [INFO ] Deduced a trap composed of 72 places in 385 ms of which 3 ms to minimize.
[2025-06-01 02:25:44] [INFO ] Deduced a trap composed of 100 places in 393 ms of which 3 ms to minimize.
[2025-06-01 02:25:45] [INFO ] Deduced a trap composed of 126 places in 378 ms of which 4 ms to minimize.
[2025-06-01 02:25:45] [INFO ] Deduced a trap composed of 111 places in 357 ms of which 4 ms to minimize.
[2025-06-01 02:25:45] [INFO ] Deduced a trap composed of 111 places in 410 ms of which 3 ms to minimize.
[2025-06-01 02:25:46] [INFO ] Deduced a trap composed of 118 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:25:46] [INFO ] Deduced a trap composed of 25 places in 405 ms of which 4 ms to minimize.
[2025-06-01 02:25:47] [INFO ] Deduced a trap composed of 117 places in 335 ms of which 3 ms to minimize.
[2025-06-01 02:25:47] [INFO ] Deduced a trap composed of 116 places in 393 ms of which 3 ms to minimize.
[2025-06-01 02:25:48] [INFO ] Deduced a trap composed of 121 places in 398 ms of which 3 ms to minimize.
[2025-06-01 02:25:48] [INFO ] Deduced a trap composed of 142 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:25:49] [INFO ] Deduced a trap composed of 105 places in 371 ms of which 3 ms to minimize.
[2025-06-01 02:25:49] [INFO ] Deduced a trap composed of 135 places in 388 ms of which 3 ms to minimize.
[2025-06-01 02:25:50] [INFO ] Deduced a trap composed of 136 places in 384 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/551 variables, 20/208 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:25:53] [INFO ] Deduced a trap composed of 167 places in 348 ms of which 3 ms to minimize.
[2025-06-01 02:25:53] [INFO ] Deduced a trap composed of 131 places in 438 ms of which 4 ms to minimize.
[2025-06-01 02:25:54] [INFO ] Deduced a trap composed of 166 places in 376 ms of which 3 ms to minimize.
[2025-06-01 02:25:54] [INFO ] Deduced a trap composed of 93 places in 375 ms of which 4 ms to minimize.
[2025-06-01 02:25:54] [INFO ] Deduced a trap composed of 90 places in 368 ms of which 3 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 175 places in 395 ms of which 3 ms to minimize.
[2025-06-01 02:25:55] [INFO ] Deduced a trap composed of 90 places in 357 ms of which 4 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 141 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 142 places in 327 ms of which 3 ms to minimize.
[2025-06-01 02:25:56] [INFO ] Deduced a trap composed of 131 places in 375 ms of which 3 ms to minimize.
[2025-06-01 02:25:57] [INFO ] Deduced a trap composed of 118 places in 338 ms of which 3 ms to minimize.
[2025-06-01 02:25:57] [INFO ] Deduced a trap composed of 163 places in 337 ms of which 3 ms to minimize.
[2025-06-01 02:25:57] [INFO ] Deduced a trap composed of 129 places in 357 ms of which 3 ms to minimize.
[2025-06-01 02:25:58] [INFO ] Deduced a trap composed of 124 places in 312 ms of which 3 ms to minimize.
[2025-06-01 02:25:58] [INFO ] Deduced a trap composed of 124 places in 306 ms of which 3 ms to minimize.
[2025-06-01 02:25:58] [INFO ] Deduced a trap composed of 85 places in 304 ms of which 3 ms to minimize.
[2025-06-01 02:25:59] [INFO ] Deduced a trap composed of 166 places in 300 ms of which 2 ms to minimize.
[2025-06-01 02:25:59] [INFO ] Deduced a trap composed of 132 places in 352 ms of which 4 ms to minimize.
[2025-06-01 02:26:00] [INFO ] Deduced a trap composed of 125 places in 291 ms of which 2 ms to minimize.
[2025-06-01 02:26:00] [INFO ] Deduced a trap composed of 149 places in 387 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/551 variables, 20/228 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:26:03] [INFO ] Deduced a trap composed of 3 places in 372 ms of which 3 ms to minimize.
[2025-06-01 02:26:03] [INFO ] Deduced a trap composed of 118 places in 362 ms of which 4 ms to minimize.
[2025-06-01 02:26:04] [INFO ] Deduced a trap composed of 103 places in 355 ms of which 3 ms to minimize.
[2025-06-01 02:26:04] [INFO ] Deduced a trap composed of 145 places in 387 ms of which 4 ms to minimize.
[2025-06-01 02:26:05] [INFO ] Deduced a trap composed of 98 places in 423 ms of which 4 ms to minimize.
[2025-06-01 02:26:05] [INFO ] Deduced a trap composed of 103 places in 402 ms of which 4 ms to minimize.
[2025-06-01 02:26:06] [INFO ] Deduced a trap composed of 86 places in 364 ms of which 3 ms to minimize.
[2025-06-01 02:26:06] [INFO ] Deduced a trap composed of 76 places in 339 ms of which 2 ms to minimize.
[2025-06-01 02:26:06] [INFO ] Deduced a trap composed of 119 places in 360 ms of which 3 ms to minimize.
[2025-06-01 02:26:07] [INFO ] Deduced a trap composed of 107 places in 383 ms of which 3 ms to minimize.
[2025-06-01 02:26:07] [INFO ] Deduced a trap composed of 55 places in 361 ms of which 3 ms to minimize.
[2025-06-01 02:26:08] [INFO ] Deduced a trap composed of 120 places in 337 ms of which 3 ms to minimize.
[2025-06-01 02:26:08] [INFO ] Deduced a trap composed of 20 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:26:08] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 4 ms to minimize.
[2025-06-01 02:26:09] [INFO ] Deduced a trap composed of 138 places in 382 ms of which 3 ms to minimize.
[2025-06-01 02:26:09] [INFO ] Deduced a trap composed of 131 places in 385 ms of which 4 ms to minimize.
[2025-06-01 02:26:09] [INFO ] Deduced a trap composed of 121 places in 342 ms of which 3 ms to minimize.
[2025-06-01 02:26:10] [INFO ] Deduced a trap composed of 34 places in 358 ms of which 4 ms to minimize.
[2025-06-01 02:26:10] [INFO ] Deduced a trap composed of 106 places in 366 ms of which 3 ms to minimize.
[2025-06-01 02:26:11] [INFO ] Deduced a trap composed of 113 places in 341 ms of which 4 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/551 variables, 20/248 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:26:18] [INFO ] Deduced a trap composed of 90 places in 373 ms of which 3 ms to minimize.
[2025-06-01 02:26:18] [INFO ] Deduced a trap composed of 85 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:26:19] [INFO ] Deduced a trap composed of 37 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:26:20] [INFO ] Deduced a trap composed of 93 places in 385 ms of which 3 ms to minimize.
[2025-06-01 02:26:20] [INFO ] Deduced a trap composed of 68 places in 378 ms of which 3 ms to minimize.
[2025-06-01 02:26:21] [INFO ] Deduced a trap composed of 113 places in 344 ms of which 3 ms to minimize.
[2025-06-01 02:26:21] [INFO ] Deduced a trap composed of 96 places in 325 ms of which 3 ms to minimize.
[2025-06-01 02:26:21] [INFO ] Deduced a trap composed of 121 places in 371 ms of which 4 ms to minimize.
[2025-06-01 02:26:22] [INFO ] Deduced a trap composed of 126 places in 353 ms of which 4 ms to minimize.
[2025-06-01 02:26:22] [INFO ] Deduced a trap composed of 154 places in 382 ms of which 4 ms to minimize.
[2025-06-01 02:26:23] [INFO ] Deduced a trap composed of 112 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:26:23] [INFO ] Deduced a trap composed of 111 places in 407 ms of which 3 ms to minimize.
[2025-06-01 02:26:23] [INFO ] Deduced a trap composed of 97 places in 363 ms of which 3 ms to minimize.
[2025-06-01 02:26:24] [INFO ] Deduced a trap composed of 86 places in 411 ms of which 3 ms to minimize.
[2025-06-01 02:26:24] [INFO ] Deduced a trap composed of 113 places in 405 ms of which 3 ms to minimize.
[2025-06-01 02:26:25] [INFO ] Deduced a trap composed of 122 places in 384 ms of which 3 ms to minimize.
[2025-06-01 02:26:25] [INFO ] Deduced a trap composed of 113 places in 343 ms of which 4 ms to minimize.
[2025-06-01 02:26:26] [INFO ] Deduced a trap composed of 120 places in 354 ms of which 4 ms to minimize.
[2025-06-01 02:26:26] [INFO ] Deduced a trap composed of 112 places in 406 ms of which 3 ms to minimize.
[2025-06-01 02:26:26] [INFO ] Deduced a trap composed of 134 places in 324 ms of which 3 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/551 variables, 20/268 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
[2025-06-01 02:26:30] [INFO ] Deduced a trap composed of 105 places in 374 ms of which 3 ms to minimize.
[2025-06-01 02:26:30] [INFO ] Deduced a trap composed of 68 places in 367 ms of which 3 ms to minimize.
[2025-06-01 02:26:31] [INFO ] Deduced a trap composed of 56 places in 369 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 551/1964 variables, and 271 constraints, problems are : Problem set: 0 solved, 2263 unsolved in 120064 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/551 constraints, ReadFeed: 0/876 constraints, PredecessorRefiner: 0/2263 constraints, Known Traps: 243/243 constraints]
After SMT, in 242054ms problems are : Problem set: 0 solved, 2263 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 303 out of 551 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 124 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 124 ms. Remains : 551/551 places, 3492/3492 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 551/551 places, 3492/3492 transitions.
Applied a total of 0 rules in 124 ms. Remains 551 /551 variables (removed 0) and now considering 3492/3492 (removed 0) transitions.
[2025-06-01 02:26:34] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:26:34] [INFO ] Invariant cache hit.
[2025-06-01 02:26:34] [INFO ] Implicit Places using invariants in 227 ms returned []
[2025-06-01 02:26:34] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:26:34] [INFO ] Invariant cache hit.
[2025-06-01 02:26:34] [INFO ] State equation strengthened by 876 read => feed constraints.
[2025-06-01 02:26:36] [INFO ] Implicit Places using invariants and state equation in 1635 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
[2025-06-01 02:26:36] [INFO ] Redundant transitions in 194 ms returned []
Running 3483 sub problems to find dead transitions.
[2025-06-01 02:26:36] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:26:36] [INFO ] Invariant cache hit.
[2025-06-01 02:26:36] [INFO ] State equation strengthened by 876 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 3483 unsolved
SMT process timed out in 32816ms, After SMT, problems are : Problem set: 0 solved, 3483 unsolved
Search for dead transitions found 0 dead transitions in 32854ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35055 ms. Remains : 551/551 places, 3492/3492 transitions.
RANDOM walk for 400000 steps (8 resets) in 9934 ms. (40 steps per ms) remains 149/303 properties
Running SMT prover for 149 properties.
[2025-06-01 02:27:12] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:27:12] [INFO ] Invariant cache hit.
[2025-06-01 02:27:13] [INFO ] [Real]Absence check using 19 positive place invariants in 23 ms returned sat
[2025-06-01 02:27:13] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-01 02:27:13] [INFO ] After 549ms SMT Verify possible using state equation in real domain returned unsat :0 sat :149
[2025-06-01 02:27:13] [INFO ] State equation strengthened by 876 read => feed constraints.
[2025-06-01 02:27:14] [INFO ] After 1092ms SMT Verify possible using 876 Read/Feed constraints in real domain returned unsat :0 sat :149
TRAPS : Iteration 0
[2025-06-01 02:27:26] [INFO ] After 12695ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:149
[2025-06-01 02:27:26] [INFO ] After 13507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:149
[2025-06-01 02:27:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 10 ms returned sat
[2025-06-01 02:27:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-01 02:27:27] [INFO ] After 514ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :149
[2025-06-01 02:27:28] [INFO ] After 1415ms SMT Verify possible using 876 Read/Feed constraints in natural domain returned unsat :0 sat :149
TRAPS : Iteration 0
[2025-06-01 02:27:28] [INFO ] Deduced a trap composed of 3 places in 336 ms of which 3 ms to minimize.
[2025-06-01 02:27:29] [INFO ] Deduced a trap composed of 35 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:27:29] [INFO ] Deduced a trap composed of 40 places in 280 ms of which 2 ms to minimize.
[2025-06-01 02:27:29] [INFO ] Deduced a trap composed of 29 places in 278 ms of which 3 ms to minimize.
[2025-06-01 02:27:30] [INFO ] Deduced a trap composed of 28 places in 283 ms of which 3 ms to minimize.
[2025-06-01 02:27:30] [INFO ] Deduced a trap composed of 3 places in 203 ms of which 2 ms to minimize.
[2025-06-01 02:27:30] [INFO ] Deduced a trap composed of 39 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:27:31] [INFO ] Deduced a trap composed of 35 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:27:31] [INFO ] Deduced a trap composed of 48 places in 296 ms of which 3 ms to minimize.
[2025-06-01 02:27:31] [INFO ] Deduced a trap composed of 25 places in 297 ms of which 3 ms to minimize.
[2025-06-01 02:27:32] [INFO ] Deduced a trap composed of 27 places in 257 ms of which 3 ms to minimize.
[2025-06-01 02:27:32] [INFO ] Deduced a trap composed of 23 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:27:32] [INFO ] Deduced a trap composed of 19 places in 263 ms of which 3 ms to minimize.
[2025-06-01 02:27:32] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4109 ms
[2025-06-01 02:27:32] [INFO ] Deduced a trap composed of 3 places in 200 ms of which 2 ms to minimize.
[2025-06-01 02:27:33] [INFO ] Deduced a trap composed of 3 places in 183 ms of which 1 ms to minimize.
[2025-06-01 02:27:33] [INFO ] Deduced a trap composed of 3 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:27:33] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:27:33] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 813 ms
[2025-06-01 02:27:33] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:27:33] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 0 ms to minimize.
[2025-06-01 02:27:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 281 ms
[2025-06-01 02:27:34] [INFO ] Deduced a trap composed of 35 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:27:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2025-06-01 02:27:34] [INFO ] Deduced a trap composed of 69 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:27:34] [INFO ] Deduced a trap composed of 43 places in 177 ms of which 1 ms to minimize.
[2025-06-01 02:27:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 475 ms
[2025-06-01 02:27:34] [INFO ] Deduced a trap composed of 3 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:27:35] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 0 ms to minimize.
[2025-06-01 02:27:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2025-06-01 02:27:35] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 2 ms to minimize.
[2025-06-01 02:27:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 197 ms
[2025-06-01 02:27:36] [INFO ] Deduced a trap composed of 15 places in 213 ms of which 2 ms to minimize.
[2025-06-01 02:27:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 292 ms
[2025-06-01 02:27:37] [INFO ] Deduced a trap composed of 75 places in 306 ms of which 3 ms to minimize.
[2025-06-01 02:27:37] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 1 ms to minimize.
[2025-06-01 02:27:37] [INFO ] Deduced a trap composed of 89 places in 308 ms of which 3 ms to minimize.
[2025-06-01 02:27:37] [INFO ] Deduced a trap composed of 118 places in 258 ms of which 3 ms to minimize.
[2025-06-01 02:27:37] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1218 ms
[2025-06-01 02:27:38] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 2 ms to minimize.
[2025-06-01 02:27:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 214 ms
[2025-06-01 02:27:39] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:27:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-06-01 02:27:40] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 2 ms to minimize.
[2025-06-01 02:27:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 215 ms
[2025-06-01 02:27:41] [INFO ] Deduced a trap composed of 31 places in 123 ms of which 1 ms to minimize.
[2025-06-01 02:27:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-06-01 02:27:42] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 2 ms to minimize.
[2025-06-01 02:27:42] [INFO ] Deduced a trap composed of 25 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:27:42] [INFO ] Deduced a trap composed of 21 places in 83 ms of which 0 ms to minimize.
[2025-06-01 02:27:43] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2025-06-01 02:27:43] [INFO ] Deduced a trap composed of 51 places in 123 ms of which 2 ms to minimize.
[2025-06-01 02:27:43] [INFO ] Deduced a trap composed of 13 places in 106 ms of which 1 ms to minimize.
[2025-06-01 02:27:43] [INFO ] Deduced a trap composed of 15 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:27:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 484 ms
[2025-06-01 02:27:44] [INFO ] Deduced a trap composed of 20 places in 87 ms of which 1 ms to minimize.
[2025-06-01 02:27:44] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:27:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2025-06-01 02:27:45] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 0 ms to minimize.
[2025-06-01 02:27:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 177 ms
[2025-06-01 02:27:45] [INFO ] Deduced a trap composed of 35 places in 88 ms of which 1 ms to minimize.
[2025-06-01 02:27:45] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 1 ms to minimize.
[2025-06-01 02:27:45] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 1 ms to minimize.
[2025-06-01 02:27:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 446 ms
[2025-06-01 02:27:46] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 1 ms to minimize.
[2025-06-01 02:27:46] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 181 ms
[2025-06-01 02:27:46] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2025-06-01 02:27:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 191 ms
[2025-06-01 02:27:48] [INFO ] Deduced a trap composed of 27 places in 106 ms of which 1 ms to minimize.
[2025-06-01 02:27:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 193 ms
[2025-06-01 02:27:49] [INFO ] Deduced a trap composed of 33 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:27:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-01 02:27:50] [INFO ] Deduced a trap composed of 57 places in 119 ms of which 2 ms to minimize.
[2025-06-01 02:27:50] [INFO ] Deduced a trap composed of 23 places in 131 ms of which 1 ms to minimize.
[2025-06-01 02:27:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 396 ms
[2025-06-01 02:27:51] [INFO ] Deduced a trap composed of 33 places in 135 ms of which 1 ms to minimize.
[2025-06-01 02:27:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2025-06-01 02:27:51] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 1 ms to minimize.
[2025-06-01 02:27:51] [INFO ] Deduced a trap composed of 29 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:27:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 340 ms
[2025-06-01 02:27:51] [INFO ] Deduced a trap composed of 59 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:27:52] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 0 ms to minimize.
[2025-06-01 02:27:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 319 ms
TRAPS : Iteration 1
[2025-06-01 02:27:53] [INFO ] Deduced a trap composed of 21 places in 126 ms of which 1 ms to minimize.
[2025-06-01 02:27:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2025-06-01 02:27:54] [INFO ] Deduced a trap composed of 25 places in 136 ms of which 1 ms to minimize.
[2025-06-01 02:27:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2025-06-01 02:27:55] [INFO ] Deduced a trap composed of 28 places in 113 ms of which 1 ms to minimize.
[2025-06-01 02:27:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 199 ms
[2025-06-01 02:27:59] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 178 ms
[2025-06-01 02:27:59] [INFO ] Deduced a trap composed of 31 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:27:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 190 ms
[2025-06-01 02:28:00] [INFO ] Deduced a trap composed of 116 places in 329 ms of which 3 ms to minimize.
[2025-06-01 02:28:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 440 ms
[2025-06-01 02:28:00] [INFO ] Deduced a trap composed of 118 places in 351 ms of which 3 ms to minimize.
[2025-06-01 02:28:01] [INFO ] Deduced a trap composed of 101 places in 346 ms of which 3 ms to minimize.
[2025-06-01 02:28:01] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 852 ms
TRAPS : Iteration 2
[2025-06-01 02:28:07] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:28:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 221 ms
[2025-06-01 02:28:08] [INFO ] Deduced a trap composed of 25 places in 120 ms of which 1 ms to minimize.
[2025-06-01 02:28:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 209 ms
[2025-06-01 02:28:09] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:28:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 218 ms
[2025-06-01 02:28:12] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 1 ms to minimize.
[2025-06-01 02:28:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 242 ms
TRAPS : Iteration 3
[2025-06-01 02:28:29] [INFO ] After 62742ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :149
[2025-06-01 02:28:31] [INFO ] After 65167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :149
RANDOM walk for 446738 steps (0 resets) in 120004 ms. (3 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 77 ms. (51 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 142 ms. (28 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 94 ms. (42 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 80 ms. (49 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 87 ms. (45 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 102 ms. (38 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 174 ms. (22 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 96 ms. (41 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 92 ms. (43 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 118 ms. (33 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 109 ms. (36 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 82 ms. (48 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 75 ms. (52 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 68 ms. (58 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 122 ms. (32 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 110 ms. (36 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 72 ms. (54 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 53 ms. (74 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 64 ms. (61 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 67 ms. (58 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 62 ms. (63 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 61 ms. (64 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 57 ms. (69 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 153 ms. (26 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 83 ms. (47 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 97 ms. (40 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 103 ms. (38 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 70 ms. (56 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 126 ms. (31 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 100 ms. (39 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 76 ms. (52 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 105 ms. (37 steps per ms) remains 2263/2263 properties
BEST_FIRST walk for 4004 steps (8 resets) in 114 ms. (34 steps per ms) remains 2263/2263 properties
Interrupted probabilistic random walk after 741890 steps, run timeout after 93009 ms. (steps per millisecond=7 ) properties seen :0 out of 2263
Probabilistic random walk after 741890 steps, saw 520678 distinct states, run finished after 93010 ms. (steps per millisecond=7 ) properties seen :0
[2025-06-01 02:30:36] [INFO ] Flow matrix only has 1413 transitions (discarded 2079 similar events)
[2025-06-01 02:30:36] [INFO ] Invariant cache hit.
[2025-06-01 02:30:36] [INFO ] State equation strengthened by 876 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/303 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/303 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2263 unsolved
At refinement iteration 2 (OVERLAPS) 248/551 variables, 18/19 constraints. Problems are: Problem set: 0 solved, 2263 unsolved

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-09"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
echo " Input is EisenbergMcGuire-PT-09, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r084-tall-174860080700504"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-09.tgz
mv EisenbergMcGuire-PT-09 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;