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.r166-smll-171636274400113.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 EisenbergMcGuire-PT-07, examination is StableMarking
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r166-smll-171636274400113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 19 07:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 210K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1.2M May 18 16:42 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 1716481797398

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=StableMarking
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=EisenbergMcGuire-PT-07
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 16:29:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, StableMarking, -timeout, 180, -rebuildPNML]
[2024-05-23 16:29:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 16:29:59] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2024-05-23 16:29:59] [INFO ] Transformed 553 places.
[2024-05-23 16:29:59] [INFO ] Transformed 1960 transitions.
[2024-05-23 16:29:59] [INFO ] Found NUPN structural information;
[2024-05-23 16:29:59] [INFO ] Parsed PT model containing 553 places and 1960 transitions and 9212 arcs in 482 ms.
RANDOM walk for 40000 steps (8 resets) in 3353 ms. (11 steps per ms) remains 167/553 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 12 ms. (31 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 11 ms. (33 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 20 ms. (19 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 14 ms. (26 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 10 ms. (36 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 9 ms. (40 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 18 ms. (21 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 6 ms. (57 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 5 ms. (67 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 8 ms. (44 steps per ms) remains 167/167 properties
BEST_FIRST walk for 404 steps (8 resets) in 7 ms. (50 steps per ms) remains 167/167 properties
[2024-05-23 16:30:01] [INFO ] Flow matrix only has 1001 transitions (discarded 959 similar events)
// Phase 1: matrix 1001 rows 553 cols
[2024-05-23 16:30:01] [INFO ] Computed 22 invariants in 28 ms
[2024-05-23 16:30:01] [INFO ] State equation strengthened by 472 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) 365/532 variables, 14/181 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 365/546 constraints. Problems are: Problem set: 0 solved, 167 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 532/1554 variables, and 546 constraints, problems are : Problem set: 0 solved, 167 unsolved in 5081 ms.
Refiners :[Domain max(s): 532/553 constraints, Positive P Invariants (semi-flows): 14/15 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/553 constraints, ReadFeed: 0/472 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) 365/532 variables, 14/181 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 365/546 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 0/546 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 5 (OVERLAPS) 14/546 variables, 7/553 constraints. Problems are: Problem set: 0 solved, 167 unsolved
SMT process timed out in 10356ms, After SMT, problems are : Problem set: 0 solved, 167 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 167 out of 553 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 553/553 places, 1960/1960 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 553 transition count 1953
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 546 transition count 1953
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 14 place count 546 transition count 1841
Deduced a syphon composed of 112 places in 2 ms
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 238 place count 434 transition count 1841
Discarding 42 places :
Symmetric choice reduction at 2 with 42 rule applications. Total rules 280 place count 392 transition count 1547
Iterating global reduction 2 with 42 rules applied. Total rules applied 322 place count 392 transition count 1547
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 4 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 406 place count 350 transition count 1505
Applied a total of 406 rules in 295 ms. Remains 350 /553 variables (removed 203) and now considering 1505/1960 (removed 455) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 350/553 places, 1505/1960 transitions.
RANDOM walk for 4000000 steps (8 resets) in 80945 ms. (49 steps per ms) remains 158/167 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 165 ms. (240 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 182 ms. (218 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 179 ms. (222 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 183 ms. (217 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 176 ms. (226 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 158/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 157/158 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 157/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 156/157 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 114 ms. (347 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 119 ms. (333 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 117 ms. (339 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 110 ms. (360 steps per ms) remains 156/156 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 156/156 properties
Interrupted probabilistic random walk after 7285400 steps, run timeout after 72001 ms. (steps per millisecond=101 ) properties seen :153 out of 156
Probabilistic random walk after 7285400 steps, saw 1582285 distinct states, run finished after 72018 ms. (steps per millisecond=101 ) properties seen :153
[2024-05-23 16:31:48] [INFO ] Flow matrix only has 546 transitions (discarded 959 similar events)
// Phase 1: matrix 546 rows 350 cols
[2024-05-23 16:31:48] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:31:48] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 138/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/147 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 234/381 variables, 147/156 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/381 variables, 24/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 55/436 variables, 7/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 25/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 80/516 variables, 36/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/516 variables, 24/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/516 variables, 0/273 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 152/668 variables, 8/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/668 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/676 variables, 4/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/676 variables, 0/285 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 220/896 variables, 160/445 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/896 variables, 147/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/896 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/896 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 896/896 variables, and 592 constraints, problems are : Problem set: 0 solved, 3 unsolved in 827 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 350/350 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 138/141 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/141 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/147 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:31:49] [INFO ] Deduced a trap composed of 3 places in 229 ms of which 30 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 3 places in 222 ms of which 8 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 19 places in 178 ms of which 3 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 37 places in 133 ms of which 2 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 15 places in 156 ms of which 3 ms to minimize.
[2024-05-23 16:31:50] [INFO ] Deduced a trap composed of 11 places in 157 ms of which 3 ms to minimize.
[2024-05-23 16:31:51] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 2 ms to minimize.
[2024-05-23 16:31:51] [INFO ] Deduced a trap composed of 13 places in 107 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/147 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 234/381 variables, 147/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/381 variables, 24/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/381 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 55/436 variables, 7/196 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 25/222 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 2/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/436 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 80/516 variables, 36/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/516 variables, 24/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/516 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 152/668 variables, 8/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/668 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/676 variables, 4/296 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/676 variables, 1/297 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:31:52] [INFO ] Deduced a trap composed of 74 places in 397 ms of which 5 ms to minimize.
[2024-05-23 16:31:52] [INFO ] Deduced a trap composed of 75 places in 460 ms of which 5 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/676 variables, 2/299 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:31:52] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 2 ms to minimize.
[2024-05-23 16:31:53] [INFO ] Deduced a trap composed of 48 places in 113 ms of which 2 ms to minimize.
[2024-05-23 16:31:53] [INFO ] Deduced a trap composed of 47 places in 123 ms of which 3 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/676 variables, 3/302 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:31:53] [INFO ] Deduced a trap composed of 66 places in 367 ms of which 6 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/676 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/676 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 220/896 variables, 160/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/896 variables, 147/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/896 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/896 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 896/896 variables, and 610 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4825 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 350/350 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 15/15 constraints]
After SMT, in 5681ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 825 ms.
Support contains 3 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1505/1505 transitions.
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 42 Pre rules applied. Total rules applied 0 place count 350 transition count 1463
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 0 with 84 rules applied. Total rules applied 84 place count 308 transition count 1463
Applied a total of 84 rules in 71 ms. Remains 308 /350 variables (removed 42) and now considering 1463/1505 (removed 42) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 308/350 places, 1463/1505 transitions.
RANDOM walk for 4000000 steps (8 resets) in 12235 ms. (326 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2353 ms. (1699 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2630 ms. (1520 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2894 ms. (1381 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1777480 steps, run timeout after 15001 ms. (steps per millisecond=118 ) properties seen :0 out of 3
Probabilistic random walk after 1777480 steps, saw 481806 distinct states, run finished after 15001 ms. (steps per millisecond=118 ) properties seen :0
[2024-05-23 16:32:15] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:32:15] [INFO ] Computed 22 invariants in 14 ms
[2024-05-23 16:32:15] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/129 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 216/345 variables, 129/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 24/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 55/400 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 25/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 80/480 variables, 36/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 24/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 128/608 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/608 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/616 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/616 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 196/812 variables, 136/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 147/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 3 unsolved in 824 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/129 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:32:16] [INFO ] Deduced a trap composed of 3 places in 182 ms of which 3 ms to minimize.
[2024-05-23 16:32:17] [INFO ] Deduced a trap composed of 3 places in 178 ms of which 2 ms to minimize.
[2024-05-23 16:32:17] [INFO ] Deduced a trap composed of 19 places in 176 ms of which 2 ms to minimize.
[2024-05-23 16:32:17] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-05-23 16:32:17] [INFO ] Deduced a trap composed of 36 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:32:17] [INFO ] Deduced a trap composed of 15 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:32:17] [INFO ] Deduced a trap composed of 11 places in 174 ms of which 3 ms to minimize.
[2024-05-23 16:32:17] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-23 16:32:18] [INFO ] Deduced a trap composed of 13 places in 86 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 216/345 variables, 129/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 24/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 55/400 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 25/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 80/480 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 24/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 128/608 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/616 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/616 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 196/812 variables, 136/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 147/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/562 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 562 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2341 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 9/9 constraints]
After SMT, in 3204ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 561 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 67 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 62 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:32:19] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:32:19] [INFO ] Invariant cache hit.
[2024-05-23 16:32:20] [INFO ] Implicit Places using invariants in 505 ms returned []
[2024-05-23 16:32:20] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:32:20] [INFO ] Invariant cache hit.
[2024-05-23 16:32:20] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:32:22] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2499 ms to find 0 implicit places.
[2024-05-23 16:32:22] [INFO ] Redundant transitions in 148 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:32:22] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:32:22] [INFO ] Invariant cache hit.
[2024-05-23 16:32:22] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:32:39] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:32:40] [INFO ] Deduced a trap composed of 40 places in 256 ms of which 4 ms to minimize.
[2024-05-23 16:32:40] [INFO ] Deduced a trap composed of 47 places in 266 ms of which 3 ms to minimize.
[2024-05-23 16:32:40] [INFO ] Deduced a trap composed of 3 places in 269 ms of which 3 ms to minimize.
[2024-05-23 16:32:41] [INFO ] Deduced a trap composed of 51 places in 372 ms of which 5 ms to minimize.
[2024-05-23 16:32:41] [INFO ] Deduced a trap composed of 26 places in 352 ms of which 5 ms to minimize.
[2024-05-23 16:32:41] [INFO ] Deduced a trap composed of 25 places in 363 ms of which 5 ms to minimize.
[2024-05-23 16:32:42] [INFO ] Deduced a trap composed of 87 places in 353 ms of which 4 ms to minimize.
[2024-05-23 16:32:42] [INFO ] Deduced a trap composed of 32 places in 365 ms of which 3 ms to minimize.
[2024-05-23 16:32:42] [INFO ] Deduced a trap composed of 26 places in 313 ms of which 4 ms to minimize.
[2024-05-23 16:32:43] [INFO ] Deduced a trap composed of 29 places in 320 ms of which 5 ms to minimize.
[2024-05-23 16:32:43] [INFO ] Deduced a trap composed of 30 places in 333 ms of which 5 ms to minimize.
[2024-05-23 16:32:43] [INFO ] Deduced a trap composed of 31 places in 393 ms of which 5 ms to minimize.
[2024-05-23 16:32:44] [INFO ] Deduced a trap composed of 54 places in 356 ms of which 4 ms to minimize.
[2024-05-23 16:32:44] [INFO ] Deduced a trap composed of 51 places in 324 ms of which 5 ms to minimize.
[2024-05-23 16:32:45] [INFO ] Deduced a trap composed of 3 places in 331 ms of which 4 ms to minimize.
[2024-05-23 16:32:45] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 4 ms to minimize.
[2024-05-23 16:32:45] [INFO ] Deduced a trap composed of 51 places in 311 ms of which 4 ms to minimize.
[2024-05-23 16:32:46] [INFO ] Deduced a trap composed of 58 places in 283 ms of which 4 ms to minimize.
[2024-05-23 16:32:47] [INFO ] Deduced a trap composed of 54 places in 251 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:32:48] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:32:48] [INFO ] Deduced a trap composed of 21 places in 335 ms of which 4 ms to minimize.
[2024-05-23 16:32:49] [INFO ] Deduced a trap composed of 27 places in 367 ms of which 4 ms to minimize.
[2024-05-23 16:32:49] [INFO ] Deduced a trap composed of 51 places in 263 ms of which 4 ms to minimize.
[2024-05-23 16:32:49] [INFO ] Deduced a trap composed of 52 places in 244 ms of which 3 ms to minimize.
[2024-05-23 16:32:51] [INFO ] Deduced a trap composed of 48 places in 269 ms of which 4 ms to minimize.
[2024-05-23 16:32:51] [INFO ] Deduced a trap composed of 37 places in 272 ms of which 5 ms to minimize.
[2024-05-23 16:32:52] [INFO ] Deduced a trap composed of 42 places in 287 ms of which 4 ms to minimize.
[2024-05-23 16:32:52] [INFO ] Deduced a trap composed of 37 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:32:53] [INFO ] Deduced a trap composed of 49 places in 281 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 52 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 30/30 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 30/52 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:32:56] [INFO ] Deduced a trap composed of 19 places in 265 ms of which 3 ms to minimize.
[2024-05-23 16:32:56] [INFO ] Deduced a trap composed of 53 places in 204 ms of which 4 ms to minimize.
[2024-05-23 16:32:56] [INFO ] Deduced a trap composed of 53 places in 192 ms of which 6 ms to minimize.
[2024-05-23 16:32:57] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:32:57] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 3 ms to minimize.
[2024-05-23 16:32:58] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 2 ms to minimize.
[2024-05-23 16:32:58] [INFO ] Deduced a trap composed of 11 places in 153 ms of which 3 ms to minimize.
[2024-05-23 16:32:58] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-23 16:32:59] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:33:01] [INFO ] Deduced a trap composed of 13 places in 154 ms of which 3 ms to minimize.
[2024-05-23 16:33:03] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 2 ms to minimize.
[2024-05-23 16:33:04] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:33:05] [INFO ] Deduced a trap composed of 3 places in 49 ms of which 1 ms to minimize.
[2024-05-23 16:33:06] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:33:07] [INFO ] Deduced a trap composed of 47 places in 254 ms of which 3 ms to minimize.
[2024-05-23 16:33:08] [INFO ] Deduced a trap composed of 3 places in 238 ms of which 3 ms to minimize.
[2024-05-23 16:33:08] [INFO ] Deduced a trap composed of 58 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:33:08] [INFO ] Deduced a trap composed of 24 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:33:09] [INFO ] Deduced a trap composed of 21 places in 263 ms of which 3 ms to minimize.
[2024-05-23 16:33:09] [INFO ] Deduced a trap composed of 25 places in 252 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/72 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:33:11] [INFO ] Deduced a trap composed of 46 places in 158 ms of which 2 ms to minimize.
[2024-05-23 16:33:14] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 2 ms to minimize.
[2024-05-23 16:33:15] [INFO ] Deduced a trap composed of 39 places in 210 ms of which 2 ms to minimize.
[2024-05-23 16:33:15] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 2 ms to minimize.
[2024-05-23 16:33:15] [INFO ] Deduced a trap composed of 46 places in 208 ms of which 2 ms to minimize.
[2024-05-23 16:33:16] [INFO ] Deduced a trap composed of 52 places in 211 ms of which 3 ms to minimize.
[2024-05-23 16:33:16] [INFO ] Deduced a trap composed of 68 places in 228 ms of which 2 ms to minimize.
[2024-05-23 16:33:16] [INFO ] Deduced a trap composed of 49 places in 230 ms of which 3 ms to minimize.
[2024-05-23 16:33:16] [INFO ] Deduced a trap composed of 62 places in 223 ms of which 3 ms to minimize.
[2024-05-23 16:33:17] [INFO ] Deduced a trap composed of 54 places in 204 ms of which 2 ms to minimize.
[2024-05-23 16:33:17] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 3 ms to minimize.
[2024-05-23 16:33:17] [INFO ] Deduced a trap composed of 48 places in 220 ms of which 3 ms to minimize.
[2024-05-23 16:33:17] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 2 ms to minimize.
[2024-05-23 16:33:18] [INFO ] Deduced a trap composed of 38 places in 73 ms of which 1 ms to minimize.
[2024-05-23 16:33:18] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:33:18] [INFO ] Deduced a trap composed of 40 places in 184 ms of which 2 ms to minimize.
[2024-05-23 16:33:18] [INFO ] Deduced a trap composed of 40 places in 158 ms of which 2 ms to minimize.
[2024-05-23 16:33:18] [INFO ] Deduced a trap composed of 52 places in 198 ms of which 3 ms to minimize.
[2024-05-23 16:33:19] [INFO ] Deduced a trap composed of 74 places in 221 ms of which 2 ms to minimize.
[2024-05-23 16:33:19] [INFO ] Deduced a trap composed of 74 places in 175 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/92 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 1)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 1)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 1)
(s16 0)
(s17 1)
(s18 0)
(s19 0)
(s20 0)
(s21 1)
(s22 0)
(s23 0)
(s24 1)
(s25 0)
(s26 1)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 1)
(s33 1)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 1)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 1)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 1)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 92 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 70/70 constraints]
After SMT, in 61286ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61330ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64069 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 400000 steps (8 resets) in 3329 ms. (120 steps per ms) remains 3/3 properties
Running SMT prover for 3 properties.
[2024-05-23 16:33:24] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:33:24] [INFO ] Invariant cache hit.
[2024-05-23 16:33:24] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-23 16:33:24] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-23 16:33:24] [INFO ] After 197ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-23 16:33:24] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:33:24] [INFO ] After 57ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 16:33:25] [INFO ] After 242ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 16:33:25] [INFO ] After 552ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 16:33:25] [INFO ] [Nat]Absence check using 15 positive place invariants in 13 ms returned sat
[2024-05-23 16:33:25] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 5 ms returned sat
[2024-05-23 16:33:25] [INFO ] After 276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 16:33:25] [INFO ] After 55ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 16:33:25] [INFO ] Deduced a trap composed of 3 places in 50 ms of which 1 ms to minimize.
[2024-05-23 16:33:25] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:33:25] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 16:33:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 264 ms
[2024-05-23 16:33:25] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-05-23 16:33:25] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-23 16:33:26] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-05-23 16:33:26] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 276 ms
[2024-05-23 16:33:26] [INFO ] Deduced a trap composed of 44 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:33:26] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:33:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 206 ms
TRAPS : Iteration 1
[2024-05-23 16:33:26] [INFO ] After 1000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 16:33:26] [INFO ] After 1407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
RANDOM walk for 4000000 steps (8 resets) in 11451 ms. (349 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2478 ms. (1613 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2473 ms. (1616 steps per ms) remains 3/3 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 2478 ms. (1613 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1380656 steps, run timeout after 12001 ms. (steps per millisecond=115 ) properties seen :0 out of 3
Probabilistic random walk after 1380656 steps, saw 403155 distinct states, run finished after 12001 ms. (steps per millisecond=115 ) properties seen :0
[2024-05-23 16:33:43] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:33:43] [INFO ] Invariant cache hit.
[2024-05-23 16:33:43] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/129 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 216/345 variables, 129/138 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/345 variables, 24/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 55/400 variables, 7/169 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 1/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 25/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 80/480 variables, 36/231 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/480 variables, 24/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/480 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 128/608 variables, 8/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/608 variables, 0/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 8/616 variables, 4/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/616 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 196/812 variables, 136/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 147/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 3 unsolved in 544 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 120/123 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/129 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 3 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 15 places in 104 ms of which 2 ms to minimize.
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 34 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 3 places in 98 ms of which 2 ms to minimize.
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 36 places in 84 ms of which 1 ms to minimize.
[2024-05-23 16:33:44] [INFO ] Deduced a trap composed of 11 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:33:45] [INFO ] Deduced a trap composed of 3 places in 73 ms of which 2 ms to minimize.
[2024-05-23 16:33:45] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 216/345 variables, 129/147 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/345 variables, 24/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/345 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 55/400 variables, 7/178 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/400 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/400 variables, 25/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/400 variables, 2/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/400 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 80/480 variables, 36/242 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/480 variables, 24/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/480 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 128/608 variables, 8/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/608 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 8/616 variables, 4/278 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/616 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-23 16:33:45] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:33:45] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/616 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/616 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 196/812 variables, 136/417 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 147/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/812 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/812 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 564 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2234 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 11/11 constraints]
After SMT, in 2798ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 506 ms.
Support contains 3 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 42 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 46 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:33:46] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:33:46] [INFO ] Invariant cache hit.
[2024-05-23 16:33:47] [INFO ] Implicit Places using invariants in 481 ms returned []
[2024-05-23 16:33:47] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:33:47] [INFO ] Invariant cache hit.
[2024-05-23 16:33:47] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:33:49] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2248 ms to find 0 implicit places.
[2024-05-23 16:33:49] [INFO ] Redundant transitions in 96 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:33:49] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:33:49] [INFO ] Invariant cache hit.
[2024-05-23 16:33:49] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:34:01] [INFO ] Deduced a trap composed of 43 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:34:02] [INFO ] Deduced a trap composed of 40 places in 365 ms of which 5 ms to minimize.
[2024-05-23 16:34:02] [INFO ] Deduced a trap composed of 47 places in 343 ms of which 4 ms to minimize.
[2024-05-23 16:34:02] [INFO ] Deduced a trap composed of 3 places in 265 ms of which 3 ms to minimize.
[2024-05-23 16:34:03] [INFO ] Deduced a trap composed of 51 places in 259 ms of which 3 ms to minimize.
[2024-05-23 16:34:03] [INFO ] Deduced a trap composed of 26 places in 257 ms of which 3 ms to minimize.
[2024-05-23 16:34:03] [INFO ] Deduced a trap composed of 25 places in 266 ms of which 3 ms to minimize.
[2024-05-23 16:34:03] [INFO ] Deduced a trap composed of 87 places in 272 ms of which 3 ms to minimize.
[2024-05-23 16:34:04] [INFO ] Deduced a trap composed of 32 places in 282 ms of which 3 ms to minimize.
[2024-05-23 16:34:04] [INFO ] Deduced a trap composed of 26 places in 282 ms of which 4 ms to minimize.
[2024-05-23 16:34:04] [INFO ] Deduced a trap composed of 29 places in 266 ms of which 4 ms to minimize.
[2024-05-23 16:34:05] [INFO ] Deduced a trap composed of 30 places in 257 ms of which 3 ms to minimize.
[2024-05-23 16:34:05] [INFO ] Deduced a trap composed of 31 places in 273 ms of which 3 ms to minimize.
[2024-05-23 16:34:05] [INFO ] Deduced a trap composed of 54 places in 227 ms of which 3 ms to minimize.
[2024-05-23 16:34:05] [INFO ] Deduced a trap composed of 51 places in 204 ms of which 3 ms to minimize.
[2024-05-23 16:34:06] [INFO ] Deduced a trap composed of 3 places in 218 ms of which 3 ms to minimize.
[2024-05-23 16:34:06] [INFO ] Deduced a trap composed of 51 places in 189 ms of which 2 ms to minimize.
[2024-05-23 16:34:06] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 3 ms to minimize.
[2024-05-23 16:34:06] [INFO ] Deduced a trap composed of 58 places in 164 ms of which 3 ms to minimize.
[2024-05-23 16:34:07] [INFO ] Deduced a trap composed of 54 places in 156 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:34:08] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 3 ms to minimize.
[2024-05-23 16:34:08] [INFO ] Deduced a trap composed of 21 places in 210 ms of which 4 ms to minimize.
[2024-05-23 16:34:08] [INFO ] Deduced a trap composed of 27 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:34:09] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 3 ms to minimize.
[2024-05-23 16:34:09] [INFO ] Deduced a trap composed of 52 places in 203 ms of which 4 ms to minimize.
[2024-05-23 16:34:10] [INFO ] Deduced a trap composed of 48 places in 254 ms of which 4 ms to minimize.
[2024-05-23 16:34:10] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 2 ms to minimize.
[2024-05-23 16:34:10] [INFO ] Deduced a trap composed of 42 places in 167 ms of which 2 ms to minimize.
[2024-05-23 16:34:11] [INFO ] Deduced a trap composed of 37 places in 237 ms of which 4 ms to minimize.
[2024-05-23 16:34:11] [INFO ] Deduced a trap composed of 49 places in 158 ms of which 3 ms to minimize.
[2024-05-23 16:34:12] [INFO ] Deduced a trap composed of 38 places in 268 ms of which 4 ms to minimize.
[2024-05-23 16:34:12] [INFO ] Deduced a trap composed of 38 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:34:13] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-05-23 16:34:13] [INFO ] Deduced a trap composed of 11 places in 225 ms of which 3 ms to minimize.
[2024-05-23 16:34:13] [INFO ] Deduced a trap composed of 66 places in 160 ms of which 3 ms to minimize.
[2024-05-23 16:34:14] [INFO ] Deduced a trap composed of 42 places in 249 ms of which 3 ms to minimize.
[2024-05-23 16:34:15] [INFO ] Deduced a trap composed of 38 places in 166 ms of which 2 ms to minimize.
[2024-05-23 16:34:15] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-05-23 16:34:15] [INFO ] Deduced a trap composed of 45 places in 265 ms of which 4 ms to minimize.
[2024-05-23 16:34:16] [INFO ] Deduced a trap composed of 53 places in 232 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:34:22] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 3 ms to minimize.
[2024-05-23 16:34:23] [INFO ] Deduced a trap composed of 19 places in 256 ms of which 5 ms to minimize.
[2024-05-23 16:34:23] [INFO ] Deduced a trap composed of 53 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:34:23] [INFO ] Deduced a trap composed of 27 places in 165 ms of which 3 ms to minimize.
[2024-05-23 16:34:23] [INFO ] Deduced a trap composed of 60 places in 229 ms of which 3 ms to minimize.
[2024-05-23 16:34:29] [INFO ] Deduced a trap composed of 13 places in 278 ms of which 4 ms to minimize.
[2024-05-23 16:34:31] [INFO ] Deduced a trap composed of 15 places in 364 ms of which 4 ms to minimize.
[2024-05-23 16:34:33] [INFO ] Deduced a trap composed of 3 places in 71 ms of which 2 ms to minimize.
[2024-05-23 16:34:34] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 5 ms to minimize.
[2024-05-23 16:34:35] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-05-23 16:34:36] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2024-05-23 16:34:40] [INFO ] Deduced a trap composed of 19 places in 452 ms of which 5 ms to minimize.
[2024-05-23 16:34:41] [INFO ] Deduced a trap composed of 21 places in 451 ms of which 5 ms to minimize.
[2024-05-23 16:34:41] [INFO ] Deduced a trap composed of 67 places in 392 ms of which 4 ms to minimize.
[2024-05-23 16:34:42] [INFO ] Deduced a trap composed of 25 places in 335 ms of which 4 ms to minimize.
[2024-05-23 16:34:42] [INFO ] Deduced a trap composed of 17 places in 354 ms of which 5 ms to minimize.
[2024-05-23 16:34:42] [INFO ] Deduced a trap composed of 69 places in 396 ms of which 4 ms to minimize.
[2024-05-23 16:34:43] [INFO ] Deduced a trap composed of 19 places in 396 ms of which 4 ms to minimize.
[2024-05-23 16:34:43] [INFO ] Deduced a trap composed of 23 places in 388 ms of which 5 ms to minimize.
[2024-05-23 16:34:44] [INFO ] Deduced a trap composed of 3 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:34:45] [INFO ] Deduced a trap composed of 56 places in 251 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 83 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 61/61 constraints]
After SMT, in 60923ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60941ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63342 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 400000 steps (8 resets) in 1685 ms. (237 steps per ms) remains 3/3 properties
Running SMT prover for 3 properties.
[2024-05-23 16:34:50] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:34:50] [INFO ] Invariant cache hit.
[2024-05-23 16:34:50] [INFO ] [Real]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-05-23 16:34:50] [INFO ] [Real]Absence check using 15 positive and 7 generalized place invariants in 8 ms returned sat
[2024-05-23 16:34:51] [INFO ] After 290ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3
[2024-05-23 16:34:51] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:34:51] [INFO ] After 80ms SMT Verify possible using 220 Read/Feed constraints in real domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 16:34:51] [INFO ] After 269ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 16:34:51] [INFO ] After 704ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 16:34:51] [INFO ] [Nat]Absence check using 15 positive place invariants in 17 ms returned sat
[2024-05-23 16:34:51] [INFO ] [Nat]Absence check using 15 positive and 7 generalized place invariants in 7 ms returned sat
[2024-05-23 16:34:51] [INFO ] After 283ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 16:34:51] [INFO ] After 82ms SMT Verify possible using 220 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 16:34:51] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 13 places in 120 ms of which 2 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 1 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 366 ms
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 3 places in 56 ms of which 2 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 34 places in 107 ms of which 1 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 11 places in 108 ms of which 1 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 415 ms
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 44 places in 104 ms of which 1 ms to minimize.
[2024-05-23 16:34:52] [INFO ] Deduced a trap composed of 23 places in 92 ms of which 2 ms to minimize.
[2024-05-23 16:34:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 305 ms
TRAPS : Iteration 1
[2024-05-23 16:34:53] [INFO ] After 1450ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 16:34:53] [INFO ] After 1892ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
RANDOM walk for 40000 steps (8 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 407656 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 1
Probabilistic random walk after 407656 steps, saw 168527 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-05-23 16:34:56] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:34:56] [INFO ] Invariant cache hit.
[2024-05-23 16:34:56] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 24/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 187/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 508 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 24/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:34:57] [INFO ] Deduced a trap composed of 29 places in 329 ms of which 3 ms to minimize.
[2024-05-23 16:34:57] [INFO ] Deduced a trap composed of 67 places in 272 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 187/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 3 places in 122 ms of which 2 ms to minimize.
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 19 places in 142 ms of which 2 ms to minimize.
[2024-05-23 16:34:58] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1583 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2115ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 57 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 63 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 159 ms. (250 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 38 ms. (1025 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 440472 steps, run timeout after 3001 ms. (steps per millisecond=146 ) properties seen :0 out of 1
Probabilistic random walk after 440472 steps, saw 178326 distinct states, run finished after 3002 ms. (steps per millisecond=146 ) properties seen :0
[2024-05-23 16:35:01] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:35:01] [INFO ] Invariant cache hit.
[2024-05-23 16:35:01] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 24/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 187/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 513 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 24/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:35:02] [INFO ] Deduced a trap composed of 29 places in 479 ms of which 6 ms to minimize.
[2024-05-23 16:35:03] [INFO ] Deduced a trap composed of 67 places in 483 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 2/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 187/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:35:03] [INFO ] Deduced a trap composed of 3 places in 189 ms of which 3 ms to minimize.
[2024-05-23 16:35:04] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-23 16:35:04] [INFO ] Deduced a trap composed of 16 places in 129 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 2770ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 58 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 63 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 63 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:35:04] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:35:04] [INFO ] Invariant cache hit.
[2024-05-23 16:35:05] [INFO ] Implicit Places using invariants in 794 ms returned []
[2024-05-23 16:35:05] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:35:05] [INFO ] Invariant cache hit.
[2024-05-23 16:35:05] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:35:07] [INFO ] Implicit Places using invariants and state equation in 2225 ms returned []
Implicit Place search using SMT with State Equation took 3022 ms to find 0 implicit places.
[2024-05-23 16:35:07] [INFO ] Redundant transitions in 42 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:35:07] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:35:07] [INFO ] Invariant cache hit.
[2024-05-23 16:35:07] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:35:25] [INFO ] Deduced a trap composed of 43 places in 447 ms of which 5 ms to minimize.
[2024-05-23 16:35:26] [INFO ] Deduced a trap composed of 40 places in 428 ms of which 5 ms to minimize.
[2024-05-23 16:35:26] [INFO ] Deduced a trap composed of 47 places in 446 ms of which 5 ms to minimize.
[2024-05-23 16:35:27] [INFO ] Deduced a trap composed of 3 places in 416 ms of which 5 ms to minimize.
[2024-05-23 16:35:27] [INFO ] Deduced a trap composed of 51 places in 415 ms of which 5 ms to minimize.
[2024-05-23 16:35:28] [INFO ] Deduced a trap composed of 26 places in 432 ms of which 4 ms to minimize.
[2024-05-23 16:35:28] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 4 ms to minimize.
[2024-05-23 16:35:29] [INFO ] Deduced a trap composed of 87 places in 447 ms of which 5 ms to minimize.
[2024-05-23 16:35:29] [INFO ] Deduced a trap composed of 32 places in 427 ms of which 5 ms to minimize.
[2024-05-23 16:35:29] [INFO ] Deduced a trap composed of 26 places in 445 ms of which 5 ms to minimize.
[2024-05-23 16:35:30] [INFO ] Deduced a trap composed of 29 places in 423 ms of which 4 ms to minimize.
[2024-05-23 16:35:30] [INFO ] Deduced a trap composed of 30 places in 417 ms of which 5 ms to minimize.
[2024-05-23 16:35:31] [INFO ] Deduced a trap composed of 31 places in 418 ms of which 5 ms to minimize.
[2024-05-23 16:35:31] [INFO ] Deduced a trap composed of 54 places in 297 ms of which 4 ms to minimize.
[2024-05-23 16:35:32] [INFO ] Deduced a trap composed of 51 places in 330 ms of which 4 ms to minimize.
[2024-05-23 16:35:32] [INFO ] Deduced a trap composed of 3 places in 358 ms of which 5 ms to minimize.
[2024-05-23 16:35:32] [INFO ] Deduced a trap composed of 51 places in 295 ms of which 4 ms to minimize.
[2024-05-23 16:35:33] [INFO ] Deduced a trap composed of 51 places in 314 ms of which 4 ms to minimize.
[2024-05-23 16:35:33] [INFO ] Deduced a trap composed of 58 places in 292 ms of which 4 ms to minimize.
[2024-05-23 16:35:34] [INFO ] Deduced a trap composed of 54 places in 269 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:35:35] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 3 ms to minimize.
[2024-05-23 16:35:36] [INFO ] Deduced a trap composed of 21 places in 334 ms of which 4 ms to minimize.
[2024-05-23 16:35:36] [INFO ] Deduced a trap composed of 27 places in 306 ms of which 3 ms to minimize.
[2024-05-23 16:35:36] [INFO ] Deduced a trap composed of 51 places in 162 ms of which 2 ms to minimize.
[2024-05-23 16:35:36] [INFO ] Deduced a trap composed of 52 places in 152 ms of which 3 ms to minimize.
[2024-05-23 16:35:37] [INFO ] Deduced a trap composed of 48 places in 166 ms of which 3 ms to minimize.
[2024-05-23 16:35:38] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:35:38] [INFO ] Deduced a trap composed of 42 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:35:38] [INFO ] Deduced a trap composed of 37 places in 152 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 51 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 29/51 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:35:41] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 3 ms to minimize.
[2024-05-23 16:35:41] [INFO ] Deduced a trap composed of 53 places in 200 ms of which 3 ms to minimize.
[2024-05-23 16:35:41] [INFO ] Deduced a trap composed of 53 places in 198 ms of which 3 ms to minimize.
[2024-05-23 16:35:41] [INFO ] Deduced a trap composed of 27 places in 215 ms of which 3 ms to minimize.
[2024-05-23 16:35:41] [INFO ] Deduced a trap composed of 55 places in 155 ms of which 2 ms to minimize.
[2024-05-23 16:35:42] [INFO ] Deduced a trap composed of 56 places in 131 ms of which 2 ms to minimize.
[2024-05-23 16:35:42] [INFO ] Deduced a trap composed of 16 places in 165 ms of which 2 ms to minimize.
[2024-05-23 16:35:43] [INFO ] Deduced a trap composed of 11 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:35:43] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-23 16:35:44] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 1 ms to minimize.
[2024-05-23 16:35:44] [INFO ] Deduced a trap composed of 66 places in 150 ms of which 2 ms to minimize.
[2024-05-23 16:35:45] [INFO ] Deduced a trap composed of 38 places in 175 ms of which 2 ms to minimize.
[2024-05-23 16:35:45] [INFO ] Deduced a trap composed of 38 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:35:46] [INFO ] Deduced a trap composed of 39 places in 171 ms of which 3 ms to minimize.
[2024-05-23 16:35:46] [INFO ] Deduced a trap composed of 13 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:35:47] [INFO ] Deduced a trap composed of 42 places in 169 ms of which 2 ms to minimize.
[2024-05-23 16:35:47] [INFO ] Deduced a trap composed of 42 places in 165 ms of which 2 ms to minimize.
[2024-05-23 16:35:48] [INFO ] Deduced a trap composed of 55 places in 222 ms of which 2 ms to minimize.
[2024-05-23 16:35:48] [INFO ] Deduced a trap composed of 40 places in 218 ms of which 3 ms to minimize.
[2024-05-23 16:35:48] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/71 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:35:49] [INFO ] Deduced a trap composed of 39 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:35:49] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 2 ms to minimize.
[2024-05-23 16:35:54] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
[2024-05-23 16:35:54] [INFO ] Deduced a trap composed of 3 places in 78 ms of which 2 ms to minimize.
[2024-05-23 16:35:55] [INFO ] Deduced a trap composed of 4 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:35:55] [INFO ] Deduced a trap composed of 3 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:35:57] [INFO ] Deduced a trap composed of 3 places in 81 ms of which 1 ms to minimize.
[2024-05-23 16:35:58] [INFO ] Deduced a trap composed of 35 places in 75 ms of which 3 ms to minimize.
[2024-05-23 16:36:00] [INFO ] Deduced a trap composed of 19 places in 275 ms of which 4 ms to minimize.
[2024-05-23 16:36:01] [INFO ] Deduced a trap composed of 19 places in 283 ms of which 3 ms to minimize.
[2024-05-23 16:36:01] [INFO ] Deduced a trap composed of 21 places in 275 ms of which 3 ms to minimize.
[2024-05-23 16:36:01] [INFO ] Deduced a trap composed of 25 places in 223 ms of which 3 ms to minimize.
[2024-05-23 16:36:02] [INFO ] Deduced a trap composed of 18 places in 221 ms of which 3 ms to minimize.
[2024-05-23 16:36:02] [INFO ] Deduced a trap composed of 19 places in 221 ms of which 3 ms to minimize.
[2024-05-23 16:36:02] [INFO ] Deduced a trap composed of 23 places in 230 ms of which 3 ms to minimize.
[2024-05-23 16:36:02] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 2 ms to minimize.
[2024-05-23 16:36:02] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-23 16:36:02] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 1 ms to minimize.
[2024-05-23 16:36:04] [INFO ] Deduced a trap composed of 18 places in 257 ms of which 3 ms to minimize.
[2024-05-23 16:36:04] [INFO ] Deduced a trap composed of 64 places in 269 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/308 variables, 20/91 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:36:06] [INFO ] Deduced a trap composed of 53 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:36:06] [INFO ] Deduced a trap composed of 57 places in 179 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 93 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 71/71 constraints]
After SMT, in 61038ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 61066ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64211 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 5 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 58 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2024-05-23 16:36:08] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 16:36:08] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:36:08] [INFO ] [Nat]Absence check using 15 positive place invariants in 5 ms returned sat
[2024-05-23 16:36:08] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:36:08] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:36:08] [INFO ] After 8ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:36:08] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:36:08] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 200 ms.
RANDOM walk for 40000 steps (8 resets) in 113 ms. (350 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 525744 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 525744 steps, saw 202310 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-05-23 16:36:12] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:36:12] [INFO ] Computed 22 invariants in 3 ms
[2024-05-23 16:36:12] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 294/812 variables, 204/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 188/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:12] [INFO ] Deduced a trap composed of 60 places in 240 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 188/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:13] [INFO ] Deduced a trap composed of 3 places in 58 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/812 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 553 constraints, problems are : Problem set: 0 solved, 1 unsolved in 782 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1178ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 38 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 146 ms. (272 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 523080 steps, run timeout after 3001 ms. (steps per millisecond=174 ) properties seen :0 out of 1
Probabilistic random walk after 523080 steps, saw 201134 distinct states, run finished after 3004 ms. (steps per millisecond=174 ) properties seen :0
[2024-05-23 16:36:16] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:36:16] [INFO ] Invariant cache hit.
[2024-05-23 16:36:16] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 294/812 variables, 204/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 188/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:36:17] [INFO ] Deduced a trap composed of 3 places in 136 ms of which 2 ms to minimize.
[2024-05-23 16:36:17] [INFO ] Deduced a trap composed of 44 places in 115 ms of which 1 ms to minimize.
[2024-05-23 16:36:17] [INFO ] Deduced a trap composed of 3 places in 82 ms of which 2 ms to minimize.
[2024-05-23 16:36:17] [INFO ] Deduced a trap composed of 42 places in 76 ms of which 2 ms to minimize.
[2024-05-23 16:36:17] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 5/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 940 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 1294ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 37 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 43 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 308/308 places, 1463/1463 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 46 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
[2024-05-23 16:36:17] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:36:17] [INFO ] Invariant cache hit.
[2024-05-23 16:36:18] [INFO ] Implicit Places using invariants in 631 ms returned []
[2024-05-23 16:36:18] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:36:18] [INFO ] Invariant cache hit.
[2024-05-23 16:36:18] [INFO ] State equation strengthened by 220 read => feed constraints.
[2024-05-23 16:36:20] [INFO ] Implicit Places using invariants and state equation in 1652 ms returned []
Implicit Place search using SMT with State Equation took 2287 ms to find 0 implicit places.
[2024-05-23 16:36:20] [INFO ] Redundant transitions in 28 ms returned []
Running 1456 sub problems to find dead transitions.
[2024-05-23 16:36:20] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:36:20] [INFO ] Invariant cache hit.
[2024-05-23 16:36:20] [INFO ] State equation strengthened by 220 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:36:32] [INFO ] Deduced a trap composed of 43 places in 264 ms of which 3 ms to minimize.
[2024-05-23 16:36:33] [INFO ] Deduced a trap composed of 40 places in 278 ms of which 5 ms to minimize.
[2024-05-23 16:36:33] [INFO ] Deduced a trap composed of 47 places in 333 ms of which 4 ms to minimize.
[2024-05-23 16:36:33] [INFO ] Deduced a trap composed of 3 places in 262 ms of which 3 ms to minimize.
[2024-05-23 16:36:33] [INFO ] Deduced a trap composed of 51 places in 257 ms of which 3 ms to minimize.
[2024-05-23 16:36:34] [INFO ] Deduced a trap composed of 26 places in 373 ms of which 4 ms to minimize.
[2024-05-23 16:36:34] [INFO ] Deduced a trap composed of 25 places in 365 ms of which 3 ms to minimize.
[2024-05-23 16:36:34] [INFO ] Deduced a trap composed of 87 places in 277 ms of which 5 ms to minimize.
[2024-05-23 16:36:35] [INFO ] Deduced a trap composed of 32 places in 339 ms of which 4 ms to minimize.
[2024-05-23 16:36:35] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 4 ms to minimize.
[2024-05-23 16:36:35] [INFO ] Deduced a trap composed of 29 places in 251 ms of which 3 ms to minimize.
[2024-05-23 16:36:36] [INFO ] Deduced a trap composed of 30 places in 372 ms of which 4 ms to minimize.
[2024-05-23 16:36:36] [INFO ] Deduced a trap composed of 31 places in 322 ms of which 4 ms to minimize.
[2024-05-23 16:36:36] [INFO ] Deduced a trap composed of 54 places in 317 ms of which 4 ms to minimize.
[2024-05-23 16:36:37] [INFO ] Deduced a trap composed of 51 places in 278 ms of which 4 ms to minimize.
[2024-05-23 16:36:37] [INFO ] Deduced a trap composed of 3 places in 251 ms of which 4 ms to minimize.
[2024-05-23 16:36:37] [INFO ] Deduced a trap composed of 51 places in 242 ms of which 3 ms to minimize.
[2024-05-23 16:36:38] [INFO ] Deduced a trap composed of 51 places in 235 ms of which 3 ms to minimize.
[2024-05-23 16:36:38] [INFO ] Deduced a trap composed of 58 places in 229 ms of which 4 ms to minimize.
[2024-05-23 16:36:39] [INFO ] Deduced a trap composed of 54 places in 163 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:36:40] [INFO ] Deduced a trap composed of 15 places in 300 ms of which 4 ms to minimize.
[2024-05-23 16:36:40] [INFO ] Deduced a trap composed of 21 places in 292 ms of which 4 ms to minimize.
[2024-05-23 16:36:40] [INFO ] Deduced a trap composed of 27 places in 297 ms of which 4 ms to minimize.
[2024-05-23 16:36:41] [INFO ] Deduced a trap composed of 51 places in 166 ms of which 2 ms to minimize.
[2024-05-23 16:36:41] [INFO ] Deduced a trap composed of 52 places in 134 ms of which 2 ms to minimize.
[2024-05-23 16:36:42] [INFO ] Deduced a trap composed of 48 places in 162 ms of which 3 ms to minimize.
[2024-05-23 16:36:42] [INFO ] Deduced a trap composed of 37 places in 169 ms of which 3 ms to minimize.
[2024-05-23 16:36:42] [INFO ] Deduced a trap composed of 42 places in 168 ms of which 3 ms to minimize.
[2024-05-23 16:36:42] [INFO ] Deduced a trap composed of 37 places in 155 ms of which 3 ms to minimize.
[2024-05-23 16:36:43] [INFO ] Deduced a trap composed of 49 places in 156 ms of which 2 ms to minimize.
[2024-05-23 16:36:43] [INFO ] Deduced a trap composed of 38 places in 250 ms of which 3 ms to minimize.
[2024-05-23 16:36:44] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 2 ms to minimize.
[2024-05-23 16:36:44] [INFO ] Deduced a trap composed of 3 places in 47 ms of which 1 ms to minimize.
[2024-05-23 16:36:44] [INFO ] Deduced a trap composed of 11 places in 154 ms of which 2 ms to minimize.
[2024-05-23 16:36:45] [INFO ] Deduced a trap composed of 66 places in 226 ms of which 4 ms to minimize.
[2024-05-23 16:36:45] [INFO ] Deduced a trap composed of 42 places in 187 ms of which 3 ms to minimize.
[2024-05-23 16:36:46] [INFO ] Deduced a trap composed of 38 places in 185 ms of which 3 ms to minimize.
[2024-05-23 16:36:46] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 1 ms to minimize.
[2024-05-23 16:36:47] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 3 ms to minimize.
[2024-05-23 16:36:47] [INFO ] Deduced a trap composed of 53 places in 190 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 1.0)
(s22 0.0)
(s23 0.0)
(s24 1.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 1.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 308/812 variables, and 62 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 1456/1456 constraints, Known Traps: 40/40 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1456 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/308 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/308 variables, 7/22 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/308 variables, 40/62 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:36:53] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 2 ms to minimize.
[2024-05-23 16:36:53] [INFO ] Deduced a trap composed of 19 places in 205 ms of which 3 ms to minimize.
[2024-05-23 16:36:54] [INFO ] Deduced a trap composed of 53 places in 280 ms of which 3 ms to minimize.
[2024-05-23 16:36:54] [INFO ] Deduced a trap composed of 27 places in 140 ms of which 2 ms to minimize.
[2024-05-23 16:36:54] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 2 ms to minimize.
[2024-05-23 16:36:58] [INFO ] Deduced a trap composed of 13 places in 219 ms of which 3 ms to minimize.
[2024-05-23 16:37:00] [INFO ] Deduced a trap composed of 15 places in 261 ms of which 3 ms to minimize.
[2024-05-23 16:37:01] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2024-05-23 16:37:02] [INFO ] Deduced a trap composed of 17 places in 261 ms of which 2 ms to minimize.
[2024-05-23 16:37:03] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 2 ms to minimize.
[2024-05-23 16:37:04] [INFO ] Deduced a trap composed of 3 places in 55 ms of which 1 ms to minimize.
[2024-05-23 16:37:08] [INFO ] Deduced a trap composed of 19 places in 450 ms of which 5 ms to minimize.
[2024-05-23 16:37:08] [INFO ] Deduced a trap composed of 21 places in 431 ms of which 5 ms to minimize.
[2024-05-23 16:37:09] [INFO ] Deduced a trap composed of 67 places in 392 ms of which 5 ms to minimize.
[2024-05-23 16:37:09] [INFO ] Deduced a trap composed of 25 places in 333 ms of which 4 ms to minimize.
[2024-05-23 16:37:10] [INFO ] Deduced a trap composed of 17 places in 374 ms of which 5 ms to minimize.
[2024-05-23 16:37:10] [INFO ] Deduced a trap composed of 69 places in 381 ms of which 5 ms to minimize.
[2024-05-23 16:37:10] [INFO ] Deduced a trap composed of 19 places in 393 ms of which 5 ms to minimize.
[2024-05-23 16:37:11] [INFO ] Deduced a trap composed of 23 places in 372 ms of which 5 ms to minimize.
[2024-05-23 16:37:11] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/308 variables, 20/82 constraints. Problems are: Problem set: 0 solved, 1456 unsolved
[2024-05-23 16:37:13] [INFO ] Deduced a trap composed of 56 places in 225 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/812 variables, and 83 constraints, problems are : Problem set: 0 solved, 1456 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/308 constraints, ReadFeed: 0/220 constraints, PredecessorRefiner: 0/1456 constraints, Known Traps: 61/61 constraints]
After SMT, in 60879ms problems are : Problem set: 0 solved, 1456 unsolved
Search for dead transitions found 0 dead transitions in 60898ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63284 ms. Remains : 308/308 places, 1463/1463 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1349 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 2 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 83 Post agglomeration using F-continuation condition.Transition count delta: 83
Deduced a syphon composed of 83 places in 0 ms
Reduce places removed 83 places and 0 transitions.
Iterating global reduction 2 with 166 rules applied. Total rules applied 328 place count 99 transition count 218
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 370 place count 99 transition count 176
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 384 place count 92 transition count 176
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 391 place count 92 transition count 169
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 398 place count 92 transition count 162
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 440 place count 92 transition count 120
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 482 place count 50 transition count 120
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 489 place count 50 transition count 120
Applied a total of 489 rules in 48 ms. Remains 50 /308 variables (removed 258) and now considering 120/1463 (removed 1343) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 120 rows 50 cols
[2024-05-23 16:37:21] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 16:37:21] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 16:37:21] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 16:37:21] [INFO ] After 54ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 16:37:21] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:37:21] [INFO ] After 9ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-23 16:37:21] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-23 16:37:21] [INFO ] After 142ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 287 ms.
RANDOM walk for 40000 steps (8 resets) in 157 ms. (253 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 34 ms. (1142 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 424648 steps, run timeout after 3001 ms. (steps per millisecond=141 ) properties seen :0 out of 1
Probabilistic random walk after 424648 steps, saw 173864 distinct states, run finished after 3001 ms. (steps per millisecond=141 ) properties seen :0
[2024-05-23 16:37:24] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
// Phase 1: matrix 504 rows 308 cols
[2024-05-23 16:37:24] [INFO ] Computed 22 invariants in 4 ms
[2024-05-23 16:37:24] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 294/812 variables, 204/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 188/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 450 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 294/812 variables, 204/363 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 188/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:37:25] [INFO ] Deduced a trap composed of 3 places in 128 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 740 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1208ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 1 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 1463/1463 transitions.
Applied a total of 0 rules in 58 ms. Remains 308 /308 variables (removed 0) and now considering 1463/1463 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 308/308 places, 1463/1463 transitions.
RANDOM walk for 40000 steps (8 resets) in 172 ms. (231 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 40 ms. (975 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 463872 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 1
Probabilistic random walk after 463872 steps, saw 186021 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) properties seen :0
[2024-05-23 16:37:28] [INFO ] Flow matrix only has 504 transitions (discarded 959 similar events)
[2024-05-23 16:37:28] [INFO ] Invariant cache hit.
[2024-05-23 16:37:28] [INFO ] State equation strengthened by 220 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 0/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 294/812 variables, 204/362 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/812 variables, 188/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/812 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 433 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/43 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 72/115 variables, 43/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/115 variables, 2/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/115 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 79/194 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/194 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/194 variables, 9/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 120/314 variables, 54/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/314 variables, 21/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/314 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 192/506 variables, 12/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/506 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/518 variables, 6/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/518 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-23 16:37:29] [INFO ] Deduced a trap composed of 15 places in 110 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/518 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/518 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 294/812 variables, 204/364 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/812 variables, 188/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/812 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 717 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 308/308 constraints, ReadFeed: 220/220 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1167ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 34 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 1 properties in 15 ms.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1345 edges and 308 vertex of which 49 / 308 are part of one of the 7 SCC in 3 ms
Free SCC test removed 42 places
Drop transitions (Empty/Sink Transition effects.) removed 161 transitions
Ensure Unique test removed 924 transitions
Reduce isomorphic transitions removed 1085 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 62 transitions
Trivial Post-agglo rules discarded 62 transitions
Performed 62 trivial Post agglomeration. Transition count delta: 62
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 266 transition count 316
Reduce places removed 62 places and 0 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 204 transition count 316
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 125 place count 204 transition count 301
Deduced a syphon composed of 15 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 37 rules applied. Total rules applied 162 place count 182 transition count 301
Performed 81 Post agglomeration using F-continuation condition.Transition count delta: 81
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 2 with 162 rules applied. Total rules applied 324 place count 101 transition count 220
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 2 with 42 rules applied. Total rules applied 366 place count 101 transition count 178
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 380 place count 94 transition count 178
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 387 place count 94 transition count 171
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 4 with 7 rules applied. Total rules applied 394 place count 94 transition count 164
Free-agglomeration rule applied 42 times.
Iterating global reduction 4 with 42 rules applied. Total rules applied 436 place count 94 transition count 122
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 4 with 42 rules applied. Total rules applied 478 place count 52 transition count 122
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 5 with 7 rules applied. Total rules applied 485 place count 52 transition count 122
Applied a total of 485 rules in 43 ms. Remains 52 /308 variables (removed 256) and now considering 122/1463 (removed 1341) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 122 rows 52 cols
[2024-05-23 16:37:30] [INFO ] Computed 15 invariants in 1 ms
[2024-05-23 16:37:30] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 16:37:30] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-23 16:37:30] [INFO ] After 80ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 16:37:30] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-23 16:37:30] [INFO ] After 28ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-23 16:37:30] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-23 16:37:30] [INFO ] After 234ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 327 ms.
Unable to solve all queries for examination StableMarking. Remains :3 assertions to prove.
No /home/mcc/execution/StableMarking.xml examination file found. Proceeding without properties.
Parsed 3 properties from file /home/mcc/execution/StableMarking.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 451199 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running EisenbergMcGuire-PT-07

