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

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

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME StableMarking

=== Now, execution of the tool begins

BK_START 1748743162813

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-09
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2025-06-01 01:59:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2025-06-01 01:59:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 01:59:24] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2025-06-01 01:59:24] [INFO ] Transformed 891 places.
[2025-06-01 01:59:24] [INFO ] Transformed 3888 transitions.
[2025-06-01 01:59:24] [INFO ] Found NUPN structural information;
[2025-06-01 01:59:24] [INFO ] Parsed PT model containing 891 places and 3888 transitions and 18792 arcs in 390 ms.
RANDOM walk for 40000 steps (8 resets) in 2221 ms. (18 steps per ms) remains 300/891 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 300/300 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 300/300 properties
[2025-06-01 01:59:25] [INFO ] Flow matrix only has 1809 transitions (discarded 2079 similar events)
// Phase 1: matrix 1809 rows 891 cols
[2025-06-01 01:59:25] [INFO ] Computed 28 invariants in 28 ms
[2025-06-01 01:59:25] [INFO ] State equation strengthened by 932 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 300/2700 variables, and 300 constraints, problems are : Problem set: 0 solved, 300 unsolved in 5062 ms.
Refiners :[Domain max(s): 300/891 constraints, Positive P Invariants (semi-flows): 0/19 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/891 constraints, ReadFeed: 0/932 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/300 variables, 300/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/300 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (OVERLAPS) 564/864 variables, 18/318 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/864 variables, 564/882 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 864/2700 variables, and 882 constraints, problems are : Problem set: 0 solved, 300 unsolved in 5014 ms.
Refiners :[Domain max(s): 864/891 constraints, Positive P Invariants (semi-flows): 18/19 constraints, Generalized P Invariants (flows): 0/9 constraints, State Equation: 0/891 constraints, ReadFeed: 0/932 constraints, PredecessorRefiner: 0/300 constraints, Known Traps: 0/0 constraints]
After SMT, in 10351ms problems are : Problem set: 0 solved, 300 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 300 out of 891 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 891/891 places, 3888/3888 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 891 transition count 3879
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 882 transition count 3879
Performed 180 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 180 Pre rules applied. Total rules applied 18 place count 882 transition count 3699
Deduced a syphon composed of 180 places in 6 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 2 with 360 rules applied. Total rules applied 378 place count 702 transition count 3699
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 450 place count 630 transition count 3051
Iterating global reduction 2 with 72 rules applied. Total rules applied 522 place count 630 transition count 3051
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 9 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 640 place count 571 transition count 2992
Applied a total of 640 rules in 368 ms. Remains 571 /891 variables (removed 320) and now considering 2992/3888 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 378 ms. Remains : 571/891 places, 2992/3888 transitions.
RANDOM walk for 4000000 steps (8 resets) in 75476 ms. (52 steps per ms) remains 276/300 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 276/276 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 274/276 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 96 ms. (412 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 101 ms. (392 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 89 ms. (444 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 274/274 properties
Interrupted probabilistic random walk after 4880170 steps, run timeout after 60001 ms. (steps per millisecond=81 ) properties seen :257 out of 274
Probabilistic random walk after 4880170 steps, saw 2161217 distinct states, run finished after 60005 ms. (steps per millisecond=81 ) properties seen :257
[2025-06-01 02:00:57] [INFO ] Flow matrix only has 913 transitions (discarded 2079 similar events)
// Phase 1: matrix 913 rows 571 cols
[2025-06-01 02:00:57] [INFO ] Computed 28 invariants in 9 ms
[2025-06-01 02:00:57] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 288/305 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 10/315 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 510/825 variables, 315/330 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/825 variables, 70/400 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/825 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 73/898 variables, 9/409 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/898 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/898 variables, 55/465 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 0/465 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 96/994 variables, 44/509 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/994 variables, 29/538 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/994 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 195/1189 variables, 8/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1189 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (OVERLAPS) 8/1197 variables, 4/550 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1197 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (OVERLAPS) 287/1484 variables, 203/753 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1484 variables, 202/955 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1484 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (OVERLAPS) 0/1484 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1484/1484 variables, and 955 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2750 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 571/571 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 288/305 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 10/315 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 3 places in 219 ms of which 33 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 95 places in 196 ms of which 3 ms to minimize.
[2025-06-01 02:01:00] [INFO ] Deduced a trap composed of 19 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 21 places in 168 ms of which 3 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 30 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 57 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 25 places in 108 ms of which 1 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 02:01:01] [INFO ] Deduced a trap composed of 33 places in 111 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 19 places in 139 ms of which 2 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 47 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:01:02] [INFO ] Deduced a trap composed of 49 places in 80 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/315 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 510/825 variables, 315/350 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/825 variables, 70/420 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/825 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 73/898 variables, 9/429 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/898 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/898 variables, 55/485 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/898 variables, 8/493 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/898 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (OVERLAPS) 96/994 variables, 44/537 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/994 variables, 29/566 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 02:01:04] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/994 variables, 1/567 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/994 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 195/1189 variables, 8/575 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1189 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (OVERLAPS) 8/1197 variables, 4/579 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1197 variables, 9/588 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 02:01:06] [INFO ] Deduced a trap composed of 23 places in 330 ms of which 4 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 17 places in 218 ms of which 3 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 50 places in 90 ms of which 1 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:01:07] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:01:08] [INFO ] Deduced a trap composed of 52 places in 92 ms of which 0 ms to minimize.
[2025-06-01 02:01:08] [INFO ] Deduced a trap composed of 107 places in 315 ms of which 3 ms to minimize.
[2025-06-01 02:01:08] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1197 variables, 8/596 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 151 places in 316 ms of which 3 ms to minimize.
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 108 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:01:09] [INFO ] Deduced a trap composed of 117 places in 321 ms of which 3 ms to minimize.
[2025-06-01 02:01:10] [INFO ] Deduced a trap composed of 126 places in 345 ms of which 4 ms to minimize.
[2025-06-01 02:01:10] [INFO ] Deduced a trap composed of 94 places in 321 ms of which 4 ms to minimize.
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 3 places in 328 ms of which 6 ms to minimize.
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 115 places in 285 ms of which 3 ms to minimize.
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 125 places in 288 ms of which 3 ms to minimize.
[2025-06-01 02:01:11] [INFO ] Deduced a trap composed of 111 places in 265 ms of which 3 ms to minimize.
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 137 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:01:12] [INFO ] Deduced a trap composed of 144 places in 317 ms of which 3 ms to minimize.
[2025-06-01 02:01:13] [INFO ] Deduced a trap composed of 137 places in 313 ms of which 3 ms to minimize.
[2025-06-01 02:01:13] [INFO ] Deduced a trap composed of 110 places in 304 ms of which 3 ms to minimize.
[2025-06-01 02:01:13] [INFO ] Deduced a trap composed of 98 places in 307 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1197 variables, 14/610 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1197 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (OVERLAPS) 287/1484 variables, 203/813 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1484 variables, 202/1015 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1484 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (OVERLAPS) 0/1484 variables, 0/1015 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1484/1484 variables, and 1015 constraints, problems are : Problem set: 0 solved, 17 unsolved in 17826 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 571/571 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 43/43 constraints]
After SMT, in 20620ms problems are : Problem set: 0 solved, 17 unsolved
Parikh walk visited 7 properties in 13777 ms.
Support contains 10 out of 571 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 571/571 places, 2992/2992 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 571 transition count 2920
Deduced a syphon composed of 72 places in 8 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 499 transition count 2920
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 7 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 170 place count 486 transition count 2907
Applied a total of 170 rules in 193 ms. Remains 486 /571 variables (removed 85) and now considering 2907/2992 (removed 85) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 486/571 places, 2907/2992 transitions.
RANDOM walk for 4000000 steps (8 resets) in 20523 ms. (194 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3163 ms. (1264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3162 ms. (1264 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3231 ms. (1237 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3216 ms. (1243 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3263 ms. (1225 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3228 ms. (1238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3250 ms. (1230 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3246 ms. (1231 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3252 ms. (1229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3156 ms. (1267 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 4069020 steps, run timeout after 39001 ms. (steps per millisecond=104 ) properties seen :4 out of 10
Probabilistic random walk after 4069020 steps, saw 1829156 distinct states, run finished after 39002 ms. (steps per millisecond=104 ) properties seen :4
[2025-06-01 02:02:24] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-01 02:02:24] [INFO ] Computed 28 invariants in 4 ms
[2025-06-01 02:02:24] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 55/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 29/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 202/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:25] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 2 ms to minimize.
[2025-06-01 02:02:25] [INFO ] Deduced a trap composed of 23 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 24 places in 94 ms of which 2 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 17 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:02:26] [INFO ] Deduced a trap composed of 27 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 44 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 4 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 33 places in 99 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:27] [INFO ] Deduced a trap composed of 27 places in 104 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/301 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 73/798 variables, 9/380 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 55/436 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 4/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 96/894 variables, 44/484 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/894 variables, 29/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 0/513 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 160/1054 variables, 8/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1054 variables, 0/521 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 8/1062 variables, 4/525 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1062 variables, 2/527 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:29] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1062 variables, 1/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:29] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1062 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1062 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 252/1314 variables, 168/697 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 202/899 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:02:29] [INFO ] Deduced a trap composed of 3 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:02:29] [INFO ] Deduced a trap composed of 3 places in 59 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/1314 variables, 2/901 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1314 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (OVERLAPS) 0/1314 variables, 0/901 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 901 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5456 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 25/25 constraints]
After SMT, in 6530ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2325 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 89 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 4000000 steps (8 resets) in 18365 ms. (217 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2836 ms. (1409 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2845 ms. (1405 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2860 ms. (1398 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2870 ms. (1393 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2876 ms. (1390 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2868 ms. (1394 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2766620 steps, run timeout after 27001 ms. (steps per millisecond=102 ) properties seen :0 out of 6
Probabilistic random walk after 2766620 steps, saw 1341956 distinct states, run finished after 27001 ms. (steps per millisecond=102 ) properties seen :0
[2025-06-01 02:03:09] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:03:09] [INFO ] Invariant cache hit.
[2025-06-01 02:03:09] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 55/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 29/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 202/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 6 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:03:10] [INFO ] Deduced a trap composed of 50 places in 155 ms of which 1 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 2 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 22 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 22 places in 144 ms of which 2 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 50 places in 122 ms of which 1 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 3 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:03:11] [INFO ] Deduced a trap composed of 61 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 36 places in 148 ms of which 1 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 25 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 23 places in 146 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 48 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 1 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:03:12] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 3 places in 153 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 21 places in 127 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 46 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 44 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 15 places in 127 ms of which 2 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 1 ms to minimize.
[2025-06-01 02:03:13] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:03:14] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 73/798 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 55/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:03:14] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 96/894 variables, 44/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 29/520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/894 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 160/1054 variables, 8/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1054 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 8/1062 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1062 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1062 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 252/1314 variables, 168/702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 202/904 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/1314 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 904 constraints, problems are : Problem set: 0 solved, 6 unsolved in 5717 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 28/28 constraints]
After SMT, in 6695ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2510 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 91 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 91 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:03:18] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:03:18] [INFO ] Invariant cache hit.
[2025-06-01 02:03:19] [INFO ] Implicit Places using invariants in 572 ms returned []
[2025-06-01 02:03:19] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:03:19] [INFO ] Invariant cache hit.
[2025-06-01 02:03:19] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:03:22] [INFO ] Implicit Places using invariants and state equation in 2678 ms returned []
Implicit Place search using SMT with State Equation took 3259 ms to find 0 implicit places.
[2025-06-01 02:03:22] [INFO ] Redundant transitions in 147 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:03:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:03:22] [INFO ] Invariant cache hit.
[2025-06-01 02:03:22] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:03:47] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 1 ms to minimize.
[2025-06-01 02:03:47] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 3 places in 113 ms of which 1 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 37 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:03:48] [INFO ] Deduced a trap composed of 65 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:03:50] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 3 ms to minimize.
[2025-06-01 02:03:50] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:03:50] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 02:03:50] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 3 ms to minimize.
[2025-06-01 02:03:51] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2025-06-01 02:03:51] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:03:51] [INFO ] Deduced a trap composed of 64 places in 210 ms of which 3 ms to minimize.
[2025-06-01 02:03:51] [INFO ] Deduced a trap composed of 93 places in 214 ms of which 2 ms to minimize.
[2025-06-01 02:03:52] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 2 ms to minimize.
[2025-06-01 02:03:52] [INFO ] Deduced a trap composed of 106 places in 227 ms of which 3 ms to minimize.
[2025-06-01 02:03:52] [INFO ] Deduced a trap composed of 101 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:03:52] [INFO ] Deduced a trap composed of 91 places in 261 ms of which 3 ms to minimize.
[2025-06-01 02:03:53] [INFO ] Deduced a trap composed of 109 places in 275 ms of which 3 ms to minimize.
[2025-06-01 02:03:53] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:03:58] [INFO ] Deduced a trap composed of 64 places in 165 ms of which 3 ms to minimize.
[2025-06-01 02:03:59] [INFO ] Deduced a trap composed of 51 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:03:59] [INFO ] Deduced a trap composed of 57 places in 221 ms of which 2 ms to minimize.
[2025-06-01 02:03:59] [INFO ] Deduced a trap composed of 58 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:04:00] [INFO ] Deduced a trap composed of 65 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:04:00] [INFO ] Deduced a trap composed of 25 places in 219 ms of which 3 ms to minimize.
[2025-06-01 02:04:00] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:04:01] [INFO ] Deduced a trap composed of 49 places in 187 ms of which 3 ms to minimize.
[2025-06-01 02:04:01] [INFO ] Deduced a trap composed of 57 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:04:02] [INFO ] Deduced a trap composed of 48 places in 180 ms of which 2 ms to minimize.
[2025-06-01 02:04:03] [INFO ] Deduced a trap composed of 69 places in 200 ms of which 2 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 85 places in 200 ms of which 3 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 63 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 92 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:04:04] [INFO ] Deduced a trap composed of 86 places in 241 ms of which 3 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 29 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 2 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 87 places in 228 ms of which 2 ms to minimize.
[2025-06-01 02:04:05] [INFO ] Deduced a trap composed of 84 places in 227 ms of which 3 ms to minimize.
[2025-06-01 02:04:06] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:04:15] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
[2025-06-01 02:04:16] [INFO ] Deduced a trap composed of 15 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:04:20] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:04:20] [INFO ] Deduced a trap composed of 91 places in 181 ms of which 2 ms to minimize.
[2025-06-01 02:04:20] [INFO ] Deduced a trap composed of 3 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:04:20] [INFO ] Deduced a trap composed of 18 places in 170 ms of which 3 ms to minimize.
[2025-06-01 02:04:21] [INFO ] Deduced a trap composed of 44 places in 190 ms of which 3 ms to minimize.
[2025-06-01 02:04:21] [INFO ] Deduced a trap composed of 19 places in 192 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 62016ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 62055ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65577 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 400000 steps (8 resets) in 3224 ms. (124 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2025-06-01 02:04:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:04:25] [INFO ] Invariant cache hit.
[2025-06-01 02:04:25] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-01 02:04:25] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-01 02:04:25] [INFO ] After 191ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2025-06-01 02:04:25] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:04:25] [INFO ] After 103ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:04:26] [INFO ] After 416ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:04:26] [INFO ] After 728ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:04:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-01 02:04:26] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 5 ms returned sat
[2025-06-01 02:04:26] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-01 02:04:26] [INFO ] After 71ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:04:26] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:04:26] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:04:26] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:04:26] [INFO ] Deduced a trap composed of 25 places in 91 ms of which 1 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 44 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 48 places in 81 ms of which 1 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 925 ms
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 42 places in 69 ms of which 0 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 0 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:04:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
TRAPS : Iteration 1
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 140 ms
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 0 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 128 ms
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 23 places in 77 ms of which 0 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:04:28] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 237 ms
[2025-06-01 02:04:28] [INFO ] Deduced a trap composed of 48 places in 73 ms of which 0 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 0 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 239 ms
TRAPS : Iteration 2
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2025-06-01 02:04:29] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 0 ms to minimize.
[2025-06-01 02:04:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 146 ms
TRAPS : Iteration 3
[2025-06-01 02:04:29] [INFO ] After 3617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 02:04:30] [INFO ] After 3967ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 4000000 steps (8 resets) in 18978 ms. (210 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3028 ms. (1320 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3041 ms. (1314 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3040 ms. (1315 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3033 ms. (1318 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 3003 ms. (1331 steps per ms) remains 6/6 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2987 ms. (1338 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 2716240 steps, run timeout after 27001 ms. (steps per millisecond=100 ) properties seen :0 out of 6
Probabilistic random walk after 2716240 steps, saw 1318908 distinct states, run finished after 27001 ms. (steps per millisecond=100 ) properties seen :0
[2025-06-01 02:05:06] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:05:06] [INFO ] Invariant cache hit.
[2025-06-01 02:05:06] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 460/725 variables, 265/280 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/725 variables, 70/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/725 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 73/798 variables, 9/359 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/798 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/798 variables, 55/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 96/894 variables, 44/459 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/894 variables, 29/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/894 variables, 0/488 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 160/1054 variables, 8/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1054 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 8/1062 variables, 4/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1062 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 252/1314 variables, 168/668 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 202/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 6 unsolved in 969 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 249/255 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 10/265 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:05:07] [INFO ] Deduced a trap composed of 50 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:05:08] [INFO ] Deduced a trap composed of 15 places in 152 ms of which 2 ms to minimize.
[2025-06-01 02:05:08] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 1 ms to minimize.
[2025-06-01 02:05:08] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 1 ms to minimize.
[2025-06-01 02:05:08] [INFO ] Deduced a trap composed of 50 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:05:08] [INFO ] Deduced a trap composed of 12 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:05:08] [INFO ] Deduced a trap composed of 3 places in 156 ms of which 2 ms to minimize.
[2025-06-01 02:05:08] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:05:09] [INFO ] Deduced a trap composed of 36 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:05:09] [INFO ] Deduced a trap composed of 25 places in 157 ms of which 1 ms to minimize.
[2025-06-01 02:05:09] [INFO ] Deduced a trap composed of 23 places in 156 ms of which 1 ms to minimize.
[2025-06-01 02:05:09] [INFO ] Deduced a trap composed of 48 places in 159 ms of which 2 ms to minimize.
[2025-06-01 02:05:09] [INFO ] Deduced a trap composed of 28 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:05:09] [INFO ] Deduced a trap composed of 23 places in 136 ms of which 2 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 17 places in 129 ms of which 2 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 3 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 21 places in 129 ms of which 1 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 46 places in 67 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 44 places in 63 ms of which 1 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 22 places in 128 ms of which 1 ms to minimize.
[2025-06-01 02:05:10] [INFO ] Deduced a trap composed of 15 places in 130 ms of which 1 ms to minimize.
[2025-06-01 02:05:11] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:05:11] [INFO ] Deduced a trap composed of 48 places in 72 ms of which 0 ms to minimize.
[2025-06-01 02:05:11] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 7/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 460/725 variables, 265/307 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/725 variables, 70/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 73/798 variables, 9/386 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/798 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/798 variables, 55/442 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/798 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:05:11] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/798 variables, 1/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/798 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 96/894 variables, 44/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/894 variables, 29/520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/894 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 160/1054 variables, 8/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1054 variables, 0/528 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 8/1062 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1062 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1062 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (OVERLAPS) 252/1314 variables, 168/702 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 202/904 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2025-06-01 02:05:12] [INFO ] Deduced a trap composed of 3 places in 84 ms of which 1 ms to minimize.
[2025-06-01 02:05:13] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:05:13] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:05:13] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:05:13] [INFO ] Deduced a trap composed of 54 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:05:13] [INFO ] Deduced a trap composed of 64 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:05:13] [INFO ] Deduced a trap composed of 19 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:05:13] [INFO ] Deduced a trap composed of 35 places in 77 ms of which 0 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1314 variables, 8/912 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1314 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 0/1314 variables, 0/912 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 912 constraints, problems are : Problem set: 0 solved, 6 unsolved in 7024 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 36/36 constraints]
After SMT, in 8024ms problems are : Problem set: 0 solved, 6 unsolved
Parikh walk visited 0 properties in 2326 ms.
Support contains 6 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 86 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:05:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:05:17] [INFO ] Invariant cache hit.
[2025-06-01 02:05:17] [INFO ] Implicit Places using invariants in 507 ms returned []
[2025-06-01 02:05:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:05:17] [INFO ] Invariant cache hit.
[2025-06-01 02:05:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:05:19] [INFO ] Implicit Places using invariants and state equation in 2366 ms returned []
Implicit Place search using SMT with State Equation took 2874 ms to find 0 implicit places.
[2025-06-01 02:05:20] [INFO ] Redundant transitions in 152 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:05:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:05:20] [INFO ] Invariant cache hit.
[2025-06-01 02:05:20] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 3 places in 127 ms of which 1 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 1 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 1 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 3 places in 102 ms of which 2 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:05:45] [INFO ] Deduced a trap composed of 65 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 49 places in 163 ms of which 2 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2025-06-01 02:05:47] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 49 places in 193 ms of which 3 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 3 ms to minimize.
[2025-06-01 02:05:48] [INFO ] Deduced a trap composed of 64 places in 213 ms of which 3 ms to minimize.
[2025-06-01 02:05:49] [INFO ] Deduced a trap composed of 93 places in 225 ms of which 3 ms to minimize.
[2025-06-01 02:05:49] [INFO ] Deduced a trap composed of 47 places in 237 ms of which 3 ms to minimize.
[2025-06-01 02:05:49] [INFO ] Deduced a trap composed of 106 places in 224 ms of which 3 ms to minimize.
[2025-06-01 02:05:49] [INFO ] Deduced a trap composed of 101 places in 253 ms of which 3 ms to minimize.
[2025-06-01 02:05:50] [INFO ] Deduced a trap composed of 91 places in 272 ms of which 3 ms to minimize.
[2025-06-01 02:05:50] [INFO ] Deduced a trap composed of 109 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:05:50] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:05:56] [INFO ] Deduced a trap composed of 64 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:05:56] [INFO ] Deduced a trap composed of 51 places in 170 ms of which 3 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 57 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 58 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:05:57] [INFO ] Deduced a trap composed of 65 places in 198 ms of which 3 ms to minimize.
[2025-06-01 02:05:58] [INFO ] Deduced a trap composed of 25 places in 203 ms of which 3 ms to minimize.
[2025-06-01 02:05:58] [INFO ] Deduced a trap composed of 13 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:05:58] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:05:59] [INFO ] Deduced a trap composed of 57 places in 158 ms of which 2 ms to minimize.
[2025-06-01 02:06:00] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 3 ms to minimize.
[2025-06-01 02:06:01] [INFO ] Deduced a trap composed of 69 places in 210 ms of which 2 ms to minimize.
[2025-06-01 02:06:01] [INFO ] Deduced a trap composed of 85 places in 204 ms of which 3 ms to minimize.
[2025-06-01 02:06:01] [INFO ] Deduced a trap composed of 63 places in 222 ms of which 2 ms to minimize.
[2025-06-01 02:06:01] [INFO ] Deduced a trap composed of 92 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 86 places in 249 ms of which 2 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 29 places in 250 ms of which 2 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 63 places in 245 ms of which 2 ms to minimize.
[2025-06-01 02:06:02] [INFO ] Deduced a trap composed of 87 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 84 places in 229 ms of which 3 ms to minimize.
[2025-06-01 02:06:03] [INFO ] Deduced a trap composed of 58 places in 242 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:06:12] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 0 ms to minimize.
[2025-06-01 02:06:13] [INFO ] Deduced a trap composed of 15 places in 162 ms of which 2 ms to minimize.
[2025-06-01 02:06:17] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 2 ms to minimize.
[2025-06-01 02:06:17] [INFO ] Deduced a trap composed of 91 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:06:17] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2025-06-01 02:06:18] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:06:19] [INFO ] Deduced a trap composed of 44 places in 180 ms of which 2 ms to minimize.
[2025-06-01 02:06:19] [INFO ] Deduced a trap composed of 19 places in 187 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 61926ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61951ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65080 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 400000 steps (8 resets) in 1934 ms. (206 steps per ms) remains 6/6 properties
Running SMT prover for 6 properties.
[2025-06-01 02:06:22] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:06:22] [INFO ] Invariant cache hit.
[2025-06-01 02:06:22] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2025-06-01 02:06:22] [INFO ] [Real]Absence check using 19 positive and 9 generalized place invariants in 4 ms returned sat
[2025-06-01 02:06:22] [INFO ] After 194ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6
[2025-06-01 02:06:22] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:06:23] [INFO ] After 95ms SMT Verify possible using 356 Read/Feed constraints in real domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:06:23] [INFO ] After 406ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:06:23] [INFO ] After 694ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:06:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2025-06-01 02:06:23] [INFO ] [Nat]Absence check using 19 positive and 9 generalized place invariants in 6 ms returned sat
[2025-06-01 02:06:23] [INFO ] After 205ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-01 02:06:23] [INFO ] After 78ms SMT Verify possible using 356 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:06:23] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 1 ms to minimize.
[2025-06-01 02:06:23] [INFO ] Deduced a trap composed of 61 places in 103 ms of which 3 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 1 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 25 places in 92 ms of which 1 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 0 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 48 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 870 ms
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Deduced a trap composed of 42 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:06:24] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 211 ms
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 44 places in 74 ms of which 1 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 0 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 108 ms
TRAPS : Iteration 1
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 15 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 135 ms
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 0 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:06:25] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 1 ms to minimize.
[2025-06-01 02:06:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 225 ms
[2025-06-01 02:06:26] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:06:26] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 1 ms to minimize.
[2025-06-01 02:06:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 236 ms
TRAPS : Iteration 2
[2025-06-01 02:06:26] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 149 ms
[2025-06-01 02:06:26] [INFO ] Deduced a trap composed of 26 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:06:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
TRAPS : Iteration 3
[2025-06-01 02:06:27] [INFO ] After 3515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 02:06:27] [INFO ] After 3862ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 461760 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 461760 steps, saw 280178 distinct states, run finished after 3002 ms. (steps per millisecond=153 ) properties seen :0
[2025-06-01 02:06:30] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:06:30] [INFO ] Invariant cache hit.
[2025-06-01 02:06:30] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:30] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:31] [INFO ] Deduced a trap composed of 11 places in 74 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 640 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1050ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 89 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 192 ms. (207 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 464810 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 464810 steps, saw 281863 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:06:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:06:34] [INFO ] Invariant cache hit.
[2025-06-01 02:06:34] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 376 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:35] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:06:35] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1028ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 100 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 89 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:06:35] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:06:35] [INFO ] Invariant cache hit.
[2025-06-01 02:06:36] [INFO ] Implicit Places using invariants in 529 ms returned []
[2025-06-01 02:06:36] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:06:36] [INFO ] Invariant cache hit.
[2025-06-01 02:06:36] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:06:39] [INFO ] Implicit Places using invariants and state equation in 2828 ms returned []
Implicit Place search using SMT with State Equation took 3357 ms to find 0 implicit places.
[2025-06-01 02:06:39] [INFO ] Redundant transitions in 74 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:06:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:06:39] [INFO ] Invariant cache hit.
[2025-06-01 02:06:39] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:07:04] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 2 ms to minimize.
[2025-06-01 02:07:04] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:07:04] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:07:04] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 2 ms to minimize.
[2025-06-01 02:07:05] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:07:05] [INFO ] Deduced a trap composed of 65 places in 150 ms of which 2 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 49 places in 166 ms of which 3 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 0 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:07:07] [INFO ] Deduced a trap composed of 49 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:07:08] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:07:08] [INFO ] Deduced a trap composed of 64 places in 209 ms of which 2 ms to minimize.
[2025-06-01 02:07:08] [INFO ] Deduced a trap composed of 93 places in 228 ms of which 2 ms to minimize.
[2025-06-01 02:07:08] [INFO ] Deduced a trap composed of 47 places in 229 ms of which 2 ms to minimize.
[2025-06-01 02:07:09] [INFO ] Deduced a trap composed of 106 places in 231 ms of which 3 ms to minimize.
[2025-06-01 02:07:09] [INFO ] Deduced a trap composed of 101 places in 251 ms of which 2 ms to minimize.
[2025-06-01 02:07:09] [INFO ] Deduced a trap composed of 91 places in 272 ms of which 2 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 109 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:07:10] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 64 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:07:15] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 57 places in 198 ms of which 2 ms to minimize.
[2025-06-01 02:07:16] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 65 places in 202 ms of which 3 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 25 places in 213 ms of which 2 ms to minimize.
[2025-06-01 02:07:17] [INFO ] Deduced a trap composed of 13 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:07:18] [INFO ] Deduced a trap composed of 49 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:07:18] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:07:19] [INFO ] Deduced a trap composed of 48 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:07:20] [INFO ] Deduced a trap composed of 69 places in 206 ms of which 2 ms to minimize.
[2025-06-01 02:07:20] [INFO ] Deduced a trap composed of 85 places in 206 ms of which 3 ms to minimize.
[2025-06-01 02:07:20] [INFO ] Deduced a trap composed of 63 places in 232 ms of which 2 ms to minimize.
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 92 places in 250 ms of which 3 ms to minimize.
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 86 places in 235 ms of which 2 ms to minimize.
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 29 places in 253 ms of which 2 ms to minimize.
[2025-06-01 02:07:21] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 2 ms to minimize.
[2025-06-01 02:07:22] [INFO ] Deduced a trap composed of 87 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:07:22] [INFO ] Deduced a trap composed of 84 places in 243 ms of which 2 ms to minimize.
[2025-06-01 02:07:22] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:07:32] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 02:07:33] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:07:37] [INFO ] Deduced a trap composed of 15 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:07:37] [INFO ] Deduced a trap composed of 91 places in 185 ms of which 2 ms to minimize.
[2025-06-01 02:07:37] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:07:37] [INFO ] Deduced a trap composed of 18 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:07:38] [INFO ] Deduced a trap composed of 44 places in 178 ms of which 2 ms to minimize.
[2025-06-01 02:07:38] [INFO ] Deduced a trap composed of 19 places in 183 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 61684ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61708ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65245 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 3 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 83 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-06-01 02:07:41] [INFO ] Computed 19 invariants in 0 ms
[2025-06-01 02:07:41] [INFO ] After 18ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:07:41] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-01 02:07:41] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:07:41] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 02:07:41] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:07:41] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:07:41] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 197 ms.
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 461700 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 461700 steps, saw 280147 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2025-06-01 02:07:44] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-01 02:07:44] [INFO ] Computed 28 invariants in 9 ms
[2025-06-01 02:07:44] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 384 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:07:44] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:07:45] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 628 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1039ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 102 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 93 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 93 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 215 ms. (185 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 462000 steps, run timeout after 3001 ms. (steps per millisecond=153 ) properties seen :0 out of 1
Probabilistic random walk after 462000 steps, saw 280287 distinct states, run finished after 3001 ms. (steps per millisecond=153 ) properties seen :0
[2025-06-01 02:07:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:07:48] [INFO ] Invariant cache hit.
[2025-06-01 02:07:48] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 374 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 831ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 83 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 89 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 87 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:07:49] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:07:49] [INFO ] Invariant cache hit.
[2025-06-01 02:07:50] [INFO ] Implicit Places using invariants in 526 ms returned []
[2025-06-01 02:07:50] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:07:50] [INFO ] Invariant cache hit.
[2025-06-01 02:07:50] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:07:52] [INFO ] Implicit Places using invariants and state equation in 2545 ms returned []
Implicit Place search using SMT with State Equation took 3071 ms to find 0 implicit places.
[2025-06-01 02:07:52] [INFO ] Redundant transitions in 76 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:07:52] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:07:52] [INFO ] Invariant cache hit.
[2025-06-01 02:07:52] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 3 places in 120 ms of which 2 ms to minimize.
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:08:17] [INFO ] Deduced a trap composed of 3 places in 70 ms of which 0 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 3 places in 105 ms of which 2 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 37 places in 73 ms of which 1 ms to minimize.
[2025-06-01 02:08:18] [INFO ] Deduced a trap composed of 65 places in 158 ms of which 3 ms to minimize.
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 49 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:08:20] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 55 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 64 places in 207 ms of which 3 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 93 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 3 ms to minimize.
[2025-06-01 02:08:21] [INFO ] Deduced a trap composed of 106 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 101 places in 245 ms of which 2 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 91 places in 268 ms of which 3 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 109 places in 270 ms of which 3 ms to minimize.
[2025-06-01 02:08:22] [INFO ] Deduced a trap composed of 23 places in 105 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:08:28] [INFO ] Deduced a trap composed of 64 places in 176 ms of which 2 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 51 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:08:29] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 2 ms to minimize.
[2025-06-01 02:08:30] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:08:30] [INFO ] Deduced a trap composed of 65 places in 188 ms of which 2 ms to minimize.
[2025-06-01 02:08:30] [INFO ] Deduced a trap composed of 25 places in 207 ms of which 3 ms to minimize.
[2025-06-01 02:08:31] [INFO ] Deduced a trap composed of 13 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:08:31] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:08:31] [INFO ] Deduced a trap composed of 57 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:08:32] [INFO ] Deduced a trap composed of 48 places in 170 ms of which 3 ms to minimize.
[2025-06-01 02:08:33] [INFO ] Deduced a trap composed of 69 places in 203 ms of which 2 ms to minimize.
[2025-06-01 02:08:34] [INFO ] Deduced a trap composed of 85 places in 214 ms of which 3 ms to minimize.
[2025-06-01 02:08:34] [INFO ] Deduced a trap composed of 63 places in 288 ms of which 2 ms to minimize.
[2025-06-01 02:08:34] [INFO ] Deduced a trap composed of 92 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:08:34] [INFO ] Deduced a trap composed of 86 places in 233 ms of which 2 ms to minimize.
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 29 places in 243 ms of which 3 ms to minimize.
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 63 places in 242 ms of which 2 ms to minimize.
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 87 places in 234 ms of which 2 ms to minimize.
[2025-06-01 02:08:35] [INFO ] Deduced a trap composed of 84 places in 220 ms of which 2 ms to minimize.
[2025-06-01 02:08:36] [INFO ] Deduced a trap composed of 58 places in 257 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:08:45] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 0 ms to minimize.
[2025-06-01 02:08:46] [INFO ] Deduced a trap composed of 15 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:08:50] [INFO ] Deduced a trap composed of 15 places in 244 ms of which 3 ms to minimize.
[2025-06-01 02:08:50] [INFO ] Deduced a trap composed of 91 places in 180 ms of which 2 ms to minimize.
[2025-06-01 02:08:50] [INFO ] Deduced a trap composed of 3 places in 77 ms of which 1 ms to minimize.
[2025-06-01 02:08:51] [INFO ] Deduced a trap composed of 18 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:08:51] [INFO ] Deduced a trap composed of 44 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:08:52] [INFO ] Deduced a trap composed of 19 places in 181 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 61743ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61767ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65017 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 35 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-06-01 02:08:54] [INFO ] Computed 19 invariants in 2 ms
[2025-06-01 02:08:54] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:08:54] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-01 02:08:54] [INFO ] After 40ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:08:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 02:08:54] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:08:54] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:08:54] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 163 ms.
RANDOM walk for 40000 steps (8 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 458660 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 458660 steps, saw 278365 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2025-06-01 02:08:58] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-01 02:08:58] [INFO ] Computed 28 invariants in 10 ms
[2025-06-01 02:08:58] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:08:58] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:08:58] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:08:58] [INFO ] Deduced a trap composed of 3 places in 86 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 1/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1314 variables, 0/874 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 874 constraints, problems are : Problem set: 0 solved, 1 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1089ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 59 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 218 ms. (182 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 473440 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 473440 steps, saw 287044 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2025-06-01 02:09:02] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:09:02] [INFO ] Invariant cache hit.
[2025-06-01 02:09:02] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 360 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:09:03] [INFO ] Deduced a trap composed of 67 places in 254 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/558 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1108ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 67 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 82 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 83 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:09:03] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:09:03] [INFO ] Invariant cache hit.
[2025-06-01 02:09:04] [INFO ] Implicit Places using invariants in 550 ms returned []
[2025-06-01 02:09:04] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:09:04] [INFO ] Invariant cache hit.
[2025-06-01 02:09:04] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:09:06] [INFO ] Implicit Places using invariants and state equation in 2537 ms returned []
Implicit Place search using SMT with State Equation took 3088 ms to find 0 implicit places.
[2025-06-01 02:09:06] [INFO ] Redundant transitions in 73 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:09:06] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:09:06] [INFO ] Invariant cache hit.
[2025-06-01 02:09:06] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 3 places in 117 ms of which 1 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:09:31] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 3 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 3 places in 103 ms of which 1 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 37 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:09:32] [INFO ] Deduced a trap composed of 65 places in 154 ms of which 2 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 49 places in 172 ms of which 3 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 1 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 0 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 2 ms to minimize.
[2025-06-01 02:09:34] [INFO ] Deduced a trap composed of 49 places in 177 ms of which 2 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 55 places in 193 ms of which 3 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 64 places in 200 ms of which 2 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 93 places in 226 ms of which 3 ms to minimize.
[2025-06-01 02:09:35] [INFO ] Deduced a trap composed of 47 places in 238 ms of which 3 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 106 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 101 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 91 places in 254 ms of which 3 ms to minimize.
[2025-06-01 02:09:36] [INFO ] Deduced a trap composed of 109 places in 256 ms of which 3 ms to minimize.
[2025-06-01 02:09:37] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 1.0)
(s14 0.0)
(s15 0.0)
(s16 1.0)
(s17 0.0)
(s18 0.0)
(s19 1.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 1.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 0.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 0.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 0.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 0.0)
(s445 0.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 0.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 0.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:09:42] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:09:43] [INFO ] Deduced a trap composed of 51 places in 164 ms of which 2 ms to minimize.
[2025-06-01 02:09:43] [INFO ] Deduced a trap composed of 57 places in 194 ms of which 3 ms to minimize.
[2025-06-01 02:09:43] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2025-06-01 02:09:44] [INFO ] Deduced a trap composed of 65 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:09:44] [INFO ] Deduced a trap composed of 25 places in 200 ms of which 2 ms to minimize.
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 13 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 49 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:09:45] [INFO ] Deduced a trap composed of 57 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:09:46] [INFO ] Deduced a trap composed of 48 places in 160 ms of which 2 ms to minimize.
[2025-06-01 02:09:47] [INFO ] Deduced a trap composed of 69 places in 201 ms of which 3 ms to minimize.
[2025-06-01 02:09:47] [INFO ] Deduced a trap composed of 85 places in 199 ms of which 2 ms to minimize.
[2025-06-01 02:09:48] [INFO ] Deduced a trap composed of 63 places in 224 ms of which 2 ms to minimize.
[2025-06-01 02:09:48] [INFO ] Deduced a trap composed of 92 places in 245 ms of which 2 ms to minimize.
[2025-06-01 02:09:48] [INFO ] Deduced a trap composed of 86 places in 243 ms of which 2 ms to minimize.
[2025-06-01 02:09:48] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 2 ms to minimize.
[2025-06-01 02:09:49] [INFO ] Deduced a trap composed of 63 places in 239 ms of which 2 ms to minimize.
[2025-06-01 02:09:49] [INFO ] Deduced a trap composed of 87 places in 224 ms of which 3 ms to minimize.
[2025-06-01 02:09:49] [INFO ] Deduced a trap composed of 84 places in 218 ms of which 2 ms to minimize.
[2025-06-01 02:09:49] [INFO ] Deduced a trap composed of 58 places in 247 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:09:59] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2025-06-01 02:10:00] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:10:04] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 2 ms to minimize.
[2025-06-01 02:10:04] [INFO ] Deduced a trap composed of 91 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:10:04] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:10:05] [INFO ] Deduced a trap composed of 18 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:10:05] [INFO ] Deduced a trap composed of 44 places in 187 ms of which 2 ms to minimize.
[2025-06-01 02:10:06] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 61747ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61770ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65031 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 1 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 29 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-06-01 02:10:08] [INFO ] Computed 19 invariants in 2 ms
[2025-06-01 02:10:08] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:10:08] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-01 02:10:08] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:10:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 02:10:08] [INFO ] After 13ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:10:08] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:10:08] [INFO ] After 101ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 165 ms.
RANDOM walk for 40000 steps (8 resets) in 239 ms. (166 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 456920 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 456920 steps, saw 277388 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
[2025-06-01 02:10:11] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-01 02:10:11] [INFO ] Computed 28 invariants in 6 ms
[2025-06-01 02:10:11] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 373 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:10:12] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/145 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 137/282 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/282 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 192/474 variables, 88/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 29/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/474 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 320/794 variables, 16/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/794 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 16/810 variables, 8/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 1/222 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:10:12] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 873 constraints, problems are : Problem set: 0 solved, 1 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 995ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 62 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 36 ms. (1081 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463390 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463390 steps, saw 281044 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:10:16] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:10:16] [INFO ] Invariant cache hit.
[2025-06-01 02:10:16] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 855ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 48 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 84 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:10:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:10:17] [INFO ] Invariant cache hit.
[2025-06-01 02:10:17] [INFO ] Implicit Places using invariants in 531 ms returned []
[2025-06-01 02:10:17] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:10:17] [INFO ] Invariant cache hit.
[2025-06-01 02:10:17] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:10:20] [INFO ] Implicit Places using invariants and state equation in 2746 ms returned []
Implicit Place search using SMT with State Equation took 3279 ms to find 0 implicit places.
[2025-06-01 02:10:20] [INFO ] Redundant transitions in 80 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:10:20] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:10:20] [INFO ] Invariant cache hit.
[2025-06-01 02:10:20] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:10:45] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 1 ms to minimize.
[2025-06-01 02:10:45] [INFO ] Deduced a trap composed of 3 places in 95 ms of which 1 ms to minimize.
[2025-06-01 02:10:46] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:10:46] [INFO ] Deduced a trap composed of 3 places in 101 ms of which 1 ms to minimize.
[2025-06-01 02:10:46] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:10:46] [INFO ] Deduced a trap composed of 65 places in 151 ms of which 2 ms to minimize.
[2025-06-01 02:10:48] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:10:48] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 1 ms to minimize.
[2025-06-01 02:10:48] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2025-06-01 02:10:48] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:10:49] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:10:49] [INFO ] Deduced a trap composed of 55 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:10:49] [INFO ] Deduced a trap composed of 64 places in 203 ms of which 3 ms to minimize.
[2025-06-01 02:10:49] [INFO ] Deduced a trap composed of 93 places in 213 ms of which 2 ms to minimize.
[2025-06-01 02:10:50] [INFO ] Deduced a trap composed of 47 places in 230 ms of which 3 ms to minimize.
[2025-06-01 02:10:50] [INFO ] Deduced a trap composed of 106 places in 229 ms of which 3 ms to minimize.
[2025-06-01 02:10:50] [INFO ] Deduced a trap composed of 101 places in 241 ms of which 3 ms to minimize.
[2025-06-01 02:10:50] [INFO ] Deduced a trap composed of 91 places in 262 ms of which 3 ms to minimize.
[2025-06-01 02:10:51] [INFO ] Deduced a trap composed of 109 places in 259 ms of which 3 ms to minimize.
[2025-06-01 02:10:51] [INFO ] Deduced a trap composed of 23 places in 96 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:10:56] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:10:56] [INFO ] Deduced a trap composed of 51 places in 182 ms of which 3 ms to minimize.
[2025-06-01 02:10:57] [INFO ] Deduced a trap composed of 57 places in 205 ms of which 2 ms to minimize.
[2025-06-01 02:10:57] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 3 ms to minimize.
[2025-06-01 02:10:58] [INFO ] Deduced a trap composed of 65 places in 195 ms of which 2 ms to minimize.
[2025-06-01 02:10:58] [INFO ] Deduced a trap composed of 25 places in 210 ms of which 3 ms to minimize.
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 13 places in 174 ms of which 3 ms to minimize.
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 49 places in 197 ms of which 3 ms to minimize.
[2025-06-01 02:10:59] [INFO ] Deduced a trap composed of 57 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:11:00] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:11:01] [INFO ] Deduced a trap composed of 69 places in 218 ms of which 3 ms to minimize.
[2025-06-01 02:11:02] [INFO ] Deduced a trap composed of 85 places in 218 ms of which 3 ms to minimize.
[2025-06-01 02:11:02] [INFO ] Deduced a trap composed of 63 places in 237 ms of which 3 ms to minimize.
[2025-06-01 02:11:02] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 3 ms to minimize.
[2025-06-01 02:11:02] [INFO ] Deduced a trap composed of 86 places in 255 ms of which 3 ms to minimize.
[2025-06-01 02:11:03] [INFO ] Deduced a trap composed of 29 places in 246 ms of which 3 ms to minimize.
[2025-06-01 02:11:03] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 2 ms to minimize.
[2025-06-01 02:11:03] [INFO ] Deduced a trap composed of 87 places in 237 ms of which 3 ms to minimize.
[2025-06-01 02:11:03] [INFO ] Deduced a trap composed of 84 places in 233 ms of which 2 ms to minimize.
[2025-06-01 02:11:04] [INFO ] Deduced a trap composed of 58 places in 252 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:11:13] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2025-06-01 02:11:15] [INFO ] Deduced a trap composed of 15 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:11:18] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:11:18] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 2 ms to minimize.
[2025-06-01 02:11:19] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:11:19] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 2 ms to minimize.
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 44 places in 183 ms of which 2 ms to minimize.
[2025-06-01 02:11:20] [INFO ] Deduced a trap composed of 19 places in 177 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 1)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 1)
(s23 0)
(s24 0)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 1)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
timeout
(s157 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 61773ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61796ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65255 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 36 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-06-01 02:11:22] [INFO ] Computed 19 invariants in 2 ms
[2025-06-01 02:11:22] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:11:22] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-01 02:11:22] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:11:22] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 02:11:22] [INFO ] After 6ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:11:22] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:11:22] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 153 ms.
RANDOM walk for 40000 steps (8 resets) in 180 ms. (220 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 453880 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 453880 steps, saw 275602 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2025-06-01 02:11:25] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-01 02:11:25] [INFO ] Computed 28 invariants in 8 ms
[2025-06-01 02:11:25] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 387 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 874ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 82 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 84 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 453430 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 453430 steps, saw 275351 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2025-06-01 02:11:29] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:11:29] [INFO ] Invariant cache hit.
[2025-06-01 02:11:29] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 386 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:11:30] [INFO ] Deduced a trap composed of 46 places in 79 ms of which 1 ms to minimize.
[2025-06-01 02:11:30] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 2/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/810 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 504/1314 variables, 336/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 314/873 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:11:30] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 0 ms to minimize.
[2025-06-01 02:11:30] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1314 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 875 constraints, problems are : Problem set: 0 solved, 1 unsolved in 878 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1280ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 76 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 88 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 88 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:11:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:11:31] [INFO ] Invariant cache hit.
[2025-06-01 02:11:31] [INFO ] Implicit Places using invariants in 526 ms returned []
[2025-06-01 02:11:31] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:11:31] [INFO ] Invariant cache hit.
[2025-06-01 02:11:32] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:11:34] [INFO ] Implicit Places using invariants and state equation in 2775 ms returned []
Implicit Place search using SMT with State Equation took 3303 ms to find 0 implicit places.
[2025-06-01 02:11:34] [INFO ] Redundant transitions in 81 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:11:34] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:11:34] [INFO ] Invariant cache hit.
[2025-06-01 02:11:34] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:12:00] [INFO ] Deduced a trap composed of 3 places in 116 ms of which 1 ms to minimize.
[2025-06-01 02:12:00] [INFO ] Deduced a trap composed of 3 places in 97 ms of which 1 ms to minimize.
[2025-06-01 02:12:00] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:12:00] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 1 ms to minimize.
[2025-06-01 02:12:00] [INFO ] Deduced a trap composed of 37 places in 76 ms of which 0 ms to minimize.
[2025-06-01 02:12:00] [INFO ] Deduced a trap composed of 65 places in 142 ms of which 2 ms to minimize.
[2025-06-01 02:12:02] [INFO ] Deduced a trap composed of 49 places in 169 ms of which 2 ms to minimize.
[2025-06-01 02:12:02] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:12:02] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2025-06-01 02:12:02] [INFO ] Deduced a trap composed of 49 places in 196 ms of which 2 ms to minimize.
[2025-06-01 02:12:03] [INFO ] Deduced a trap composed of 49 places in 157 ms of which 3 ms to minimize.
[2025-06-01 02:12:03] [INFO ] Deduced a trap composed of 55 places in 188 ms of which 3 ms to minimize.
[2025-06-01 02:12:03] [INFO ] Deduced a trap composed of 64 places in 204 ms of which 2 ms to minimize.
[2025-06-01 02:12:03] [INFO ] Deduced a trap composed of 93 places in 226 ms of which 2 ms to minimize.
[2025-06-01 02:12:04] [INFO ] Deduced a trap composed of 47 places in 225 ms of which 3 ms to minimize.
[2025-06-01 02:12:04] [INFO ] Deduced a trap composed of 106 places in 233 ms of which 2 ms to minimize.
[2025-06-01 02:12:04] [INFO ] Deduced a trap composed of 101 places in 240 ms of which 2 ms to minimize.
[2025-06-01 02:12:04] [INFO ] Deduced a trap composed of 91 places in 260 ms of which 3 ms to minimize.
[2025-06-01 02:12:05] [INFO ] Deduced a trap composed of 109 places in 267 ms of which 3 ms to minimize.
[2025-06-01 02:12:05] [INFO ] Deduced a trap composed of 23 places in 107 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:12:10] [INFO ] Deduced a trap composed of 64 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:12:10] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:12:11] [INFO ] Deduced a trap composed of 57 places in 189 ms of which 2 ms to minimize.
[2025-06-01 02:12:11] [INFO ] Deduced a trap composed of 58 places in 171 ms of which 2 ms to minimize.
[2025-06-01 02:12:12] [INFO ] Deduced a trap composed of 65 places in 190 ms of which 3 ms to minimize.
[2025-06-01 02:12:12] [INFO ] Deduced a trap composed of 25 places in 214 ms of which 2 ms to minimize.
[2025-06-01 02:12:12] [INFO ] Deduced a trap composed of 13 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:12:13] [INFO ] Deduced a trap composed of 49 places in 191 ms of which 2 ms to minimize.
[2025-06-01 02:12:13] [INFO ] Deduced a trap composed of 57 places in 168 ms of which 3 ms to minimize.
[2025-06-01 02:12:14] [INFO ] Deduced a trap composed of 48 places in 172 ms of which 2 ms to minimize.
[2025-06-01 02:12:15] [INFO ] Deduced a trap composed of 69 places in 197 ms of which 2 ms to minimize.
[2025-06-01 02:12:15] [INFO ] Deduced a trap composed of 85 places in 207 ms of which 3 ms to minimize.
[2025-06-01 02:12:16] [INFO ] Deduced a trap composed of 63 places in 229 ms of which 3 ms to minimize.
[2025-06-01 02:12:16] [INFO ] Deduced a trap composed of 92 places in 240 ms of which 3 ms to minimize.
[2025-06-01 02:12:16] [INFO ] Deduced a trap composed of 86 places in 243 ms of which 3 ms to minimize.
[2025-06-01 02:12:16] [INFO ] Deduced a trap composed of 29 places in 249 ms of which 6 ms to minimize.
[2025-06-01 02:12:17] [INFO ] Deduced a trap composed of 63 places in 249 ms of which 3 ms to minimize.
[2025-06-01 02:12:17] [INFO ] Deduced a trap composed of 87 places in 236 ms of which 3 ms to minimize.
[2025-06-01 02:12:17] [INFO ] Deduced a trap composed of 84 places in 230 ms of which 3 ms to minimize.
[2025-06-01 02:12:17] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:12:27] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2025-06-01 02:12:28] [INFO ] Deduced a trap composed of 15 places in 157 ms of which 2 ms to minimize.
[2025-06-01 02:12:31] [INFO ] Deduced a trap composed of 15 places in 173 ms of which 2 ms to minimize.
[2025-06-01 02:12:32] [INFO ] Deduced a trap composed of 91 places in 182 ms of which 3 ms to minimize.
[2025-06-01 02:12:32] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 0 ms to minimize.
[2025-06-01 02:12:32] [INFO ] Deduced a trap composed of 18 places in 190 ms of which 3 ms to minimize.
[2025-06-01 02:12:33] [INFO ] Deduced a trap composed of 44 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:12:33] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 3 ms to minimize.
(s164 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 0)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 1)
(s21 0)
(s22 0)
(s23 1)
(s24 1)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 1)
(s30 0)
(s31 0)
(s32 1)
(s33 0)
(s34 0)
(s35 1)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0timeout
) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 61785ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61809ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65296 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 27 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-06-01 02:12:36] [INFO ] Computed 19 invariants in 2 ms
[2025-06-01 02:12:36] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:12:36] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-01 02:12:36] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:12:36] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 02:12:36] [INFO ] After 7ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:12:36] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:12:36] [INFO ] After 98ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 157 ms.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 31 ms. (1250 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463650 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463650 steps, saw 281240 distinct states, run finished after 3003 ms. (steps per millisecond=154 ) properties seen :0
[2025-06-01 02:12:39] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
// Phase 1: matrix 828 rows 486 cols
[2025-06-01 02:12:39] [INFO ] Computed 28 invariants in 3 ms
[2025-06-01 02:12:39] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1314 variables, 0/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 871 constraints, problems are : Problem set: 0 solved, 1 unsolved in 479 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 95 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 84 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 486/486 places, 2907/2907 transitions.
RANDOM walk for 40000 steps (8 resets) in 179 ms. (222 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 32 ms. (1212 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 451530 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :0 out of 1
Probabilistic random walk after 451530 steps, saw 274231 distinct states, run finished after 3001 ms. (steps per millisecond=150 ) properties seen :0
[2025-06-01 02:12:43] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:12:43] [INFO ] Invariant cache hit.
[2025-06-01 02:12:43] [INFO ] State equation strengthened by 356 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 504/1314 variables, 336/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1314 variables, 314/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1314 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1314/1314 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 50/51 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/53 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 92/145 variables, 53/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/145 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/145 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 137/282 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/282 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/282 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/282 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 192/474 variables, 88/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/474 variables, 29/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/474 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 320/794 variables, 16/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/794 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/810 variables, 8/220 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/810 variables, 1/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/810 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 504/1314 variables, 336/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1314 variables, 314/871 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2025-06-01 02:12:44] [INFO ] Deduced a trap composed of 3 places in 61 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1314 variables, 1/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/1314 variables, 0/872 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1314/1314 variables, and 872 constraints, problems are : Problem set: 0 solved, 1 unsolved in 590 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 486/486 constraints, ReadFeed: 356/356 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 983ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 94 ms.
Support contains 1 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 486/486 places, 2907/2907 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 2907/2907 transitions.
Applied a total of 0 rules in 85 ms. Remains 486 /486 variables (removed 0) and now considering 2907/2907 (removed 0) transitions.
[2025-06-01 02:12:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:12:45] [INFO ] Invariant cache hit.
[2025-06-01 02:12:45] [INFO ] Implicit Places using invariants in 535 ms returned []
[2025-06-01 02:12:45] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:12:45] [INFO ] Invariant cache hit.
[2025-06-01 02:12:45] [INFO ] State equation strengthened by 356 read => feed constraints.
[2025-06-01 02:12:48] [INFO ] Implicit Places using invariants and state equation in 2889 ms returned []
Implicit Place search using SMT with State Equation took 3425 ms to find 0 implicit places.
[2025-06-01 02:12:48] [INFO ] Redundant transitions in 80 ms returned []
Running 2898 sub problems to find dead transitions.
[2025-06-01 02:12:48] [INFO ] Flow matrix only has 828 transitions (discarded 2079 similar events)
[2025-06-01 02:12:48] [INFO ] Invariant cache hit.
[2025-06-01 02:12:48] [INFO ] State equation strengthened by 356 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:13:13] [INFO ] Deduced a trap composed of 3 places in 119 ms of which 1 ms to minimize.
[2025-06-01 02:13:13] [INFO ] Deduced a trap composed of 3 places in 110 ms of which 1 ms to minimize.
[2025-06-01 02:13:13] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
[2025-06-01 02:13:13] [INFO ] Deduced a trap composed of 3 places in 109 ms of which 1 ms to minimize.
[2025-06-01 02:13:13] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 1 ms to minimize.
[2025-06-01 02:13:14] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 2 ms to minimize.
[2025-06-01 02:13:15] [INFO ] Deduced a trap composed of 49 places in 167 ms of which 2 ms to minimize.
[2025-06-01 02:13:16] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 0 ms to minimize.
[2025-06-01 02:13:16] [INFO ] Deduced a trap composed of 3 places in 51 ms of which 1 ms to minimize.
[2025-06-01 02:13:16] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 3 ms to minimize.
[2025-06-01 02:13:16] [INFO ] Deduced a trap composed of 49 places in 173 ms of which 3 ms to minimize.
[2025-06-01 02:13:16] [INFO ] Deduced a trap composed of 55 places in 190 ms of which 2 ms to minimize.
[2025-06-01 02:13:17] [INFO ] Deduced a trap composed of 64 places in 215 ms of which 3 ms to minimize.
[2025-06-01 02:13:17] [INFO ] Deduced a trap composed of 93 places in 232 ms of which 2 ms to minimize.
[2025-06-01 02:13:17] [INFO ] Deduced a trap composed of 47 places in 231 ms of which 3 ms to minimize.
[2025-06-01 02:13:17] [INFO ] Deduced a trap composed of 106 places in 227 ms of which 2 ms to minimize.
[2025-06-01 02:13:18] [INFO ] Deduced a trap composed of 101 places in 248 ms of which 3 ms to minimize.
[2025-06-01 02:13:18] [INFO ] Deduced a trap composed of 91 places in 265 ms of which 2 ms to minimize.
[2025-06-01 02:13:18] [INFO ] Deduced a trap composed of 109 places in 269 ms of which 3 ms to minimize.
[2025-06-01 02:13:18] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/1314 variables, and 48 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 2898/2898 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2898 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/486 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/486 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/486 variables, 20/48 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:13:24] [INFO ] Deduced a trap composed of 64 places in 170 ms of which 3 ms to minimize.
[2025-06-01 02:13:24] [INFO ] Deduced a trap composed of 51 places in 168 ms of which 2 ms to minimize.
[2025-06-01 02:13:25] [INFO ] Deduced a trap composed of 57 places in 182 ms of which 2 ms to minimize.
[2025-06-01 02:13:25] [INFO ] Deduced a trap composed of 58 places in 175 ms of which 3 ms to minimize.
[2025-06-01 02:13:26] [INFO ] Deduced a trap composed of 65 places in 192 ms of which 3 ms to minimize.
[2025-06-01 02:13:26] [INFO ] Deduced a trap composed of 25 places in 208 ms of which 3 ms to minimize.
[2025-06-01 02:13:26] [INFO ] Deduced a trap composed of 13 places in 166 ms of which 3 ms to minimize.
[2025-06-01 02:13:27] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 2 ms to minimize.
[2025-06-01 02:13:27] [INFO ] Deduced a trap composed of 57 places in 175 ms of which 2 ms to minimize.
[2025-06-01 02:13:28] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 2 ms to minimize.
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 69 places in 205 ms of which 3 ms to minimize.
[2025-06-01 02:13:29] [INFO ] Deduced a trap composed of 85 places in 211 ms of which 2 ms to minimize.
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 63 places in 235 ms of which 3 ms to minimize.
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 92 places in 252 ms of which 2 ms to minimize.
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 86 places in 241 ms of which 3 ms to minimize.
[2025-06-01 02:13:30] [INFO ] Deduced a trap composed of 29 places in 245 ms of which 2 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 63 places in 250 ms of which 3 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 87 places in 229 ms of which 2 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 84 places in 237 ms of which 2 ms to minimize.
[2025-06-01 02:13:31] [INFO ] Deduced a trap composed of 58 places in 255 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/486 variables, 20/68 constraints. Problems are: Problem set: 0 solved, 2898 unsolved
[2025-06-01 02:13:41] [INFO ] Deduced a trap composed of 3 places in 64 ms of which 1 ms to minimize.
[2025-06-01 02:13:42] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 2 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 15 places in 181 ms of which 3 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 91 places in 179 ms of which 3 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 3 places in 76 ms of which 1 ms to minimize.
[2025-06-01 02:13:46] [INFO ] Deduced a trap composed of 18 places in 174 ms of which 2 ms to minimize.
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 44 places in 184 ms of which 2 ms to minimize.
[2025-06-01 02:13:47] [INFO ] Deduced a trap composed of 19 places in 189 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 1)
(s15 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/1314 variables, and 76 constraints, problems are : Problem set: 0 solved, 2898 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 9/9 constraints, State Equation: 0/486 constraints, ReadFeed: 0/356 constraints, PredecessorRefiner: 0/2898 constraints, Known Traps: 48/48 constraints]
After SMT, in 61831ms problems are : Problem set: 0 solved, 2898 unsolved
Search for dead transitions found 0 dead transitions in 61854ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65459 ms. Remains : 486/486 places, 2907/2907 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2725 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 1 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 1 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 143 Post agglomeration using F-continuation condition.Transition count delta: 143
Deduced a syphon composed of 143 places in 0 ms
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 286 rules applied. Total rules applied 530 place count 145 transition count 352
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 602 place count 145 transition count 280
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 620 place count 136 transition count 280
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 629 place count 136 transition count 271
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 638 place count 136 transition count 262
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 710 place count 136 transition count 190
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 782 place count 64 transition count 190
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 791 place count 64 transition count 190
Applied a total of 791 rules in 32 ms. Remains 64 /486 variables (removed 422) and now considering 190/2907 (removed 2717) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 190 rows 64 cols
[2025-06-01 02:13:50] [INFO ] Computed 19 invariants in 1 ms
[2025-06-01 02:13:50] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2025-06-01 02:13:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-01 02:13:50] [INFO ] After 39ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-01 02:13:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 02:13:50] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2025-06-01 02:13:50] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-01 02:13:50] [INFO ] After 83ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 145 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 2715 edges and 486 vertex of which 81 / 486 are part of one of the 9 SCC in 0 ms
Free SCC test removed 72 places
Drop transitions (Empty/Sink Transition effects.) removed 279 transitions
Ensure Unique test removed 2016 transitions
Reduce isomorphic transitions removed 2295 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 0 with 98 rules applied. Total rules applied 99 place count 414 transition count 514
Reduce places removed 98 places and 0 transitions.
Iterating post reduction 1 with 98 rules applied. Total rules applied 197 place count 316 transition count 514
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 197 place count 316 transition count 495
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 47 rules applied. Total rules applied 244 place count 288 transition count 495
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 276 rules applied. Total rules applied 520 place count 150 transition count 357
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 592 place count 150 transition count 285
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 610 place count 141 transition count 285
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 619 place count 141 transition count 276
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 628 place count 141 transition count 267
Free-agglomeration rule applied 72 times.
Iterating global reduction 4 with 72 rules applied. Total rules applied 700 place count 141 transition count 195
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 4 with 72 rules applied. Total rules applied 772 place count 69 transition count 195
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 5 with 9 rules applied. Total rules applied 781 place count 69 transition count 195
Applied a total of 781 rules in 31 ms. Remains 69 /486 variables (removed 417) and now considering 195/2907 (removed 2712) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 195 rows 69 cols
[2025-06-01 02:13:50] [INFO ] Computed 19 invariants in 1 ms
[2025-06-01 02:13:50] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2025-06-01 02:13:50] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-06-01 02:13:50] [INFO ] After 61ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2025-06-01 02:13:50] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 02:13:50] [INFO ] After 37ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :6
TRAPS : Iteration 0
[2025-06-01 02:13:50] [INFO ] After 81ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
[2025-06-01 02:13:50] [INFO ] After 212ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Over-approximation ignoring read arcs solved 0 properties in 279 ms.
Unable to solve all queries for examination StableMarking. Remains :6 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 6 properties from file /home/mcc/execution/StableMarking.xml in 1 ms.
Working with output stream class java.io.PrintStream
Total runtime 866652 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-09

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 891
TRANSITIONS: 3888
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 18792
NUPN UNITS: 23
LOADING TIME: 2.151

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.096
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.667
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: 2599
MODEL NAME: /home/mcc/execution/model
891 places, 3888 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.

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 StableMarking -timeout 180 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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