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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K 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.1K 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 6.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 53K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 255K 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 1748741158784

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-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:26:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2025-06-01 01:26:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:26:00] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2025-06-01 01:26:00] [INFO ] Transformed 196 places.
[2025-06-01 01:26:00] [INFO ] Transformed 448 transitions.
[2025-06-01 01:26:00] [INFO ] Found NUPN structural information;
[2025-06-01 01:26:00] [INFO ] Parsed PT model containing 196 places and 448 transitions and 1952 arcs in 219 ms.
Built sparse matrix representations for Structural reductions in 6 ms.16559KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 196/196 places, 448/448 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 49 ms. Remains 196 /196 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 64 ms. Remains : 196/196 places, 448/448 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 196/196 places, 448/448 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 25 ms. Remains 196 /196 variables (removed 0) and now considering 448/448 (removed 0) transitions.
[2025-06-01 01:26:00] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
// Phase 1: matrix 284 rows 196 cols
[2025-06-01 01:26:00] [INFO ] Computed 13 invariants in 19 ms
[2025-06-01 01:26:01] [INFO ] Implicit Places using invariants in 233 ms returned []
[2025-06-01 01:26:01] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
[2025-06-01 01:26:01] [INFO ] Invariant cache hit.
[2025-06-01 01:26:01] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 01:26:01] [INFO ] Implicit Places using invariants and state equation in 176 ms returned []
Implicit Place search using SMT with State Equation took 446 ms to find 0 implicit places.
[2025-06-01 01:26:01] [INFO ] Redundant transitions in 22 ms returned []
Running 444 sub problems to find dead transitions.
[2025-06-01 01:26:01] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
[2025-06-01 01:26:01] [INFO ] Invariant cache hit.
[2025-06-01 01:26:01] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 9/205 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 16 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 4 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 65 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:26:03] [INFO ] Deduced a trap composed of 51 places in 65 ms of which 2 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 35 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 45 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 54 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:26:04] [INFO ] Deduced a trap composed of 60 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:26:05] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:26:05] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2025-06-01 01:26:05] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 01:26:05] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 20/229 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 71 places in 89 ms of which 2 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 66 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 43 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:26:07] [INFO ] Deduced a trap composed of 61 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 61 places in 61 ms of which 2 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 56 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 45 places in 85 ms of which 2 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 69 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 2 ms to minimize.
[2025-06-01 01:26:08] [INFO ] Deduced a trap composed of 49 places in 74 ms of which 2 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 50 places in 75 ms of which 2 ms to minimize.
[2025-06-01 01:26:09] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 20/249 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 32 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 57 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 32 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:26:10] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2025-06-01 01:26:11] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 46 places in 72 ms of which 2 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 1 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 39 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:26:12] [INFO ] Deduced a trap composed of 37 places in 70 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 11/260 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:13] [INFO ] Deduced a trap composed of 69 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:26:13] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2025-06-01 01:26:13] [INFO ] Deduced a trap composed of 37 places in 72 ms of which 1 ms to minimize.
[2025-06-01 01:26:14] [INFO ] Deduced a trap composed of 53 places in 82 ms of which 2 ms to minimize.
[2025-06-01 01:26:14] [INFO ] Deduced a trap composed of 33 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:26:14] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 5 ms to minimize.
[2025-06-01 01:26:14] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:26:14] [INFO ] Deduced a trap composed of 50 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:26:15] [INFO ] Deduced a trap composed of 51 places in 74 ms of which 1 ms to minimize.
[2025-06-01 01:26:15] [INFO ] Deduced a trap composed of 46 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:15] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:26:15] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 1 ms to minimize.
[2025-06-01 01:26:16] [INFO ] Deduced a trap composed of 49 places in 67 ms of which 2 ms to minimize.
[2025-06-01 01:26:16] [INFO ] Deduced a trap composed of 61 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:16] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:26:16] [INFO ] Deduced a trap composed of 68 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:26:16] [INFO ] Deduced a trap composed of 43 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:16] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 18/278 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:19] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:26:20] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:26:21] [INFO ] Deduced a trap composed of 61 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 3/281 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 58 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:22] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:25] [INFO ] Deduced a trap composed of 46 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:25] [INFO ] Deduced a trap composed of 50 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 46 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:28] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 196/480 variables, and 288 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30025 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 0/196 constraints, ReadFeed: 0/112 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 79/79 constraints]
Escalating to Integer solving :Problem set: 0 solved, 444 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/196 variables, 196/196 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/196 variables, 9/205 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/196 variables, 4/209 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/196 variables, 79/288 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 49 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:26:32] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:26:35] [INFO ] Deduced a trap composed of 49 places in 85 ms of which 1 ms to minimize.
[2025-06-01 01:26:35] [INFO ] Deduced a trap composed of 43 places in 81 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/196 variables, 4/292 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:36] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:26:37] [INFO ] Deduced a trap composed of 47 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:26:37] [INFO ] Deduced a trap composed of 51 places in 84 ms of which 2 ms to minimize.
[2025-06-01 01:26:37] [INFO ] Deduced a trap composed of 53 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:26:38] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 1 ms to minimize.
[2025-06-01 01:26:38] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/196 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:39] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 1 ms to minimize.
[2025-06-01 01:26:40] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:26:40] [INFO ] Deduced a trap composed of 47 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:41] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:26:41] [INFO ] Deduced a trap composed of 66 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:41] [INFO ] Deduced a trap composed of 55 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:41] [INFO ] Deduced a trap composed of 56 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:26:41] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 1 ms to minimize.
[2025-06-01 01:26:41] [INFO ] Deduced a trap composed of 40 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:26:41] [INFO ] Deduced a trap composed of 38 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:26:42] [INFO ] Deduced a trap composed of 44 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:26:42] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:26:42] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-06-01 01:26:42] [INFO ] Deduced a trap composed of 38 places in 78 ms of which 2 ms to minimize.
[2025-06-01 01:26:42] [INFO ] Deduced a trap composed of 59 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:26:42] [INFO ] Deduced a trap composed of 43 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:43] [INFO ] Deduced a trap composed of 49 places in 64 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/196 variables, 17/315 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:44] [INFO ] Deduced a trap composed of 52 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:45] [INFO ] Deduced a trap composed of 56 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:26:45] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:26:45] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 2 ms to minimize.
[2025-06-01 01:26:45] [INFO ] Deduced a trap composed of 56 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:46] [INFO ] Deduced a trap composed of 46 places in 61 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/196 variables, 6/321 constraints. Problems are: Problem set: 0 solved, 444 unsolved
[2025-06-01 01:26:49] [INFO ] Deduced a trap composed of 68 places in 65 ms of which 2 ms to minimize.
[2025-06-01 01:26:49] [INFO ] Deduced a trap composed of 57 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:26:49] [INFO ] Deduced a trap composed of 62 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:26:50] [INFO ] Deduced a trap composed of 59 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:26:50] [INFO ] Deduced a trap composed of 62 places in 61 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/196 variables, 5/326 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/196 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 10 (OVERLAPS) 284/480 variables, 196/522 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/480 variables, 112/634 constraints. Problems are: Problem set: 0 solved, 444 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/480 variables, 444/1078 constraints. Problems are: Problem set: 0 solved, 444 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/480 variables, and 1078 constraints, problems are : Problem set: 0 solved, 444 unsolved in 30016 ms.
Refiners :[Domain max(s): 196/196 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 196/196 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 444/444 constraints, Known Traps: 117/117 constraints]
After SMT, in 60249ms problems are : Problem set: 0 solved, 444 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 60775 ms. Remains : 196/196 places, 448/448 transitions.
Random walk for 1250000 steps, including 0 resets, run took 2531 ms (no deadlock found). (steps per millisecond=493 )
Random directed walk for 1250000 steps, including 0 resets, run took 1610 ms (no deadlock found). (steps per millisecond=776 )
[2025-06-01 01:27:05] [INFO ] Flow matrix only has 284 transitions (discarded 164 similar events)
[2025-06-01 01:27:05] [INFO ] Invariant cache hit.
[2025-06-01 01:27:05] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-01 01:27:05] [INFO ] [Real]Absence check using 9 positive and 4 generalized place invariants in 6 ms returned sat
[2025-06-01 01:27:05] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-01 01:27:05] [INFO ] Solution in real domain found non-integer solution.
[2025-06-01 01:27:05] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2025-06-01 01:27:06] [INFO ] [Nat]Absence check using 9 positive and 4 generalized place invariants in 3 ms returned sat
[2025-06-01 01:27:06] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2025-06-01 01:27:06] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 01:27:06] [INFO ] [Nat]Added 112 Read/Feed constraints in 28 ms returned sat
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 3 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 1 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Deduced a trap composed of 14 places in 77 ms of which 2 ms to minimize.
[2025-06-01 01:27:06] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 7 trap constraints in 681 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 192 transition count 392
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 140 transition count 392
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 128 transition count 380
Applied a total of 136 rules in 29 ms. Remains 128 /196 variables (removed 68) and now considering 380/448 (removed 68) transitions.
[2025-06-01 01:27:06] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
// Phase 1: matrix 216 rows 128 cols
[2025-06-01 01:27:06] [INFO ] Computed 13 invariants in 4 ms
[2025-06-01 01:27:07] [INFO ] Implicit Places using invariants in 136 ms returned []
[2025-06-01 01:27:07] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:27:07] [INFO ] Invariant cache hit.
[2025-06-01 01:27:07] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 01:27:07] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2025-06-01 01:27:07] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:27:07] [INFO ] Invariant cache hit.
[2025-06-01 01:27:07] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 2 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:08] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 30 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 47 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 30 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 3 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2025-06-01 01:27:09] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 26 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 37 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:27:11] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 40 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 45 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 36 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:27:12] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 32 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 44 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:27:13] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 0 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 38 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:14] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:15] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:27:16] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:17] [INFO ] Deduced a trap composed of 50 places in 56 ms of which 2 ms to minimize.
[2025-06-01 01:27:17] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:27:17] [INFO ] Deduced a trap composed of 42 places in 62 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 48 places in 71 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 54 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:19] [INFO ] Deduced a trap composed of 36 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 39 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 0 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 41 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 37 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:27:20] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:21] [INFO ] Deduced a trap composed of 34 places in 43 ms of which 1 ms to minimize.
[2025-06-01 01:27:21] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 11/221 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:22] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:23] [INFO ] Deduced a trap composed of 36 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 58 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 49 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 42 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:27:24] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 11 (OVERLAPS) 216/344 variables, 128/359 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 112/471 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 38 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:36] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/344 variables, and 473 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30022 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 92/233 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:38] [INFO ] Deduced a trap composed of 60 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 30 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 41 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:39] [INFO ] Deduced a trap composed of 55 places in 60 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/242 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:40] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:27:41] [INFO ] Deduced a trap composed of 30 places in 62 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:45] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:46] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:27:46] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:27:46] [INFO ] Deduced a trap composed of 40 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 49 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 44 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:27:47] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:27:49] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:27:49] [INFO ] Deduced a trap composed of 34 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 62 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:27:50] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (OVERLAPS) 216/344 variables, 128/384 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 112/496 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 376/872 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:28:06] [INFO ] Deduced a trap composed of 35 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 873 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30018 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 116/116 constraints]
After SMT, in 60139ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Starting structural reductions in LIVENESS mode, iteration 1 : 128/196 places, 380/448 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 60599 ms. Remains : 128/196 places, 380/448 transitions.
Initial state reduction rules removed 4 formulas.
RANDOM walk for 40000 steps (8 resets) in 2076 ms. (19 steps per ms) remains 235/376 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 235/235 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 235/235 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 235/235 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 235/235 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 235/235 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 235/235 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 234/235 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 234/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 233/234 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 233/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/233 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 232/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/232 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 4 ms. (80 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 230/230 properties
[2025-06-01 01:28:08] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:28:08] [INFO ] Invariant cache hit.
[2025-06-01 01:28:08] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/85 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 3 (OVERLAPS) 43/128 variables, 8/94 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 43/137 constraints. Problems are: Problem set: 0 solved, 230 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 38 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 39 places in 59 ms of which 2 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 0 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 26 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:28:10] [INFO ] Deduced a trap composed of 3 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:28:11] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 4 ms to minimize.
[2025-06-01 01:28:11] [INFO ] Deduced a trap composed of 48 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:11] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 1 ms to minimize.
[2025-06-01 01:28:11] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:11] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 230 unsolved
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 36 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 41 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 40 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 49 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 36 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 13 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 45 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 15 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:28:12] [INFO ] Deduced a trap composed of 42 places in 67 ms of which 1 ms to minimize.
[2025-06-01 01:28:13] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:28:13] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:28:13] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:28:13] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:13] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
[2025-06-01 01:28:13] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:28:13] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
SMT process timed out in 5074ms, After SMT, problems are : Problem set: 0 solved, 230 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 380/380 transitions.
Applied a total of 0 rules in 15 ms. Remains 128 /128 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 128/128 places, 380/380 transitions.
RANDOM walk for 4000000 steps (8 resets) in 57479 ms. (69 steps per ms) remains 223/230 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 223/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 221/223 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 220/221 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 220/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 218/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 217/218 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 217/217 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 215/217 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 213/215 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 213/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 212/213 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 211/212 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 210/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 210/210 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 210/210 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 203/210 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 203/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 197/203 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 195/197 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 195/195 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 190/195 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 190/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 184/190 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 184/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 183/184 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 183/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 182/183 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 182/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/182 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 181/181 properties
[2025-06-01 01:28:33] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:28:33] [INFO ] Invariant cache hit.
[2025-06-01 01:28:33] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 58/128 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 58/137 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 39 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 23 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 19 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 46 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:28:34] [INFO ] Deduced a trap composed of 40 places in 54 ms of which 0 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 43 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 36 places in 63 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
[2025-06-01 01:28:35] [INFO ] Deduced a trap composed of 11 places in 39 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 53 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 27 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 34 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:28:36] [INFO ] Deduced a trap composed of 39 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 34 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 15/176 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:37] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:38] [INFO ] Deduced a trap composed of 33 places in 53 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 3/179 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:39] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:40] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:40] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 2/182 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 38 places in 54 ms of which 2 ms to minimize.
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 47 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 49 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:28:41] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/128 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:42] [INFO ] Deduced a trap composed of 43 places in 64 ms of which 1 ms to minimize.
[2025-06-01 01:28:42] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:28:42] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/128 variables, 3/193 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:43] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:28:43] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/128 variables, 4/197 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:44] [INFO ] Deduced a trap composed of 45 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 31 places in 56 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/128 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:45] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 44 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:28:46] [INFO ] Deduced a trap composed of 37 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:47] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/128 variables, 6/207 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:47] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:28:47] [INFO ] Deduced a trap composed of 41 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 29 places in 57 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/128 variables, 3/210 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 0 ms to minimize.
[2025-06-01 01:28:48] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:49] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 3 ms to minimize.
[2025-06-01 01:28:49] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 0 ms to minimize.
[2025-06-01 01:28:49] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/128 variables, 5/215 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:50] [INFO ] Deduced a trap composed of 40 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:28:50] [INFO ] Deduced a trap composed of 33 places in 45 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/128 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:51] [INFO ] Deduced a trap composed of 36 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:28:52] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:28:52] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/128 variables, 3/220 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:52] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:28:52] [INFO ] Deduced a trap composed of 37 places in 64 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/128 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:54] [INFO ] Deduced a trap composed of 36 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:28:54] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/128 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/128 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 23 (OVERLAPS) 216/344 variables, 128/352 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/344 variables, 112/464 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:28:58] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:28:58] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:28:59] [INFO ] Deduced a trap composed of 35 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:28:59] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/344 variables, 4/468 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/344 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:29:03] [INFO ] Deduced a trap composed of 56 places in 64 ms of which 1 ms to minimize.
At refinement iteration 27 (OVERLAPS) 0/344 variables, 3/471 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/344 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 29 (OVERLAPS) 0/344 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Real declared 344/344 variables, and 471 constraints, problems are : Problem set: 0 solved, 181 unsolved in 42208 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 90/90 constraints]
Escalating to Integer solving :Problem set: 0 solved, 181 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/70 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 3 (OVERLAPS) 58/128 variables, 8/79 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 58/137 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 90/231 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:29:16] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:29:16] [INFO ] Deduced a trap composed of 43 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:29:16] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:29:16] [INFO ] Deduced a trap composed of 40 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:29:16] [INFO ] Deduced a trap composed of 30 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 6/237 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 2 ms to minimize.
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 37 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:29:17] [INFO ] Deduced a trap composed of 52 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 44 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 28 places in 56 ms of which 0 ms to minimize.
[2025-06-01 01:29:18] [INFO ] Deduced a trap composed of 29 places in 48 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 7/244 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 10 (OVERLAPS) 216/344 variables, 128/372 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 112/484 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 181/665 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 39 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 30 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:29:25] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 3/668 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:29:34] [INFO ] Deduced a trap composed of 50 places in 63 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/344 variables, 1/669 constraints. Problems are: Problem set: 0 solved, 181 unsolved
[2025-06-01 01:29:42] [INFO ] Deduced a trap composed of 53 places in 66 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/344 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/344 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 181 unsolved
At refinement iteration 17 (OVERLAPS) 0/344 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 181 unsolved
No progress, stopping.
After SMT solving in domain Int declared 344/344 variables, and 670 constraints, problems are : Problem set: 0 solved, 181 unsolved in 45022 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 181/181 constraints, Known Traps: 108/108 constraints]
After SMT, in 87281ms problems are : Problem set: 0 solved, 181 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 70 out of 128 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 128/128 places, 380/380 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 124 transition count 364
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 124 transition count 364
Applied a total of 8 rules in 16 ms. Remains 124 /128 variables (removed 4) and now considering 364/380 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 124/128 places, 364/380 transitions.
RANDOM walk for 4000000 steps (8 resets) in 52165 ms. (76 steps per ms) remains 180/181 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 106 ms. (373 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 180/180 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 180/180 properties
Finished probabilistic random walk after 1073023 steps, run visited all 180 properties in 5471 ms. (steps per millisecond=196 )
Probabilistic random walk after 1073023 steps, saw 216754 distinct states, run finished after 5475 ms. (steps per millisecond=195 ) properties seen :180
Able to resolve query QuasiLiveness after proving 380 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 196/196 places, 448/448 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 196 transition count 444
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 192 transition count 444
Performed 52 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 52 Pre rules applied. Total rules applied 8 place count 192 transition count 392
Deduced a syphon composed of 52 places in 0 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 2 with 104 rules applied. Total rules applied 112 place count 140 transition count 392
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 136 place count 128 transition count 380
Applied a total of 136 rules in 30 ms. Remains 128 /196 variables (removed 68) and now considering 380/448 (removed 68) transitions.
[2025-06-01 01:30:20] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:30:20] [INFO ] Invariant cache hit.
[2025-06-01 01:30:21] [INFO ] Implicit Places using invariants in 111 ms returned []
[2025-06-01 01:30:21] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:30:21] [INFO ] Invariant cache hit.
[2025-06-01 01:30:21] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-01 01:30:21] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 376 sub problems to find dead transitions.
[2025-06-01 01:30:21] [INFO ] Flow matrix only has 216 transitions (discarded 164 similar events)
[2025-06-01 01:30:21] [INFO ] Invariant cache hit.
[2025-06-01 01:30:21] [INFO ] State equation strengthened by 112 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 27 places in 44 ms of which 0 ms to minimize.
[2025-06-01 01:30:22] [INFO ] Deduced a trap composed of 41 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 35 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 27 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 47 places in 61 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 33 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 30 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 15 places in 34 ms of which 0 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 19 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:30:23] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 0 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 0 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 38 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 46 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:30:25] [INFO ] Deduced a trap composed of 37 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 2 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 35 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 37 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 37 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 28 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 36 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:30:26] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 20/181 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 32 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 43 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 38 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 46 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 44 places in 54 ms of which 0 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 41 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 36 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:30:27] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 0 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 34 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 33 places in 52 ms of which 0 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 38 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 38 places in 53 ms of which 1 ms to minimize.
[2025-06-01 01:30:28] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 0 ms to minimize.
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 28 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:29] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:30] [INFO ] Deduced a trap composed of 36 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:30:30] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:30:30] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 0 ms to minimize.
[2025-06-01 01:30:30] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2025-06-01 01:30:30] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:30] [INFO ] Deduced a trap composed of 50 places in 57 ms of which 1 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:30:31] [INFO ] Deduced a trap composed of 42 places in 56 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 9/210 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 54 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:30:33] [INFO ] Deduced a trap composed of 39 places in 52 ms of which 0 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 37 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 34 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 34 places in 50 ms of which 1 ms to minimize.
[2025-06-01 01:30:34] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 11/221 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:36] [INFO ] Deduced a trap composed of 37 places in 66 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 49 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:30:37] [INFO ] Deduced a trap composed of 53 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:30:38] [INFO ] Deduced a trap composed of 50 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:30:38] [INFO ] Deduced a trap composed of 42 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:38] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:30:38] [INFO ] Deduced a trap composed of 44 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:30:38] [INFO ] Deduced a trap composed of 40 places in 51 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 9/231 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/128 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 11 (OVERLAPS) 216/344 variables, 128/359 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 112/471 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:49] [INFO ] Deduced a trap composed of 38 places in 60 ms of which 1 ms to minimize.
[2025-06-01 01:30:50] [INFO ] Deduced a trap composed of 33 places in 48 ms of which 0 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/344 variables, 2/473 constraints. Problems are: Problem set: 0 solved, 376 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 344/344 variables, and 473 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30022 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 92/92 constraints]
Escalating to Integer solving :Problem set: 0 solved, 376 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 128/128 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/128 variables, 9/137 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 4/141 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/128 variables, 92/233 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:52] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2025-06-01 01:30:52] [INFO ] Deduced a trap composed of 41 places in 51 ms of which 1 ms to minimize.
[2025-06-01 01:30:52] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:30:52] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 35 places in 52 ms of which 1 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 41 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:30:53] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/128 variables, 9/242 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:55] [INFO ] Deduced a trap composed of 28 places in 58 ms of which 0 ms to minimize.
[2025-06-01 01:30:55] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:30:59] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:31:00] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 1 ms to minimize.
[2025-06-01 01:31:00] [INFO ] Deduced a trap composed of 39 places in 56 ms of which 1 ms to minimize.
[2025-06-01 01:31:01] [INFO ] Deduced a trap composed of 40 places in 59 ms of which 1 ms to minimize.
[2025-06-01 01:31:01] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:31:01] [INFO ] Deduced a trap composed of 44 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:31:01] [INFO ] Deduced a trap composed of 44 places in 59 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 6/251 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:31:04] [INFO ] Deduced a trap composed of 30 places in 58 ms of which 1 ms to minimize.
[2025-06-01 01:31:04] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 1 ms to minimize.
[2025-06-01 01:31:04] [INFO ] Deduced a trap composed of 28 places in 47 ms of which 1 ms to minimize.
[2025-06-01 01:31:05] [INFO ] Deduced a trap composed of 62 places in 66 ms of which 1 ms to minimize.
[2025-06-01 01:31:05] [INFO ] Deduced a trap composed of 44 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 5/256 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 10 (OVERLAPS) 216/344 variables, 128/384 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/344 variables, 112/496 constraints. Problems are: Problem set: 0 solved, 376 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/344 variables, 376/872 constraints. Problems are: Problem set: 0 solved, 376 unsolved
[2025-06-01 01:31:21] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 344/344 variables, and 873 constraints, problems are : Problem set: 0 solved, 376 unsolved in 30019 ms.
Refiners :[Domain max(s): 128/128 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 128/128 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 376/376 constraints, Known Traps: 116/116 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 376 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LIVENESS mode, iteration 1 : 128/196 places, 380/448 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 60577 ms. Remains : 128/196 places, 380/448 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Net is conservative; using simplified expression for initial state.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :380 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 380 properties from file /home/mcc/execution/Liveness.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 321279 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-04

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 196
TRANSITIONS: 448
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 1952
NUPN UNITS: 12
LOADING TIME: 0.415

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

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

Process ID: 2117
MODEL NAME: /home/mcc/execution/model
196 places, 448 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...

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

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