IS_COLORED=
IS_NUPN=1

LOADING model.pnml ...
MODEL CLASS: P/T NET WITH NUPN EXTENSION
PLACES: 553
TRANSITIONS: 1960
CONSTANTS: 0
TEMPLATE VARS: 0
ARCS: 9212
NUPN UNITS: 17
LOADING TIME: 1.535

SAVING AS /home/mcc/execution/model.(net/def) ...
exportGspn useExt=true
SAVING TIME: 0.12
SAVING NAME MAP FILE /home/mcc/execution/model.id2name ...
SAVING NUPN UNITS AS FILE /home/mcc/execution/model.nu ...
TOTAL TIME: 2.496
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: 1777
MODEL NAME: /home/mcc/execution/model
553 places, 1960 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-07"
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 EisenbergMcGuire-PT-07, 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 r166-smll-171636274400113"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/EisenbergMcGuire-PT-07.tgz
mv EisenbergMcGuire-PT-07 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 '' StableMarking.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "StableMarking" = "ReachabilityDeadlock" ] || [ "StableMarking" = "QuasiLiveness" ] || [ "StableMarking" = "StableMarking" ] || [ "StableMarking" = "Liveness" ] || [ "StableMarking" = "OneSafe" ] ; then
echo "FORMULA_NAME StableMarking"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;