About the Execution of GreatSPN+red for Peterson-PT-4
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8444.487 | 1215969.00 | 2871012.00 | 1666.50 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r276-smll-171654416100168.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool greatspnxred
Input is Peterson-PT-4, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416100168
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.7M
-rw-r--r-- 1 mcc users 48K Apr 12 02:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 222K Apr 12 02:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 02:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 270K Apr 12 02:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 23K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 82K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 75K Apr 12 03:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 304K Apr 12 03:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 212K Apr 12 03:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 982K Apr 12 03:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.6K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 298K May 18 16:43 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 1716821470226
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 14:51:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-27 14:51:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 14:51:12] [INFO ] Load time of PNML (sax parser for PT used): 235 ms
[2024-05-27 14:51:12] [INFO ] Transformed 480 places.
[2024-05-27 14:51:12] [INFO ] Transformed 690 transitions.
[2024-05-27 14:51:12] [INFO ] Found NUPN structural information;
[2024-05-27 14:51:12] [INFO ] Parsed PT model containing 480 places and 690 transitions and 2120 arcs in 451 ms.
RANDOM walk for 40000 steps (8 resets) in 3268 ms. (12 steps per ms) remains 220/480 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 16 ms. (23 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 22 ms. (17 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 25 ms. (15 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 17 ms. (22 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 13 ms. (28 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 15 ms. (25 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 220/220 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 220/220 properties
[2024-05-27 14:51:14] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2024-05-27 14:51:14] [INFO ] Computed 19 invariants in 40 ms
[2024-05-27 14:51:14] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 230/450 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 230/455 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 450/1110 variables, and 455 constraints, problems are : Problem set: 0 solved, 220 unsolved in 5214 ms.
Refiners :[Domain max(s): 450/480 constraints, Positive P Invariants (semi-flows): 5/14 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/220 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 230/450 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/450 variables, 230/455 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 450/1110 variables, and 455 constraints, problems are : Problem set: 0 solved, 220 unsolved in 5015 ms.
Refiners :[Domain max(s): 450/480 constraints, Positive P Invariants (semi-flows): 5/14 constraints, Generalized P Invariants (flows): 0/5 constraints, State Equation: 0/480 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 0/220 constraints, Known Traps: 0/0 constraints]
After SMT, in 10470ms problems are : Problem set: 0 solved, 220 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 220 out of 480 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 480/480 places, 690/690 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 82 place count 480 transition count 608
Reduce places removed 82 places and 0 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 164 place count 398 transition count 608
Performed 59 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 59 Pre rules applied. Total rules applied 164 place count 398 transition count 549
Deduced a syphon composed of 59 places in 2 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 2 with 118 rules applied. Total rules applied 282 place count 339 transition count 549
Applied a total of 282 rules in 110 ms. Remains 339 /480 variables (removed 141) and now considering 549/690 (removed 141) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 339/480 places, 549/690 transitions.
RANDOM walk for 4000000 steps (8 resets) in 87409 ms. (45 steps per ms) remains 216/220 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 216/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 215/216 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 215/215 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 211/215 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 211/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 208/211 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 208/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 204/208 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 174 ms. (228 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 185 ms. (215 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 204/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 180 ms. (221 steps per ms) remains 200/204 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 155 ms. (256 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 200/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 193/200 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 127 ms. (312 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 149 ms. (266 steps per ms) remains 193/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 186/193 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 126 ms. (314 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 124 ms. (320 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 143 ms. (277 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 130 ms. (305 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 133 ms. (298 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 154 ms. (258 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 158 ms. (251 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 160 ms. (248 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 195 ms. (204 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 163 ms. (243 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 186/186 properties
[2024-05-27 14:51:58] [INFO ] Flow matrix only has 489 transitions (discarded 60 similar events)
// Phase 1: matrix 489 rows 339 cols
[2024-05-27 14:51:58] [INFO ] Computed 19 invariants in 6 ms
[2024-05-27 14:51:58] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 123/309 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 123/314 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 5/314 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 5/319 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 489/808 variables, 319/653 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 116/769 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/808 variables, 0/769 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 14 (OVERLAPS) 20/828 variables, 20/789 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/828 variables, 20/809 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/828 variables, 4/813 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/828 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 18 (OVERLAPS) 0/828 variables, 0/813 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 828/828 variables, and 813 constraints, problems are : Problem set: 0 solved, 186 unsolved in 32165 ms.
Refiners :[Domain max(s): 339/339 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 339/339 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/186 variables, 186/186 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/186 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (OVERLAPS) 123/309 variables, 5/191 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/309 variables, 123/314 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/309 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 5/314 variables, 5/319 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/314 variables, 5/324 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/314 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 5/319 variables, 5/329 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/319 variables, 5/334 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-27 14:52:35] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 37 ms to minimize.
[2024-05-27 14:52:35] [INFO ] Deduced a trap composed of 32 places in 189 ms of which 3 ms to minimize.
[2024-05-27 14:52:36] [INFO ] Deduced a trap composed of 48 places in 126 ms of which 3 ms to minimize.
[2024-05-27 14:52:36] [INFO ] Deduced a trap composed of 36 places in 154 ms of which 4 ms to minimize.
[2024-05-27 14:52:36] [INFO ] Deduced a trap composed of 28 places in 150 ms of which 3 ms to minimize.
[2024-05-27 14:52:36] [INFO ] Deduced a trap composed of 80 places in 132 ms of which 3 ms to minimize.
[2024-05-27 14:52:37] [INFO ] Deduced a trap composed of 99 places in 87 ms of which 4 ms to minimize.
[2024-05-27 14:52:37] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 3 ms to minimize.
[2024-05-27 14:52:37] [INFO ] Deduced a trap composed of 115 places in 97 ms of which 3 ms to minimize.
[2024-05-27 14:52:37] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/319 variables, 10/344 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/319 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 12 (OVERLAPS) 489/808 variables, 319/663 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/808 variables, 116/779 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/808 variables, 186/965 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/808 variables, 0/965 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 16 (OVERLAPS) 20/828 variables, 20/985 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/828 variables, 20/1005 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/828 variables, 4/1009 constraints. Problems are: Problem set: 0 solved, 186 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 828/828 variables, and 1009 constraints, problems are : Problem set: 0 solved, 186 unsolved in 45014 ms.
Refiners :[Domain max(s): 339/339 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 339/339 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 10/10 constraints]
After SMT, in 77264ms problems are : Problem set: 0 solved, 186 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 186 out of 339 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 339/339 places, 549/549 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 339 transition count 529
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 319 transition count 529
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 40 place count 319 transition count 522
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 54 place count 312 transition count 522
Applied a total of 54 rules in 56 ms. Remains 312 /339 variables (removed 27) and now considering 522/549 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 312/339 places, 522/549 transitions.
RANDOM walk for 3718095 steps (8 resets) in 107711 ms. (34 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 302 ms. (132 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 320 ms. (124 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 374 ms. (106 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 312 ms. (127 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 369 ms. (108 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 329 ms. (121 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 319 ms. (125 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 186/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 328 ms. (121 steps per ms) remains 178/186 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 178/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 296 ms. (134 steps per ms) remains 171/178 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 237 ms. (168 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 282 ms. (141 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 260 ms. (153 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 368 ms. (108 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 280 ms. (142 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 298 ms. (133 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 306 ms. (130 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 289 ms. (137 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 316 ms. (126 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 331 ms. (120 steps per ms) remains 171/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 167/171 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 301 ms. (132 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 330 ms. (120 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 322 ms. (123 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 264 ms. (150 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 333 ms. (119 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 167/167 properties
[2024-05-27 14:53:57] [INFO ] Flow matrix only has 462 transitions (discarded 60 similar events)
// Phase 1: matrix 462 rows 312 cols
[2024-05-27 14:53:57] [INFO ] Computed 19 invariants in 4 ms
[2024-05-27 14:53:57] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 115/282 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 115/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 5/287 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 5/292 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (OVERLAPS) 462/754 variables, 292/599 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/754 variables, 116/715 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/754 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 14 (OVERLAPS) 20/774 variables, 20/735 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/774 variables, 20/755 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/774 variables, 4/759 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/774 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 18 (OVERLAPS) 0/774 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 167 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 759 constraints, problems are : Problem set: 0 solved, 167 unsolved in 29941 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 312/312 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 167 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 167/167 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 115/282 variables, 5/172 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 115/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 5/287 variables, 5/292 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/287 variables, 5/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/287 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 8 (OVERLAPS) 5/292 variables, 5/302 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/292 variables, 5/307 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-27 14:54:31] [INFO ] Deduced a trap composed of 45 places in 221 ms of which 3 ms to minimize.
[2024-05-27 14:54:31] [INFO ] Deduced a trap composed of 49 places in 132 ms of which 3 ms to minimize.
[2024-05-27 14:54:31] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 3 ms to minimize.
[2024-05-27 14:54:32] [INFO ] Deduced a trap composed of 32 places in 186 ms of which 3 ms to minimize.
[2024-05-27 14:54:32] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 2 ms to minimize.
[2024-05-27 14:54:32] [INFO ] Deduced a trap composed of 71 places in 104 ms of which 2 ms to minimize.
[2024-05-27 14:54:32] [INFO ] Deduced a trap composed of 87 places in 79 ms of which 2 ms to minimize.
[2024-05-27 14:54:32] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-27 14:54:32] [INFO ] Deduced a trap composed of 100 places in 84 ms of which 2 ms to minimize.
[2024-05-27 14:54:33] [INFO ] Deduced a trap composed of 61 places in 64 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/292 variables, 10/317 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 12 (OVERLAPS) 462/754 variables, 292/609 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/754 variables, 116/725 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/754 variables, 167/892 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/754 variables, 0/892 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 16 (OVERLAPS) 20/774 variables, 20/912 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/774 variables, 20/932 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/774 variables, 4/936 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-27 14:54:59] [INFO ] Deduced a trap composed of 38 places in 207 ms of which 4 ms to minimize.
[2024-05-27 14:54:59] [INFO ] Deduced a trap composed of 23 places in 175 ms of which 4 ms to minimize.
[2024-05-27 14:55:00] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 3 ms to minimize.
[2024-05-27 14:55:00] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 3 ms to minimize.
[2024-05-27 14:55:00] [INFO ] Deduced a trap composed of 10 places in 180 ms of which 3 ms to minimize.
[2024-05-27 14:55:00] [INFO ] Deduced a trap composed of 8 places in 198 ms of which 3 ms to minimize.
[2024-05-27 14:55:00] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 4 ms to minimize.
[2024-05-27 14:55:01] [INFO ] Deduced a trap composed of 20 places in 160 ms of which 2 ms to minimize.
[2024-05-27 14:55:01] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 2 ms to minimize.
[2024-05-27 14:55:01] [INFO ] Deduced a trap composed of 18 places in 154 ms of which 2 ms to minimize.
[2024-05-27 14:55:01] [INFO ] Deduced a trap composed of 18 places in 166 ms of which 3 ms to minimize.
[2024-05-27 14:55:01] [INFO ] Deduced a trap composed of 10 places in 162 ms of which 3 ms to minimize.
[2024-05-27 14:55:01] [INFO ] Deduced a trap composed of 35 places in 144 ms of which 3 ms to minimize.
[2024-05-27 14:55:02] [INFO ] Deduced a trap composed of 34 places in 127 ms of which 4 ms to minimize.
[2024-05-27 14:55:02] [INFO ] Deduced a trap composed of 23 places in 140 ms of which 8 ms to minimize.
[2024-05-27 14:55:02] [INFO ] Deduced a trap composed of 24 places in 117 ms of which 3 ms to minimize.
[2024-05-27 14:55:02] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 2 ms to minimize.
[2024-05-27 14:55:02] [INFO ] Deduced a trap composed of 36 places in 134 ms of which 3 ms to minimize.
[2024-05-27 14:55:03] [INFO ] Deduced a trap composed of 23 places in 132 ms of which 2 ms to minimize.
[2024-05-27 14:55:03] [INFO ] Deduced a trap composed of 46 places in 160 ms of which 4 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/774 variables, 20/956 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-27 14:55:10] [INFO ] Deduced a trap composed of 23 places in 155 ms of which 4 ms to minimize.
[2024-05-27 14:55:10] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 5 ms to minimize.
[2024-05-27 14:55:10] [INFO ] Deduced a trap composed of 9 places in 335 ms of which 28 ms to minimize.
[2024-05-27 14:55:11] [INFO ] Deduced a trap composed of 11 places in 325 ms of which 13 ms to minimize.
[2024-05-27 14:55:12] [INFO ] Deduced a trap composed of 49 places in 1568 ms of which 2 ms to minimize.
[2024-05-27 14:55:13] [INFO ] Deduced a trap composed of 49 places in 188 ms of which 7 ms to minimize.
[2024-05-27 14:55:13] [INFO ] Deduced a trap composed of 39 places in 99 ms of which 2 ms to minimize.
[2024-05-27 14:55:13] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 2 ms to minimize.
[2024-05-27 14:55:13] [INFO ] Deduced a trap composed of 19 places in 172 ms of which 3 ms to minimize.
[2024-05-27 14:55:13] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 2 ms to minimize.
[2024-05-27 14:55:13] [INFO ] Deduced a trap composed of 39 places in 83 ms of which 2 ms to minimize.
[2024-05-27 14:55:13] [INFO ] Deduced a trap composed of 39 places in 97 ms of which 2 ms to minimize.
[2024-05-27 14:55:14] [INFO ] Deduced a trap composed of 42 places in 133 ms of which 3 ms to minimize.
[2024-05-27 14:55:14] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 1 ms to minimize.
[2024-05-27 14:55:14] [INFO ] Deduced a trap composed of 32 places in 155 ms of which 3 ms to minimize.
[2024-05-27 14:55:14] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 13 ms to minimize.
[2024-05-27 14:55:14] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 2 ms to minimize.
[2024-05-27 14:55:14] [INFO ] Deduced a trap composed of 41 places in 113 ms of which 2 ms to minimize.
[2024-05-27 14:55:15] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-05-27 14:55:15] [INFO ] Deduced a trap composed of 10 places in 128 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/774 variables, 20/976 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-27 14:55:23] [INFO ] Deduced a trap composed of 51 places in 137 ms of which 3 ms to minimize.
[2024-05-27 14:55:23] [INFO ] Deduced a trap composed of 44 places in 126 ms of which 2 ms to minimize.
[2024-05-27 14:55:24] [INFO ] Deduced a trap composed of 56 places in 121 ms of which 2 ms to minimize.
[2024-05-27 14:55:24] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 3 ms to minimize.
[2024-05-27 14:55:24] [INFO ] Deduced a trap composed of 8 places in 159 ms of which 3 ms to minimize.
[2024-05-27 14:55:24] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-27 14:55:24] [INFO ] Deduced a trap composed of 11 places in 162 ms of which 3 ms to minimize.
[2024-05-27 14:55:25] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 3 ms to minimize.
[2024-05-27 14:55:25] [INFO ] Deduced a trap composed of 19 places in 163 ms of which 2 ms to minimize.
[2024-05-27 14:55:25] [INFO ] Deduced a trap composed of 32 places in 134 ms of which 3 ms to minimize.
[2024-05-27 14:55:25] [INFO ] Deduced a trap composed of 42 places in 139 ms of which 2 ms to minimize.
[2024-05-27 14:55:26] [INFO ] Deduced a trap composed of 29 places in 136 ms of which 3 ms to minimize.
[2024-05-27 14:55:26] [INFO ] Deduced a trap composed of 38 places in 162 ms of which 3 ms to minimize.
[2024-05-27 14:55:26] [INFO ] Deduced a trap composed of 32 places in 119 ms of which 2 ms to minimize.
[2024-05-27 14:55:26] [INFO ] Deduced a trap composed of 19 places in 162 ms of which 2 ms to minimize.
[2024-05-27 14:55:26] [INFO ] Deduced a trap composed of 36 places in 146 ms of which 2 ms to minimize.
[2024-05-27 14:55:27] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 2 ms to minimize.
[2024-05-27 14:55:27] [INFO ] Deduced a trap composed of 32 places in 95 ms of which 2 ms to minimize.
[2024-05-27 14:55:27] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-05-27 14:55:27] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/774 variables, 20/996 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-27 14:55:37] [INFO ] Deduced a trap composed of 36 places in 124 ms of which 2 ms to minimize.
[2024-05-27 14:55:37] [INFO ] Deduced a trap composed of 36 places in 121 ms of which 2 ms to minimize.
[2024-05-27 14:55:37] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 2 ms to minimize.
[2024-05-27 14:55:37] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 2 ms to minimize.
[2024-05-27 14:55:38] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 3 ms to minimize.
[2024-05-27 14:55:38] [INFO ] Deduced a trap composed of 32 places in 128 ms of which 2 ms to minimize.
[2024-05-27 14:55:38] [INFO ] Deduced a trap composed of 44 places in 139 ms of which 2 ms to minimize.
[2024-05-27 14:55:38] [INFO ] Deduced a trap composed of 45 places in 149 ms of which 2 ms to minimize.
[2024-05-27 14:55:39] [INFO ] Deduced a trap composed of 48 places in 104 ms of which 2 ms to minimize.
[2024-05-27 14:55:39] [INFO ] Deduced a trap composed of 8 places in 148 ms of which 3 ms to minimize.
[2024-05-27 14:55:39] [INFO ] Deduced a trap composed of 18 places in 141 ms of which 3 ms to minimize.
[2024-05-27 14:55:40] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2024-05-27 14:55:40] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 1 ms to minimize.
[2024-05-27 14:55:40] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 1 ms to minimize.
[2024-05-27 14:55:40] [INFO ] Deduced a trap composed of 74 places in 147 ms of which 2 ms to minimize.
[2024-05-27 14:55:40] [INFO ] Deduced a trap composed of 30 places in 144 ms of which 2 ms to minimize.
[2024-05-27 14:55:40] [INFO ] Deduced a trap composed of 33 places in 150 ms of which 3 ms to minimize.
[2024-05-27 14:55:41] [INFO ] Deduced a trap composed of 14 places in 162 ms of which 3 ms to minimize.
[2024-05-27 14:55:41] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 3 ms to minimize.
[2024-05-27 14:55:41] [INFO ] Deduced a trap composed of 60 places in 151 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/774 variables, 20/1016 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 774/774 variables, and 1016 constraints, problems are : Problem set: 0 solved, 167 unsolved in 75014 ms.
Refiners :[Domain max(s): 312/312 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 312/312 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 90/90 constraints]
After SMT, in 104992ms problems are : Problem set: 0 solved, 167 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 312 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 312/312 places, 522/522 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 312 transition count 511
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 301 transition count 511
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 22 place count 301 transition count 507
Deduced a syphon composed of 4 places in 16 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 30 place count 297 transition count 507
Applied a total of 30 rules in 57 ms. Remains 297 /312 variables (removed 15) and now considering 507/522 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 297/312 places, 507/522 transitions.
RANDOM walk for 3578311 steps (8 resets) in 117365 ms. (30 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 363 ms. (109 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 236 ms. (168 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 167/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 163/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 208 ms. (191 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 321 ms. (124 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 335 ms. (119 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 323 ms. (123 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 293 ms. (136 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 287 ms. (138 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 246 ms. (161 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 267 ms. (149 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 163/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 159/163 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 309 ms. (129 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 350 ms. (113 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 285 ms. (139 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 216 ms. (184 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 364 ms. (109 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 258 ms. (154 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 248 ms. (160 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 281 ms. (141 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 255 ms. (156 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 249 ms. (160 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 261 ms. (152 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 268 ms. (148 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 233 ms. (170 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 244 ms. (163 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 253 ms. (157 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 169 ms. (235 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 247 ms. (161 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 206 ms. (193 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 159/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 211 ms. (188 steps per ms) remains 158/159 properties
BEST_FIRST walk for 40004 steps (8 resets) in 256 ms. (155 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 224 ms. (177 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 278 ms. (143 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 205 ms. (194 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 273 ms. (146 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 226 ms. (176 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 263 ms. (151 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 292 ms. (136 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 262 ms. (152 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 198 ms. (201 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 351 ms. (113 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 257 ms. (155 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 238 ms. (167 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 295 ms. (135 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 300 ms. (132 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 235 ms. (169 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 250 ms. (159 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 252 ms. (158 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 209 ms. (190 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 272 ms. (146 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 225 ms. (177 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 199 ms. (200 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 202 ms. (197 steps per ms) remains 158/158 properties
Probabilistic random walk after 10000001 steps, saw 1666808 distinct states, run finished after 108630 ms. (steps per millisecond=92 ) properties seen :96
[2024-05-27 14:58:14] [INFO ] Flow matrix only has 447 transitions (discarded 60 similar events)
// Phase 1: matrix 447 rows 297 cols
[2024-05-27 14:58:14] [INFO ] Computed 19 invariants in 3 ms
[2024-05-27 14:58:14] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 109/171 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 109/174 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 3/174 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 3/177 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (OVERLAPS) 279/456 variables, 177/363 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/456 variables, 48/411 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 0/411 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (OVERLAPS) 52/508 variables, 20/431 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/508 variables, 20/451 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/508 variables, 4/455 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/508 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 18 (OVERLAPS) 80/588 variables, 16/471 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/588 variables, 16/487 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/588 variables, 68/555 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/588 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 22 (OVERLAPS) 80/668 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/668 variables, 80/637 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/668 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 25 (OVERLAPS) 2/670 variables, 2/639 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/670 variables, 2/641 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/670 variables, 0/641 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 28 (OVERLAPS) 2/672 variables, 2/643 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/672 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/672 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 31 (OVERLAPS) 72/744 variables, 84/729 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/744 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 33 (OVERLAPS) 0/744 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 744/744 variables, and 729 constraints, problems are : Problem set: 0 solved, 62 unsolved in 11690 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 297/297 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 62 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/62 variables, 62/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/62 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 2 (OVERLAPS) 109/171 variables, 3/65 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/171 variables, 109/174 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/171 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 5 (OVERLAPS) 3/174 variables, 3/177 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 3/180 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 8 (OVERLAPS) 3/177 variables, 3/183 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/177 variables, 3/186 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:27] [INFO ] Deduced a trap composed of 65 places in 70 ms of which 2 ms to minimize.
[2024-05-27 14:58:27] [INFO ] Deduced a trap composed of 100 places in 77 ms of which 2 ms to minimize.
[2024-05-27 14:58:27] [INFO ] Deduced a trap composed of 78 places in 69 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/177 variables, 3/189 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/177 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 12 (OVERLAPS) 279/456 variables, 177/366 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/456 variables, 48/414 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/456 variables, 60/474 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/456 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 16 (OVERLAPS) 52/508 variables, 20/494 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/508 variables, 20/514 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/508 variables, 4/518 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:30] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-05-27 14:58:30] [INFO ] Deduced a trap composed of 20 places in 98 ms of which 2 ms to minimize.
[2024-05-27 14:58:30] [INFO ] Deduced a trap composed of 57 places in 115 ms of which 2 ms to minimize.
[2024-05-27 14:58:30] [INFO ] Deduced a trap composed of 41 places in 103 ms of which 2 ms to minimize.
[2024-05-27 14:58:31] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 1 ms to minimize.
[2024-05-27 14:58:31] [INFO ] Deduced a trap composed of 50 places in 76 ms of which 2 ms to minimize.
[2024-05-27 14:58:31] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-27 14:58:31] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 2 ms to minimize.
[2024-05-27 14:58:31] [INFO ] Deduced a trap composed of 37 places in 120 ms of which 2 ms to minimize.
[2024-05-27 14:58:31] [INFO ] Deduced a trap composed of 39 places in 114 ms of which 2 ms to minimize.
[2024-05-27 14:58:31] [INFO ] Deduced a trap composed of 46 places in 84 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/508 variables, 11/529 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/508 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 21 (OVERLAPS) 80/588 variables, 16/545 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/588 variables, 16/561 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/588 variables, 68/629 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:35] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 1 ms to minimize.
[2024-05-27 14:58:35] [INFO ] Deduced a trap composed of 40 places in 89 ms of which 1 ms to minimize.
[2024-05-27 14:58:35] [INFO ] Deduced a trap composed of 49 places in 83 ms of which 1 ms to minimize.
[2024-05-27 14:58:35] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-05-27 14:58:35] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-05-27 14:58:36] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 2 ms to minimize.
[2024-05-27 14:58:36] [INFO ] Deduced a trap composed of 30 places in 109 ms of which 3 ms to minimize.
[2024-05-27 14:58:36] [INFO ] Deduced a trap composed of 25 places in 105 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/588 variables, 8/637 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:38] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-27 14:58:38] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 3 ms to minimize.
[2024-05-27 14:58:38] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/588 variables, 3/640 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:40] [INFO ] Deduced a trap composed of 46 places in 96 ms of which 2 ms to minimize.
[2024-05-27 14:58:40] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/588 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:41] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-05-27 14:58:41] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-05-27 14:58:41] [INFO ] Deduced a trap composed of 73 places in 115 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/588 variables, 3/645 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:44] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/588 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/588 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 30 (OVERLAPS) 80/668 variables, 2/648 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/668 variables, 80/728 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:48] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-27 14:58:48] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-05-27 14:58:48] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 1 ms to minimize.
[2024-05-27 14:58:48] [INFO ] Deduced a trap composed of 68 places in 106 ms of which 2 ms to minimize.
[2024-05-27 14:58:48] [INFO ] Deduced a trap composed of 46 places in 133 ms of which 3 ms to minimize.
[2024-05-27 14:58:48] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-05-27 14:58:48] [INFO ] Deduced a trap composed of 52 places in 108 ms of which 2 ms to minimize.
[2024-05-27 14:58:49] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 2 ms to minimize.
[2024-05-27 14:58:49] [INFO ] Deduced a trap composed of 65 places in 102 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/668 variables, 9/737 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:51] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-27 14:58:51] [INFO ] Deduced a trap composed of 10 places in 130 ms of which 3 ms to minimize.
[2024-05-27 14:58:51] [INFO ] Deduced a trap composed of 62 places in 94 ms of which 3 ms to minimize.
At refinement iteration 33 (INCLUDED_ONLY) 0/668 variables, 3/740 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:58:54] [INFO ] Deduced a trap composed of 60 places in 125 ms of which 2 ms to minimize.
[2024-05-27 14:58:54] [INFO ] Deduced a trap composed of 42 places in 141 ms of which 2 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/668 variables, 2/742 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/668 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 36 (OVERLAPS) 2/670 variables, 2/744 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/670 variables, 2/746 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/670 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 39 (OVERLAPS) 2/672 variables, 2/748 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/672 variables, 2/750 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/672 variables, 2/752 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:59:03] [INFO ] Deduced a trap composed of 28 places in 138 ms of which 3 ms to minimize.
[2024-05-27 14:59:03] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 3 ms to minimize.
[2024-05-27 14:59:04] [INFO ] Deduced a trap composed of 15 places in 158 ms of which 3 ms to minimize.
[2024-05-27 14:59:04] [INFO ] Deduced a trap composed of 45 places in 154 ms of which 2 ms to minimize.
[2024-05-27 14:59:04] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 3 ms to minimize.
[2024-05-27 14:59:04] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 1 ms to minimize.
[2024-05-27 14:59:05] [INFO ] Deduced a trap composed of 26 places in 133 ms of which 3 ms to minimize.
[2024-05-27 14:59:05] [INFO ] Deduced a trap composed of 58 places in 138 ms of which 2 ms to minimize.
[2024-05-27 14:59:05] [INFO ] Deduced a trap composed of 46 places in 102 ms of which 2 ms to minimize.
[2024-05-27 14:59:05] [INFO ] Deduced a trap composed of 15 places in 144 ms of which 3 ms to minimize.
[2024-05-27 14:59:05] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
[2024-05-27 14:59:06] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
[2024-05-27 14:59:06] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-27 14:59:06] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-27 14:59:06] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
[2024-05-27 14:59:06] [INFO ] Deduced a trap composed of 8 places in 135 ms of which 2 ms to minimize.
[2024-05-27 14:59:07] [INFO ] Deduced a trap composed of 41 places in 115 ms of which 3 ms to minimize.
[2024-05-27 14:59:07] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 2 ms to minimize.
At refinement iteration 42 (INCLUDED_ONLY) 0/672 variables, 18/770 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:59:11] [INFO ] Deduced a trap composed of 30 places in 117 ms of which 2 ms to minimize.
[2024-05-27 14:59:11] [INFO ] Deduced a trap composed of 30 places in 133 ms of which 3 ms to minimize.
[2024-05-27 14:59:12] [INFO ] Deduced a trap composed of 26 places in 74 ms of which 2 ms to minimize.
[2024-05-27 14:59:12] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 3 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/672 variables, 4/774 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:59:17] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 3 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/672 variables, 1/775 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/672 variables, 0/775 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 46 (OVERLAPS) 72/744 variables, 84/859 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/744 variables, 0/859 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:59:38] [INFO ] Deduced a trap composed of 50 places in 123 ms of which 4 ms to minimize.
At refinement iteration 48 (OVERLAPS) 0/744 variables, 1/860 constraints. Problems are: Problem set: 0 solved, 62 unsolved
[2024-05-27 14:59:45] [INFO ] Deduced a trap composed of 15 places in 211 ms of which 4 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/744 variables, 1/861 constraints. Problems are: Problem set: 0 solved, 62 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/744 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 62 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 744/744 variables, and 861 constraints, problems are : Problem set: 0 solved, 62 unsolved in 90011 ms.
Refiners :[Domain max(s): 297/297 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 297/297 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 62/62 constraints, Known Traps: 70/70 constraints]
After SMT, in 101726ms problems are : Problem set: 0 solved, 62 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 62 out of 297 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 297/297 places, 507/507 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 50 place count 297 transition count 457
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 100 place count 247 transition count 457
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 100 place count 247 transition count 435
Deduced a syphon composed of 22 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 144 place count 225 transition count 435
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 166 place count 214 transition count 424
Applied a total of 166 rules in 69 ms. Remains 214 /297 variables (removed 83) and now considering 424/507 (removed 83) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 214/297 places, 424/507 transitions.
RANDOM walk for 4000000 steps (8 resets) in 37687 ms. (106 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1212 ms. (329 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1322 ms. (302 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1548 ms. (258 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1363 ms. (293 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1131 ms. (353 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1042 ms. (383 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1088 ms. (367 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1589 ms. (251 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1891 ms. (211 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1495 ms. (267 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1238 ms. (322 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1196 ms. (334 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1097 ms. (364 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1180 ms. (338 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1062 ms. (376 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1357 ms. (294 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1162 ms. (343 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1331 ms. (300 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1418 ms. (281 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1125 ms. (355 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1410 ms. (283 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1320 ms. (302 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1215 ms. (328 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1055 ms. (378 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1466 ms. (272 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1141 ms. (350 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1343 ms. (297 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1365 ms. (292 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1210 ms. (330 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1260 ms. (317 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1208 ms. (330 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1220 ms. (327 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1359 ms. (294 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1425 ms. (280 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1264 ms. (316 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1322 ms. (302 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1178 ms. (339 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1256 ms. (318 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1443 ms. (277 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1227 ms. (325 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1347 ms. (296 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1179 ms. (338 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1351 ms. (295 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1185 ms. (337 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1583 ms. (252 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1592 ms. (251 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1367 ms. (292 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1466 ms. (272 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1301 ms. (307 steps per ms) remains 62/62 properties
BEST_FIRST walk for 400004 steps (8 resets) in 1236 ms. (323 steps per ms) remains 62/62 properties
Interrupted probabilistic random walk after 11177256 steps, run timeout after 105001 ms. (steps per millisecond=106 ) properties seen :39 out of 62
Probabilistic random walk after 11177256 steps, saw 1863207 distinct states, run finished after 105017 ms. (steps per millisecond=106 ) properties seen :39
[2024-05-27 15:02:16] [INFO ] Flow matrix only has 364 transitions (discarded 60 similar events)
// Phase 1: matrix 364 rows 214 cols
[2024-05-27 15:02:16] [INFO ] Computed 19 invariants in 3 ms
[2024-05-27 15:02:16] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 55/78 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 55/80 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 2/80 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 2/82 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 150/232 variables, 82/170 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/232 variables, 24/194 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 68/300 variables, 20/214 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/300 variables, 20/234 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/300 variables, 4/238 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (OVERLAPS) 120/420 variables, 24/262 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/420 variables, 24/286 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/420 variables, 92/378 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/420 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (OVERLAPS) 82/502 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/502 variables, 82/463 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/502 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (OVERLAPS) 3/505 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/505 variables, 3/469 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/505 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 28 (OVERLAPS) 3/508 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/508 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/508 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (OVERLAPS) 70/578 variables, 88/563 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/578 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 33 (OVERLAPS) 0/578 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 578/578 variables, and 563 constraints, problems are : Problem set: 0 solved, 23 unsolved in 2717 ms.
Refiners :[Domain max(s): 214/214 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 214/214 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 55/78 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/78 variables, 55/80 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 2/80 variables, 2/82 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 2/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (OVERLAPS) 2/82 variables, 2/86 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/82 variables, 2/88 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:20] [INFO ] Deduced a trap composed of 47 places in 56 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/82 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/82 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (OVERLAPS) 150/232 variables, 82/171 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/232 variables, 24/195 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/232 variables, 15/210 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/232 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 16 (OVERLAPS) 68/300 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/300 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/300 variables, 4/254 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:20] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-27 15:02:20] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 2 ms to minimize.
[2024-05-27 15:02:20] [INFO ] Deduced a trap composed of 30 places in 51 ms of which 1 ms to minimize.
[2024-05-27 15:02:20] [INFO ] Deduced a trap composed of 31 places in 52 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/300 variables, 4/258 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/300 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 21 (OVERLAPS) 120/420 variables, 24/282 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/420 variables, 24/306 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/420 variables, 92/398 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:21] [INFO ] Deduced a trap composed of 43 places in 68 ms of which 2 ms to minimize.
[2024-05-27 15:02:21] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/420 variables, 2/400 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/420 variables, 0/400 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 26 (OVERLAPS) 82/502 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/502 variables, 82/485 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:22] [INFO ] Deduced a trap composed of 9 places in 114 ms of which 2 ms to minimize.
[2024-05-27 15:02:22] [INFO ] Deduced a trap composed of 27 places in 119 ms of which 2 ms to minimize.
[2024-05-27 15:02:22] [INFO ] Deduced a trap composed of 15 places in 166 ms of which 3 ms to minimize.
[2024-05-27 15:02:23] [INFO ] Deduced a trap composed of 16 places in 108 ms of which 2 ms to minimize.
[2024-05-27 15:02:23] [INFO ] Deduced a trap composed of 30 places in 94 ms of which 2 ms to minimize.
[2024-05-27 15:02:23] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-27 15:02:23] [INFO ] Deduced a trap composed of 44 places in 64 ms of which 2 ms to minimize.
[2024-05-27 15:02:23] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/502 variables, 8/493 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/502 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 30 (OVERLAPS) 3/505 variables, 3/496 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/505 variables, 3/499 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/505 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 33 (OVERLAPS) 3/508 variables, 3/502 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/508 variables, 3/505 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/508 variables, 8/513 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:24] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 1 ms to minimize.
[2024-05-27 15:02:24] [INFO ] Deduced a trap composed of 26 places in 156 ms of which 3 ms to minimize.
[2024-05-27 15:02:24] [INFO ] Deduced a trap composed of 8 places in 112 ms of which 2 ms to minimize.
At refinement iteration 36 (INCLUDED_ONLY) 0/508 variables, 3/516 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:25] [INFO ] Deduced a trap composed of 22 places in 152 ms of which 3 ms to minimize.
[2024-05-27 15:02:25] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-05-27 15:02:26] [INFO ] Deduced a trap composed of 8 places in 171 ms of which 3 ms to minimize.
At refinement iteration 37 (INCLUDED_ONLY) 0/508 variables, 3/519 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:26] [INFO ] Deduced a trap composed of 14 places in 93 ms of which 2 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/508 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:27] [INFO ] Deduced a trap composed of 10 places in 184 ms of which 3 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/508 variables, 1/521 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:27] [INFO ] Deduced a trap composed of 54 places in 120 ms of which 3 ms to minimize.
[2024-05-27 15:02:27] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
[2024-05-27 15:02:27] [INFO ] Deduced a trap composed of 47 places in 92 ms of which 2 ms to minimize.
[2024-05-27 15:02:28] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-05-27 15:02:28] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 2 ms to minimize.
At refinement iteration 40 (INCLUDED_ONLY) 0/508 variables, 5/526 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/508 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 42 (OVERLAPS) 70/578 variables, 88/614 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:29] [INFO ] Deduced a trap composed of 50 places in 142 ms of which 3 ms to minimize.
[2024-05-27 15:02:29] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-05-27 15:02:29] [INFO ] Deduced a trap composed of 16 places in 63 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/578 variables, 3/617 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:30] [INFO ] Deduced a trap composed of 22 places in 74 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/578 variables, 1/618 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:30] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-05-27 15:02:31] [INFO ] Deduced a trap composed of 34 places in 86 ms of which 2 ms to minimize.
At refinement iteration 45 (INCLUDED_ONLY) 0/578 variables, 2/620 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-27 15:02:31] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 3 ms to minimize.
At refinement iteration 46 (INCLUDED_ONLY) 0/578 variables, 1/621 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/578 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 48 (OVERLAPS) 0/578 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 578/578 variables, and 621 constraints, problems are : Problem set: 0 solved, 23 unsolved in 13617 ms.
Refiners :[Domain max(s): 214/214 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 214/214 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 35/35 constraints]
After SMT, in 16361ms problems are : Problem set: 0 solved, 23 unsolved
Parikh walk visited 22 properties in 895 ms.
Support contains 1 out of 214 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 214/214 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 214 transition count 387
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 74 place count 177 transition count 387
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 74 place count 177 transition count 379
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 90 place count 169 transition count 379
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 106 place count 161 transition count 371
Applied a total of 106 rules in 49 ms. Remains 161 /214 variables (removed 53) and now considering 371/424 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 161/214 places, 371/424 transitions.
RANDOM walk for 4000000 steps (8 resets) in 7372 ms. (542 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2757 ms. (1450 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2774268 steps, run timeout after 6001 ms. (steps per millisecond=462 ) properties seen :0 out of 1
Probabilistic random walk after 2774268 steps, saw 462532 distinct states, run finished after 6004 ms. (steps per millisecond=462 ) properties seen :0
[2024-05-27 15:02:42] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 161 cols
[2024-05-27 15:02:42] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 15:02:42] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 63/92 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/176 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/176 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/176 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/176 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 160/336 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 108/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/336 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 72/408 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 72/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/412 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/412 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/412 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/416 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/416 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/416 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 56/472 variables, 80/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/472 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/472 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 472/472 variables, and 457 constraints, problems are : Problem set: 0 solved, 1 unsolved in 324 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/29 variables, 1/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/29 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/29 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 63/92 variables, 29/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/92 variables, 8/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/92 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 84/176 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/176 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/176 variables, 4/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/176 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 160/336 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/336 variables, 32/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/336 variables, 108/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/336 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 72/408 variables, 4/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/408 variables, 72/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/408 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 4/412 variables, 4/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/412 variables, 4/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/412 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 4/416 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/416 variables, 4/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/416 variables, 1/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 15:02:43] [INFO ] Deduced a trap composed of 38 places in 128 ms of which 3 ms to minimize.
[2024-05-27 15:02:43] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 2 ms to minimize.
[2024-05-27 15:02:43] [INFO ] Deduced a trap composed of 9 places in 93 ms of which 1 ms to minimize.
[2024-05-27 15:02:43] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-05-27 15:02:44] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
At refinement iteration 31 (INCLUDED_ONLY) 0/416 variables, 5/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/416 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 56/472 variables, 80/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/472 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (OVERLAPS) 0/472 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 472/472 variables, and 463 constraints, problems are : Problem set: 0 solved, 1 unsolved in 898 ms.
Refiners :[Domain max(s): 161/161 constraints, Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 161/161 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 371/371 transitions.
Applied a total of 0 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 161/161 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-05-27 15:02:44] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:02:44] [INFO ] Invariant cache hit.
[2024-05-27 15:02:44] [INFO ] Implicit Places using invariants in 239 ms returned [151, 152, 153, 154, 155]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 254 ms to find 5 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 156/161 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 273 ms. Remains : 156/161 places, 371/371 transitions.
RANDOM walk for 4000000 steps (8 resets) in 7290 ms. (548 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2551 ms. (1567 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2573718 steps, run timeout after 6001 ms. (steps per millisecond=428 ) properties seen :0 out of 1
Probabilistic random walk after 2573718 steps, saw 429148 distinct states, run finished after 6001 ms. (steps per millisecond=428 ) properties seen :0
[2024-05-27 15:02:53] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
// Phase 1: matrix 311 rows 156 cols
[2024-05-27 15:02:53] [INFO ] Computed 14 invariants in 3 ms
[2024-05-27 15:02:53] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/411 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/411 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/411 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 56/467 variables, 76/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 253 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 15:02:53] [INFO ] Deduced a trap composed of 15 places in 111 ms of which 2 ms to minimize.
[2024-05-27 15:02:53] [INFO ] Deduced a trap composed of 24 places in 159 ms of which 2 ms to minimize.
[2024-05-27 15:02:54] [INFO ] Deduced a trap composed of 19 places in 155 ms of which 3 ms to minimize.
[2024-05-27 15:02:54] [INFO ] Deduced a trap composed of 16 places in 146 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/407 variables, 4/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/407 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/411 variables, 4/367 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/411 variables, 4/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/411 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 56/467 variables, 76/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/467 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/467 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 989 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 4/4 constraints]
After SMT, in 1256ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 8 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-05-27 15:02:54] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:02:54] [INFO ] Invariant cache hit.
[2024-05-27 15:02:54] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-27 15:02:54] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:02:54] [INFO ] Invariant cache hit.
[2024-05-27 15:02:54] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 15:02:55] [INFO ] Implicit Places using invariants and state equation in 706 ms returned []
Implicit Place search using SMT with State Equation took 1006 ms to find 0 implicit places.
[2024-05-27 15:02:55] [INFO ] Redundant transitions in 42 ms returned []
Running 366 sub problems to find dead transitions.
[2024-05-27 15:02:55] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:02:55] [INFO ] Invariant cache hit.
[2024-05-27 15:02:55] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 14/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:02:57] [INFO ] Deduced a trap composed of 14 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:02:57] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 2 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 26 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 26 places in 122 ms of which 3 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 2 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 26 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 15 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 3 ms to minimize.
[2024-05-27 15:02:58] [INFO ] Deduced a trap composed of 27 places in 87 ms of which 2 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 2 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 3 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 31 places in 110 ms of which 1 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 8 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 2 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 3 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 2 ms to minimize.
[2024-05-27 15:02:59] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:00] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 2 ms to minimize.
[2024-05-27 15:03:00] [INFO ] Deduced a trap composed of 9 places in 146 ms of which 3 ms to minimize.
[2024-05-27 15:03:00] [INFO ] Deduced a trap composed of 20 places in 119 ms of which 2 ms to minimize.
[2024-05-27 15:03:00] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 2 ms to minimize.
[2024-05-27 15:03:00] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:03:00] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 14 places in 75 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 32 places in 67 ms of which 1 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 28 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 31 places in 114 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 16 places in 107 ms of which 3 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 2 ms to minimize.
[2024-05-27 15:03:01] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-27 15:03:02] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 1 ms to minimize.
[2024-05-27 15:03:02] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 2 ms to minimize.
[2024-05-27 15:03:02] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:04] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 3 ms to minimize.
[2024-05-27 15:03:04] [INFO ] Deduced a trap composed of 9 places in 87 ms of which 6 ms to minimize.
[2024-05-27 15:03:04] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 2 ms to minimize.
[2024-05-27 15:03:04] [INFO ] Deduced a trap composed of 15 places in 65 ms of which 1 ms to minimize.
[2024-05-27 15:03:04] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2024-05-27 15:03:04] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 2 ms to minimize.
[2024-05-27 15:03:04] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 1 ms to minimize.
[2024-05-27 15:03:05] [INFO ] Deduced a trap composed of 20 places in 55 ms of which 1 ms to minimize.
[2024-05-27 15:03:05] [INFO ] Deduced a trap composed of 21 places in 53 ms of which 1 ms to minimize.
[2024-05-27 15:03:05] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 2 ms to minimize.
[2024-05-27 15:03:05] [INFO ] Deduced a trap composed of 15 places in 113 ms of which 2 ms to minimize.
[2024-05-27 15:03:05] [INFO ] Deduced a trap composed of 58 places in 127 ms of which 3 ms to minimize.
[2024-05-27 15:03:05] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 2 ms to minimize.
[2024-05-27 15:03:06] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-05-27 15:03:06] [INFO ] Deduced a trap composed of 16 places in 48 ms of which 1 ms to minimize.
[2024-05-27 15:03:06] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
[2024-05-27 15:03:06] [INFO ] Deduced a trap composed of 27 places in 73 ms of which 2 ms to minimize.
[2024-05-27 15:03:06] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 2 ms to minimize.
[2024-05-27 15:03:06] [INFO ] Deduced a trap composed of 36 places in 86 ms of which 3 ms to minimize.
[2024-05-27 15:03:06] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:07] [INFO ] Deduced a trap composed of 30 places in 67 ms of which 1 ms to minimize.
[2024-05-27 15:03:07] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-05-27 15:03:07] [INFO ] Deduced a trap composed of 10 places in 92 ms of which 2 ms to minimize.
[2024-05-27 15:03:07] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 27 places in 76 ms of which 2 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 22 places in 75 ms of which 1 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 2 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-05-27 15:03:08] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 2 ms to minimize.
[2024-05-27 15:03:09] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
[2024-05-27 15:03:09] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 1 ms to minimize.
[2024-05-27 15:03:09] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-27 15:03:09] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
[2024-05-27 15:03:09] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 2 ms to minimize.
[2024-05-27 15:03:09] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 2 ms to minimize.
[2024-05-27 15:03:09] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 1 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 28 places in 46 ms of which 1 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 23 places in 53 ms of which 1 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 11 places in 75 ms of which 2 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 43 places in 73 ms of which 1 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 2 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-05-27 15:03:11] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-05-27 15:03:12] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-05-27 15:03:12] [INFO ] Deduced a trap composed of 27 places in 55 ms of which 1 ms to minimize.
[2024-05-27 15:03:12] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 2 ms to minimize.
[2024-05-27 15:03:12] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-05-27 15:03:12] [INFO ] Deduced a trap composed of 30 places in 49 ms of which 1 ms to minimize.
[2024-05-27 15:03:12] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
[2024-05-27 15:03:12] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-27 15:03:13] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-27 15:03:13] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-27 15:03:13] [INFO ] Deduced a trap composed of 36 places in 71 ms of which 2 ms to minimize.
[2024-05-27 15:03:13] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:17] [INFO ] Deduced a trap composed of 17 places in 46 ms of which 1 ms to minimize.
[2024-05-27 15:03:19] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-05-27 15:03:19] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 2 ms to minimize.
[2024-05-27 15:03:19] [INFO ] Deduced a trap composed of 31 places in 113 ms of which 3 ms to minimize.
[2024-05-27 15:03:19] [INFO ] Deduced a trap composed of 11 places in 107 ms of which 3 ms to minimize.
[2024-05-27 15:03:19] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-05-27 15:03:20] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 1 ms to minimize.
[2024-05-27 15:03:20] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2024-05-27 15:03:20] [INFO ] Deduced a trap composed of 21 places in 75 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:21] [INFO ] Deduced a trap composed of 44 places in 52 ms of which 1 ms to minimize.
[2024-05-27 15:03:22] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 2 ms to minimize.
[2024-05-27 15:03:23] [INFO ] Deduced a trap composed of 35 places in 61 ms of which 2 ms to minimize.
[2024-05-27 15:03:23] [INFO ] Deduced a trap composed of 24 places in 78 ms of which 2 ms to minimize.
[2024-05-27 15:03:23] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 3 ms to minimize.
[2024-05-27 15:03:24] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-05-27 15:03:24] [INFO ] Deduced a trap composed of 22 places in 116 ms of which 3 ms to minimize.
[2024-05-27 15:03:24] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/467 variables, and 287 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 14/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 117/287 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:28] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-05-27 15:03:28] [INFO ] Deduced a trap composed of 19 places in 68 ms of which 1 ms to minimize.
[2024-05-27 15:03:29] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
[2024-05-27 15:03:30] [INFO ] Deduced a trap composed of 19 places in 147 ms of which 3 ms to minimize.
[2024-05-27 15:03:30] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:03:31] [INFO ] Deduced a trap composed of 20 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:03:31] [INFO ] Deduced a trap composed of 32 places in 88 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:03:33] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 3 ms to minimize.
[2024-05-27 15:03:35] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-05-27 15:03:35] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-27 15:03:36] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 311/467 variables, 156/454 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 116/570 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 366/936 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 936 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30016 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 128/128 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61359 ms. Remains : 156/156 places, 371/371 transitions.
RANDOM walk for 400000 steps (8 resets) in 2430 ms. (164 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-27 15:03:56] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:03:56] [INFO ] Invariant cache hit.
[2024-05-27 15:03:56] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 15:03:56] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 15:03:56] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 15:03:56] [INFO ] After 14ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 15:03:56] [INFO ] After 38ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 15:03:56] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 15:03:56] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 15:03:56] [INFO ] After 101ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 15:03:56] [INFO ] After 16ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 15:03:56] [INFO ] After 46ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 15:03:56] [INFO ] After 214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 4000000 steps (8 resets) in 7669 ms. (521 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2112 ms. (1893 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2747970 steps, run timeout after 6001 ms. (steps per millisecond=457 ) properties seen :0 out of 1
Probabilistic random walk after 2747970 steps, saw 458129 distinct states, run finished after 6001 ms. (steps per millisecond=457 ) properties seen :0
[2024-05-27 15:04:05] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:05] [INFO ] Invariant cache hit.
[2024-05-27 15:04:05] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/411 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/411 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/411 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 56/467 variables, 76/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 15:04:05] [INFO ] Deduced a trap composed of 14 places in 132 ms of which 3 ms to minimize.
[2024-05-27 15:04:05] [INFO ] Deduced a trap composed of 8 places in 117 ms of which 3 ms to minimize.
[2024-05-27 15:04:06] [INFO ] Deduced a trap composed of 9 places in 109 ms of which 2 ms to minimize.
[2024-05-27 15:04:06] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 2 ms to minimize.
[2024-05-27 15:04:06] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/407 variables, 5/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/407 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/411 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/411 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/411 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 56/467 variables, 76/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/467 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/467 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 909 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1162ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-05-27 15:04:06] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:06] [INFO ] Invariant cache hit.
[2024-05-27 15:04:06] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-27 15:04:06] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:06] [INFO ] Invariant cache hit.
[2024-05-27 15:04:06] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 15:04:07] [INFO ] Implicit Places using invariants and state equation in 625 ms returned []
Implicit Place search using SMT with State Equation took 870 ms to find 0 implicit places.
[2024-05-27 15:04:07] [INFO ] Redundant transitions in 11 ms returned []
Running 366 sub problems to find dead transitions.
[2024-05-27 15:04:07] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:07] [INFO ] Invariant cache hit.
[2024-05-27 15:04:07] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 14/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:09] [INFO ] Deduced a trap composed of 14 places in 151 ms of which 4 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 21 places in 206 ms of which 3 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 2 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 26 places in 112 ms of which 2 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 26 places in 113 ms of which 2 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 2 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 3 ms to minimize.
[2024-05-27 15:04:10] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 3 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 8 places in 125 ms of which 2 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 31 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 1 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-05-27 15:04:11] [INFO ] Deduced a trap composed of 21 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 2 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 20 places in 112 ms of which 2 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 14 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 16 places in 98 ms of which 2 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 27 places in 102 ms of which 1 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 32 places in 96 ms of which 2 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 14 places in 70 ms of which 1 ms to minimize.
[2024-05-27 15:04:12] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 1 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 3 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 31 places in 147 ms of which 2 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 2 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 42 places in 128 ms of which 3 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 2 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:04:13] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-27 15:04:14] [INFO ] Deduced a trap composed of 15 places in 90 ms of which 2 ms to minimize.
[2024-05-27 15:04:14] [INFO ] Deduced a trap composed of 26 places in 124 ms of which 2 ms to minimize.
[2024-05-27 15:04:14] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:16] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-27 15:04:16] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 2 ms to minimize.
[2024-05-27 15:04:16] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 2 ms to minimize.
[2024-05-27 15:04:16] [INFO ] Deduced a trap composed of 15 places in 83 ms of which 1 ms to minimize.
[2024-05-27 15:04:16] [INFO ] Deduced a trap composed of 32 places in 87 ms of which 2 ms to minimize.
[2024-05-27 15:04:17] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 2 ms to minimize.
[2024-05-27 15:04:17] [INFO ] Deduced a trap composed of 25 places in 160 ms of which 2 ms to minimize.
[2024-05-27 15:04:17] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 2 ms to minimize.
[2024-05-27 15:04:17] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
[2024-05-27 15:04:17] [INFO ] Deduced a trap composed of 16 places in 100 ms of which 8 ms to minimize.
[2024-05-27 15:04:17] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 1 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 2 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 9 places in 122 ms of which 2 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 10 places in 51 ms of which 1 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 16 places in 46 ms of which 1 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 16 places in 47 ms of which 1 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 2 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 2 ms to minimize.
[2024-05-27 15:04:18] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:19] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 1 ms to minimize.
[2024-05-27 15:04:19] [INFO ] Deduced a trap composed of 21 places in 61 ms of which 1 ms to minimize.
[2024-05-27 15:04:19] [INFO ] Deduced a trap composed of 10 places in 101 ms of which 2 ms to minimize.
[2024-05-27 15:04:20] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 3 ms to minimize.
[2024-05-27 15:04:20] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 1 ms to minimize.
[2024-05-27 15:04:20] [INFO ] Deduced a trap composed of 27 places in 103 ms of which 2 ms to minimize.
[2024-05-27 15:04:20] [INFO ] Deduced a trap composed of 23 places in 82 ms of which 2 ms to minimize.
[2024-05-27 15:04:20] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 1 ms to minimize.
[2024-05-27 15:04:20] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 2 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 29 places in 70 ms of which 2 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 1 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-27 15:04:21] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-27 15:04:22] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:23] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-27 15:04:23] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-27 15:04:23] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
[2024-05-27 15:04:23] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 2 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 43 places in 88 ms of which 2 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 2 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 2 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 1 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 28 places in 52 ms of which 1 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 2 ms to minimize.
[2024-05-27 15:04:24] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 2 ms to minimize.
[2024-05-27 15:04:25] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 2 ms to minimize.
[2024-05-27 15:04:25] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-27 15:04:25] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-27 15:04:26] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 2 ms to minimize.
[2024-05-27 15:04:26] [INFO ] Deduced a trap composed of 11 places in 120 ms of which 2 ms to minimize.
[2024-05-27 15:04:26] [INFO ] Deduced a trap composed of 36 places in 99 ms of which 2 ms to minimize.
[2024-05-27 15:04:26] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:30] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
[2024-05-27 15:04:32] [INFO ] Deduced a trap composed of 10 places in 78 ms of which 2 ms to minimize.
[2024-05-27 15:04:32] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-05-27 15:04:32] [INFO ] Deduced a trap composed of 31 places in 126 ms of which 2 ms to minimize.
[2024-05-27 15:04:33] [INFO ] Deduced a trap composed of 11 places in 115 ms of which 2 ms to minimize.
[2024-05-27 15:04:33] [INFO ] Deduced a trap composed of 31 places in 69 ms of which 2 ms to minimize.
[2024-05-27 15:04:33] [INFO ] Deduced a trap composed of 40 places in 82 ms of which 2 ms to minimize.
[2024-05-27 15:04:33] [INFO ] Deduced a trap composed of 23 places in 122 ms of which 2 ms to minimize.
[2024-05-27 15:04:33] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:34] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-27 15:04:36] [INFO ] Deduced a trap composed of 35 places in 56 ms of which 2 ms to minimize.
[2024-05-27 15:04:37] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-05-27 15:04:37] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-27 15:04:37] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 2 ms to minimize.
[2024-05-27 15:04:37] [INFO ] Deduced a trap composed of 17 places in 127 ms of which 2 ms to minimize.
SMT process timed out in 30308ms, After SMT, problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 30316ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31221 ms. Remains : 156/156 places, 371/371 transitions.
RANDOM walk for 400000 steps (8 resets) in 770 ms. (518 steps per ms) remains 1/1 properties
Running SMT prover for 1 properties.
[2024-05-27 15:04:37] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:37] [INFO ] Invariant cache hit.
[2024-05-27 15:04:37] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 15:04:38] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-27 15:04:38] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 15:04:38] [INFO ] After 17ms SMT Verify possible using 116 Read/Feed constraints in real domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 15:04:38] [INFO ] After 42ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 15:04:38] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 15:04:38] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 15:04:38] [INFO ] After 114ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-27 15:04:38] [INFO ] After 20ms SMT Verify possible using 116 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 15:04:38] [INFO ] After 43ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 15:04:38] [INFO ] After 228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
RANDOM walk for 40000 steps (8 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 28 ms. (1379 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1355976 steps, run timeout after 3001 ms. (steps per millisecond=451 ) properties seen :0 out of 1
Probabilistic random walk after 1355976 steps, saw 226063 distinct states, run finished after 3001 ms. (steps per millisecond=451 ) properties seen :0
[2024-05-27 15:04:41] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:41] [INFO ] Invariant cache hit.
[2024-05-27 15:04:41] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/411 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/411 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/411 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 56/467 variables, 76/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 259 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 15:04:41] [INFO ] Deduced a trap composed of 14 places in 85 ms of which 2 ms to minimize.
[2024-05-27 15:04:42] [INFO ] Deduced a trap composed of 8 places in 142 ms of which 3 ms to minimize.
[2024-05-27 15:04:42] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 1 ms to minimize.
[2024-05-27 15:04:42] [INFO ] Deduced a trap composed of 16 places in 116 ms of which 2 ms to minimize.
[2024-05-27 15:04:42] [INFO ] Deduced a trap composed of 28 places in 132 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/407 variables, 5/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/407 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/411 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/411 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/411 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 56/467 variables, 76/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/467 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/467 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 971 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1241ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 13 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 156/156 places, 371/371 transitions.
RANDOM walk for 40000 steps (8 resets) in 110 ms. (360 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 1310892 steps, run timeout after 3001 ms. (steps per millisecond=436 ) properties seen :0 out of 1
Probabilistic random walk after 1310892 steps, saw 218564 distinct states, run finished after 3004 ms. (steps per millisecond=436 ) properties seen :0
[2024-05-27 15:04:45] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:45] [INFO ] Invariant cache hit.
[2024-05-27 15:04:45] [INFO ] State equation strengthened by 116 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 4/411 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/411 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/411 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 56/467 variables, 76/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/467 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 467/467 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 242 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 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, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 26/27 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 26/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/28 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/28 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 63/91 variables, 28/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/91 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 84/175 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/175 variables, 4/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/175 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 160/335 variables, 32/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/335 variables, 32/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/335 variables, 108/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/335 variables, 0/282 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 72/407 variables, 4/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/407 variables, 72/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/407 variables, 1/359 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-27 15:04:46] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 3 ms to minimize.
[2024-05-27 15:04:46] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 2 ms to minimize.
[2024-05-27 15:04:46] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 3 ms to minimize.
[2024-05-27 15:04:46] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 3 ms to minimize.
[2024-05-27 15:04:46] [INFO ] Deduced a trap composed of 28 places in 128 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/407 variables, 5/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/407 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 4/411 variables, 4/368 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/411 variables, 4/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/411 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 56/467 variables, 76/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/467 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/467 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 467/467 variables, and 448 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1093 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1357ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 156 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 156/156 places, 371/371 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 156/156 places, 371/371 transitions.
Applied a total of 0 rules in 6 ms. Remains 156 /156 variables (removed 0) and now considering 371/371 (removed 0) transitions.
[2024-05-27 15:04:47] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:47] [INFO ] Invariant cache hit.
[2024-05-27 15:04:47] [INFO ] Implicit Places using invariants in 298 ms returned []
[2024-05-27 15:04:47] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:47] [INFO ] Invariant cache hit.
[2024-05-27 15:04:47] [INFO ] State equation strengthened by 116 read => feed constraints.
[2024-05-27 15:04:48] [INFO ] Implicit Places using invariants and state equation in 651 ms returned []
Implicit Place search using SMT with State Equation took 957 ms to find 0 implicit places.
[2024-05-27 15:04:48] [INFO ] Redundant transitions in 4 ms returned []
Running 366 sub problems to find dead transitions.
[2024-05-27 15:04:48] [INFO ] Flow matrix only has 311 transitions (discarded 60 similar events)
[2024-05-27 15:04:48] [INFO ] Invariant cache hit.
[2024-05-27 15:04:48] [INFO ] State equation strengthened by 116 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 14/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:50] [INFO ] Deduced a trap composed of 14 places in 112 ms of which 2 ms to minimize.
[2024-05-27 15:04:50] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 2 ms to minimize.
[2024-05-27 15:04:50] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 16 places in 124 ms of which 3 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 26 places in 111 ms of which 2 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 15 places in 120 ms of which 3 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 8 places in 165 ms of which 3 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 2 ms to minimize.
[2024-05-27 15:04:51] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 3 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 8 places in 149 ms of which 3 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 31 places in 171 ms of which 3 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 8 places in 156 ms of which 3 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 21 places in 73 ms of which 1 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 22 places in 80 ms of which 2 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 22 places in 76 ms of which 2 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 22 places in 71 ms of which 2 ms to minimize.
[2024-05-27 15:04:52] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:53] [INFO ] Deduced a trap composed of 8 places in 133 ms of which 3 ms to minimize.
[2024-05-27 15:04:53] [INFO ] Deduced a trap composed of 9 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:04:53] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 2 ms to minimize.
[2024-05-27 15:04:53] [INFO ] Deduced a trap composed of 14 places in 138 ms of which 3 ms to minimize.
[2024-05-27 15:04:54] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 2 ms to minimize.
[2024-05-27 15:04:54] [INFO ] Deduced a trap composed of 27 places in 141 ms of which 2 ms to minimize.
[2024-05-27 15:04:54] [INFO ] Deduced a trap composed of 32 places in 150 ms of which 2 ms to minimize.
[2024-05-27 15:04:54] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-27 15:04:54] [INFO ] Deduced a trap composed of 32 places in 104 ms of which 2 ms to minimize.
[2024-05-27 15:04:54] [INFO ] Deduced a trap composed of 28 places in 178 ms of which 2 ms to minimize.
[2024-05-27 15:04:54] [INFO ] Deduced a trap composed of 31 places in 191 ms of which 3 ms to minimize.
[2024-05-27 15:04:55] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 2 ms to minimize.
[2024-05-27 15:04:55] [INFO ] Deduced a trap composed of 42 places in 163 ms of which 3 ms to minimize.
[2024-05-27 15:04:55] [INFO ] Deduced a trap composed of 15 places in 151 ms of which 3 ms to minimize.
[2024-05-27 15:04:55] [INFO ] Deduced a trap composed of 16 places in 162 ms of which 2 ms to minimize.
[2024-05-27 15:04:55] [INFO ] Deduced a trap composed of 16 places in 147 ms of which 2 ms to minimize.
[2024-05-27 15:04:55] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-27 15:04:55] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
[2024-05-27 15:04:56] [INFO ] Deduced a trap composed of 26 places in 132 ms of which 3 ms to minimize.
[2024-05-27 15:04:56] [INFO ] Deduced a trap composed of 20 places in 111 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 20/210 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:04:58] [INFO ] Deduced a trap composed of 16 places in 111 ms of which 2 ms to minimize.
[2024-05-27 15:04:58] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 2 ms to minimize.
[2024-05-27 15:04:58] [INFO ] Deduced a trap composed of 9 places in 99 ms of which 2 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 15 places in 80 ms of which 2 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 2 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 14 places in 102 ms of which 2 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 2 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 1 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 21 places in 63 ms of which 2 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
[2024-05-27 15:04:59] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 1 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 1 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 36 places in 64 ms of which 2 ms to minimize.
[2024-05-27 15:05:00] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 20/230 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:05:01] [INFO ] Deduced a trap composed of 30 places in 59 ms of which 1 ms to minimize.
[2024-05-27 15:05:01] [INFO ] Deduced a trap composed of 21 places in 55 ms of which 1 ms to minimize.
[2024-05-27 15:05:01] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2024-05-27 15:05:01] [INFO ] Deduced a trap composed of 11 places in 78 ms of which 1 ms to minimize.
[2024-05-27 15:05:01] [INFO ] Deduced a trap composed of 23 places in 55 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 27 places in 65 ms of which 2 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 29 places in 40 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 22 places in 51 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 2 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 28 places in 42 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 0 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 11 places in 37 ms of which 1 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 26 places in 50 ms of which 2 ms to minimize.
[2024-05-27 15:05:02] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-05-27 15:05:03] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-27 15:05:03] [INFO ] Deduced a trap composed of 10 places in 88 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 20/250 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:05:04] [INFO ] Deduced a trap composed of 17 places in 53 ms of which 1 ms to minimize.
[2024-05-27 15:05:04] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-27 15:05:04] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-27 15:05:05] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 1 ms to minimize.
[2024-05-27 15:05:05] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2024-05-27 15:05:05] [INFO ] Deduced a trap composed of 43 places in 92 ms of which 2 ms to minimize.
[2024-05-27 15:05:05] [INFO ] Deduced a trap composed of 11 places in 118 ms of which 3 ms to minimize.
[2024-05-27 15:05:05] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-27 15:05:05] [INFO ] Deduced a trap composed of 29 places in 59 ms of which 1 ms to minimize.
[2024-05-27 15:05:05] [INFO ] Deduced a trap composed of 28 places in 54 ms of which 1 ms to minimize.
[2024-05-27 15:05:06] [INFO ] Deduced a trap composed of 27 places in 58 ms of which 2 ms to minimize.
[2024-05-27 15:05:06] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 1 ms to minimize.
[2024-05-27 15:05:06] [INFO ] Deduced a trap composed of 28 places in 59 ms of which 2 ms to minimize.
[2024-05-27 15:05:06] [INFO ] Deduced a trap composed of 30 places in 44 ms of which 1 ms to minimize.
[2024-05-27 15:05:06] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
[2024-05-27 15:05:06] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
[2024-05-27 15:05:07] [INFO ] Deduced a trap composed of 10 places in 77 ms of which 1 ms to minimize.
[2024-05-27 15:05:07] [INFO ] Deduced a trap composed of 11 places in 91 ms of which 2 ms to minimize.
[2024-05-27 15:05:07] [INFO ] Deduced a trap composed of 36 places in 72 ms of which 2 ms to minimize.
[2024-05-27 15:05:07] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/156 variables, 20/270 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:05:10] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 1 ms to minimize.
[2024-05-27 15:05:12] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2024-05-27 15:05:12] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 1 ms to minimize.
[2024-05-27 15:05:12] [INFO ] Deduced a trap composed of 31 places in 77 ms of which 2 ms to minimize.
[2024-05-27 15:05:12] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-27 15:05:12] [INFO ] Deduced a trap composed of 31 places in 49 ms of which 1 ms to minimize.
[2024-05-27 15:05:13] [INFO ] Deduced a trap composed of 40 places in 70 ms of which 2 ms to minimize.
[2024-05-27 15:05:13] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-27 15:05:13] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/156 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:05:14] [INFO ] Deduced a trap composed of 44 places in 62 ms of which 2 ms to minimize.
[2024-05-27 15:05:15] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-05-27 15:05:16] [INFO ] Deduced a trap composed of 35 places in 58 ms of which 1 ms to minimize.
[2024-05-27 15:05:16] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 2 ms to minimize.
[2024-05-27 15:05:16] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 2 ms to minimize.
[2024-05-27 15:05:17] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 2 ms to minimize.
[2024-05-27 15:05:17] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-05-27 15:05:17] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/156 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 156/467 variables, and 287 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30013 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 0/156 constraints, ReadFeed: 0/116 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 117/117 constraints]
Escalating to Integer solving :Problem set: 0 solved, 366 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 156/156 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 14/170 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 117/287 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:05:20] [INFO ] Deduced a trap composed of 17 places in 78 ms of which 1 ms to minimize.
[2024-05-27 15:05:20] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2024-05-27 15:05:20] [INFO ] Deduced a trap composed of 9 places in 69 ms of which 2 ms to minimize.
[2024-05-27 15:05:22] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
[2024-05-27 15:05:22] [INFO ] Deduced a trap composed of 27 places in 75 ms of which 2 ms to minimize.
[2024-05-27 15:05:22] [INFO ] Deduced a trap composed of 20 places in 80 ms of which 1 ms to minimize.
[2024-05-27 15:05:22] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 366 unsolved
[2024-05-27 15:05:23] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 2 ms to minimize.
[2024-05-27 15:05:25] [INFO ] Deduced a trap composed of 22 places in 89 ms of which 2 ms to minimize.
[2024-05-27 15:05:26] [INFO ] Deduced a trap composed of 22 places in 137 ms of which 2 ms to minimize.
[2024-05-27 15:05:26] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/156 variables, 4/298 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/156 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 6 (OVERLAPS) 311/467 variables, 156/454 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 116/570 constraints. Problems are: Problem set: 0 solved, 366 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 366/936 constraints. Problems are: Problem set: 0 solved, 366 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/467 variables, and 936 constraints, problems are : Problem set: 0 solved, 366 unsolved in 30013 ms.
Refiners :[Domain max(s): 156/156 constraints, Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 156/156 constraints, ReadFeed: 116/116 constraints, PredecessorRefiner: 366/366 constraints, Known Traps: 128/128 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 366 unsolved
Search for dead transitions found 0 dead transitions in 60182ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61158 ms. Remains : 156/156 places, 371/371 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 279 edges and 156 vertex of which 100 / 156 are part of one of the 20 SCC in 4 ms
Free SCC test removed 80 places
Drop transitions (Empty/Sink Transition effects.) removed 160 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 239 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 76 transition count 113
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 57 transition count 113
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 47 transition count 108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 42 transition count 103
Graph (trivial) has 21 edges and 42 vertex of which 21 / 42 are part of one of the 5 SCC in 0 ms
Free SCC test removed 16 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 69 place count 22 transition count 103
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 86 edges and 22 vertex of which 2 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Iterating post reduction 0 with 22 rules applied. Total rules applied 91 place count 2 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 107 place count 2 transition count 2
Applied a total of 107 rules in 38 ms. Remains 2 /156 variables (removed 154) and now considering 2/371 (removed 369) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-05-27 15:05:48] [INFO ] Computed 1 invariants in 0 ms
[2024-05-27 15:05:48] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 15:05:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 15:05:48] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 15:05:48] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 15:05:48] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 89 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 279 edges and 156 vertex of which 100 / 156 are part of one of the 20 SCC in 1 ms
Free SCC test removed 80 places
Drop transitions (Empty/Sink Transition effects.) removed 160 transitions
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 239 transitions.
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 19 Pre rules applied. Total rules applied 1 place count 76 transition count 113
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 39 place count 57 transition count 113
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 54 place count 47 transition count 108
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 64 place count 42 transition count 103
Graph (trivial) has 21 edges and 42 vertex of which 21 / 42 are part of one of the 5 SCC in 0 ms
Free SCC test removed 16 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 69 place count 22 transition count 103
Drop transitions (Empty/Sink Transition effects.) removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Graph (complete) has 86 edges and 22 vertex of which 2 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 64 output transitions
Drop transitions (Output transitions of discarded places.) removed 64 transitions
Iterating post reduction 0 with 22 rules applied. Total rules applied 91 place count 2 transition count 18
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 107 place count 2 transition count 2
Applied a total of 107 rules in 14 ms. Remains 2 /156 variables (removed 154) and now considering 2/371 (removed 369) transitions.
Running SMT prover for 1 properties.
[2024-05-27 15:05:48] [INFO ] Invariant cache hit.
[2024-05-27 15:05:48] [INFO ] After 16ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 15:05:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-27 15:05:48] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-27 15:05:48] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-27 15:05:48] [INFO ] After 31ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 66 ms.
Unable to solve all queries for examination StableMarking. Remains :1 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 1 properties from file /home/mcc/execution/StableMarking.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 876260 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running Peterson-PT-4
IS_COLORED=
IS_NUPN=1
LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 480
TRANSITIONS: 690
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 2120
NUPN UNITS: 16
LOADING TIME: 1.059
SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.064
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 1.572
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: 2554
MODEL NAME: /home/mcc/execution/model
480 places, 690 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StableMarking FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716822686195
--------------------
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="Peterson-PT-4"
export BK_EXAMINATION="StableMarking"
export BK_TOOL="greatspnxred"
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-5568"
echo " Executing tool greatspnxred"
echo " Input is Peterson-PT-4, 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 r276-smll-171654416100168"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-4.tgz
mv Peterson-PT-4 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property StableMarking.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 '
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 ;