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.r514-smll-171654416900182.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 ltsminxred
Input is Peterson-PT-7, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r514-smll-171654416900182
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 9.8M
-rw-r--r-- 1 mcc users 264K Apr 12 03:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M Apr 12 03:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 183K Apr 12 03:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 831K Apr 12 03:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 218K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 156K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 517K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 378K Apr 12 04:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.4M Apr 12 04:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 617K Apr 12 04:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.8M Apr 12 04:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 58K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 1.3M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1717251092190

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Peterson-PT-7
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:11:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -timeout, 180, -rebuildPNML]
[2024-06-01 14:11:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:11:35] [INFO ] Load time of PNML (sax parser for PT used): 602 ms
[2024-06-01 14:11:35] [INFO ] Transformed 1992 places.
[2024-06-01 14:11:35] [INFO ] Transformed 3096 transitions.
[2024-06-01 14:11:35] [INFO ] Found NUPN structural information;
[2024-06-01 14:11:35] [INFO ] Parsed PT model containing 1992 places and 3096 transitions and 9584 arcs in 858 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 1992/1992 places, 3096/3096 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 896 transitions
Trivial Post-agglo rules discarded 896 transitions
Performed 896 trivial Post agglomeration. Transition count delta: 896
Iterating post reduction 0 with 896 rules applied. Total rules applied 896 place count 1992 transition count 2200
Reduce places removed 896 places and 0 transitions.
Iterating post reduction 1 with 896 rules applied. Total rules applied 1792 place count 1096 transition count 2200
Performed 448 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 448 Pre rules applied. Total rules applied 1792 place count 1096 transition count 1752
Deduced a syphon composed of 448 places in 9 ms
Reduce places removed 448 places and 0 transitions.
Iterating global reduction 2 with 896 rules applied. Total rules applied 2688 place count 648 transition count 1752
Performed 56 Post agglomeration using F-continuation condition.Transition count delta: 56
Deduced a syphon composed of 56 places in 9 ms
Reduce places removed 56 places and 0 transitions.
Iterating global reduction 2 with 112 rules applied. Total rules applied 2800 place count 592 transition count 1696
Applied a total of 2800 rules in 592 ms. Remains 592 /1992 variables (removed 1400) and now considering 1696/3096 (removed 1400) transitions.
[2024-06-01 14:11:36] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 592 cols
[2024-06-01 14:11:36] [INFO ] Computed 31 invariants in 38 ms
[2024-06-01 14:11:37] [INFO ] Implicit Places using invariants in 1299 ms returned [576, 577, 578, 579, 580, 589, 590, 591]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1345 ms to find 8 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 584/1992 places, 1696/3096 transitions.
Applied a total of 0 rules in 14 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1982 ms. Remains : 584/1992 places, 1696/3096 transitions.
Discarding 8 transitions out of 1696. Remains 1688
RANDOM walk for 40000 steps (8 resets) in 8957 ms. (4 steps per ms) remains 765/1688 properties
BEST_FIRST walk for 124 steps (8 resets) in 14 ms. (8 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 13 ms. (8 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 11 ms. (10 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 10 ms. (11 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 8 ms. (13 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 9 ms. (12 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 12 ms. (9 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 4 ms. (24 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 5 ms. (20 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 7 ms. (15 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
BEST_FIRST walk for 124 steps (8 resets) in 6 ms. (17 steps per ms) remains 765/765 properties
[2024-06-01 14:11:40] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2024-06-01 14:11:40] [INFO ] Computed 23 invariants in 7 ms
[2024-06-01 14:11:40] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/497 variables, 497/497 constraints. Problems are: Problem set: 0 solved, 765 unsolved
SMT process timed out in 5808ms, After SMT, problems are : Problem set: 0 solved, 765 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 497 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 120 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 121 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 2659558 steps (5 resets) in 120004 ms. (22 steps per ms) remains 671/765 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 670/671 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 668/670 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 668/668 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 667/668 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 667/667 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 667/667 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 665/667 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 657/665 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 653/657 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 652/653 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 652/652 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 652/652 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 650/652 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 650/650 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 650/650 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 650/650 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 647/650 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 647/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 645/647 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 645/645 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 641/645 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 641/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 639/641 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 639/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/639 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 637/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 635/637 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 635/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 634/635 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 634/634 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 634/634 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 634/634 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 634/634 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/634 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 632/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 631/632 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 631/631 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 631/631 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 631/631 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 631/631 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 629/631 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 629/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/629 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 627/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 624/627 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 624/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/624 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 622/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 620/622 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 620/620 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 617/620 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 617/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 615/617 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 615/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 615/615 properties
[2024-06-01 14:12:17] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:12:17] [INFO ] Invariant cache hit.
[2024-06-01 14:12:17] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 423/423 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/423 variables, 7/430 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 3 (OVERLAPS) 161/584 variables, 16/446 constraints. Problems are: Problem set: 0 solved, 615 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 161/607 constraints. Problems are: Problem set: 0 solved, 615 unsolved
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 60 places in 631 ms of which 91 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 29 places in 761 ms of which 10 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 11 places in 751 ms of which 9 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 22 places in 751 ms of which 6 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 15 places in 400 ms of which 5 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 103 places in 531 ms of which 5 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 12 places in 384 ms of which 5 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 70 places in 642 ms of which 5 ms to minimize.
[2024-06-01 14:12:53] [INFO ] Deduced a trap composed of 16 places in 403 ms of which 4 ms to minimize.
[2024-06-01 14:12:53] [INFO ] Deduced a trap composed of 13 places in 666 ms of which 8 ms to minimize.
[2024-06-01 14:12:54] [INFO ] Deduced a trap composed of 96 places in 508 ms of which 5 ms to minimize.
[2024-06-01 14:12:54] [INFO ] Deduced a trap composed of 60 places in 327 ms of which 4 ms to minimize.
[2024-06-01 14:12:55] [INFO ] Deduced a trap composed of 15 places in 477 ms of which 9 ms to minimize.
[2024-06-01 14:12:56] [INFO ] Deduced a trap composed of 58 places in 748 ms of which 8 ms to minimize.
[2024-06-01 14:12:56] [INFO ] Deduced a trap composed of 92 places in 720 ms of which 9 ms to minimize.
[2024-06-01 14:12:57] [INFO ] Deduced a trap composed of 13 places in 731 ms of which 8 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 11 places in 668 ms of which 7 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 14 places in 711 ms of which 8 ms to minimize.
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 16 places in 679 ms of which 8 ms to minimize.
[2024-06-01 14:13:00] [INFO ] Deduced a trap composed of 20 places in 707 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 615 unsolved
[2024-06-01 14:13:01] [INFO ] Deduced a trap composed of 50 places in 507 ms of which 6 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 64 places in 450 ms of which 4 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 14 places in 338 ms of which 4 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 32 places in 459 ms of which 5 ms to minimize.
SMT process timed out in 45466ms, After SMT, problems are : Problem set: 0 solved, 615 unsolved
Fused 615 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 423 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 59 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 3133264 steps (8 resets) in 120004 ms. (26 steps per ms) remains 612/615 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 612/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 612/612 properties
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 13491 ms. (steps per millisecond=74 ) properties seen :0
[2024-06-01 14:13:47] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:13:47] [INFO ] Invariant cache hit.
[2024-06-01 14:13:47] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 422/422 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 7/429 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 3 (OVERLAPS) 162/584 variables, 16/445 constraints. Problems are: Problem set: 0 solved, 612 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/584 variables, 162/607 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 60 places in 565 ms of which 5 ms to minimize.
[2024-06-01 14:14:15] [INFO ] Deduced a trap composed of 13 places in 471 ms of which 5 ms to minimize.
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 53 places in 653 ms of which 8 ms to minimize.
[2024-06-01 14:14:16] [INFO ] Deduced a trap composed of 61 places in 669 ms of which 7 ms to minimize.
[2024-06-01 14:14:17] [INFO ] Deduced a trap composed of 38 places in 614 ms of which 8 ms to minimize.
[2024-06-01 14:14:18] [INFO ] Deduced a trap composed of 11 places in 722 ms of which 8 ms to minimize.
[2024-06-01 14:14:18] [INFO ] Deduced a trap composed of 12 places in 679 ms of which 8 ms to minimize.
[2024-06-01 14:14:19] [INFO ] Deduced a trap composed of 14 places in 560 ms of which 7 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 100 places in 606 ms of which 7 ms to minimize.
[2024-06-01 14:14:20] [INFO ] Deduced a trap composed of 16 places in 603 ms of which 7 ms to minimize.
[2024-06-01 14:14:21] [INFO ] Deduced a trap composed of 101 places in 641 ms of which 8 ms to minimize.
[2024-06-01 14:14:22] [INFO ] Deduced a trap composed of 101 places in 732 ms of which 8 ms to minimize.
[2024-06-01 14:14:22] [INFO ] Deduced a trap composed of 17 places in 428 ms of which 5 ms to minimize.
[2024-06-01 14:14:23] [INFO ] Deduced a trap composed of 55 places in 434 ms of which 4 ms to minimize.
[2024-06-01 14:14:23] [INFO ] Deduced a trap composed of 34 places in 602 ms of which 7 ms to minimize.
[2024-06-01 14:14:24] [INFO ] Deduced a trap composed of 23 places in 618 ms of which 7 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 34 places in 627 ms of which 6 ms to minimize.
[2024-06-01 14:14:25] [INFO ] Deduced a trap composed of 13 places in 580 ms of which 7 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 24 places in 584 ms of which 7 ms to minimize.
[2024-06-01 14:14:26] [INFO ] Deduced a trap composed of 118 places in 560 ms of which 6 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-01 14:14:28] [INFO ] Deduced a trap composed of 15 places in 542 ms of which 6 ms to minimize.
[2024-06-01 14:14:28] [INFO ] Deduced a trap composed of 29 places in 642 ms of which 6 ms to minimize.
[2024-06-01 14:14:29] [INFO ] Deduced a trap composed of 85 places in 676 ms of which 8 ms to minimize.
[2024-06-01 14:14:30] [INFO ] Deduced a trap composed of 11 places in 720 ms of which 9 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 15 places in 753 ms of which 9 ms to minimize.
[2024-06-01 14:14:31] [INFO ] Deduced a trap composed of 14 places in 698 ms of which 7 ms to minimize.
[2024-06-01 14:14:32] [INFO ] Deduced a trap composed of 70 places in 652 ms of which 8 ms to minimize.
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 118 places in 700 ms of which 8 ms to minimize.
[2024-06-01 14:14:33] [INFO ] Deduced a trap composed of 16 places in 526 ms of which 7 ms to minimize.
[2024-06-01 14:14:34] [INFO ] Deduced a trap composed of 20 places in 471 ms of which 5 ms to minimize.
[2024-06-01 14:14:34] [INFO ] Deduced a trap composed of 94 places in 472 ms of which 5 ms to minimize.
[2024-06-01 14:14:35] [INFO ] Deduced a trap composed of 11 places in 457 ms of which 5 ms to minimize.
[2024-06-01 14:14:35] [INFO ] Deduced a trap composed of 33 places in 725 ms of which 9 ms to minimize.
[2024-06-01 14:14:36] [INFO ] Deduced a trap composed of 15 places in 671 ms of which 7 ms to minimize.
[2024-06-01 14:14:37] [INFO ] Deduced a trap composed of 14 places in 685 ms of which 7 ms to minimize.
[2024-06-01 14:14:38] [INFO ] Deduced a trap composed of 43 places in 648 ms of which 8 ms to minimize.
[2024-06-01 14:14:38] [INFO ] Deduced a trap composed of 16 places in 624 ms of which 7 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 44 places in 589 ms of which 5 ms to minimize.
[2024-06-01 14:14:39] [INFO ] Deduced a trap composed of 97 places in 470 ms of which 5 ms to minimize.
[2024-06-01 14:14:40] [INFO ] Deduced a trap composed of 67 places in 513 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/584 variables, 20/647 constraints. Problems are: Problem set: 0 solved, 612 unsolved
[2024-06-01 14:14:52] [INFO ] Deduced a trap composed of 23 places in 776 ms of which 8 ms to minimize.
[2024-06-01 14:14:53] [INFO ] Deduced a trap composed of 52 places in 760 ms of which 8 ms to minimize.
[2024-06-01 14:14:54] [INFO ] Deduced a trap composed of 11 places in 784 ms of which 8 ms to minimize.
[2024-06-01 14:14:55] [INFO ] Deduced a trap composed of 62 places in 780 ms of which 9 ms to minimize.
[2024-06-01 14:14:56] [INFO ] Deduced a trap composed of 25 places in 752 ms of which 9 ms to minimize.
[2024-06-01 14:14:56] [INFO ] Deduced a trap composed of 16 places in 714 ms of which 8 ms to minimize.
[2024-06-01 14:14:57] [INFO ] Deduced a trap composed of 34 places in 659 ms of which 7 ms to minimize.
[2024-06-01 14:14:58] [INFO ] Deduced a trap composed of 15 places in 629 ms of which 7 ms to minimize.
[2024-06-01 14:14:58] [INFO ] Deduced a trap composed of 69 places in 671 ms of which 8 ms to minimize.
[2024-06-01 14:14:59] [INFO ] Deduced a trap composed of 157 places in 625 ms of which 8 ms to minimize.
[2024-06-01 14:15:00] [INFO ] Deduced a trap composed of 17 places in 686 ms of which 7 ms to minimize.
[2024-06-01 14:15:00] [INFO ] Deduced a trap composed of 28 places in 720 ms of which 8 ms to minimize.
[2024-06-01 14:15:01] [INFO ] Deduced a trap composed of 12 places in 715 ms of which 8 ms to minimize.
[2024-06-01 14:15:02] [INFO ] Deduced a trap composed of 35 places in 717 ms of which 8 ms to minimize.
[2024-06-01 14:15:03] [INFO ] Deduced a trap composed of 11 places in 670 ms of which 7 ms to minimize.
SMT process timed out in 75737ms, After SMT, problems are : Problem set: 0 solved, 612 unsolved
Fused 612 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 422 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 75 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 3129073 steps (8 resets) in 120005 ms. (26 steps per ms) remains 609/612 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 609/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/609 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 607/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/607 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 606/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 604/606 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 604/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 602/604 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 602/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 600/602 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 600/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 599/600 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 599/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 597/599 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 597/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/597 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 596/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/596 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 595/595 properties
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 13661 ms. (steps per millisecond=73 ) properties seen :0
[2024-06-01 14:15:48] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:15:48] [INFO ] Invariant cache hit.
[2024-06-01 14:15:48] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (OVERLAPS) 173/583 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 173/605 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:16:18] [INFO ] Deduced a trap composed of 60 places in 828 ms of which 9 ms to minimize.
[2024-06-01 14:16:19] [INFO ] Deduced a trap composed of 13 places in 827 ms of which 8 ms to minimize.
[2024-06-01 14:16:20] [INFO ] Deduced a trap composed of 53 places in 801 ms of which 9 ms to minimize.
[2024-06-01 14:16:21] [INFO ] Deduced a trap composed of 22 places in 816 ms of which 8 ms to minimize.
[2024-06-01 14:16:22] [INFO ] Deduced a trap composed of 40 places in 769 ms of which 8 ms to minimize.
[2024-06-01 14:16:22] [INFO ] Deduced a trap composed of 39 places in 619 ms of which 8 ms to minimize.
[2024-06-01 14:16:23] [INFO ] Deduced a trap composed of 11 places in 696 ms of which 8 ms to minimize.
[2024-06-01 14:16:24] [INFO ] Deduced a trap composed of 51 places in 761 ms of which 8 ms to minimize.
[2024-06-01 14:16:24] [INFO ] Deduced a trap composed of 42 places in 758 ms of which 8 ms to minimize.
[2024-06-01 14:16:25] [INFO ] Deduced a trap composed of 31 places in 770 ms of which 9 ms to minimize.
[2024-06-01 14:16:26] [INFO ] Deduced a trap composed of 15 places in 702 ms of which 8 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 115 places in 701 ms of which 7 ms to minimize.
[2024-06-01 14:16:27] [INFO ] Deduced a trap composed of 66 places in 694 ms of which 8 ms to minimize.
[2024-06-01 14:16:28] [INFO ] Deduced a trap composed of 82 places in 678 ms of which 7 ms to minimize.
[2024-06-01 14:16:29] [INFO ] Deduced a trap composed of 40 places in 697 ms of which 8 ms to minimize.
[2024-06-01 14:16:30] [INFO ] Deduced a trap composed of 14 places in 695 ms of which 8 ms to minimize.
[2024-06-01 14:16:30] [INFO ] Deduced a trap composed of 12 places in 720 ms of which 8 ms to minimize.
[2024-06-01 14:16:31] [INFO ] Deduced a trap composed of 16 places in 696 ms of which 8 ms to minimize.
[2024-06-01 14:16:32] [INFO ] Deduced a trap composed of 21 places in 778 ms of which 8 ms to minimize.
[2024-06-01 14:16:33] [INFO ] Deduced a trap composed of 30 places in 774 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:16:34] [INFO ] Deduced a trap composed of 14 places in 724 ms of which 8 ms to minimize.
[2024-06-01 14:16:35] [INFO ] Deduced a trap composed of 20 places in 751 ms of which 8 ms to minimize.
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 13 places in 748 ms of which 9 ms to minimize.
[2024-06-01 14:16:36] [INFO ] Deduced a trap composed of 11 places in 706 ms of which 7 ms to minimize.
[2024-06-01 14:16:37] [INFO ] Deduced a trap composed of 15 places in 660 ms of which 8 ms to minimize.
[2024-06-01 14:16:38] [INFO ] Deduced a trap composed of 71 places in 661 ms of which 8 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 15 places in 744 ms of which 8 ms to minimize.
[2024-06-01 14:16:39] [INFO ] Deduced a trap composed of 35 places in 601 ms of which 8 ms to minimize.
[2024-06-01 14:16:40] [INFO ] Deduced a trap composed of 14 places in 591 ms of which 8 ms to minimize.
[2024-06-01 14:16:41] [INFO ] Deduced a trap composed of 11 places in 727 ms of which 8 ms to minimize.
[2024-06-01 14:16:41] [INFO ] Deduced a trap composed of 77 places in 662 ms of which 8 ms to minimize.
[2024-06-01 14:16:42] [INFO ] Deduced a trap composed of 71 places in 618 ms of which 7 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 11 places in 724 ms of which 8 ms to minimize.
[2024-06-01 14:16:43] [INFO ] Deduced a trap composed of 15 places in 683 ms of which 8 ms to minimize.
[2024-06-01 14:16:44] [INFO ] Deduced a trap composed of 16 places in 595 ms of which 9 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 74 places in 653 ms of which 7 ms to minimize.
[2024-06-01 14:16:45] [INFO ] Deduced a trap composed of 11 places in 734 ms of which 9 ms to minimize.
[2024-06-01 14:16:46] [INFO ] Deduced a trap composed of 15 places in 618 ms of which 8 ms to minimize.
[2024-06-01 14:16:47] [INFO ] Deduced a trap composed of 71 places in 645 ms of which 8 ms to minimize.
[2024-06-01 14:16:48] [INFO ] Deduced a trap composed of 11 places in 738 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/645 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:16:57] [INFO ] Deduced a trap composed of 35 places in 443 ms of which 4 ms to minimize.
[2024-06-01 14:16:58] [INFO ] Deduced a trap composed of 71 places in 679 ms of which 7 ms to minimize.
[2024-06-01 14:16:59] [INFO ] Deduced a trap composed of 78 places in 636 ms of which 7 ms to minimize.
[2024-06-01 14:16:59] [INFO ] Deduced a trap composed of 23 places in 650 ms of which 7 ms to minimize.
[2024-06-01 14:17:00] [INFO ] Deduced a trap composed of 11 places in 612 ms of which 7 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 15 places in 634 ms of which 8 ms to minimize.
[2024-06-01 14:17:01] [INFO ] Deduced a trap composed of 23 places in 664 ms of which 7 ms to minimize.
[2024-06-01 14:17:02] [INFO ] Deduced a trap composed of 46 places in 698 ms of which 8 ms to minimize.
[2024-06-01 14:17:03] [INFO ] Deduced a trap composed of 34 places in 514 ms of which 5 ms to minimize.
[2024-06-01 14:17:03] [INFO ] Deduced a trap composed of 22 places in 455 ms of which 5 ms to minimize.
[2024-06-01 14:17:04] [INFO ] Deduced a trap composed of 23 places in 608 ms of which 7 ms to minimize.
[2024-06-01 14:17:04] [INFO ] Deduced a trap composed of 23 places in 455 ms of which 4 ms to minimize.
[2024-06-01 14:17:05] [INFO ] Deduced a trap composed of 45 places in 462 ms of which 5 ms to minimize.
[2024-06-01 14:17:05] [INFO ] Deduced a trap composed of 40 places in 441 ms of which 5 ms to minimize.
[2024-06-01 14:17:06] [INFO ] Deduced a trap composed of 51 places in 591 ms of which 7 ms to minimize.
[2024-06-01 14:17:06] [INFO ] Deduced a trap composed of 31 places in 477 ms of which 5 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 33 places in 473 ms of which 5 ms to minimize.
[2024-06-01 14:17:07] [INFO ] Deduced a trap composed of 95 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:17:08] [INFO ] Deduced a trap composed of 22 places in 473 ms of which 5 ms to minimize.
[2024-06-01 14:17:08] [INFO ] Deduced a trap composed of 75 places in 488 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/665 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:17:10] [INFO ] Deduced a trap composed of 34 places in 435 ms of which 5 ms to minimize.
[2024-06-01 14:17:10] [INFO ] Deduced a trap composed of 16 places in 446 ms of which 5 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 50 places in 489 ms of which 6 ms to minimize.
[2024-06-01 14:17:11] [INFO ] Deduced a trap composed of 32 places in 491 ms of which 6 ms to minimize.
[2024-06-01 14:17:12] [INFO ] Deduced a trap composed of 33 places in 622 ms of which 5 ms to minimize.
[2024-06-01 14:17:12] [INFO ] Deduced a trap composed of 65 places in 539 ms of which 7 ms to minimize.
[2024-06-01 14:17:13] [INFO ] Deduced a trap composed of 35 places in 559 ms of which 6 ms to minimize.
[2024-06-01 14:17:14] [INFO ] Deduced a trap composed of 34 places in 499 ms of which 5 ms to minimize.
[2024-06-01 14:17:14] [INFO ] Deduced a trap composed of 20 places in 446 ms of which 5 ms to minimize.
[2024-06-01 14:17:14] [INFO ] Deduced a trap composed of 23 places in 441 ms of which 5 ms to minimize.
[2024-06-01 14:17:15] [INFO ] Deduced a trap composed of 38 places in 440 ms of which 5 ms to minimize.
[2024-06-01 14:17:15] [INFO ] Deduced a trap composed of 35 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:17:16] [INFO ] Deduced a trap composed of 55 places in 461 ms of which 5 ms to minimize.
[2024-06-01 14:17:16] [INFO ] Deduced a trap composed of 22 places in 441 ms of which 5 ms to minimize.
[2024-06-01 14:17:17] [INFO ] Deduced a trap composed of 46 places in 453 ms of which 5 ms to minimize.
[2024-06-01 14:17:17] [INFO ] Deduced a trap composed of 25 places in 452 ms of which 5 ms to minimize.
[2024-06-01 14:17:18] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 5 ms to minimize.
[2024-06-01 14:17:18] [INFO ] Deduced a trap composed of 25 places in 458 ms of which 6 ms to minimize.
SMT process timed out in 90255ms, After SMT, problems are : Problem set: 0 solved, 595 unsolved
Fused 595 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 410 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 39 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 3278405 steps (8 resets) in 120005 ms. (27 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 23 ms. (166 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 595/595 properties
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 18172 ms. (steps per millisecond=55 ) properties seen :0
[2024-06-01 14:18:07] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:18:07] [INFO ] Invariant cache hit.
[2024-06-01 14:18:07] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (OVERLAPS) 173/583 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 173/605 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:18:35] [INFO ] Deduced a trap composed of 60 places in 733 ms of which 9 ms to minimize.
[2024-06-01 14:18:36] [INFO ] Deduced a trap composed of 13 places in 752 ms of which 8 ms to minimize.
[2024-06-01 14:18:37] [INFO ] Deduced a trap composed of 53 places in 722 ms of which 8 ms to minimize.
[2024-06-01 14:18:37] [INFO ] Deduced a trap composed of 22 places in 662 ms of which 8 ms to minimize.
[2024-06-01 14:18:38] [INFO ] Deduced a trap composed of 40 places in 701 ms of which 8 ms to minimize.
[2024-06-01 14:18:39] [INFO ] Deduced a trap composed of 39 places in 698 ms of which 7 ms to minimize.
[2024-06-01 14:18:39] [INFO ] Deduced a trap composed of 11 places in 707 ms of which 7 ms to minimize.
[2024-06-01 14:18:40] [INFO ] Deduced a trap composed of 51 places in 761 ms of which 8 ms to minimize.
[2024-06-01 14:18:41] [INFO ] Deduced a trap composed of 42 places in 742 ms of which 8 ms to minimize.
[2024-06-01 14:18:42] [INFO ] Deduced a trap composed of 31 places in 820 ms of which 8 ms to minimize.
[2024-06-01 14:18:43] [INFO ] Deduced a trap composed of 15 places in 762 ms of which 8 ms to minimize.
[2024-06-01 14:18:43] [INFO ] Deduced a trap composed of 115 places in 687 ms of which 7 ms to minimize.
[2024-06-01 14:18:44] [INFO ] Deduced a trap composed of 66 places in 663 ms of which 8 ms to minimize.
[2024-06-01 14:18:45] [INFO ] Deduced a trap composed of 82 places in 724 ms of which 7 ms to minimize.
[2024-06-01 14:18:45] [INFO ] Deduced a trap composed of 40 places in 733 ms of which 7 ms to minimize.
[2024-06-01 14:18:46] [INFO ] Deduced a trap composed of 14 places in 671 ms of which 7 ms to minimize.
[2024-06-01 14:18:47] [INFO ] Deduced a trap composed of 12 places in 660 ms of which 7 ms to minimize.
[2024-06-01 14:18:48] [INFO ] Deduced a trap composed of 16 places in 658 ms of which 8 ms to minimize.
[2024-06-01 14:18:48] [INFO ] Deduced a trap composed of 21 places in 762 ms of which 8 ms to minimize.
[2024-06-01 14:18:49] [INFO ] Deduced a trap composed of 30 places in 758 ms of which 8 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:18:50] [INFO ] Deduced a trap composed of 14 places in 483 ms of which 7 ms to minimize.
[2024-06-01 14:18:51] [INFO ] Deduced a trap composed of 20 places in 676 ms of which 8 ms to minimize.
[2024-06-01 14:18:52] [INFO ] Deduced a trap composed of 13 places in 768 ms of which 8 ms to minimize.
[2024-06-01 14:18:53] [INFO ] Deduced a trap composed of 11 places in 690 ms of which 7 ms to minimize.
[2024-06-01 14:18:53] [INFO ] Deduced a trap composed of 15 places in 624 ms of which 8 ms to minimize.
[2024-06-01 14:18:54] [INFO ] Deduced a trap composed of 71 places in 681 ms of which 7 ms to minimize.
[2024-06-01 14:18:55] [INFO ] Deduced a trap composed of 15 places in 610 ms of which 8 ms to minimize.
[2024-06-01 14:18:55] [INFO ] Deduced a trap composed of 35 places in 734 ms of which 8 ms to minimize.
[2024-06-01 14:18:56] [INFO ] Deduced a trap composed of 14 places in 725 ms of which 8 ms to minimize.
[2024-06-01 14:18:57] [INFO ] Deduced a trap composed of 11 places in 725 ms of which 8 ms to minimize.
[2024-06-01 14:18:57] [INFO ] Deduced a trap composed of 77 places in 658 ms of which 7 ms to minimize.
[2024-06-01 14:18:58] [INFO ] Deduced a trap composed of 71 places in 654 ms of which 8 ms to minimize.
[2024-06-01 14:18:59] [INFO ] Deduced a trap composed of 11 places in 691 ms of which 7 ms to minimize.
[2024-06-01 14:19:00] [INFO ] Deduced a trap composed of 15 places in 636 ms of which 8 ms to minimize.
[2024-06-01 14:19:00] [INFO ] Deduced a trap composed of 16 places in 677 ms of which 7 ms to minimize.
[2024-06-01 14:19:01] [INFO ] Deduced a trap composed of 74 places in 651 ms of which 8 ms to minimize.
[2024-06-01 14:19:02] [INFO ] Deduced a trap composed of 11 places in 715 ms of which 8 ms to minimize.
[2024-06-01 14:19:02] [INFO ] Deduced a trap composed of 15 places in 667 ms of which 7 ms to minimize.
[2024-06-01 14:19:03] [INFO ] Deduced a trap composed of 71 places in 679 ms of which 8 ms to minimize.
[2024-06-01 14:19:04] [INFO ] Deduced a trap composed of 11 places in 713 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/645 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:19:12] [INFO ] Deduced a trap composed of 35 places in 414 ms of which 5 ms to minimize.
[2024-06-01 14:19:13] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:19:13] [INFO ] Deduced a trap composed of 78 places in 414 ms of which 4 ms to minimize.
[2024-06-01 14:19:14] [INFO ] Deduced a trap composed of 23 places in 435 ms of which 4 ms to minimize.
[2024-06-01 14:19:14] [INFO ] Deduced a trap composed of 11 places in 438 ms of which 5 ms to minimize.
[2024-06-01 14:19:15] [INFO ] Deduced a trap composed of 15 places in 438 ms of which 5 ms to minimize.
[2024-06-01 14:19:15] [INFO ] Deduced a trap composed of 23 places in 453 ms of which 5 ms to minimize.
[2024-06-01 14:19:16] [INFO ] Deduced a trap composed of 46 places in 549 ms of which 7 ms to minimize.
[2024-06-01 14:19:16] [INFO ] Deduced a trap composed of 34 places in 501 ms of which 5 ms to minimize.
[2024-06-01 14:19:17] [INFO ] Deduced a trap composed of 22 places in 607 ms of which 5 ms to minimize.
[2024-06-01 14:19:17] [INFO ] Deduced a trap composed of 23 places in 446 ms of which 5 ms to minimize.
[2024-06-01 14:19:18] [INFO ] Deduced a trap composed of 23 places in 576 ms of which 5 ms to minimize.
[2024-06-01 14:19:18] [INFO ] Deduced a trap composed of 45 places in 500 ms of which 7 ms to minimize.
[2024-06-01 14:19:19] [INFO ] Deduced a trap composed of 40 places in 581 ms of which 5 ms to minimize.
[2024-06-01 14:19:19] [INFO ] Deduced a trap composed of 51 places in 518 ms of which 8 ms to minimize.
[2024-06-01 14:19:20] [INFO ] Deduced a trap composed of 31 places in 536 ms of which 5 ms to minimize.
[2024-06-01 14:19:20] [INFO ] Deduced a trap composed of 33 places in 450 ms of which 5 ms to minimize.
[2024-06-01 14:19:21] [INFO ] Deduced a trap composed of 95 places in 491 ms of which 7 ms to minimize.
[2024-06-01 14:19:22] [INFO ] Deduced a trap composed of 22 places in 541 ms of which 5 ms to minimize.
[2024-06-01 14:19:22] [INFO ] Deduced a trap composed of 75 places in 357 ms of which 5 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/665 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:19:23] [INFO ] Deduced a trap composed of 34 places in 445 ms of which 5 ms to minimize.
[2024-06-01 14:19:24] [INFO ] Deduced a trap composed of 16 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:19:24] [INFO ] Deduced a trap composed of 50 places in 470 ms of which 5 ms to minimize.
[2024-06-01 14:19:25] [INFO ] Deduced a trap composed of 32 places in 620 ms of which 5 ms to minimize.
[2024-06-01 14:19:25] [INFO ] Deduced a trap composed of 33 places in 498 ms of which 7 ms to minimize.
[2024-06-01 14:19:26] [INFO ] Deduced a trap composed of 65 places in 596 ms of which 5 ms to minimize.
[2024-06-01 14:19:26] [INFO ] Deduced a trap composed of 35 places in 477 ms of which 5 ms to minimize.
[2024-06-01 14:19:27] [INFO ] Deduced a trap composed of 34 places in 528 ms of which 8 ms to minimize.
[2024-06-01 14:19:28] [INFO ] Deduced a trap composed of 20 places in 525 ms of which 5 ms to minimize.
[2024-06-01 14:19:28] [INFO ] Deduced a trap composed of 23 places in 557 ms of which 7 ms to minimize.
[2024-06-01 14:19:29] [INFO ] Deduced a trap composed of 38 places in 460 ms of which 4 ms to minimize.
[2024-06-01 14:19:29] [INFO ] Deduced a trap composed of 35 places in 434 ms of which 5 ms to minimize.
[2024-06-01 14:19:30] [INFO ] Deduced a trap composed of 55 places in 566 ms of which 8 ms to minimize.
[2024-06-01 14:19:30] [INFO ] Deduced a trap composed of 22 places in 492 ms of which 5 ms to minimize.
[2024-06-01 14:19:31] [INFO ] Deduced a trap composed of 46 places in 569 ms of which 9 ms to minimize.
[2024-06-01 14:19:31] [INFO ] Deduced a trap composed of 25 places in 446 ms of which 5 ms to minimize.
[2024-06-01 14:19:32] [INFO ] Deduced a trap composed of 25 places in 590 ms of which 5 ms to minimize.
[2024-06-01 14:19:32] [INFO ] Deduced a trap composed of 25 places in 454 ms of which 8 ms to minimize.
[2024-06-01 14:19:33] [INFO ] Deduced a trap composed of 13 places in 554 ms of which 5 ms to minimize.
[2024-06-01 14:19:33] [INFO ] Deduced a trap composed of 56 places in 446 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:19:35] [INFO ] Deduced a trap composed of 73 places in 566 ms of which 7 ms to minimize.
[2024-06-01 14:19:36] [INFO ] Deduced a trap composed of 67 places in 474 ms of which 5 ms to minimize.
[2024-06-01 14:19:36] [INFO ] Deduced a trap composed of 38 places in 589 ms of which 7 ms to minimize.
[2024-06-01 14:19:37] [INFO ] Deduced a trap composed of 20 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:19:37] [INFO ] Deduced a trap composed of 29 places in 574 ms of which 6 ms to minimize.
[2024-06-01 14:19:38] [INFO ] Deduced a trap composed of 33 places in 563 ms of which 7 ms to minimize.
[2024-06-01 14:19:38] [INFO ] Deduced a trap composed of 32 places in 577 ms of which 7 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 41 places in 596 ms of which 6 ms to minimize.
[2024-06-01 14:19:40] [INFO ] Deduced a trap composed of 46 places in 621 ms of which 7 ms to minimize.
[2024-06-01 14:19:40] [INFO ] Deduced a trap composed of 29 places in 696 ms of which 8 ms to minimize.
[2024-06-01 14:19:41] [INFO ] Deduced a trap composed of 47 places in 516 ms of which 7 ms to minimize.
[2024-06-01 14:19:42] [INFO ] Deduced a trap composed of 70 places in 650 ms of which 7 ms to minimize.
[2024-06-01 14:19:42] [INFO ] Deduced a trap composed of 70 places in 602 ms of which 7 ms to minimize.
[2024-06-01 14:19:43] [INFO ] Deduced a trap composed of 41 places in 599 ms of which 7 ms to minimize.
[2024-06-01 14:19:44] [INFO ] Deduced a trap composed of 42 places in 586 ms of which 6 ms to minimize.
[2024-06-01 14:19:44] [INFO ] Deduced a trap composed of 38 places in 458 ms of which 4 ms to minimize.
[2024-06-01 14:19:44] [INFO ] Deduced a trap composed of 47 places in 422 ms of which 7 ms to minimize.
[2024-06-01 14:19:45] [INFO ] Deduced a trap composed of 43 places in 506 ms of which 7 ms to minimize.
[2024-06-01 14:19:45] [INFO ] Deduced a trap composed of 50 places in 497 ms of which 6 ms to minimize.
[2024-06-01 14:19:46] [INFO ] Deduced a trap composed of 62 places in 361 ms of which 4 ms to minimize.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1944 variables, and 705 constraints, problems are : Problem set: 0 solved, 595 unsolved in 105031 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 100/100 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (OVERLAPS) 173/583 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 173/605 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 100/705 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:20:03] [INFO ] Deduced a trap composed of 41 places in 277 ms of which 4 ms to minimize.
[2024-06-01 14:20:03] [INFO ] Deduced a trap composed of 59 places in 346 ms of which 4 ms to minimize.
[2024-06-01 14:20:04] [INFO ] Deduced a trap composed of 44 places in 502 ms of which 6 ms to minimize.
[2024-06-01 14:20:04] [INFO ] Deduced a trap composed of 41 places in 541 ms of which 7 ms to minimize.
[2024-06-01 14:20:05] [INFO ] Deduced a trap composed of 44 places in 350 ms of which 4 ms to minimize.
[2024-06-01 14:20:05] [INFO ] Deduced a trap composed of 29 places in 502 ms of which 6 ms to minimize.
[2024-06-01 14:20:06] [INFO ] Deduced a trap composed of 67 places in 558 ms of which 6 ms to minimize.
[2024-06-01 14:20:06] [INFO ] Deduced a trap composed of 67 places in 558 ms of which 6 ms to minimize.
[2024-06-01 14:20:07] [INFO ] Deduced a trap composed of 39 places in 548 ms of which 7 ms to minimize.
[2024-06-01 14:20:08] [INFO ] Deduced a trap composed of 50 places in 528 ms of which 6 ms to minimize.
[2024-06-01 14:20:08] [INFO ] Deduced a trap composed of 41 places in 575 ms of which 7 ms to minimize.
[2024-06-01 14:20:09] [INFO ] Deduced a trap composed of 66 places in 582 ms of which 7 ms to minimize.
[2024-06-01 14:20:10] [INFO ] Deduced a trap composed of 41 places in 557 ms of which 7 ms to minimize.
[2024-06-01 14:20:11] [INFO ] Deduced a trap composed of 31 places in 690 ms of which 8 ms to minimize.
[2024-06-01 14:20:11] [INFO ] Deduced a trap composed of 30 places in 608 ms of which 7 ms to minimize.
[2024-06-01 14:20:12] [INFO ] Deduced a trap composed of 30 places in 618 ms of which 7 ms to minimize.
[2024-06-01 14:20:12] [INFO ] Deduced a trap composed of 66 places in 611 ms of which 6 ms to minimize.
[2024-06-01 14:20:13] [INFO ] Deduced a trap composed of 71 places in 439 ms of which 5 ms to minimize.
[2024-06-01 14:20:13] [INFO ] Deduced a trap composed of 53 places in 440 ms of which 5 ms to minimize.
[2024-06-01 14:20:14] [INFO ] Deduced a trap composed of 53 places in 376 ms of which 5 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/725 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:20:16] [INFO ] Deduced a trap composed of 50 places in 441 ms of which 6 ms to minimize.
[2024-06-01 14:20:17] [INFO ] Deduced a trap composed of 31 places in 609 ms of which 8 ms to minimize.
[2024-06-01 14:20:18] [INFO ] Deduced a trap composed of 31 places in 555 ms of which 7 ms to minimize.
[2024-06-01 14:20:19] [INFO ] Deduced a trap composed of 32 places in 658 ms of which 7 ms to minimize.
[2024-06-01 14:20:19] [INFO ] Deduced a trap composed of 33 places in 662 ms of which 7 ms to minimize.
[2024-06-01 14:20:20] [INFO ] Deduced a trap composed of 31 places in 675 ms of which 8 ms to minimize.
[2024-06-01 14:20:21] [INFO ] Deduced a trap composed of 32 places in 606 ms of which 7 ms to minimize.
[2024-06-01 14:20:21] [INFO ] Deduced a trap composed of 75 places in 607 ms of which 7 ms to minimize.
[2024-06-01 14:20:22] [INFO ] Deduced a trap composed of 49 places in 602 ms of which 7 ms to minimize.
[2024-06-01 14:20:23] [INFO ] Deduced a trap composed of 32 places in 607 ms of which 7 ms to minimize.
[2024-06-01 14:20:23] [INFO ] Deduced a trap composed of 50 places in 358 ms of which 5 ms to minimize.
[2024-06-01 14:20:24] [INFO ] Deduced a trap composed of 60 places in 364 ms of which 4 ms to minimize.
[2024-06-01 14:20:24] [INFO ] Deduced a trap composed of 51 places in 372 ms of which 5 ms to minimize.
[2024-06-01 14:20:24] [INFO ] Deduced a trap composed of 51 places in 371 ms of which 5 ms to minimize.
[2024-06-01 14:20:25] [INFO ] Deduced a trap composed of 34 places in 609 ms of which 7 ms to minimize.
[2024-06-01 14:20:25] [INFO ] Deduced a trap composed of 60 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 59 places in 335 ms of which 4 ms to minimize.
[2024-06-01 14:20:26] [INFO ] Deduced a trap composed of 62 places in 339 ms of which 4 ms to minimize.
[2024-06-01 14:20:27] [INFO ] Deduced a trap composed of 60 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:20:27] [INFO ] Deduced a trap composed of 62 places in 345 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/745 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:20:31] [INFO ] Deduced a trap composed of 24 places in 444 ms of which 7 ms to minimize.
[2024-06-01 14:20:32] [INFO ] Deduced a trap composed of 24 places in 591 ms of which 7 ms to minimize.
[2024-06-01 14:20:32] [INFO ] Deduced a trap composed of 24 places in 625 ms of which 7 ms to minimize.
[2024-06-01 14:20:33] [INFO ] Deduced a trap composed of 42 places in 547 ms of which 7 ms to minimize.
[2024-06-01 14:20:34] [INFO ] Deduced a trap composed of 47 places in 615 ms of which 7 ms to minimize.
[2024-06-01 14:20:34] [INFO ] Deduced a trap composed of 54 places in 611 ms of which 7 ms to minimize.
[2024-06-01 14:20:35] [INFO ] Deduced a trap composed of 16 places in 511 ms of which 6 ms to minimize.
[2024-06-01 14:20:36] [INFO ] Deduced a trap composed of 29 places in 658 ms of which 8 ms to minimize.
[2024-06-01 14:20:36] [INFO ] Deduced a trap composed of 85 places in 533 ms of which 7 ms to minimize.
[2024-06-01 14:20:37] [INFO ] Deduced a trap composed of 85 places in 527 ms of which 7 ms to minimize.
[2024-06-01 14:20:37] [INFO ] Deduced a trap composed of 54 places in 561 ms of which 6 ms to minimize.
[2024-06-01 14:20:38] [INFO ] Deduced a trap composed of 74 places in 571 ms of which 7 ms to minimize.
[2024-06-01 14:20:39] [INFO ] Deduced a trap composed of 57 places in 569 ms of which 6 ms to minimize.
[2024-06-01 14:20:39] [INFO ] Deduced a trap composed of 51 places in 416 ms of which 5 ms to minimize.
[2024-06-01 14:20:40] [INFO ] Deduced a trap composed of 51 places in 548 ms of which 7 ms to minimize.
[2024-06-01 14:20:41] [INFO ] Deduced a trap composed of 29 places in 651 ms of which 8 ms to minimize.
[2024-06-01 14:20:41] [INFO ] Deduced a trap composed of 74 places in 622 ms of which 7 ms to minimize.
[2024-06-01 14:20:42] [INFO ] Deduced a trap composed of 72 places in 629 ms of which 8 ms to minimize.
[2024-06-01 14:20:43] [INFO ] Deduced a trap composed of 29 places in 663 ms of which 7 ms to minimize.
[2024-06-01 14:20:43] [INFO ] Deduced a trap composed of 59 places in 316 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/765 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:20:47] [INFO ] Deduced a trap composed of 58 places in 399 ms of which 5 ms to minimize.
[2024-06-01 14:20:48] [INFO ] Deduced a trap composed of 50 places in 632 ms of which 7 ms to minimize.
[2024-06-01 14:20:49] [INFO ] Deduced a trap composed of 136 places in 667 ms of which 7 ms to minimize.
[2024-06-01 14:20:49] [INFO ] Deduced a trap composed of 59 places in 643 ms of which 7 ms to minimize.
[2024-06-01 14:20:50] [INFO ] Deduced a trap composed of 17 places in 663 ms of which 8 ms to minimize.
[2024-06-01 14:20:51] [INFO ] Deduced a trap composed of 16 places in 680 ms of which 8 ms to minimize.
[2024-06-01 14:20:51] [INFO ] Deduced a trap composed of 26 places in 664 ms of which 8 ms to minimize.
[2024-06-01 14:20:52] [INFO ] Deduced a trap composed of 17 places in 660 ms of which 7 ms to minimize.
[2024-06-01 14:20:53] [INFO ] Deduced a trap composed of 35 places in 674 ms of which 7 ms to minimize.
[2024-06-01 14:20:53] [INFO ] Deduced a trap composed of 76 places in 648 ms of which 7 ms to minimize.
[2024-06-01 14:20:54] [INFO ] Deduced a trap composed of 47 places in 662 ms of which 8 ms to minimize.
[2024-06-01 14:20:55] [INFO ] Deduced a trap composed of 39 places in 703 ms of which 7 ms to minimize.
[2024-06-01 14:20:56] [INFO ] Deduced a trap composed of 39 places in 684 ms of which 8 ms to minimize.
[2024-06-01 14:20:56] [INFO ] Deduced a trap composed of 73 places in 707 ms of which 8 ms to minimize.
[2024-06-01 14:20:57] [INFO ] Deduced a trap composed of 17 places in 630 ms of which 8 ms to minimize.
[2024-06-01 14:20:58] [INFO ] Deduced a trap composed of 54 places in 718 ms of which 7 ms to minimize.
[2024-06-01 14:20:59] [INFO ] Deduced a trap composed of 11 places in 633 ms of which 7 ms to minimize.
[2024-06-01 14:21:00] [INFO ] Deduced a trap composed of 48 places in 534 ms of which 6 ms to minimize.
[2024-06-01 14:21:00] [INFO ] Deduced a trap composed of 48 places in 558 ms of which 7 ms to minimize.
[2024-06-01 14:21:01] [INFO ] Deduced a trap composed of 39 places in 558 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/785 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:21:07] [INFO ] Deduced a trap composed of 68 places in 557 ms of which 7 ms to minimize.
[2024-06-01 14:21:07] [INFO ] Deduced a trap composed of 49 places in 555 ms of which 7 ms to minimize.
[2024-06-01 14:21:08] [INFO ] Deduced a trap composed of 52 places in 575 ms of which 7 ms to minimize.
[2024-06-01 14:21:08] [INFO ] Deduced a trap composed of 47 places in 467 ms of which 5 ms to minimize.
[2024-06-01 14:21:09] [INFO ] Deduced a trap composed of 69 places in 617 ms of which 7 ms to minimize.
[2024-06-01 14:21:10] [INFO ] Deduced a trap composed of 64 places in 520 ms of which 7 ms to minimize.
[2024-06-01 14:21:10] [INFO ] Deduced a trap composed of 50 places in 646 ms of which 8 ms to minimize.
[2024-06-01 14:21:11] [INFO ] Deduced a trap composed of 48 places in 597 ms of which 7 ms to minimize.
[2024-06-01 14:21:12] [INFO ] Deduced a trap composed of 39 places in 629 ms of which 7 ms to minimize.
[2024-06-01 14:21:12] [INFO ] Deduced a trap composed of 74 places in 618 ms of which 7 ms to minimize.
[2024-06-01 14:21:13] [INFO ] Deduced a trap composed of 59 places in 626 ms of which 7 ms to minimize.
[2024-06-01 14:21:14] [INFO ] Deduced a trap composed of 54 places in 594 ms of which 7 ms to minimize.
[2024-06-01 14:21:14] [INFO ] Deduced a trap composed of 65 places in 538 ms of which 6 ms to minimize.
[2024-06-01 14:21:15] [INFO ] Deduced a trap composed of 66 places in 506 ms of which 6 ms to minimize.
[2024-06-01 14:21:15] [INFO ] Deduced a trap composed of 66 places in 563 ms of which 6 ms to minimize.
[2024-06-01 14:21:16] [INFO ] Deduced a trap composed of 66 places in 494 ms of which 7 ms to minimize.
[2024-06-01 14:21:17] [INFO ] Deduced a trap composed of 66 places in 571 ms of which 7 ms to minimize.
[2024-06-01 14:21:17] [INFO ] Deduced a trap composed of 39 places in 488 ms of which 7 ms to minimize.
[2024-06-01 14:21:18] [INFO ] Deduced a trap composed of 62 places in 426 ms of which 5 ms to minimize.
[2024-06-01 14:21:18] [INFO ] Deduced a trap composed of 62 places in 424 ms of which 5 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 20/805 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:21:25] [INFO ] Deduced a trap composed of 30 places in 568 ms of which 8 ms to minimize.
[2024-06-01 14:21:26] [INFO ] Deduced a trap composed of 63 places in 610 ms of which 7 ms to minimize.
[2024-06-01 14:21:27] [INFO ] Deduced a trap composed of 68 places in 625 ms of which 7 ms to minimize.
[2024-06-01 14:21:27] [INFO ] Deduced a trap composed of 41 places in 658 ms of which 8 ms to minimize.
[2024-06-01 14:21:28] [INFO ] Deduced a trap composed of 38 places in 612 ms of which 7 ms to minimize.
[2024-06-01 14:21:29] [INFO ] Deduced a trap composed of 42 places in 528 ms of which 7 ms to minimize.
[2024-06-01 14:21:29] [INFO ] Deduced a trap composed of 71 places in 425 ms of which 5 ms to minimize.
[2024-06-01 14:21:30] [INFO ] Deduced a trap composed of 71 places in 416 ms of which 5 ms to minimize.
[2024-06-01 14:21:30] [INFO ] Deduced a trap composed of 71 places in 423 ms of which 5 ms to minimize.
[2024-06-01 14:21:31] [INFO ] Deduced a trap composed of 71 places in 400 ms of which 5 ms to minimize.
[2024-06-01 14:21:31] [INFO ] Deduced a trap composed of 53 places in 414 ms of which 5 ms to minimize.
[2024-06-01 14:21:32] [INFO ] Deduced a trap composed of 71 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:21:32] [INFO ] Deduced a trap composed of 53 places in 201 ms of which 3 ms to minimize.
[2024-06-01 14:21:32] [INFO ] Deduced a trap composed of 62 places in 237 ms of which 4 ms to minimize.
[2024-06-01 14:21:32] [INFO ] Deduced a trap composed of 91 places in 309 ms of which 4 ms to minimize.
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 108 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 61 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:21:33] [INFO ] Deduced a trap composed of 52 places in 301 ms of which 4 ms to minimize.
[2024-06-01 14:21:34] [INFO ] Deduced a trap composed of 52 places in 299 ms of which 4 ms to minimize.
[2024-06-01 14:21:34] [INFO ] Deduced a trap composed of 52 places in 300 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 20/825 constraints. Problems are: Problem set: 0 solved, 595 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/1944 variables, and 825 constraints, problems are : Problem set: 0 solved, 595 unsolved in 105035 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/595 constraints, Known Traps: 220/220 constraints]
After SMT, in 210241ms problems are : Problem set: 0 solved, 595 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 410 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 25 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 26 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2024-06-01 14:21:37] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:21:37] [INFO ] Invariant cache hit.
[2024-06-01 14:21:38] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-06-01 14:21:38] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:21:38] [INFO ] Invariant cache hit.
[2024-06-01 14:21:38] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:21:40] [INFO ] Implicit Places using invariants and state equation in 1918 ms returned []
Implicit Place search using SMT with State Equation took 2241 ms to find 0 implicit places.
[2024-06-01 14:21:40] [INFO ] Redundant transitions in 181 ms returned []
Running 1688 sub problems to find dead transitions.
[2024-06-01 14:21:40] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:21:40] [INFO ] Invariant cache hit.
[2024-06-01 14:21:40] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
SMT process timed out in 31345ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 31386ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33857 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 400000 steps (8 resets) in 9940 ms. (40 steps per ms) remains 264/410 properties
Running SMT prover for 264 properties.
[2024-06-01 14:22:14] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:22:14] [INFO ] Invariant cache hit.
[2024-06-01 14:22:14] [INFO ] [Real]Absence check using 23 positive place invariants in 12 ms returned sat
[2024-06-01 14:22:15] [INFO ] After 944ms SMT Verify possible using state equation in real domain returned unsat :0 sat :264
[2024-06-01 14:22:15] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:22:17] [INFO ] After 2105ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :264
TRAPS : Iteration 0
[2024-06-01 14:22:47] [INFO ] After 32052ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:264
[2024-06-01 14:22:47] [INFO ] After 33499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:264
[2024-06-01 14:22:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 14 ms returned sat
[2024-06-01 14:22:49] [INFO ] After 978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :264
[2024-06-01 14:22:51] [INFO ] After 2486ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :264
TRAPS : Iteration 0
[2024-06-01 14:22:52] [INFO ] Deduced a trap composed of 25 places in 539 ms of which 6 ms to minimize.
[2024-06-01 14:22:53] [INFO ] Deduced a trap composed of 29 places in 545 ms of which 6 ms to minimize.
[2024-06-01 14:22:53] [INFO ] Deduced a trap composed of 13 places in 521 ms of which 6 ms to minimize.
[2024-06-01 14:22:54] [INFO ] Deduced a trap composed of 42 places in 538 ms of which 6 ms to minimize.
[2024-06-01 14:22:54] [INFO ] Deduced a trap composed of 29 places in 516 ms of which 5 ms to minimize.
[2024-06-01 14:22:55] [INFO ] Deduced a trap composed of 11 places in 504 ms of which 5 ms to minimize.
[2024-06-01 14:22:55] [INFO ] Deduced a trap composed of 41 places in 504 ms of which 5 ms to minimize.
[2024-06-01 14:22:56] [INFO ] Deduced a trap composed of 60 places in 500 ms of which 5 ms to minimize.
[2024-06-01 14:22:56] [INFO ] Deduced a trap composed of 53 places in 499 ms of which 5 ms to minimize.
[2024-06-01 14:22:57] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 5 ms to minimize.
[2024-06-01 14:22:58] [INFO ] Deduced a trap composed of 20 places in 513 ms of which 5 ms to minimize.
[2024-06-01 14:22:58] [INFO ] Deduced a trap composed of 11 places in 489 ms of which 5 ms to minimize.
[2024-06-01 14:22:59] [INFO ] Deduced a trap composed of 34 places in 487 ms of which 5 ms to minimize.
[2024-06-01 14:22:59] [INFO ] Deduced a trap composed of 20 places in 496 ms of which 5 ms to minimize.
[2024-06-01 14:23:00] [INFO ] Deduced a trap composed of 65 places in 477 ms of which 5 ms to minimize.
[2024-06-01 14:23:00] [INFO ] Deduced a trap composed of 21 places in 477 ms of which 5 ms to minimize.
[2024-06-01 14:23:01] [INFO ] Deduced a trap composed of 45 places in 482 ms of which 5 ms to minimize.
[2024-06-01 14:23:01] [INFO ] Deduced a trap composed of 71 places in 467 ms of which 5 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 22 places in 434 ms of which 5 ms to minimize.
[2024-06-01 14:23:02] [INFO ] Deduced a trap composed of 60 places in 477 ms of which 5 ms to minimize.
[2024-06-01 14:23:03] [INFO ] Deduced a trap composed of 73 places in 479 ms of which 6 ms to minimize.
[2024-06-01 14:23:03] [INFO ] Deduced a trap composed of 23 places in 473 ms of which 5 ms to minimize.
[2024-06-01 14:23:04] [INFO ] Deduced a trap composed of 59 places in 336 ms of which 4 ms to minimize.
[2024-06-01 14:23:04] [INFO ] Deduced a trap composed of 49 places in 438 ms of which 5 ms to minimize.
[2024-06-01 14:23:05] [INFO ] Deduced a trap composed of 51 places in 442 ms of which 4 ms to minimize.
[2024-06-01 14:23:05] [INFO ] Deduced a trap composed of 51 places in 425 ms of which 5 ms to minimize.
[2024-06-01 14:23:06] [INFO ] Deduced a trap composed of 33 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:23:06] [INFO ] Deduced a trap composed of 32 places in 438 ms of which 5 ms to minimize.
[2024-06-01 14:23:07] [INFO ] Deduced a trap composed of 33 places in 438 ms of which 5 ms to minimize.
[2024-06-01 14:23:07] [INFO ] Deduced a trap composed of 33 places in 433 ms of which 5 ms to minimize.
[2024-06-01 14:23:08] [INFO ] Deduced a trap composed of 33 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:23:08] [INFO ] Deduced a trap composed of 33 places in 442 ms of which 4 ms to minimize.
[2024-06-01 14:23:09] [INFO ] Deduced a trap composed of 67 places in 444 ms of which 5 ms to minimize.
[2024-06-01 14:23:09] [INFO ] Deduced a trap composed of 42 places in 629 ms of which 8 ms to minimize.
[2024-06-01 14:23:10] [INFO ] Deduced a trap composed of 11 places in 640 ms of which 7 ms to minimize.
[2024-06-01 14:23:11] [INFO ] Deduced a trap composed of 40 places in 572 ms of which 5 ms to minimize.
[2024-06-01 14:23:11] [INFO ] Deduced a trap composed of 37 places in 492 ms of which 5 ms to minimize.
[2024-06-01 14:23:12] [INFO ] Deduced a trap composed of 13 places in 687 ms of which 8 ms to minimize.
[2024-06-01 14:23:13] [INFO ] Deduced a trap composed of 13 places in 732 ms of which 8 ms to minimize.
[2024-06-01 14:23:13] [INFO ] Deduced a trap composed of 13 places in 697 ms of which 5 ms to minimize.
[2024-06-01 14:23:14] [INFO ] Deduced a trap composed of 11 places in 602 ms of which 8 ms to minimize.
[2024-06-01 14:23:15] [INFO ] Deduced a trap composed of 35 places in 691 ms of which 7 ms to minimize.
[2024-06-01 14:23:16] [INFO ] Deduced a trap composed of 45 places in 655 ms of which 7 ms to minimize.
[2024-06-01 14:23:16] [INFO ] Deduced a trap composed of 35 places in 679 ms of which 7 ms to minimize.
[2024-06-01 14:23:17] [INFO ] Deduced a trap composed of 32 places in 637 ms of which 7 ms to minimize.
[2024-06-01 14:23:18] [INFO ] Deduced a trap composed of 79 places in 681 ms of which 8 ms to minimize.
[2024-06-01 14:23:18] [INFO ] Deduced a trap composed of 72 places in 685 ms of which 8 ms to minimize.
[2024-06-01 14:23:19] [INFO ] Deduced a trap composed of 98 places in 725 ms of which 8 ms to minimize.
[2024-06-01 14:23:20] [INFO ] Deduced a trap composed of 35 places in 676 ms of which 7 ms to minimize.
[2024-06-01 14:23:21] [INFO ] Deduced a trap composed of 81 places in 675 ms of which 7 ms to minimize.
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 88 places in 680 ms of which 7 ms to minimize.
[2024-06-01 14:23:22] [INFO ] Deduced a trap composed of 48 places in 689 ms of which 7 ms to minimize.
[2024-06-01 14:23:23] [INFO ] Deduced a trap composed of 34 places in 692 ms of which 8 ms to minimize.
[2024-06-01 14:23:24] [INFO ] Deduced a trap composed of 41 places in 719 ms of which 7 ms to minimize.
[2024-06-01 14:23:25] [INFO ] Deduced a trap composed of 35 places in 731 ms of which 7 ms to minimize.
[2024-06-01 14:23:25] [INFO ] Deduced a trap composed of 41 places in 711 ms of which 7 ms to minimize.
[2024-06-01 14:23:26] [INFO ] Deduced a trap composed of 32 places in 678 ms of which 7 ms to minimize.
[2024-06-01 14:23:27] [INFO ] Deduced a trap composed of 37 places in 633 ms of which 7 ms to minimize.
[2024-06-01 14:23:28] [INFO ] Deduced a trap composed of 41 places in 614 ms of which 7 ms to minimize.
[2024-06-01 14:23:28] [INFO ] Deduced a trap composed of 72 places in 540 ms of which 7 ms to minimize.
[2024-06-01 14:23:29] [INFO ] Deduced a trap composed of 71 places in 517 ms of which 6 ms to minimize.
[2024-06-01 14:23:29] [INFO ] Deduced a trap composed of 72 places in 541 ms of which 6 ms to minimize.
[2024-06-01 14:23:30] [INFO ] Deduced a trap composed of 72 places in 476 ms of which 4 ms to minimize.
[2024-06-01 14:23:30] [INFO ] Deduced a trap composed of 71 places in 365 ms of which 4 ms to minimize.
[2024-06-01 14:23:31] [INFO ] Deduced a trap composed of 48 places in 388 ms of which 7 ms to minimize.
[2024-06-01 14:23:31] [INFO ] Deduced a trap composed of 42 places in 549 ms of which 6 ms to minimize.
[2024-06-01 14:23:32] [INFO ] Deduced a trap composed of 57 places in 630 ms of which 8 ms to minimize.
[2024-06-01 14:23:33] [INFO ] Deduced a trap composed of 41 places in 568 ms of which 7 ms to minimize.
[2024-06-01 14:23:33] [INFO ] Deduced a trap composed of 53 places in 666 ms of which 7 ms to minimize.
[2024-06-01 14:23:34] [INFO ] Deduced a trap composed of 59 places in 590 ms of which 7 ms to minimize.
[2024-06-01 14:23:35] [INFO ] Deduced a trap composed of 11 places in 699 ms of which 8 ms to minimize.
[2024-06-01 14:23:35] [INFO ] Trap strengthening (SAT) tested/added 72/71 trap constraints in 43632 ms
[2024-06-01 14:23:36] [INFO ] Deduced a trap composed of 34 places in 683 ms of which 7 ms to minimize.
[2024-06-01 14:23:37] [INFO ] Deduced a trap composed of 15 places in 644 ms of which 7 ms to minimize.
[2024-06-01 14:23:37] [INFO ] Deduced a trap composed of 14 places in 586 ms of which 7 ms to minimize.
[2024-06-01 14:23:37] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2209 ms
[2024-06-01 14:23:38] [INFO ] Deduced a trap composed of 31 places in 523 ms of which 6 ms to minimize.
[2024-06-01 14:23:39] [INFO ] Deduced a trap composed of 32 places in 537 ms of which 6 ms to minimize.
[2024-06-01 14:23:39] [INFO ] Deduced a trap composed of 32 places in 551 ms of which 6 ms to minimize.
[2024-06-01 14:23:40] [INFO ] Deduced a trap composed of 23 places in 738 ms of which 8 ms to minimize.
[2024-06-01 14:23:41] [INFO ] Deduced a trap composed of 21 places in 681 ms of which 7 ms to minimize.
[2024-06-01 14:23:42] [INFO ] Deduced a trap composed of 51 places in 682 ms of which 8 ms to minimize.
[2024-06-01 14:23:42] [INFO ] Deduced a trap composed of 80 places in 700 ms of which 8 ms to minimize.
[2024-06-01 14:23:43] [INFO ] Deduced a trap composed of 20 places in 698 ms of which 7 ms to minimize.
[2024-06-01 14:23:44] [INFO ] Deduced a trap composed of 20 places in 665 ms of which 7 ms to minimize.
[2024-06-01 14:23:45] [INFO ] Deduced a trap composed of 52 places in 687 ms of which 8 ms to minimize.
[2024-06-01 14:23:45] [INFO ] Deduced a trap composed of 23 places in 698 ms of which 7 ms to minimize.
[2024-06-01 14:23:46] [INFO ] Deduced a trap composed of 25 places in 566 ms of which 7 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 23 places in 240 ms of which 3 ms to minimize.
[2024-06-01 14:23:47] [INFO ] Deduced a trap composed of 23 places in 515 ms of which 7 ms to minimize.
[2024-06-01 14:23:48] [INFO ] Deduced a trap composed of 23 places in 522 ms of which 6 ms to minimize.
[2024-06-01 14:23:48] [INFO ] Deduced a trap composed of 87 places in 499 ms of which 6 ms to minimize.
[2024-06-01 14:23:49] [INFO ] Deduced a trap composed of 16 places in 503 ms of which 6 ms to minimize.
[2024-06-01 14:23:50] [INFO ] Deduced a trap composed of 80 places in 518 ms of which 6 ms to minimize.
[2024-06-01 14:23:50] [INFO ] Deduced a trap composed of 87 places in 504 ms of which 6 ms to minimize.
[2024-06-01 14:23:51] [INFO ] Deduced a trap composed of 22 places in 502 ms of which 6 ms to minimize.
[2024-06-01 14:23:51] [INFO ] Deduced a trap composed of 23 places in 484 ms of which 5 ms to minimize.
[2024-06-01 14:23:52] [INFO ] Deduced a trap composed of 41 places in 582 ms of which 8 ms to minimize.
[2024-06-01 14:23:53] [INFO ] Deduced a trap composed of 16 places in 653 ms of which 7 ms to minimize.
[2024-06-01 14:23:54] [INFO ] Deduced a trap composed of 34 places in 673 ms of which 8 ms to minimize.
[2024-06-01 14:23:54] [INFO ] Deduced a trap composed of 16 places in 669 ms of which 7 ms to minimize.
[2024-06-01 14:23:55] [INFO ] Deduced a trap composed of 34 places in 489 ms of which 6 ms to minimize.
[2024-06-01 14:23:55] [INFO ] Deduced a trap composed of 87 places in 503 ms of which 6 ms to minimize.
[2024-06-01 14:23:56] [INFO ] Deduced a trap composed of 33 places in 492 ms of which 6 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 26 places in 611 ms of which 7 ms to minimize.
[2024-06-01 14:23:57] [INFO ] Deduced a trap composed of 24 places in 601 ms of which 7 ms to minimize.
[2024-06-01 14:23:59] [INFO ] Deduced a trap composed of 20 places in 690 ms of which 7 ms to minimize.
[2024-06-01 14:23:59] [INFO ] Deduced a trap composed of 23 places in 630 ms of which 7 ms to minimize.
[2024-06-01 14:24:00] [INFO ] Deduced a trap composed of 32 places in 544 ms of which 6 ms to minimize.
[2024-06-01 14:24:00] [INFO ] Deduced a trap composed of 43 places in 516 ms of which 6 ms to minimize.
[2024-06-01 14:24:01] [INFO ] Trap strengthening (SAT) tested/added 35/34 trap constraints in 23089 ms
[2024-06-01 14:24:01] [INFO ] Deduced a trap composed of 34 places in 520 ms of which 6 ms to minimize.
[2024-06-01 14:24:02] [INFO ] Deduced a trap composed of 32 places in 507 ms of which 6 ms to minimize.
[2024-06-01 14:24:02] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1662 ms
[2024-06-01 14:24:03] [INFO ] Deduced a trap composed of 14 places in 523 ms of which 6 ms to minimize.
[2024-06-01 14:24:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 667 ms
[2024-06-01 14:24:04] [INFO ] Deduced a trap composed of 22 places in 540 ms of which 6 ms to minimize.
[2024-06-01 14:24:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 686 ms
[2024-06-01 14:24:05] [INFO ] Deduced a trap composed of 53 places in 435 ms of which 6 ms to minimize.
[2024-06-01 14:24:06] [INFO ] Deduced a trap composed of 62 places in 423 ms of which 6 ms to minimize.
[2024-06-01 14:24:06] [INFO ] Deduced a trap composed of 71 places in 411 ms of which 5 ms to minimize.
[2024-06-01 14:24:07] [INFO ] Deduced a trap composed of 71 places in 413 ms of which 5 ms to minimize.
[2024-06-01 14:24:07] [INFO ] Deduced a trap composed of 71 places in 419 ms of which 5 ms to minimize.
[2024-06-01 14:24:08] [INFO ] Deduced a trap composed of 71 places in 420 ms of which 6 ms to minimize.
[2024-06-01 14:24:08] [INFO ] Deduced a trap composed of 78 places in 428 ms of which 5 ms to minimize.
[2024-06-01 14:24:08] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 3539 ms
[2024-06-01 14:24:09] [INFO ] Deduced a trap composed of 53 places in 465 ms of which 6 ms to minimize.
[2024-06-01 14:24:09] [INFO ] Deduced a trap composed of 52 places in 463 ms of which 6 ms to minimize.
[2024-06-01 14:24:10] [INFO ] Deduced a trap composed of 71 places in 467 ms of which 6 ms to minimize.
[2024-06-01 14:24:10] [INFO ] Deduced a trap composed of 70 places in 465 ms of which 6 ms to minimize.
[2024-06-01 14:24:11] [INFO ] Deduced a trap composed of 122 places in 460 ms of which 5 ms to minimize.
[2024-06-01 14:24:12] [INFO ] Deduced a trap composed of 70 places in 481 ms of which 6 ms to minimize.
[2024-06-01 14:24:12] [INFO ] Deduced a trap composed of 52 places in 481 ms of which 6 ms to minimize.
[2024-06-01 14:24:13] [INFO ] Deduced a trap composed of 52 places in 469 ms of which 6 ms to minimize.
[2024-06-01 14:24:13] [INFO ] Deduced a trap composed of 70 places in 467 ms of which 6 ms to minimize.
[2024-06-01 14:24:14] [INFO ] Deduced a trap composed of 52 places in 478 ms of which 6 ms to minimize.
[2024-06-01 14:24:14] [INFO ] Deduced a trap composed of 62 places in 458 ms of which 6 ms to minimize.
[2024-06-01 14:24:15] [INFO ] Deduced a trap composed of 61 places in 460 ms of which 6 ms to minimize.
[2024-06-01 14:24:15] [INFO ] Deduced a trap composed of 70 places in 459 ms of which 6 ms to minimize.
[2024-06-01 14:24:16] [INFO ] Deduced a trap composed of 52 places in 450 ms of which 6 ms to minimize.
[2024-06-01 14:24:16] [INFO ] Deduced a trap composed of 61 places in 450 ms of which 5 ms to minimize.
[2024-06-01 14:24:17] [INFO ] Deduced a trap composed of 70 places in 456 ms of which 6 ms to minimize.
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 70 places in 484 ms of which 6 ms to minimize.
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 61 places in 341 ms of which 4 ms to minimize.
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 61 places in 356 ms of which 5 ms to minimize.
[2024-06-01 14:24:19] [INFO ] Deduced a trap composed of 61 places in 372 ms of which 4 ms to minimize.
[2024-06-01 14:24:19] [INFO ] Deduced a trap composed of 61 places in 350 ms of which 4 ms to minimize.
[2024-06-01 14:24:19] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 10967 ms
[2024-06-01 14:24:20] [INFO ] Deduced a trap composed of 59 places in 401 ms of which 5 ms to minimize.
[2024-06-01 14:24:20] [INFO ] Deduced a trap composed of 50 places in 354 ms of which 5 ms to minimize.
[2024-06-01 14:24:21] [INFO ] Deduced a trap composed of 32 places in 556 ms of which 7 ms to minimize.
[2024-06-01 14:24:22] [INFO ] Deduced a trap composed of 38 places in 530 ms of which 6 ms to minimize.
[2024-06-01 14:24:23] [INFO ] Deduced a trap composed of 47 places in 549 ms of which 6 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 25 places in 428 ms of which 5 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 31 places in 596 ms of which 7 ms to minimize.
[2024-06-01 14:24:25] [INFO ] Deduced a trap composed of 40 places in 363 ms of which 5 ms to minimize.
[2024-06-01 14:24:25] [INFO ] Deduced a trap composed of 56 places in 363 ms of which 4 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 41 places in 353 ms of which 5 ms to minimize.
[2024-06-01 14:24:26] [INFO ] Deduced a trap composed of 50 places in 378 ms of which 5 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 38 places in 581 ms of which 7 ms to minimize.
[2024-06-01 14:24:27] [INFO ] Deduced a trap composed of 38 places in 596 ms of which 7 ms to minimize.
[2024-06-01 14:24:28] [INFO ] Deduced a trap composed of 41 places in 601 ms of which 6 ms to minimize.
[2024-06-01 14:24:29] [INFO ] Deduced a trap composed of 38 places in 566 ms of which 7 ms to minimize.
[2024-06-01 14:24:29] [INFO ] Deduced a trap composed of 34 places in 356 ms of which 5 ms to minimize.
[2024-06-01 14:24:30] [INFO ] Deduced a trap composed of 33 places in 311 ms of which 4 ms to minimize.
[2024-06-01 14:24:31] [INFO ] Deduced a trap composed of 68 places in 262 ms of which 4 ms to minimize.
[2024-06-01 14:24:32] [INFO ] Deduced a trap composed of 41 places in 562 ms of which 6 ms to minimize.
[2024-06-01 14:24:32] [INFO ] Deduced a trap composed of 40 places in 586 ms of which 7 ms to minimize.
[2024-06-01 14:24:33] [INFO ] Deduced a trap composed of 34 places in 625 ms of which 7 ms to minimize.
[2024-06-01 14:24:34] [INFO ] Deduced a trap composed of 41 places in 603 ms of which 7 ms to minimize.
[2024-06-01 14:24:35] [INFO ] Deduced a trap composed of 53 places in 610 ms of which 7 ms to minimize.
[2024-06-01 14:24:35] [INFO ] Deduced a trap composed of 53 places in 624 ms of which 7 ms to minimize.
[2024-06-01 14:24:36] [INFO ] Deduced a trap composed of 62 places in 602 ms of which 7 ms to minimize.
[2024-06-01 14:24:37] [INFO ] Deduced a trap composed of 62 places in 575 ms of which 7 ms to minimize.
[2024-06-01 14:24:37] [INFO ] Deduced a trap composed of 62 places in 594 ms of which 7 ms to minimize.
[2024-06-01 14:24:38] [INFO ] Deduced a trap composed of 86 places in 601 ms of which 7 ms to minimize.
[2024-06-01 14:24:39] [INFO ] Deduced a trap composed of 66 places in 587 ms of which 7 ms to minimize.
[2024-06-01 14:24:39] [INFO ] Deduced a trap composed of 62 places in 608 ms of which 7 ms to minimize.
[2024-06-01 14:24:40] [INFO ] Deduced a trap composed of 40 places in 560 ms of which 7 ms to minimize.
[2024-06-01 14:24:41] [INFO ] Deduced a trap composed of 58 places in 564 ms of which 6 ms to minimize.
[2024-06-01 14:24:41] [INFO ] Deduced a trap composed of 58 places in 517 ms of which 7 ms to minimize.
[2024-06-01 14:24:42] [INFO ] Deduced a trap composed of 68 places in 538 ms of which 6 ms to minimize.
[2024-06-01 14:24:42] [INFO ] Deduced a trap composed of 50 places in 525 ms of which 6 ms to minimize.
[2024-06-01 14:24:43] [INFO ] Deduced a trap composed of 49 places in 485 ms of which 6 ms to minimize.
[2024-06-01 14:24:43] [INFO ] Deduced a trap composed of 44 places in 512 ms of which 6 ms to minimize.
[2024-06-01 14:24:44] [INFO ] Deduced a trap composed of 67 places in 405 ms of which 6 ms to minimize.
[2024-06-01 14:24:44] [INFO ] Deduced a trap composed of 53 places in 473 ms of which 6 ms to minimize.
[2024-06-01 14:24:45] [INFO ] Deduced a trap composed of 53 places in 470 ms of which 6 ms to minimize.
[2024-06-01 14:24:46] [INFO ] Deduced a trap composed of 67 places in 423 ms of which 5 ms to minimize.
[2024-06-01 14:24:46] [INFO ] Trap strengthening (SAT) tested/added 42/41 trap constraints in 26199 ms
[2024-06-01 14:24:46] [INFO ] Deduced a trap composed of 31 places in 603 ms of which 7 ms to minimize.
[2024-06-01 14:24:47] [INFO ] Deduced a trap composed of 60 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:24:48] [INFO ] Deduced a trap composed of 51 places in 394 ms of which 5 ms to minimize.
[2024-06-01 14:24:48] [INFO ] Deduced a trap composed of 51 places in 388 ms of which 5 ms to minimize.
[2024-06-01 14:24:49] [INFO ] Deduced a trap composed of 51 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:24:49] [INFO ] Deduced a trap composed of 59 places in 367 ms of which 5 ms to minimize.
[2024-06-01 14:24:49] [INFO ] Deduced a trap composed of 68 places in 405 ms of which 5 ms to minimize.
[2024-06-01 14:24:51] [INFO ] Deduced a trap composed of 24 places in 386 ms of which 6 ms to minimize.
[2024-06-01 14:24:52] [INFO ] Deduced a trap composed of 17 places in 612 ms of which 7 ms to minimize.
[2024-06-01 14:24:52] [INFO ] Deduced a trap composed of 69 places in 598 ms of which 7 ms to minimize.
[2024-06-01 14:24:53] [INFO ] Deduced a trap composed of 13 places in 606 ms of which 7 ms to minimize.
[2024-06-01 14:24:53] [INFO ] Deduced a trap composed of 69 places in 439 ms of which 5 ms to minimize.
[2024-06-01 14:24:54] [INFO ] Deduced a trap composed of 60 places in 434 ms of which 5 ms to minimize.
[2024-06-01 14:24:54] [INFO ] Deduced a trap composed of 69 places in 443 ms of which 6 ms to minimize.
[2024-06-01 14:24:55] [INFO ] Deduced a trap composed of 70 places in 473 ms of which 5 ms to minimize.
[2024-06-01 14:24:56] [INFO ] Deduced a trap composed of 69 places in 447 ms of which 5 ms to minimize.
[2024-06-01 14:24:56] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 9867 ms
[2024-06-01 14:24:57] [INFO ] Deduced a trap composed of 69 places in 538 ms of which 7 ms to minimize.
[2024-06-01 14:24:57] [INFO ] Deduced a trap composed of 60 places in 434 ms of which 5 ms to minimize.
[2024-06-01 14:24:58] [INFO ] Deduced a trap composed of 50 places in 447 ms of which 5 ms to minimize.
[2024-06-01 14:24:58] [INFO ] Deduced a trap composed of 59 places in 424 ms of which 5 ms to minimize.
[2024-06-01 14:24:59] [INFO ] Deduced a trap composed of 59 places in 423 ms of which 5 ms to minimize.
[2024-06-01 14:24:59] [INFO ] Deduced a trap composed of 50 places in 452 ms of which 5 ms to minimize.
[2024-06-01 14:25:00] [INFO ] Deduced a trap composed of 50 places in 414 ms of which 5 ms to minimize.
[2024-06-01 14:25:00] [INFO ] Deduced a trap composed of 60 places in 326 ms of which 4 ms to minimize.
[2024-06-01 14:25:00] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 4118 ms
[2024-06-01 14:25:01] [INFO ] Deduced a trap composed of 25 places in 555 ms of which 7 ms to minimize.
[2024-06-01 14:25:02] [INFO ] Deduced a trap composed of 43 places in 501 ms of which 6 ms to minimize.
[2024-06-01 14:25:02] [INFO ] Deduced a trap composed of 52 places in 466 ms of which 6 ms to minimize.
[2024-06-01 14:25:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1832 ms
[2024-06-01 14:25:03] [INFO ] Deduced a trap composed of 52 places in 442 ms of which 6 ms to minimize.
[2024-06-01 14:25:04] [INFO ] Deduced a trap composed of 42 places in 438 ms of which 6 ms to minimize.
[2024-06-01 14:25:04] [INFO ] Deduced a trap composed of 44 places in 480 ms of which 6 ms to minimize.
[2024-06-01 14:25:05] [INFO ] Deduced a trap composed of 44 places in 486 ms of which 6 ms to minimize.
[2024-06-01 14:25:05] [INFO ] Deduced a trap composed of 43 places in 478 ms of which 6 ms to minimize.
[2024-06-01 14:25:06] [INFO ] Deduced a trap composed of 44 places in 479 ms of which 6 ms to minimize.
[2024-06-01 14:25:07] [INFO ] Deduced a trap composed of 44 places in 538 ms of which 6 ms to minimize.
[2024-06-01 14:25:08] [INFO ] Deduced a trap composed of 34 places in 623 ms of which 7 ms to minimize.
[2024-06-01 14:25:09] [INFO ] Deduced a trap composed of 38 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:25:10] [INFO ] Deduced a trap composed of 61 places in 433 ms of which 6 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 60 places in 390 ms of which 5 ms to minimize.
[2024-06-01 14:25:11] [INFO ] Deduced a trap composed of 60 places in 412 ms of which 6 ms to minimize.
[2024-06-01 14:25:12] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 9144 ms
[2024-06-01 14:25:13] [INFO ] Deduced a trap composed of 47 places in 491 ms of which 7 ms to minimize.
[2024-06-01 14:25:14] [INFO ] Deduced a trap composed of 29 places in 587 ms of which 6 ms to minimize.
[2024-06-01 14:25:14] [INFO ] Deduced a trap composed of 75 places in 556 ms of which 7 ms to minimize.
[2024-06-01 14:25:15] [INFO ] Deduced a trap composed of 29 places in 567 ms of which 7 ms to minimize.
[2024-06-01 14:25:16] [INFO ] Deduced a trap composed of 29 places in 586 ms of which 7 ms to minimize.
[2024-06-01 14:25:16] [INFO ] Deduced a trap composed of 29 places in 593 ms of which 7 ms to minimize.
[2024-06-01 14:25:17] [INFO ] Deduced a trap composed of 29 places in 511 ms of which 7 ms to minimize.
[2024-06-01 14:25:18] [INFO ] Deduced a trap composed of 47 places in 583 ms of which 7 ms to minimize.
[2024-06-01 14:25:18] [INFO ] Deduced a trap composed of 70 places in 556 ms of which 7 ms to minimize.
[2024-06-01 14:25:19] [INFO ] Deduced a trap composed of 56 places in 549 ms of which 7 ms to minimize.
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 56 places in 606 ms of which 7 ms to minimize.
[2024-06-01 14:25:20] [INFO ] Deduced a trap composed of 56 places in 577 ms of which 7 ms to minimize.
[2024-06-01 14:25:21] [INFO ] Deduced a trap composed of 56 places in 582 ms of which 7 ms to minimize.
[2024-06-01 14:25:22] [INFO ] Deduced a trap composed of 56 places in 556 ms of which 7 ms to minimize.
[2024-06-01 14:25:22] [INFO ] Deduced a trap composed of 56 places in 495 ms of which 7 ms to minimize.
[2024-06-01 14:25:23] [INFO ] Deduced a trap composed of 56 places in 572 ms of which 7 ms to minimize.
[2024-06-01 14:25:23] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 10247 ms
[2024-06-01 14:25:23] [INFO ] Deduced a trap composed of 38 places in 523 ms of which 6 ms to minimize.
[2024-06-01 14:25:24] [INFO ] Deduced a trap composed of 52 places in 398 ms of which 6 ms to minimize.
[2024-06-01 14:25:24] [INFO ] Deduced a trap composed of 59 places in 439 ms of which 6 ms to minimize.
[2024-06-01 14:25:25] [INFO ] Deduced a trap composed of 82 places in 435 ms of which 6 ms to minimize.
[2024-06-01 14:25:26] [INFO ] Deduced a trap composed of 60 places in 440 ms of which 5 ms to minimize.
[2024-06-01 14:25:26] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 2711 ms
[2024-06-01 14:25:26] [INFO ] Deduced a trap composed of 59 places in 407 ms of which 5 ms to minimize.
[2024-06-01 14:25:27] [INFO ] Deduced a trap composed of 90 places in 428 ms of which 6 ms to minimize.
[2024-06-01 14:25:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1060 ms
[2024-06-01 14:25:28] [INFO ] Deduced a trap composed of 44 places in 603 ms of which 7 ms to minimize.
[2024-06-01 14:25:28] [INFO ] Deduced a trap composed of 73 places in 593 ms of which 7 ms to minimize.
[2024-06-01 14:25:29] [INFO ] Deduced a trap composed of 22 places in 599 ms of which 7 ms to minimize.
[2024-06-01 14:25:30] [INFO ] Deduced a trap composed of 22 places in 598 ms of which 7 ms to minimize.
[2024-06-01 14:25:30] [INFO ] Deduced a trap composed of 51 places in 440 ms of which 5 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Deduced a trap composed of 50 places in 471 ms of which 6 ms to minimize.
[2024-06-01 14:25:31] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 3839 ms
[2024-06-01 14:25:32] [INFO ] Deduced a trap composed of 20 places in 575 ms of which 8 ms to minimize.
[2024-06-01 14:25:32] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 729 ms
[2024-06-01 14:25:33] [INFO ] Deduced a trap composed of 20 places in 569 ms of which 7 ms to minimize.
[2024-06-01 14:25:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 720 ms
[2024-06-01 14:25:34] [INFO ] Deduced a trap composed of 20 places in 663 ms of which 8 ms to minimize.
[2024-06-01 14:25:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 821 ms
[2024-06-01 14:25:36] [INFO ] Deduced a trap composed of 19 places in 702 ms of which 8 ms to minimize.
[2024-06-01 14:25:36] [INFO ] Deduced a trap composed of 30 places in 628 ms of which 8 ms to minimize.
[2024-06-01 14:25:36] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1558 ms
[2024-06-01 14:25:37] [INFO ] Deduced a trap composed of 78 places in 576 ms of which 7 ms to minimize.
[2024-06-01 14:25:38] [INFO ] Deduced a trap composed of 66 places in 592 ms of which 7 ms to minimize.
[2024-06-01 14:25:38] [INFO ] Deduced a trap composed of 24 places in 622 ms of which 8 ms to minimize.
[2024-06-01 14:25:39] [INFO ] Deduced a trap composed of 95 places in 473 ms of which 7 ms to minimize.
[2024-06-01 14:25:40] [INFO ] Deduced a trap composed of 100 places in 561 ms of which 6 ms to minimize.
[2024-06-01 14:25:40] [INFO ] Deduced a trap composed of 67 places in 580 ms of which 6 ms to minimize.
[2024-06-01 14:25:41] [INFO ] Deduced a trap composed of 24 places in 572 ms of which 6 ms to minimize.
[2024-06-01 14:25:42] [INFO ] Deduced a trap composed of 33 places in 616 ms of which 7 ms to minimize.
[2024-06-01 14:25:43] [INFO ] Deduced a trap composed of 37 places in 600 ms of which 7 ms to minimize.
[2024-06-01 14:25:44] [INFO ] Deduced a trap composed of 49 places in 491 ms of which 6 ms to minimize.
[2024-06-01 14:25:44] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 7285 ms
[2024-06-01 14:25:44] [INFO ] Deduced a trap composed of 21 places in 586 ms of which 7 ms to minimize.
[2024-06-01 14:25:45] [INFO ] Deduced a trap composed of 30 places in 507 ms of which 7 ms to minimize.
[2024-06-01 14:25:46] [INFO ] Deduced a trap composed of 50 places in 552 ms of which 6 ms to minimize.
[2024-06-01 14:25:46] [INFO ] Deduced a trap composed of 30 places in 549 ms of which 7 ms to minimize.
[2024-06-01 14:25:47] [INFO ] Deduced a trap composed of 30 places in 511 ms of which 7 ms to minimize.
[2024-06-01 14:25:47] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 3170 ms
[2024-06-01 14:25:48] [INFO ] Deduced a trap composed of 61 places in 541 ms of which 6 ms to minimize.
[2024-06-01 14:25:49] [INFO ] Deduced a trap composed of 38 places in 556 ms of which 7 ms to minimize.
[2024-06-01 14:25:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1544 ms
[2024-06-01 14:25:50] [INFO ] Deduced a trap composed of 25 places in 592 ms of which 7 ms to minimize.
[2024-06-01 14:25:51] [INFO ] Deduced a trap composed of 44 places in 553 ms of which 6 ms to minimize.
[2024-06-01 14:25:51] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1372 ms
[2024-06-01 14:25:52] [INFO ] Deduced a trap composed of 11 places in 634 ms of which 7 ms to minimize.
[2024-06-01 14:25:52] [INFO ] Deduced a trap composed of 13 places in 613 ms of which 8 ms to minimize.
[2024-06-01 14:25:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1480 ms
[2024-06-01 14:25:53] [INFO ] Deduced a trap composed of 43 places in 583 ms of which 7 ms to minimize.
[2024-06-01 14:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 740 ms
[2024-06-01 14:25:55] [INFO ] Deduced a trap composed of 24 places in 602 ms of which 6 ms to minimize.
[2024-06-01 14:25:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 752 ms
[2024-06-01 14:25:56] [INFO ] Deduced a trap composed of 31 places in 565 ms of which 6 ms to minimize.
[2024-06-01 14:25:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 719 ms
[2024-06-01 14:25:56] [INFO ] Deduced a trap composed of 40 places in 509 ms of which 6 ms to minimize.
[2024-06-01 14:25:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 663 ms
[2024-06-01 14:25:58] [INFO ] Deduced a trap composed of 13 places in 694 ms of which 7 ms to minimize.
[2024-06-01 14:25:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 847 ms
[2024-06-01 14:25:59] [INFO ] Deduced a trap composed of 20 places in 712 ms of which 8 ms to minimize.
[2024-06-01 14:26:00] [INFO ] Deduced a trap composed of 46 places in 652 ms of which 7 ms to minimize.
[2024-06-01 14:26:01] [INFO ] Deduced a trap composed of 38 places in 644 ms of which 7 ms to minimize.
[2024-06-01 14:26:01] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2317 ms
[2024-06-01 14:26:02] [INFO ] Deduced a trap composed of 23 places in 748 ms of which 7 ms to minimize.
[2024-06-01 14:26:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 913 ms
[2024-06-01 14:26:03] [INFO ] Deduced a trap composed of 32 places in 749 ms of which 8 ms to minimize.
[2024-06-01 14:26:03] [INFO ] Deduced a trap composed of 74 places in 667 ms of which 7 ms to minimize.
[2024-06-01 14:26:03] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1646 ms
[2024-06-01 14:26:04] [INFO ] Deduced a trap composed of 26 places in 632 ms of which 8 ms to minimize.
[2024-06-01 14:26:05] [INFO ] Deduced a trap composed of 26 places in 639 ms of which 7 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 26 places in 640 ms of which 7 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 26 places in 618 ms of which 7 ms to minimize.
[2024-06-01 14:26:07] [INFO ] Deduced a trap composed of 26 places in 600 ms of which 7 ms to minimize.
[2024-06-01 14:26:08] [INFO ] Deduced a trap composed of 26 places in 580 ms of which 7 ms to minimize.
SMT process timed out, exceeded limit of 100
[2024-06-01 14:26:08] [INFO ] After 198811ms SMT Verify possible using After timeout in natural domain returned unsat :0 sat :264
[2024-06-01 14:26:08] [INFO ] After 200315ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :264
RANDOM walk for 3128528 steps (8 resets) in 120004 ms. (26 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 46 ms. (85 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 44 ms. (88 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 50 ms. (78 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 51 ms. (77 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 41 ms. (95 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 47 ms. (83 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 38 ms. (102 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 42 ms. (93 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 39 ms. (100 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 43 ms. (91 steps per ms) remains 595/595 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 595/595 properties
Probabilistic random walk after 1000001 steps, saw 129370 distinct states, run finished after 15485 ms. (steps per millisecond=64 ) properties seen :0
[2024-06-01 14:26:54] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:26:54] [INFO ] Invariant cache hit.
[2024-06-01 14:26:54] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (OVERLAPS) 173/583 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 173/605 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 60 places in 507 ms of which 5 ms to minimize.
[2024-06-01 14:27:17] [INFO ] Deduced a trap composed of 13 places in 720 ms of which 8 ms to minimize.
[2024-06-01 14:27:18] [INFO ] Deduced a trap composed of 53 places in 819 ms of which 8 ms to minimize.
[2024-06-01 14:27:19] [INFO ] Deduced a trap composed of 22 places in 728 ms of which 8 ms to minimize.
[2024-06-01 14:27:20] [INFO ] Deduced a trap composed of 40 places in 668 ms of which 7 ms to minimize.
[2024-06-01 14:27:20] [INFO ] Deduced a trap composed of 39 places in 691 ms of which 7 ms to minimize.
[2024-06-01 14:27:21] [INFO ] Deduced a trap composed of 11 places in 689 ms of which 8 ms to minimize.
[2024-06-01 14:27:22] [INFO ] Deduced a trap composed of 51 places in 737 ms of which 9 ms to minimize.
[2024-06-01 14:27:23] [INFO ] Deduced a trap composed of 42 places in 767 ms of which 8 ms to minimize.
[2024-06-01 14:27:23] [INFO ] Deduced a trap composed of 31 places in 661 ms of which 8 ms to minimize.
[2024-06-01 14:27:24] [INFO ] Deduced a trap composed of 15 places in 744 ms of which 8 ms to minimize.
[2024-06-01 14:27:25] [INFO ] Deduced a trap composed of 115 places in 515 ms of which 4 ms to minimize.
[2024-06-01 14:27:25] [INFO ] Deduced a trap composed of 66 places in 407 ms of which 5 ms to minimize.
[2024-06-01 14:27:25] [INFO ] Deduced a trap composed of 82 places in 516 ms of which 7 ms to minimize.
[2024-06-01 14:27:26] [INFO ] Deduced a trap composed of 40 places in 692 ms of which 7 ms to minimize.
[2024-06-01 14:27:27] [INFO ] Deduced a trap composed of 14 places in 722 ms of which 7 ms to minimize.
[2024-06-01 14:27:28] [INFO ] Deduced a trap composed of 12 places in 710 ms of which 8 ms to minimize.
[2024-06-01 14:27:28] [INFO ] Deduced a trap composed of 16 places in 701 ms of which 8 ms to minimize.
[2024-06-01 14:27:29] [INFO ] Deduced a trap composed of 21 places in 773 ms of which 8 ms to minimize.
[2024-06-01 14:27:30] [INFO ] Deduced a trap composed of 30 places in 459 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 20/625 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:27:31] [INFO ] Deduced a trap composed of 14 places in 507 ms of which 8 ms to minimize.
[2024-06-01 14:27:32] [INFO ] Deduced a trap composed of 20 places in 675 ms of which 7 ms to minimize.
[2024-06-01 14:27:32] [INFO ] Deduced a trap composed of 13 places in 674 ms of which 7 ms to minimize.
[2024-06-01 14:27:33] [INFO ] Deduced a trap composed of 11 places in 629 ms of which 6 ms to minimize.
[2024-06-01 14:27:33] [INFO ] Deduced a trap composed of 15 places in 539 ms of which 5 ms to minimize.
[2024-06-01 14:27:34] [INFO ] Deduced a trap composed of 71 places in 495 ms of which 6 ms to minimize.
[2024-06-01 14:27:35] [INFO ] Deduced a trap composed of 15 places in 546 ms of which 6 ms to minimize.
[2024-06-01 14:27:35] [INFO ] Deduced a trap composed of 35 places in 447 ms of which 5 ms to minimize.
[2024-06-01 14:27:36] [INFO ] Deduced a trap composed of 14 places in 506 ms of which 6 ms to minimize.
[2024-06-01 14:27:36] [INFO ] Deduced a trap composed of 11 places in 466 ms of which 4 ms to minimize.
[2024-06-01 14:27:36] [INFO ] Deduced a trap composed of 77 places in 404 ms of which 4 ms to minimize.
[2024-06-01 14:27:37] [INFO ] Deduced a trap composed of 71 places in 399 ms of which 5 ms to minimize.
[2024-06-01 14:27:37] [INFO ] Deduced a trap composed of 11 places in 443 ms of which 4 ms to minimize.
[2024-06-01 14:27:38] [INFO ] Deduced a trap composed of 15 places in 409 ms of which 4 ms to minimize.
[2024-06-01 14:27:38] [INFO ] Deduced a trap composed of 16 places in 712 ms of which 7 ms to minimize.
[2024-06-01 14:27:39] [INFO ] Deduced a trap composed of 74 places in 678 ms of which 8 ms to minimize.
[2024-06-01 14:27:40] [INFO ] Deduced a trap composed of 11 places in 732 ms of which 8 ms to minimize.
[2024-06-01 14:27:41] [INFO ] Deduced a trap composed of 15 places in 684 ms of which 7 ms to minimize.
[2024-06-01 14:27:41] [INFO ] Deduced a trap composed of 71 places in 683 ms of which 7 ms to minimize.
[2024-06-01 14:27:42] [INFO ] Deduced a trap composed of 11 places in 753 ms of which 8 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/645 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:27:54] [INFO ] Deduced a trap composed of 35 places in 701 ms of which 8 ms to minimize.
[2024-06-01 14:27:55] [INFO ] Deduced a trap composed of 71 places in 728 ms of which 8 ms to minimize.
[2024-06-01 14:27:56] [INFO ] Deduced a trap composed of 78 places in 728 ms of which 8 ms to minimize.
[2024-06-01 14:27:57] [INFO ] Deduced a trap composed of 23 places in 698 ms of which 8 ms to minimize.
[2024-06-01 14:27:57] [INFO ] Deduced a trap composed of 11 places in 605 ms of which 8 ms to minimize.
[2024-06-01 14:27:58] [INFO ] Deduced a trap composed of 15 places in 642 ms of which 7 ms to minimize.
[2024-06-01 14:27:59] [INFO ] Deduced a trap composed of 23 places in 651 ms of which 7 ms to minimize.
[2024-06-01 14:27:59] [INFO ] Deduced a trap composed of 46 places in 696 ms of which 7 ms to minimize.
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 34 places in 643 ms of which 7 ms to minimize.
[2024-06-01 14:28:01] [INFO ] Deduced a trap composed of 22 places in 639 ms of which 8 ms to minimize.
[2024-06-01 14:28:01] [INFO ] Deduced a trap composed of 23 places in 530 ms of which 7 ms to minimize.
[2024-06-01 14:28:02] [INFO ] Deduced a trap composed of 23 places in 596 ms of which 6 ms to minimize.
[2024-06-01 14:28:02] [INFO ] Deduced a trap composed of 45 places in 576 ms of which 6 ms to minimize.
[2024-06-01 14:28:03] [INFO ] Deduced a trap composed of 40 places in 535 ms of which 6 ms to minimize.
[2024-06-01 14:28:03] [INFO ] Deduced a trap composed of 51 places in 499 ms of which 6 ms to minimize.
[2024-06-01 14:28:04] [INFO ] Deduced a trap composed of 31 places in 476 ms of which 6 ms to minimize.
[2024-06-01 14:28:04] [INFO ] Deduced a trap composed of 33 places in 551 ms of which 6 ms to minimize.
[2024-06-01 14:28:05] [INFO ] Deduced a trap composed of 95 places in 554 ms of which 8 ms to minimize.
[2024-06-01 14:28:06] [INFO ] Deduced a trap composed of 22 places in 704 ms of which 8 ms to minimize.
[2024-06-01 14:28:06] [INFO ] Deduced a trap composed of 75 places in 690 ms of which 7 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/665 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:28:08] [INFO ] Deduced a trap composed of 34 places in 429 ms of which 8 ms to minimize.
[2024-06-01 14:28:09] [INFO ] Deduced a trap composed of 16 places in 675 ms of which 8 ms to minimize.
[2024-06-01 14:28:09] [INFO ] Deduced a trap composed of 50 places in 674 ms of which 7 ms to minimize.
[2024-06-01 14:28:10] [INFO ] Deduced a trap composed of 32 places in 685 ms of which 8 ms to minimize.
[2024-06-01 14:28:11] [INFO ] Deduced a trap composed of 33 places in 686 ms of which 8 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 65 places in 660 ms of which 8 ms to minimize.
[2024-06-01 14:28:12] [INFO ] Deduced a trap composed of 35 places in 679 ms of which 7 ms to minimize.
[2024-06-01 14:28:13] [INFO ] Deduced a trap composed of 34 places in 696 ms of which 8 ms to minimize.
[2024-06-01 14:28:14] [INFO ] Deduced a trap composed of 20 places in 650 ms of which 7 ms to minimize.
[2024-06-01 14:28:14] [INFO ] Deduced a trap composed of 23 places in 652 ms of which 9 ms to minimize.
[2024-06-01 14:28:15] [INFO ] Deduced a trap composed of 38 places in 598 ms of which 8 ms to minimize.
[2024-06-01 14:28:16] [INFO ] Deduced a trap composed of 35 places in 638 ms of which 7 ms to minimize.
[2024-06-01 14:28:16] [INFO ] Deduced a trap composed of 55 places in 665 ms of which 7 ms to minimize.
[2024-06-01 14:28:17] [INFO ] Deduced a trap composed of 22 places in 679 ms of which 8 ms to minimize.
[2024-06-01 14:28:18] [INFO ] Deduced a trap composed of 46 places in 675 ms of which 8 ms to minimize.
[2024-06-01 14:28:18] [INFO ] Deduced a trap composed of 25 places in 669 ms of which 7 ms to minimize.
[2024-06-01 14:28:19] [INFO ] Deduced a trap composed of 25 places in 688 ms of which 7 ms to minimize.
[2024-06-01 14:28:20] [INFO ] Deduced a trap composed of 25 places in 693 ms of which 7 ms to minimize.
[2024-06-01 14:28:20] [INFO ] Deduced a trap composed of 13 places in 615 ms of which 7 ms to minimize.
[2024-06-01 14:28:21] [INFO ] Deduced a trap composed of 56 places in 547 ms of which 7 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/685 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:28:24] [INFO ] Deduced a trap composed of 73 places in 687 ms of which 8 ms to minimize.
[2024-06-01 14:28:24] [INFO ] Deduced a trap composed of 67 places in 700 ms of which 8 ms to minimize.
[2024-06-01 14:28:25] [INFO ] Deduced a trap composed of 38 places in 662 ms of which 7 ms to minimize.
[2024-06-01 14:28:26] [INFO ] Deduced a trap composed of 20 places in 709 ms of which 8 ms to minimize.
[2024-06-01 14:28:26] [INFO ] Deduced a trap composed of 29 places in 656 ms of which 7 ms to minimize.
[2024-06-01 14:28:27] [INFO ] Deduced a trap composed of 33 places in 642 ms of which 7 ms to minimize.
[2024-06-01 14:28:28] [INFO ] Deduced a trap composed of 32 places in 635 ms of which 7 ms to minimize.
[2024-06-01 14:28:28] [INFO ] Deduced a trap composed of 41 places in 649 ms of which 7 ms to minimize.
[2024-06-01 14:28:29] [INFO ] Deduced a trap composed of 46 places in 638 ms of which 7 ms to minimize.
[2024-06-01 14:28:30] [INFO ] Deduced a trap composed of 29 places in 635 ms of which 7 ms to minimize.
[2024-06-01 14:28:30] [INFO ] Deduced a trap composed of 47 places in 571 ms of which 6 ms to minimize.
[2024-06-01 14:28:31] [INFO ] Deduced a trap composed of 70 places in 547 ms of which 7 ms to minimize.
[2024-06-01 14:28:31] [INFO ] Deduced a trap composed of 70 places in 556 ms of which 6 ms to minimize.
[2024-06-01 14:28:32] [INFO ] Deduced a trap composed of 41 places in 558 ms of which 7 ms to minimize.
[2024-06-01 14:28:33] [INFO ] Deduced a trap composed of 42 places in 592 ms of which 7 ms to minimize.
[2024-06-01 14:28:33] [INFO ] Deduced a trap composed of 38 places in 593 ms of which 7 ms to minimize.
[2024-06-01 14:28:34] [INFO ] Deduced a trap composed of 47 places in 562 ms of which 6 ms to minimize.
[2024-06-01 14:28:34] [INFO ] Deduced a trap composed of 43 places in 541 ms of which 7 ms to minimize.
[2024-06-01 14:28:35] [INFO ] Deduced a trap composed of 50 places in 490 ms of which 6 ms to minimize.
[2024-06-01 14:28:36] [INFO ] Deduced a trap composed of 62 places in 578 ms of which 7 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:28:48] [INFO ] Deduced a trap composed of 16 places in 390 ms of which 5 ms to minimize.
[2024-06-01 14:28:49] [INFO ] Deduced a trap composed of 50 places in 515 ms of which 6 ms to minimize.
[2024-06-01 14:28:50] [INFO ] Deduced a trap composed of 81 places in 700 ms of which 8 ms to minimize.
[2024-06-01 14:28:51] [INFO ] Deduced a trap composed of 14 places in 740 ms of which 8 ms to minimize.
[2024-06-01 14:28:51] [INFO ] Deduced a trap composed of 42 places in 482 ms of which 6 ms to minimize.
[2024-06-01 14:28:52] [INFO ] Deduced a trap composed of 48 places in 479 ms of which 6 ms to minimize.
[2024-06-01 14:28:52] [INFO ] Deduced a trap composed of 39 places in 522 ms of which 7 ms to minimize.
[2024-06-01 14:28:53] [INFO ] Deduced a trap composed of 48 places in 552 ms of which 7 ms to minimize.
[2024-06-01 14:28:54] [INFO ] Deduced a trap composed of 47 places in 513 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1944 variables, and 714 constraints, problems are : Problem set: 0 solved, 595 unsolved in 120025 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 595/595 constraints, Known Traps: 109/109 constraints]
Escalating to Integer solving :Problem set: 0 solved, 595 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 410/410 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 6/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/410 variables, 0/416 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 3 (OVERLAPS) 173/583 variables, 16/432 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/583 variables, 173/605 constraints. Problems are: Problem set: 0 solved, 595 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 109/714 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:29:06] [INFO ] Deduced a trap composed of 57 places in 621 ms of which 7 ms to minimize.
[2024-06-01 14:29:07] [INFO ] Deduced a trap composed of 52 places in 611 ms of which 6 ms to minimize.
[2024-06-01 14:29:07] [INFO ] Deduced a trap composed of 29 places in 624 ms of which 7 ms to minimize.
[2024-06-01 14:29:08] [INFO ] Deduced a trap composed of 47 places in 451 ms of which 6 ms to minimize.
[2024-06-01 14:29:09] [INFO ] Deduced a trap composed of 38 places in 590 ms of which 6 ms to minimize.
[2024-06-01 14:29:09] [INFO ] Deduced a trap composed of 58 places in 590 ms of which 7 ms to minimize.
[2024-06-01 14:29:10] [INFO ] Deduced a trap composed of 42 places in 607 ms of which 7 ms to minimize.
[2024-06-01 14:29:10] [INFO ] Deduced a trap composed of 61 places in 540 ms of which 7 ms to minimize.
[2024-06-01 14:29:11] [INFO ] Deduced a trap composed of 48 places in 543 ms of which 6 ms to minimize.
[2024-06-01 14:29:12] [INFO ] Deduced a trap composed of 43 places in 545 ms of which 7 ms to minimize.
[2024-06-01 14:29:12] [INFO ] Deduced a trap composed of 40 places in 452 ms of which 6 ms to minimize.
[2024-06-01 14:29:13] [INFO ] Deduced a trap composed of 31 places in 602 ms of which 7 ms to minimize.
[2024-06-01 14:29:13] [INFO ] Deduced a trap composed of 32 places in 606 ms of which 7 ms to minimize.
[2024-06-01 14:29:14] [INFO ] Deduced a trap composed of 39 places in 584 ms of which 6 ms to minimize.
[2024-06-01 14:29:15] [INFO ] Deduced a trap composed of 60 places in 609 ms of which 6 ms to minimize.
[2024-06-01 14:29:15] [INFO ] Deduced a trap composed of 77 places in 534 ms of which 6 ms to minimize.
[2024-06-01 14:29:16] [INFO ] Deduced a trap composed of 66 places in 530 ms of which 7 ms to minimize.
[2024-06-01 14:29:16] [INFO ] Deduced a trap composed of 77 places in 581 ms of which 7 ms to minimize.
[2024-06-01 14:29:17] [INFO ] Deduced a trap composed of 39 places in 499 ms of which 7 ms to minimize.
[2024-06-01 14:29:18] [INFO ] Deduced a trap composed of 54 places in 554 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/583 variables, 20/734 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:29:20] [INFO ] Deduced a trap composed of 16 places in 665 ms of which 8 ms to minimize.
[2024-06-01 14:29:21] [INFO ] Deduced a trap composed of 16 places in 675 ms of which 7 ms to minimize.
[2024-06-01 14:29:22] [INFO ] Deduced a trap composed of 42 places in 510 ms of which 6 ms to minimize.
[2024-06-01 14:29:23] [INFO ] Deduced a trap composed of 41 places in 527 ms of which 6 ms to minimize.
[2024-06-01 14:29:23] [INFO ] Deduced a trap composed of 25 places in 599 ms of which 8 ms to minimize.
[2024-06-01 14:29:24] [INFO ] Deduced a trap composed of 61 places in 534 ms of which 6 ms to minimize.
[2024-06-01 14:29:25] [INFO ] Deduced a trap composed of 86 places in 523 ms of which 6 ms to minimize.
[2024-06-01 14:29:25] [INFO ] Deduced a trap composed of 51 places in 535 ms of which 6 ms to minimize.
[2024-06-01 14:29:26] [INFO ] Deduced a trap composed of 49 places in 588 ms of which 7 ms to minimize.
[2024-06-01 14:29:27] [INFO ] Deduced a trap composed of 27 places in 637 ms of which 8 ms to minimize.
[2024-06-01 14:29:27] [INFO ] Deduced a trap composed of 29 places in 607 ms of which 7 ms to minimize.
[2024-06-01 14:29:28] [INFO ] Deduced a trap composed of 53 places in 394 ms of which 5 ms to minimize.
[2024-06-01 14:29:28] [INFO ] Deduced a trap composed of 71 places in 391 ms of which 4 ms to minimize.
[2024-06-01 14:29:29] [INFO ] Deduced a trap composed of 71 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:29:29] [INFO ] Deduced a trap composed of 71 places in 388 ms of which 5 ms to minimize.
[2024-06-01 14:29:30] [INFO ] Deduced a trap composed of 71 places in 412 ms of which 5 ms to minimize.
[2024-06-01 14:29:30] [INFO ] Deduced a trap composed of 71 places in 405 ms of which 5 ms to minimize.
[2024-06-01 14:29:30] [INFO ] Deduced a trap composed of 71 places in 401 ms of which 5 ms to minimize.
[2024-06-01 14:29:31] [INFO ] Deduced a trap composed of 52 places in 329 ms of which 5 ms to minimize.
[2024-06-01 14:29:31] [INFO ] Deduced a trap composed of 52 places in 347 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/583 variables, 20/754 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:29:35] [INFO ] Deduced a trap composed of 62 places in 458 ms of which 8 ms to minimize.
[2024-06-01 14:29:36] [INFO ] Deduced a trap composed of 12 places in 653 ms of which 7 ms to minimize.
[2024-06-01 14:29:37] [INFO ] Deduced a trap composed of 51 places in 636 ms of which 7 ms to minimize.
[2024-06-01 14:29:37] [INFO ] Deduced a trap composed of 12 places in 647 ms of which 8 ms to minimize.
[2024-06-01 14:29:38] [INFO ] Deduced a trap composed of 45 places in 639 ms of which 8 ms to minimize.
[2024-06-01 14:29:39] [INFO ] Deduced a trap composed of 68 places in 671 ms of which 7 ms to minimize.
[2024-06-01 14:29:40] [INFO ] Deduced a trap composed of 32 places in 624 ms of which 8 ms to minimize.
[2024-06-01 14:29:40] [INFO ] Deduced a trap composed of 38 places in 626 ms of which 7 ms to minimize.
[2024-06-01 14:29:41] [INFO ] Deduced a trap composed of 22 places in 632 ms of which 7 ms to minimize.
[2024-06-01 14:29:41] [INFO ] Deduced a trap composed of 39 places in 624 ms of which 7 ms to minimize.
[2024-06-01 14:29:42] [INFO ] Deduced a trap composed of 107 places in 636 ms of which 7 ms to minimize.
[2024-06-01 14:29:43] [INFO ] Deduced a trap composed of 22 places in 651 ms of which 8 ms to minimize.
[2024-06-01 14:29:43] [INFO ] Deduced a trap composed of 22 places in 659 ms of which 7 ms to minimize.
[2024-06-01 14:29:44] [INFO ] Deduced a trap composed of 81 places in 645 ms of which 7 ms to minimize.
[2024-06-01 14:29:45] [INFO ] Deduced a trap composed of 42 places in 652 ms of which 7 ms to minimize.
[2024-06-01 14:29:45] [INFO ] Deduced a trap composed of 12 places in 637 ms of which 7 ms to minimize.
[2024-06-01 14:29:47] [INFO ] Deduced a trap composed of 59 places in 565 ms of which 7 ms to minimize.
[2024-06-01 14:29:47] [INFO ] Deduced a trap composed of 41 places in 540 ms of which 6 ms to minimize.
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 80 places in 531 ms of which 6 ms to minimize.
[2024-06-01 14:29:48] [INFO ] Deduced a trap composed of 48 places in 550 ms of which 6 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/583 variables, 20/774 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:29:53] [INFO ] Deduced a trap composed of 33 places in 342 ms of which 7 ms to minimize.
[2024-06-01 14:29:53] [INFO ] Deduced a trap composed of 33 places in 543 ms of which 7 ms to minimize.
[2024-06-01 14:29:54] [INFO ] Deduced a trap composed of 58 places in 535 ms of which 6 ms to minimize.
[2024-06-01 14:29:55] [INFO ] Deduced a trap composed of 34 places in 594 ms of which 7 ms to minimize.
[2024-06-01 14:29:55] [INFO ] Deduced a trap composed of 67 places in 328 ms of which 4 ms to minimize.
[2024-06-01 14:29:56] [INFO ] Deduced a trap composed of 58 places in 340 ms of which 5 ms to minimize.
[2024-06-01 14:29:56] [INFO ] Deduced a trap composed of 46 places in 546 ms of which 7 ms to minimize.
[2024-06-01 14:29:57] [INFO ] Deduced a trap composed of 62 places in 482 ms of which 6 ms to minimize.
[2024-06-01 14:29:57] [INFO ] Deduced a trap composed of 48 places in 486 ms of which 6 ms to minimize.
[2024-06-01 14:29:58] [INFO ] Deduced a trap composed of 35 places in 544 ms of which 7 ms to minimize.
[2024-06-01 14:29:59] [INFO ] Deduced a trap composed of 30 places in 592 ms of which 7 ms to minimize.
[2024-06-01 14:29:59] [INFO ] Deduced a trap composed of 30 places in 577 ms of which 7 ms to minimize.
[2024-06-01 14:30:00] [INFO ] Deduced a trap composed of 70 places in 588 ms of which 7 ms to minimize.
[2024-06-01 14:30:01] [INFO ] Deduced a trap composed of 30 places in 581 ms of which 7 ms to minimize.
[2024-06-01 14:30:02] [INFO ] Deduced a trap composed of 35 places in 649 ms of which 7 ms to minimize.
[2024-06-01 14:30:02] [INFO ] Deduced a trap composed of 32 places in 583 ms of which 6 ms to minimize.
[2024-06-01 14:30:03] [INFO ] Deduced a trap composed of 29 places in 589 ms of which 7 ms to minimize.
[2024-06-01 14:30:03] [INFO ] Deduced a trap composed of 36 places in 603 ms of which 8 ms to minimize.
[2024-06-01 14:30:04] [INFO ] Deduced a trap composed of 53 places in 208 ms of which 3 ms to minimize.
[2024-06-01 14:30:04] [INFO ] Deduced a trap composed of 60 places in 324 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/583 variables, 20/794 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:30:09] [INFO ] Deduced a trap composed of 34 places in 553 ms of which 7 ms to minimize.
[2024-06-01 14:30:10] [INFO ] Deduced a trap composed of 20 places in 691 ms of which 8 ms to minimize.
[2024-06-01 14:30:11] [INFO ] Deduced a trap composed of 41 places in 550 ms of which 6 ms to minimize.
[2024-06-01 14:30:11] [INFO ] Deduced a trap composed of 39 places in 512 ms of which 6 ms to minimize.
[2024-06-01 14:30:12] [INFO ] Deduced a trap composed of 67 places in 586 ms of which 7 ms to minimize.
[2024-06-01 14:30:13] [INFO ] Deduced a trap composed of 56 places in 571 ms of which 7 ms to minimize.
[2024-06-01 14:30:13] [INFO ] Deduced a trap composed of 30 places in 580 ms of which 6 ms to minimize.
[2024-06-01 14:30:14] [INFO ] Deduced a trap composed of 30 places in 596 ms of which 7 ms to minimize.
[2024-06-01 14:30:15] [INFO ] Deduced a trap composed of 38 places in 599 ms of which 7 ms to minimize.
[2024-06-01 14:30:15] [INFO ] Deduced a trap composed of 53 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:30:15] [INFO ] Deduced a trap composed of 62 places in 297 ms of which 4 ms to minimize.
[2024-06-01 14:30:16] [INFO ] Deduced a trap composed of 53 places in 305 ms of which 4 ms to minimize.
[2024-06-01 14:30:16] [INFO ] Deduced a trap composed of 53 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:30:16] [INFO ] Deduced a trap composed of 69 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:30:17] [INFO ] Deduced a trap composed of 62 places in 300 ms of which 3 ms to minimize.
[2024-06-01 14:30:17] [INFO ] Deduced a trap composed of 62 places in 295 ms of which 4 ms to minimize.
[2024-06-01 14:30:17] [INFO ] Deduced a trap composed of 62 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 62 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 62 places in 306 ms of which 4 ms to minimize.
[2024-06-01 14:30:18] [INFO ] Deduced a trap composed of 102 places in 397 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/583 variables, 20/814 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:30:24] [INFO ] Deduced a trap composed of 17 places in 529 ms of which 7 ms to minimize.
[2024-06-01 14:30:25] [INFO ] Deduced a trap composed of 75 places in 501 ms of which 7 ms to minimize.
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 51 places in 536 ms of which 10 ms to minimize.
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 79 places in 549 ms of which 6 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 47 places in 535 ms of which 6 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 21 places in 508 ms of which 6 ms to minimize.
[2024-06-01 14:30:28] [INFO ] Deduced a trap composed of 54 places in 466 ms of which 7 ms to minimize.
[2024-06-01 14:30:29] [INFO ] Deduced a trap composed of 58 places in 551 ms of which 6 ms to minimize.
[2024-06-01 14:30:29] [INFO ] Deduced a trap composed of 23 places in 523 ms of which 7 ms to minimize.
[2024-06-01 14:30:30] [INFO ] Deduced a trap composed of 23 places in 507 ms of which 6 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 62 places in 316 ms of which 6 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 53 places in 243 ms of which 4 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 62 places in 315 ms of which 5 ms to minimize.
[2024-06-01 14:30:32] [INFO ] Deduced a trap composed of 48 places in 497 ms of which 6 ms to minimize.
[2024-06-01 14:30:33] [INFO ] Deduced a trap composed of 53 places in 480 ms of which 6 ms to minimize.
[2024-06-01 14:30:33] [INFO ] Deduced a trap composed of 43 places in 566 ms of which 6 ms to minimize.
[2024-06-01 14:30:34] [INFO ] Deduced a trap composed of 65 places in 531 ms of which 6 ms to minimize.
[2024-06-01 14:30:34] [INFO ] Deduced a trap composed of 38 places in 510 ms of which 7 ms to minimize.
[2024-06-01 14:30:35] [INFO ] Deduced a trap composed of 38 places in 595 ms of which 7 ms to minimize.
[2024-06-01 14:30:36] [INFO ] Deduced a trap composed of 53 places in 500 ms of which 6 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/583 variables, 20/834 constraints. Problems are: Problem set: 0 solved, 595 unsolved
[2024-06-01 14:30:49] [INFO ] Deduced a trap composed of 29 places in 660 ms of which 8 ms to minimize.
[2024-06-01 14:30:51] [INFO ] Deduced a trap composed of 51 places in 562 ms of which 6 ms to minimize.
[2024-06-01 14:30:51] [INFO ] Deduced a trap composed of 59 places in 531 ms of which 6 ms to minimize.
[2024-06-01 14:30:52] [INFO ] Deduced a trap composed of 59 places in 517 ms of which 7 ms to minimize.
[2024-06-01 14:30:52] [INFO ] Deduced a trap composed of 59 places in 502 ms of which 7 ms to minimize.
[2024-06-01 14:30:53] [INFO ] Deduced a trap composed of 22 places in 577 ms of which 7 ms to minimize.
[2024-06-01 14:30:54] [INFO ] Deduced a trap composed of 22 places in 620 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 583/1944 variables, and 841 constraints, problems are : Problem set: 0 solved, 595 unsolved in 120029 ms.
Refiners :[Domain max(s): 583/584 constraints, Positive P Invariants (semi-flows): 22/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 0/595 constraints, Known Traps: 236/236 constraints]
After SMT, in 240216ms problems are : Problem set: 0 solved, 595 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 410 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 41 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 36 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2024-06-01 14:30:54] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:30:54] [INFO ] Invariant cache hit.
[2024-06-01 14:30:54] [INFO ] Implicit Places using invariants in 367 ms returned []
[2024-06-01 14:30:54] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:30:54] [INFO ] Invariant cache hit.
[2024-06-01 14:30:55] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:30:57] [INFO ] Implicit Places using invariants and state equation in 2132 ms returned []
Implicit Place search using SMT with State Equation took 2501 ms to find 0 implicit places.
[2024-06-01 14:30:57] [INFO ] Redundant transitions in 161 ms returned []
Running 1688 sub problems to find dead transitions.
[2024-06-01 14:30:57] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:30:57] [INFO ] Invariant cache hit.
[2024-06-01 14:30:57] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2024-06-01 14:31:21] [INFO ] Deduced a trap composed of 78 places in 526 ms of which 8 ms to minimize.
[2024-06-01 14:31:22] [INFO ] Deduced a trap composed of 31 places in 618 ms of which 5 ms to minimize.
[2024-06-01 14:31:22] [INFO ] Deduced a trap composed of 20 places in 508 ms of which 5 ms to minimize.
[2024-06-01 14:31:23] [INFO ] Deduced a trap composed of 35 places in 508 ms of which 5 ms to minimize.
[2024-06-01 14:31:23] [INFO ] Deduced a trap composed of 47 places in 466 ms of which 6 ms to minimize.
[2024-06-01 14:31:24] [INFO ] Deduced a trap composed of 23 places in 520 ms of which 6 ms to minimize.
[2024-06-01 14:31:24] [INFO ] Deduced a trap composed of 11 places in 535 ms of which 5 ms to minimize.
[2024-06-01 14:31:25] [INFO ] Deduced a trap composed of 25 places in 523 ms of which 5 ms to minimize.
[2024-06-01 14:31:25] [INFO ] Deduced a trap composed of 16 places in 507 ms of which 5 ms to minimize.
[2024-06-01 14:31:26] [INFO ] Deduced a trap composed of 55 places in 504 ms of which 5 ms to minimize.
[2024-06-01 14:31:26] [INFO ] Deduced a trap composed of 54 places in 481 ms of which 5 ms to minimize.
[2024-06-01 14:31:27] [INFO ] Deduced a trap composed of 24 places in 418 ms of which 5 ms to minimize.
[2024-06-01 14:31:27] [INFO ] Deduced a trap composed of 62 places in 325 ms of which 20 ms to minimize.
[2024-06-01 14:31:27] [INFO ] Deduced a trap composed of 34 places in 393 ms of which 5 ms to minimize.
[2024-06-01 14:31:28] [INFO ] Deduced a trap composed of 33 places in 390 ms of which 4 ms to minimize.
SMT process timed out in 30954ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 30987ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33698 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 400000 steps (8 resets) in 8679 ms. (46 steps per ms) remains 266/410 properties
Running SMT prover for 266 properties.
[2024-06-01 14:31:30] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:31:30] [INFO ] Invariant cache hit.
[2024-06-01 14:31:31] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2024-06-01 14:31:32] [INFO ] After 965ms SMT Verify possible using state equation in real domain returned unsat :0 sat :266
[2024-06-01 14:31:32] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:31:34] [INFO ] After 2118ms SMT Verify possible using 497 Read/Feed constraints in real domain returned unsat :0 sat :266
TRAPS : Iteration 0
[2024-06-01 14:32:02] [INFO ] After 30489ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:266
[2024-06-01 14:32:02] [INFO ] After 31956ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:266
[2024-06-01 14:32:03] [INFO ] [Nat]Absence check using 23 positive place invariants in 16 ms returned sat
[2024-06-01 14:32:04] [INFO ] After 968ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :266
[2024-06-01 14:32:07] [INFO ] After 2709ms SMT Verify possible using 497 Read/Feed constraints in natural domain returned unsat :0 sat :266
TRAPS : Iteration 0
[2024-06-01 14:32:07] [INFO ] Deduced a trap composed of 27 places in 688 ms of which 8 ms to minimize.
[2024-06-01 14:32:08] [INFO ] Deduced a trap composed of 21 places in 767 ms of which 8 ms to minimize.
[2024-06-01 14:32:09] [INFO ] Deduced a trap composed of 34 places in 765 ms of which 8 ms to minimize.
[2024-06-01 14:32:10] [INFO ] Deduced a trap composed of 34 places in 769 ms of which 8 ms to minimize.
[2024-06-01 14:32:11] [INFO ] Deduced a trap composed of 37 places in 758 ms of which 8 ms to minimize.
[2024-06-01 14:32:11] [INFO ] Deduced a trap composed of 24 places in 736 ms of which 7 ms to minimize.
[2024-06-01 14:32:12] [INFO ] Deduced a trap composed of 33 places in 746 ms of which 8 ms to minimize.
[2024-06-01 14:32:13] [INFO ] Deduced a trap composed of 42 places in 699 ms of which 8 ms to minimize.
[2024-06-01 14:32:14] [INFO ] Deduced a trap composed of 36 places in 753 ms of which 8 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 21 places in 736 ms of which 8 ms to minimize.
[2024-06-01 14:32:15] [INFO ] Deduced a trap composed of 31 places in 742 ms of which 8 ms to minimize.
[2024-06-01 14:32:16] [INFO ] Deduced a trap composed of 11 places in 739 ms of which 8 ms to minimize.
[2024-06-01 14:32:17] [INFO ] Deduced a trap composed of 60 places in 746 ms of which 8 ms to minimize.
[2024-06-01 14:32:18] [INFO ] Deduced a trap composed of 11 places in 705 ms of which 7 ms to minimize.
[2024-06-01 14:32:19] [INFO ] Deduced a trap composed of 51 places in 675 ms of which 7 ms to minimize.
[2024-06-01 14:32:19] [INFO ] Deduced a trap composed of 73 places in 696 ms of which 7 ms to minimize.
[2024-06-01 14:32:20] [INFO ] Deduced a trap composed of 11 places in 698 ms of which 7 ms to minimize.
[2024-06-01 14:32:21] [INFO ] Deduced a trap composed of 13 places in 698 ms of which 7 ms to minimize.
[2024-06-01 14:32:22] [INFO ] Deduced a trap composed of 88 places in 675 ms of which 8 ms to minimize.
[2024-06-01 14:32:22] [INFO ] Deduced a trap composed of 40 places in 692 ms of which 8 ms to minimize.
[2024-06-01 14:32:23] [INFO ] Deduced a trap composed of 11 places in 707 ms of which 8 ms to minimize.
[2024-06-01 14:32:24] [INFO ] Deduced a trap composed of 33 places in 671 ms of which 8 ms to minimize.
[2024-06-01 14:32:25] [INFO ] Deduced a trap composed of 79 places in 683 ms of which 8 ms to minimize.
[2024-06-01 14:32:25] [INFO ] Deduced a trap composed of 11 places in 684 ms of which 8 ms to minimize.
[2024-06-01 14:32:26] [INFO ] Deduced a trap composed of 88 places in 607 ms of which 8 ms to minimize.
[2024-06-01 14:32:27] [INFO ] Deduced a trap composed of 91 places in 663 ms of which 7 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 11 places in 688 ms of which 8 ms to minimize.
[2024-06-01 14:32:28] [INFO ] Deduced a trap composed of 11 places in 729 ms of which 8 ms to minimize.
[2024-06-01 14:32:29] [INFO ] Deduced a trap composed of 51 places in 610 ms of which 8 ms to minimize.
[2024-06-01 14:32:30] [INFO ] Deduced a trap composed of 23 places in 715 ms of which 8 ms to minimize.
[2024-06-01 14:32:31] [INFO ] Deduced a trap composed of 31 places in 670 ms of which 7 ms to minimize.
[2024-06-01 14:32:31] [INFO ] Deduced a trap composed of 23 places in 667 ms of which 7 ms to minimize.
[2024-06-01 14:32:32] [INFO ] Deduced a trap composed of 32 places in 681 ms of which 7 ms to minimize.
[2024-06-01 14:32:33] [INFO ] Deduced a trap composed of 57 places in 712 ms of which 7 ms to minimize.
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 43 places in 706 ms of which 8 ms to minimize.
[2024-06-01 14:32:34] [INFO ] Deduced a trap composed of 43 places in 694 ms of which 8 ms to minimize.
[2024-06-01 14:32:35] [INFO ] Deduced a trap composed of 24 places in 702 ms of which 8 ms to minimize.
[2024-06-01 14:32:36] [INFO ] Deduced a trap composed of 43 places in 707 ms of which 8 ms to minimize.
[2024-06-01 14:32:37] [INFO ] Deduced a trap composed of 56 places in 683 ms of which 8 ms to minimize.
[2024-06-01 14:32:38] [INFO ] Deduced a trap composed of 22 places in 697 ms of which 7 ms to minimize.
[2024-06-01 14:32:38] [INFO ] Deduced a trap composed of 22 places in 739 ms of which 8 ms to minimize.
[2024-06-01 14:32:39] [INFO ] Deduced a trap composed of 24 places in 707 ms of which 8 ms to minimize.
[2024-06-01 14:32:40] [INFO ] Deduced a trap composed of 23 places in 708 ms of which 8 ms to minimize.
[2024-06-01 14:32:41] [INFO ] Deduced a trap composed of 33 places in 654 ms of which 7 ms to minimize.
[2024-06-01 14:32:41] [INFO ] Deduced a trap composed of 33 places in 646 ms of which 7 ms to minimize.
[2024-06-01 14:32:42] [INFO ] Deduced a trap composed of 42 places in 676 ms of which 8 ms to minimize.
[2024-06-01 14:32:43] [INFO ] Deduced a trap composed of 33 places in 625 ms of which 6 ms to minimize.
[2024-06-01 14:32:44] [INFO ] Deduced a trap composed of 115 places in 627 ms of which 7 ms to minimize.
[2024-06-01 14:32:44] [INFO ] Deduced a trap composed of 33 places in 620 ms of which 7 ms to minimize.
[2024-06-01 14:32:45] [INFO ] Deduced a trap composed of 41 places in 569 ms of which 7 ms to minimize.
[2024-06-01 14:32:46] [INFO ] Deduced a trap composed of 41 places in 594 ms of which 7 ms to minimize.
[2024-06-01 14:32:46] [INFO ] Deduced a trap composed of 42 places in 555 ms of which 7 ms to minimize.
[2024-06-01 14:32:47] [INFO ] Deduced a trap composed of 41 places in 608 ms of which 7 ms to minimize.
[2024-06-01 14:32:48] [INFO ] Deduced a trap composed of 40 places in 596 ms of which 7 ms to minimize.
[2024-06-01 14:32:48] [INFO ] Deduced a trap composed of 31 places in 630 ms of which 7 ms to minimize.
[2024-06-01 14:32:49] [INFO ] Deduced a trap composed of 33 places in 574 ms of which 8 ms to minimize.
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 45 places in 619 ms of which 7 ms to minimize.
[2024-06-01 14:32:50] [INFO ] Deduced a trap composed of 31 places in 640 ms of which 8 ms to minimize.
[2024-06-01 14:32:51] [INFO ] Deduced a trap composed of 34 places in 553 ms of which 8 ms to minimize.
[2024-06-01 14:32:52] [INFO ] Deduced a trap composed of 67 places in 521 ms of which 7 ms to minimize.
[2024-06-01 14:32:52] [INFO ] Deduced a trap composed of 42 places in 604 ms of which 7 ms to minimize.
[2024-06-01 14:32:53] [INFO ] Deduced a trap composed of 32 places in 619 ms of which 7 ms to minimize.
[2024-06-01 14:32:54] [INFO ] Deduced a trap composed of 32 places in 586 ms of which 7 ms to minimize.
[2024-06-01 14:32:54] [INFO ] Deduced a trap composed of 45 places in 568 ms of which 7 ms to minimize.
[2024-06-01 14:32:55] [INFO ] Deduced a trap composed of 41 places in 504 ms of which 6 ms to minimize.
[2024-06-01 14:32:55] [INFO ] Deduced a trap composed of 59 places in 545 ms of which 6 ms to minimize.
[2024-06-01 14:32:56] [INFO ] Trap strengthening (SAT) tested/added 67/66 trap constraints in 48962 ms
[2024-06-01 14:32:56] [INFO ] Deduced a trap composed of 21 places in 628 ms of which 8 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 774 ms
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 22 places in 496 ms of which 6 ms to minimize.
[2024-06-01 14:32:58] [INFO ] Deduced a trap composed of 25 places in 520 ms of which 6 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 23 places in 644 ms of which 7 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 43 places in 652 ms of which 7 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 31 places in 603 ms of which 7 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 41 places in 555 ms of which 7 ms to minimize.
[2024-06-01 14:33:01] [INFO ] Deduced a trap composed of 52 places in 576 ms of which 7 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Deduced a trap composed of 44 places in 506 ms of which 6 ms to minimize.
[2024-06-01 14:33:02] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 5246 ms
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 23 places in 527 ms of which 6 ms to minimize.
[2024-06-01 14:33:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 678 ms
[2024-06-01 14:33:04] [INFO ] Deduced a trap composed of 12 places in 698 ms of which 7 ms to minimize.
[2024-06-01 14:33:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 838 ms
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 62 places in 381 ms of which 5 ms to minimize.
[2024-06-01 14:33:05] [INFO ] Deduced a trap composed of 62 places in 446 ms of which 6 ms to minimize.
[2024-06-01 14:33:06] [INFO ] Deduced a trap composed of 71 places in 455 ms of which 5 ms to minimize.
[2024-06-01 14:33:07] [INFO ] Deduced a trap composed of 62 places in 472 ms of which 6 ms to minimize.
[2024-06-01 14:33:07] [INFO ] Deduced a trap composed of 53 places in 465 ms of which 6 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 71 places in 457 ms of which 6 ms to minimize.
[2024-06-01 14:33:08] [INFO ] Deduced a trap composed of 78 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:33:09] [INFO ] Deduced a trap composed of 71 places in 464 ms of which 6 ms to minimize.
[2024-06-01 14:33:09] [INFO ] Deduced a trap composed of 71 places in 470 ms of which 6 ms to minimize.
[2024-06-01 14:33:10] [INFO ] Deduced a trap composed of 71 places in 468 ms of which 5 ms to minimize.
[2024-06-01 14:33:10] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 5348 ms
[2024-06-01 14:33:10] [INFO ] Deduced a trap composed of 53 places in 472 ms of which 6 ms to minimize.
[2024-06-01 14:33:11] [INFO ] Deduced a trap composed of 52 places in 474 ms of which 6 ms to minimize.
[2024-06-01 14:33:12] [INFO ] Deduced a trap composed of 71 places in 465 ms of which 6 ms to minimize.
[2024-06-01 14:33:12] [INFO ] Deduced a trap composed of 83 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 62 places in 449 ms of which 5 ms to minimize.
[2024-06-01 14:33:13] [INFO ] Deduced a trap composed of 70 places in 451 ms of which 5 ms to minimize.
[2024-06-01 14:33:14] [INFO ] Deduced a trap composed of 70 places in 452 ms of which 6 ms to minimize.
[2024-06-01 14:33:14] [INFO ] Deduced a trap composed of 61 places in 353 ms of which 4 ms to minimize.
[2024-06-01 14:33:14] [INFO ] Deduced a trap composed of 52 places in 250 ms of which 4 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 4 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Deduced a trap composed of 52 places in 251 ms of which 3 ms to minimize.
[2024-06-01 14:33:15] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 5211 ms
[2024-06-01 14:33:16] [INFO ] Deduced a trap composed of 23 places in 614 ms of which 7 ms to minimize.
[2024-06-01 14:33:16] [INFO ] Deduced a trap composed of 50 places in 451 ms of which 6 ms to minimize.
[2024-06-01 14:33:17] [INFO ] Deduced a trap composed of 50 places in 460 ms of which 6 ms to minimize.
[2024-06-01 14:33:17] [INFO ] Deduced a trap composed of 59 places in 457 ms of which 5 ms to minimize.
[2024-06-01 14:33:18] [INFO ] Deduced a trap composed of 68 places in 401 ms of which 6 ms to minimize.
[2024-06-01 14:33:18] [INFO ] Deduced a trap composed of 67 places in 476 ms of which 6 ms to minimize.
[2024-06-01 14:33:19] [INFO ] Deduced a trap composed of 68 places in 455 ms of which 6 ms to minimize.
[2024-06-01 14:33:20] [INFO ] Deduced a trap composed of 68 places in 472 ms of which 5 ms to minimize.
[2024-06-01 14:33:20] [INFO ] Deduced a trap composed of 58 places in 458 ms of which 5 ms to minimize.
[2024-06-01 14:33:21] [INFO ] Deduced a trap composed of 58 places in 468 ms of which 6 ms to minimize.
[2024-06-01 14:33:21] [INFO ] Deduced a trap composed of 59 places in 471 ms of which 6 ms to minimize.
[2024-06-01 14:33:22] [INFO ] Deduced a trap composed of 59 places in 473 ms of which 6 ms to minimize.
[2024-06-01 14:33:22] [INFO ] Deduced a trap composed of 67 places in 468 ms of which 5 ms to minimize.
[2024-06-01 14:33:22] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 7154 ms
[2024-06-01 14:33:23] [INFO ] Deduced a trap composed of 60 places in 383 ms of which 5 ms to minimize.
[2024-06-01 14:33:23] [INFO ] Deduced a trap composed of 61 places in 398 ms of which 5 ms to minimize.
[2024-06-01 14:33:24] [INFO ] Deduced a trap composed of 58 places in 377 ms of which 5 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 51 places in 465 ms of which 5 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 51 places in 454 ms of which 6 ms to minimize.
[2024-06-01 14:33:26] [INFO ] Deduced a trap composed of 61 places in 465 ms of which 6 ms to minimize.
[2024-06-01 14:33:26] [INFO ] Deduced a trap composed of 41 places in 367 ms of which 5 ms to minimize.
[2024-06-01 14:33:27] [INFO ] Deduced a trap composed of 59 places in 453 ms of which 6 ms to minimize.
[2024-06-01 14:33:27] [INFO ] Deduced a trap composed of 40 places in 344 ms of which 4 ms to minimize.
[2024-06-01 14:33:27] [INFO ] Deduced a trap composed of 40 places in 359 ms of which 5 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 44 places in 349 ms of which 5 ms to minimize.
[2024-06-01 14:33:28] [INFO ] Deduced a trap composed of 40 places in 359 ms of which 4 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 53 places in 356 ms of which 5 ms to minimize.
[2024-06-01 14:33:29] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 5 ms to minimize.
[2024-06-01 14:33:30] [INFO ] Deduced a trap composed of 44 places in 362 ms of which 4 ms to minimize.
[2024-06-01 14:33:30] [INFO ] Deduced a trap composed of 33 places in 394 ms of which 6 ms to minimize.
[2024-06-01 14:33:31] [INFO ] Deduced a trap composed of 32 places in 407 ms of which 5 ms to minimize.
[2024-06-01 14:33:31] [INFO ] Deduced a trap composed of 34 places in 406 ms of which 5 ms to minimize.
[2024-06-01 14:33:32] [INFO ] Deduced a trap composed of 31 places in 399 ms of which 6 ms to minimize.
[2024-06-01 14:33:32] [INFO ] Deduced a trap composed of 34 places in 394 ms of which 5 ms to minimize.
[2024-06-01 14:33:32] [INFO ] Deduced a trap composed of 35 places in 391 ms of which 5 ms to minimize.
[2024-06-01 14:33:33] [INFO ] Deduced a trap composed of 33 places in 386 ms of which 5 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 41 places in 346 ms of which 5 ms to minimize.
[2024-06-01 14:33:34] [INFO ] Deduced a trap composed of 49 places in 469 ms of which 6 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 51 places in 456 ms of which 5 ms to minimize.
[2024-06-01 14:33:35] [INFO ] Deduced a trap composed of 47 places in 460 ms of which 6 ms to minimize.
[2024-06-01 14:33:36] [INFO ] Deduced a trap composed of 51 places in 462 ms of which 6 ms to minimize.
[2024-06-01 14:33:36] [INFO ] Deduced a trap composed of 51 places in 283 ms of which 4 ms to minimize.
[2024-06-01 14:33:37] [INFO ] Deduced a trap composed of 50 places in 307 ms of which 4 ms to minimize.
[2024-06-01 14:33:38] [INFO ] Deduced a trap composed of 17 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:33:39] [INFO ] Deduced a trap composed of 38 places in 564 ms of which 6 ms to minimize.
[2024-06-01 14:33:39] [INFO ] Deduced a trap composed of 40 places in 557 ms of which 7 ms to minimize.
[2024-06-01 14:33:40] [INFO ] Deduced a trap composed of 61 places in 579 ms of which 7 ms to minimize.
[2024-06-01 14:33:41] [INFO ] Deduced a trap composed of 38 places in 565 ms of which 7 ms to minimize.
[2024-06-01 14:33:42] [INFO ] Deduced a trap composed of 38 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:33:42] [INFO ] Deduced a trap composed of 23 places in 442 ms of which 5 ms to minimize.
[2024-06-01 14:33:43] [INFO ] Deduced a trap composed of 41 places in 462 ms of which 5 ms to minimize.
[2024-06-01 14:33:43] [INFO ] Deduced a trap composed of 23 places in 292 ms of which 4 ms to minimize.
[2024-06-01 14:33:46] [INFO ] Deduced a trap composed of 51 places in 403 ms of which 7 ms to minimize.
[2024-06-01 14:33:47] [INFO ] Deduced a trap composed of 69 places in 490 ms of which 7 ms to minimize.
[2024-06-01 14:33:47] [INFO ] Deduced a trap composed of 43 places in 455 ms of which 6 ms to minimize.
[2024-06-01 14:33:48] [INFO ] Deduced a trap composed of 82 places in 499 ms of which 6 ms to minimize.
[2024-06-01 14:33:48] [INFO ] Deduced a trap composed of 76 places in 435 ms of which 6 ms to minimize.
[2024-06-01 14:33:49] [INFO ] Deduced a trap composed of 42 places in 451 ms of which 6 ms to minimize.
[2024-06-01 14:33:49] [INFO ] Deduced a trap composed of 60 places in 501 ms of which 6 ms to minimize.
[2024-06-01 14:33:50] [INFO ] Deduced a trap composed of 51 places in 509 ms of which 7 ms to minimize.
[2024-06-01 14:33:50] [INFO ] Deduced a trap composed of 51 places in 514 ms of which 6 ms to minimize.
[2024-06-01 14:33:51] [INFO ] Deduced a trap composed of 60 places in 422 ms of which 5 ms to minimize.
[2024-06-01 14:33:51] [INFO ] Deduced a trap composed of 69 places in 364 ms of which 4 ms to minimize.
[2024-06-01 14:33:52] [INFO ] Deduced a trap composed of 69 places in 361 ms of which 5 ms to minimize.
[2024-06-01 14:33:52] [INFO ] Deduced a trap composed of 70 places in 361 ms of which 5 ms to minimize.
[2024-06-01 14:33:53] [INFO ] Deduced a trap composed of 69 places in 359 ms of which 5 ms to minimize.
[2024-06-01 14:33:53] [INFO ] Deduced a trap composed of 70 places in 355 ms of which 4 ms to minimize.
[2024-06-01 14:33:54] [INFO ] Deduced a trap composed of 69 places in 358 ms of which 4 ms to minimize.
[2024-06-01 14:33:54] [INFO ] Trap strengthening (SAT) tested/added 55/54 trap constraints in 31184 ms
[2024-06-01 14:33:54] [INFO ] Deduced a trap composed of 60 places in 312 ms of which 4 ms to minimize.
[2024-06-01 14:33:54] [INFO ] Deduced a trap composed of 59 places in 315 ms of which 4 ms to minimize.
[2024-06-01 14:33:55] [INFO ] Deduced a trap composed of 50 places in 332 ms of which 4 ms to minimize.
[2024-06-01 14:33:55] [INFO ] Deduced a trap composed of 59 places in 304 ms of which 4 ms to minimize.
[2024-06-01 14:33:56] [INFO ] Deduced a trap composed of 60 places in 308 ms of which 5 ms to minimize.
[2024-06-01 14:33:57] [INFO ] Deduced a trap composed of 30 places in 386 ms of which 4 ms to minimize.
[2024-06-01 14:33:57] [INFO ] Deduced a trap composed of 27 places in 640 ms of which 7 ms to minimize.
[2024-06-01 14:33:58] [INFO ] Deduced a trap composed of 67 places in 555 ms of which 7 ms to minimize.
[2024-06-01 14:33:59] [INFO ] Deduced a trap composed of 32 places in 568 ms of which 7 ms to minimize.
[2024-06-01 14:33:59] [INFO ] Deduced a trap composed of 59 places in 470 ms of which 6 ms to minimize.
[2024-06-01 14:34:00] [INFO ] Deduced a trap composed of 50 places in 476 ms of which 6 ms to minimize.
[2024-06-01 14:34:00] [INFO ] Deduced a trap composed of 69 places in 472 ms of which 5 ms to minimize.
[2024-06-01 14:34:01] [INFO ] Deduced a trap composed of 60 places in 462 ms of which 5 ms to minimize.
[2024-06-01 14:34:01] [INFO ] Deduced a trap composed of 68 places in 488 ms of which 6 ms to minimize.
[2024-06-01 14:34:02] [INFO ] Deduced a trap composed of 68 places in 476 ms of which 5 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 69 places in 489 ms of which 6 ms to minimize.
[2024-06-01 14:34:03] [INFO ] Deduced a trap composed of 50 places in 392 ms of which 5 ms to minimize.
[2024-06-01 14:34:04] [INFO ] Deduced a trap composed of 50 places in 477 ms of which 6 ms to minimize.
[2024-06-01 14:34:04] [INFO ] Deduced a trap composed of 68 places in 383 ms of which 6 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 68 places in 486 ms of which 6 ms to minimize.
[2024-06-01 14:34:05] [INFO ] Trap strengthening (SAT) tested/added 21/20 trap constraints in 10941 ms
[2024-06-01 14:34:05] [INFO ] Deduced a trap composed of 43 places in 325 ms of which 4 ms to minimize.
[2024-06-01 14:34:06] [INFO ] Deduced a trap composed of 52 places in 308 ms of which 4 ms to minimize.
[2024-06-01 14:34:08] [INFO ] Deduced a trap composed of 20 places in 560 ms of which 6 ms to minimize.
[2024-06-01 14:34:08] [INFO ] Deduced a trap composed of 20 places in 653 ms of which 7 ms to minimize.
[2024-06-01 14:34:09] [INFO ] Deduced a trap composed of 61 places in 654 ms of which 7 ms to minimize.
[2024-06-01 14:34:10] [INFO ] Deduced a trap composed of 24 places in 642 ms of which 7 ms to minimize.
[2024-06-01 14:34:11] [INFO ] Deduced a trap composed of 20 places in 636 ms of which 7 ms to minimize.
[2024-06-01 14:34:11] [INFO ] Deduced a trap composed of 20 places in 649 ms of which 7 ms to minimize.
[2024-06-01 14:34:12] [INFO ] Deduced a trap composed of 22 places in 656 ms of which 7 ms to minimize.
[2024-06-01 14:34:12] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 7398 ms
[2024-06-01 14:34:13] [INFO ] Deduced a trap composed of 29 places in 662 ms of which 8 ms to minimize.
[2024-06-01 14:34:14] [INFO ] Deduced a trap composed of 43 places in 552 ms of which 7 ms to minimize.
[2024-06-01 14:34:14] [INFO ] Deduced a trap composed of 52 places in 476 ms of which 6 ms to minimize.
[2024-06-01 14:34:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 2092 ms
[2024-06-01 14:34:16] [INFO ] Deduced a trap composed of 73 places in 504 ms of which 6 ms to minimize.
[2024-06-01 14:34:16] [INFO ] Deduced a trap composed of 50 places in 415 ms of which 5 ms to minimize.
[2024-06-01 14:34:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1149 ms
[2024-06-01 14:34:17] [INFO ] Deduced a trap composed of 77 places in 426 ms of which 5 ms to minimize.
[2024-06-01 14:34:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 577 ms
[2024-06-01 14:34:18] [INFO ] Deduced a trap composed of 14 places in 636 ms of which 8 ms to minimize.
[2024-06-01 14:34:18] [INFO ] Deduced a trap composed of 43 places in 542 ms of which 6 ms to minimize.
[2024-06-01 14:34:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1429 ms
[2024-06-01 14:34:19] [INFO ] Deduced a trap composed of 42 places in 605 ms of which 7 ms to minimize.
[2024-06-01 14:34:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 761 ms
[2024-06-01 14:34:20] [INFO ] Deduced a trap composed of 70 places in 540 ms of which 7 ms to minimize.
[2024-06-01 14:34:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 697 ms
[2024-06-01 14:34:22] [INFO ] Deduced a trap composed of 83 places in 579 ms of which 7 ms to minimize.
[2024-06-01 14:34:22] [INFO ] Deduced a trap composed of 104 places in 526 ms of which 6 ms to minimize.
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 100 places in 538 ms of which 6 ms to minimize.
[2024-06-01 14:34:23] [INFO ] Deduced a trap composed of 100 places in 556 ms of which 6 ms to minimize.
[2024-06-01 14:34:24] [INFO ] Deduced a trap composed of 111 places in 568 ms of which 7 ms to minimize.
[2024-06-01 14:34:25] [INFO ] Deduced a trap composed of 111 places in 590 ms of which 6 ms to minimize.
[2024-06-01 14:34:25] [INFO ] Deduced a trap composed of 111 places in 569 ms of which 7 ms to minimize.
[2024-06-01 14:34:26] [INFO ] Deduced a trap composed of 111 places in 563 ms of which 7 ms to minimize.
[2024-06-01 14:34:27] [INFO ] Deduced a trap composed of 122 places in 553 ms of which 6 ms to minimize.
[2024-06-01 14:34:27] [INFO ] Deduced a trap composed of 44 places in 545 ms of which 7 ms to minimize.
[2024-06-01 14:34:28] [INFO ] Deduced a trap composed of 34 places in 547 ms of which 7 ms to minimize.
[2024-06-01 14:34:29] [INFO ] Deduced a trap composed of 20 places in 674 ms of which 7 ms to minimize.
[2024-06-01 14:34:29] [INFO ] Deduced a trap composed of 36 places in 657 ms of which 8 ms to minimize.
[2024-06-01 14:34:30] [INFO ] Deduced a trap composed of 25 places in 667 ms of which 7 ms to minimize.
[2024-06-01 14:34:31] [INFO ] Deduced a trap composed of 23 places in 748 ms of which 8 ms to minimize.
[2024-06-01 14:34:32] [INFO ] Deduced a trap composed of 34 places in 692 ms of which 8 ms to minimize.
[2024-06-01 14:34:32] [INFO ] Deduced a trap composed of 43 places in 664 ms of which 7 ms to minimize.
[2024-06-01 14:34:33] [INFO ] Deduced a trap composed of 43 places in 655 ms of which 8 ms to minimize.
[2024-06-01 14:34:34] [INFO ] Deduced a trap composed of 25 places in 654 ms of which 7 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 25 places in 654 ms of which 7 ms to minimize.
[2024-06-01 14:34:35] [INFO ] Deduced a trap composed of 25 places in 661 ms of which 7 ms to minimize.
[2024-06-01 14:34:36] [INFO ] Deduced a trap composed of 25 places in 678 ms of which 8 ms to minimize.
[2024-06-01 14:34:37] [INFO ] Deduced a trap composed of 25 places in 653 ms of which 8 ms to minimize.
[2024-06-01 14:34:38] [INFO ] Deduced a trap composed of 31 places in 596 ms of which 7 ms to minimize.
[2024-06-01 14:34:38] [INFO ] Deduced a trap composed of 43 places in 604 ms of which 7 ms to minimize.
[2024-06-01 14:34:39] [INFO ] Deduced a trap composed of 31 places in 598 ms of which 8 ms to minimize.
[2024-06-01 14:34:40] [INFO ] Deduced a trap composed of 63 places in 601 ms of which 7 ms to minimize.
[2024-06-01 14:34:40] [INFO ] Deduced a trap composed of 43 places in 573 ms of which 7 ms to minimize.
[2024-06-01 14:34:41] [INFO ] Deduced a trap composed of 31 places in 576 ms of which 7 ms to minimize.
[2024-06-01 14:34:42] [INFO ] Deduced a trap composed of 31 places in 620 ms of which 6 ms to minimize.
[2024-06-01 14:34:43] [INFO ] Deduced a trap composed of 43 places in 638 ms of which 7 ms to minimize.
[2024-06-01 14:34:43] [INFO ] Deduced a trap composed of 19 places in 628 ms of which 7 ms to minimize.
[2024-06-01 14:34:44] [INFO ] Deduced a trap composed of 46 places in 632 ms of which 7 ms to minimize.
[2024-06-01 14:34:45] [INFO ] Deduced a trap composed of 19 places in 648 ms of which 8 ms to minimize.
[2024-06-01 14:34:45] [INFO ] Deduced a trap composed of 43 places in 507 ms of which 6 ms to minimize.
[2024-06-01 14:34:46] [INFO ] Deduced a trap composed of 111 places in 504 ms of which 6 ms to minimize.
[2024-06-01 14:34:46] [INFO ] Deduced a trap composed of 43 places in 509 ms of which 7 ms to minimize.
[2024-06-01 14:34:47] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 25687 ms
[2024-06-01 14:34:47] [INFO ] Deduced a trap composed of 43 places in 467 ms of which 6 ms to minimize.
[2024-06-01 14:34:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 621 ms
[2024-06-01 14:34:48] [INFO ] Deduced a trap composed of 11 places in 567 ms of which 7 ms to minimize.
[2024-06-01 14:34:49] [INFO ] Deduced a trap composed of 21 places in 611 ms of which 7 ms to minimize.
[2024-06-01 14:34:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1693 ms
[2024-06-01 14:34:50] [INFO ] Deduced a trap composed of 14 places in 636 ms of which 7 ms to minimize.
[2024-06-01 14:34:51] [INFO ] Deduced a trap composed of 27 places in 670 ms of which 8 ms to minimize.
[2024-06-01 14:34:52] [INFO ] Deduced a trap composed of 53 places in 647 ms of which 8 ms to minimize.
[2024-06-01 14:34:52] [INFO ] Deduced a trap composed of 66 places in 616 ms of which 7 ms to minimize.
[2024-06-01 14:34:53] [INFO ] Deduced a trap composed of 33 places in 444 ms of which 6 ms to minimize.
[2024-06-01 14:34:54] [INFO ] Deduced a trap composed of 22 places in 674 ms of which 7 ms to minimize.
[2024-06-01 14:34:54] [INFO ] Deduced a trap composed of 31 places in 541 ms of which 7 ms to minimize.
[2024-06-01 14:34:54] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 5157 ms
[2024-06-01 14:34:55] [INFO ] Deduced a trap composed of 58 places in 570 ms of which 7 ms to minimize.
[2024-06-01 14:34:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 724 ms
[2024-06-01 14:34:56] [INFO ] Deduced a trap composed of 47 places in 539 ms of which 6 ms to minimize.
[2024-06-01 14:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 693 ms
[2024-06-01 14:34:57] [INFO ] Deduced a trap composed of 29 places in 628 ms of which 7 ms to minimize.
[2024-06-01 14:34:58] [INFO ] Deduced a trap composed of 65 places in 635 ms of which 7 ms to minimize.
[2024-06-01 14:34:59] [INFO ] Deduced a trap composed of 14 places in 722 ms of which 8 ms to minimize.
[2024-06-01 14:35:00] [INFO ] Deduced a trap composed of 14 places in 696 ms of which 7 ms to minimize.
[2024-06-01 14:35:00] [INFO ] Deduced a trap composed of 21 places in 638 ms of which 8 ms to minimize.
[2024-06-01 14:35:01] [INFO ] Deduced a trap composed of 12 places in 587 ms of which 7 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 15 places in 636 ms of which 7 ms to minimize.
[2024-06-01 14:35:02] [INFO ] Deduced a trap composed of 12 places in 651 ms of which 6 ms to minimize.
[2024-06-01 14:35:03] [INFO ] Deduced a trap composed of 35 places in 623 ms of which 6 ms to minimize.
[2024-06-01 14:35:04] [INFO ] Deduced a trap composed of 56 places in 633 ms of which 7 ms to minimize.
[2024-06-01 14:35:05] [INFO ] Deduced a trap composed of 39 places in 602 ms of which 7 ms to minimize.
[2024-06-01 14:35:06] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 5 ms to minimize.
[2024-06-01 14:35:07] [INFO ] Deduced a trap composed of 24 places in 672 ms of which 7 ms to minimize.
[2024-06-01 14:35:07] [INFO ] Deduced a trap composed of 34 places in 543 ms of which 6 ms to minimize.
[2024-06-01 14:35:08] [INFO ] Deduced a trap composed of 34 places in 541 ms of which 6 ms to minimize.
[2024-06-01 14:35:08] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 11419 ms
[2024-06-01 14:35:09] [INFO ] Deduced a trap composed of 63 places in 603 ms of which 7 ms to minimize.
[2024-06-01 14:35:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 765 ms
[2024-06-01 14:35:10] [INFO ] Deduced a trap composed of 16 places in 705 ms of which 7 ms to minimize.
[2024-06-01 14:35:11] [INFO ] Deduced a trap composed of 40 places in 651 ms of which 7 ms to minimize.
[2024-06-01 14:35:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1601 ms
[2024-06-01 14:35:12] [INFO ] Deduced a trap composed of 29 places in 618 ms of which 7 ms to minimize.
[2024-06-01 14:35:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 887 ms
[2024-06-01 14:35:13] [INFO ] Deduced a trap composed of 29 places in 537 ms of which 7 ms to minimize.
[2024-06-01 14:35:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 700 ms
[2024-06-01 14:35:14] [INFO ] Deduced a trap composed of 14 places in 580 ms of which 7 ms to minimize.
[2024-06-01 14:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 738 ms
[2024-06-01 14:35:15] [INFO ] Deduced a trap composed of 21 places in 569 ms of which 7 ms to minimize.
[2024-06-01 14:35:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 724 ms
[2024-06-01 14:35:15] [INFO ] Deduced a trap composed of 13 places in 545 ms of which 7 ms to minimize.
[2024-06-01 14:35:16] [INFO ] Deduced a trap composed of 62 places in 348 ms of which 4 ms to minimize.
[2024-06-01 14:35:16] [INFO ] Deduced a trap composed of 53 places in 332 ms of which 5 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 53 places in 351 ms of which 4 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 62 places in 340 ms of which 4 ms to minimize.
[2024-06-01 14:35:17] [INFO ] Deduced a trap composed of 53 places in 221 ms of which 3 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 53 places in 233 ms of which 4 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 2982 ms
[2024-06-01 14:35:19] [INFO ] Deduced a trap composed of 15 places in 638 ms of which 7 ms to minimize.
[2024-06-01 14:35:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 794 ms
[2024-06-01 14:35:21] [INFO ] Deduced a trap composed of 29 places in 623 ms of which 7 ms to minimize.
[2024-06-01 14:35:21] [INFO ] Deduced a trap composed of 29 places in 627 ms of which 8 ms to minimize.
[2024-06-01 14:35:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1485 ms
[2024-06-01 14:35:22] [INFO ] Deduced a trap composed of 25 places in 617 ms of which 7 ms to minimize.
[2024-06-01 14:35:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 781 ms
TRAPS : Iteration 1
[2024-06-01 14:35:22] [INFO ] After 198417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :265 real:1
[2024-06-01 14:35:22] [INFO ] After 200044ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :265 real:1
RANDOM walk for 44 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 16 steps (0 resets) in 5 ms. (2 steps per ms) remains 0/1 properties
RANDOM walk for 43 steps (0 resets) in 5 ms. (7 steps per ms) remains 0/1 properties
RANDOM walk for 26 steps (0 resets) in 6 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 60 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
RANDOM walk for 55 steps (0 resets) in 7 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 61 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
RANDOM walk for 92 steps (0 resets) in 5 ms. (15 steps per ms) remains 0/1 properties
RANDOM walk for 48 steps (0 resets) in 6 ms. (6 steps per ms) remains 0/1 properties
RANDOM walk for 53 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
RANDOM walk for 45 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 47 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
RANDOM walk for 26 steps (0 resets) in 7 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 364 ms. (109 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 516951 steps, run timeout after 3001 ms. (steps per millisecond=172 ) properties seen :0 out of 1
Probabilistic random walk after 516951 steps, saw 75834 distinct states, run finished after 3005 ms. (steps per millisecond=172 ) properties seen :0
[2024-06-01 14:35:26] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:35:26] [INFO ] Invariant cache hit.
[2024-06-01 14:35:26] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 891 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 14 places in 507 ms of which 5 ms to minimize.
[2024-06-01 14:35:28] [INFO ] Deduced a trap composed of 24 places in 486 ms of which 5 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 30 places in 541 ms of which 6 ms to minimize.
[2024-06-01 14:35:29] [INFO ] Deduced a trap composed of 25 places in 460 ms of which 5 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 12 places in 671 ms of which 5 ms to minimize.
[2024-06-01 14:35:30] [INFO ] Deduced a trap composed of 13 places in 477 ms of which 6 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 11 places in 459 ms of which 5 ms to minimize.
[2024-06-01 14:35:31] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 5 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 15 places in 479 ms of which 6 ms to minimize.
SMT process timed out in 6171ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 186 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 183 ms. (217 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 558603 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 558603 steps, saw 80527 distinct states, run finished after 3001 ms. (steps per millisecond=186 ) properties seen :0
[2024-06-01 14:35:35] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:35:35] [INFO ] Invariant cache hit.
[2024-06-01 14:35:35] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 990 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:35:38] [INFO ] Deduced a trap composed of 14 places in 715 ms of which 9 ms to minimize.
[2024-06-01 14:35:38] [INFO ] Deduced a trap composed of 24 places in 773 ms of which 9 ms to minimize.
[2024-06-01 14:35:39] [INFO ] Deduced a trap composed of 30 places in 813 ms of which 8 ms to minimize.
[2024-06-01 14:35:40] [INFO ] Deduced a trap composed of 25 places in 767 ms of which 8 ms to minimize.
[2024-06-01 14:35:41] [INFO ] Deduced a trap composed of 12 places in 756 ms of which 9 ms to minimize.
[2024-06-01 14:35:42] [INFO ] Deduced a trap composed of 13 places in 750 ms of which 8 ms to minimize.
[2024-06-01 14:35:42] [INFO ] Deduced a trap composed of 11 places in 743 ms of which 7 ms to minimize.
[2024-06-01 14:35:43] [INFO ] Deduced a trap composed of 34 places in 686 ms of which 8 ms to minimize.
[2024-06-01 14:35:44] [INFO ] Deduced a trap composed of 15 places in 713 ms of which 8 ms to minimize.
[2024-06-01 14:35:45] [INFO ] Deduced a trap composed of 16 places in 711 ms of which 8 ms to minimize.
[2024-06-01 14:35:45] [INFO ] Deduced a trap composed of 17 places in 696 ms of which 8 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 11/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1321 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1336 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1700 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1700 constraints, problems are : Problem set: 0 solved, 1 unsolved in 9880 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 11/11 constraints]
After SMT, in 10886ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 56 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 61 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2024-06-01 14:35:46] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:35:46] [INFO ] Invariant cache hit.
[2024-06-01 14:35:47] [INFO ] Implicit Places using invariants in 1042 ms returned []
[2024-06-01 14:35:47] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:35:47] [INFO ] Invariant cache hit.
[2024-06-01 14:35:48] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:35:52] [INFO ] Implicit Places using invariants and state equation in 5275 ms returned []
Implicit Place search using SMT with State Equation took 6318 ms to find 0 implicit places.
[2024-06-01 14:35:52] [INFO ] Redundant transitions in 71 ms returned []
Running 1688 sub problems to find dead transitions.
[2024-06-01 14:35:52] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:35:52] [INFO ] Invariant cache hit.
[2024-06-01 14:35:53] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 78 places in 553 ms of which 5 ms to minimize.
[2024-06-01 14:36:19] [INFO ] Deduced a trap composed of 31 places in 524 ms of which 5 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 20 places in 500 ms of which 5 ms to minimize.
[2024-06-01 14:36:20] [INFO ] Deduced a trap composed of 35 places in 542 ms of which 8 ms to minimize.
[2024-06-01 14:36:21] [INFO ] Deduced a trap composed of 47 places in 568 ms of which 5 ms to minimize.
[2024-06-01 14:36:21] [INFO ] Deduced a trap composed of 23 places in 511 ms of which 5 ms to minimize.
[2024-06-01 14:36:22] [INFO ] Deduced a trap composed of 11 places in 607 ms of which 8 ms to minimize.
[2024-06-01 14:36:23] [INFO ] Deduced a trap composed of 25 places in 576 ms of which 5 ms to minimize.
[2024-06-01 14:36:23] [INFO ] Deduced a trap composed of 16 places in 518 ms of which 7 ms to minimize.
[2024-06-01 14:36:24] [INFO ] Deduced a trap composed of 55 places in 513 ms of which 5 ms to minimize.
SMT process timed out in 31224ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 31250ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37712 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 5 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 71 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 14:36:24] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 14:36:24] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:36:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 14:36:24] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:36:24] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:36:24] [INFO ] After 33ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 130 ms.
RANDOM walk for 31 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
RANDOM walk for 22 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
RANDOM walk for 40000 steps (8 resets) in 256 ms. (155 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 502209 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :0 out of 1
Probabilistic random walk after 502209 steps, saw 74393 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
[2024-06-01 14:36:27] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2024-06-01 14:36:27] [INFO ] Computed 23 invariants in 5 ms
[2024-06-01 14:36:27] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 746 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:29] [INFO ] Deduced a trap composed of 61 places in 571 ms of which 8 ms to minimize.
[2024-06-01 14:36:29] [INFO ] Deduced a trap composed of 62 places in 605 ms of which 6 ms to minimize.
[2024-06-01 14:36:30] [INFO ] Deduced a trap composed of 42 places in 640 ms of which 8 ms to minimize.
[2024-06-01 14:36:31] [INFO ] Deduced a trap composed of 23 places in 522 ms of which 5 ms to minimize.
[2024-06-01 14:36:31] [INFO ] Deduced a trap composed of 11 places in 507 ms of which 6 ms to minimize.
[2024-06-01 14:36:32] [INFO ] Deduced a trap composed of 29 places in 646 ms of which 6 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 24 places in 612 ms of which 7 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 12 places in 578 ms of which 5 ms to minimize.
SMT process timed out in 6186ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 31 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 150 ms. (264 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 533214 steps, run timeout after 3001 ms. (steps per millisecond=177 ) properties seen :0 out of 1
Probabilistic random walk after 533214 steps, saw 77569 distinct states, run finished after 3001 ms. (steps per millisecond=177 ) properties seen :0
[2024-06-01 14:36:36] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:36:36] [INFO ] Invariant cache hit.
[2024-06-01 14:36:36] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 738 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:36:38] [INFO ] Deduced a trap composed of 30 places in 706 ms of which 6 ms to minimize.
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 22 places in 530 ms of which 7 ms to minimize.
[2024-06-01 14:36:40] [INFO ] Deduced a trap composed of 25 places in 552 ms of which 6 ms to minimize.
[2024-06-01 14:36:40] [INFO ] Deduced a trap composed of 25 places in 529 ms of which 5 ms to minimize.
[2024-06-01 14:36:41] [INFO ] Deduced a trap composed of 28 places in 724 ms of which 9 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 75 places in 766 ms of which 8 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 52 places in 696 ms of which 7 ms to minimize.
[2024-06-01 14:36:43] [INFO ] Deduced a trap composed of 33 places in 642 ms of which 6 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 43 places in 632 ms of which 7 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 26 places in 603 ms of which 6 ms to minimize.
[2024-06-01 14:36:45] [INFO ] Deduced a trap composed of 11 places in 516 ms of which 6 ms to minimize.
[2024-06-01 14:36:45] [INFO ] Deduced a trap composed of 40 places in 581 ms of which 7 ms to minimize.
[2024-06-01 14:36:46] [INFO ] Deduced a trap composed of 14 places in 621 ms of which 7 ms to minimize.
[2024-06-01 14:36:47] [INFO ] Deduced a trap composed of 16 places in 505 ms of which 5 ms to minimize.
[2024-06-01 14:36:47] [INFO ] Deduced a trap composed of 15 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:36:48] [INFO ] Deduced a trap composed of 13 places in 688 ms of which 8 ms to minimize.
[2024-06-01 14:36:49] [INFO ] Deduced a trap composed of 17 places in 686 ms of which 8 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 17/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1334 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 0/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 308/1944 variables, 364/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 12094 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 12850ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 29 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 32 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2024-06-01 14:36:49] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:36:49] [INFO ] Invariant cache hit.
[2024-06-01 14:36:50] [INFO ] Implicit Places using invariants in 942 ms returned []
[2024-06-01 14:36:50] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:36:50] [INFO ] Invariant cache hit.
[2024-06-01 14:36:51] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:36:55] [INFO ] Implicit Places using invariants and state equation in 4580 ms returned []
Implicit Place search using SMT with State Equation took 5523 ms to find 0 implicit places.
[2024-06-01 14:36:55] [INFO ] Redundant transitions in 49 ms returned []
Running 1688 sub problems to find dead transitions.
[2024-06-01 14:36:55] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:36:55] [INFO ] Invariant cache hit.
[2024-06-01 14:36:55] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
SMT process timed out in 30874ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 30904ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36526 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 2 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 42 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 14:37:26] [INFO ] Computed 1 invariants in 1 ms
[2024-06-01 14:37:26] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:37:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 14:37:26] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:37:26] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:37:26] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 106 ms.
RANDOM walk for 40000 steps (8 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 55 ms. (714 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 536814 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :0 out of 1
Probabilistic random walk after 536814 steps, saw 78128 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
[2024-06-01 14:37:29] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2024-06-01 14:37:29] [INFO ] Computed 23 invariants in 9 ms
[2024-06-01 14:37:29] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 928 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:31] [INFO ] Deduced a trap composed of 14 places in 776 ms of which 8 ms to minimize.
[2024-06-01 14:37:32] [INFO ] Deduced a trap composed of 13 places in 730 ms of which 8 ms to minimize.
[2024-06-01 14:37:33] [INFO ] Deduced a trap composed of 60 places in 743 ms of which 8 ms to minimize.
[2024-06-01 14:37:34] [INFO ] Deduced a trap composed of 11 places in 746 ms of which 9 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 35 places in 763 ms of which 8 ms to minimize.
[2024-06-01 14:37:35] [INFO ] Deduced a trap composed of 60 places in 769 ms of which 8 ms to minimize.
SMT process timed out in 6425ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 39 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 490257 steps, run timeout after 3001 ms. (steps per millisecond=163 ) properties seen :0 out of 1
Probabilistic random walk after 490257 steps, saw 70115 distinct states, run finished after 3001 ms. (steps per millisecond=163 ) properties seen :0
[2024-06-01 14:37:38] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:37:38] [INFO ] Invariant cache hit.
[2024-06-01 14:37:38] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1054 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:41] [INFO ] Deduced a trap composed of 84 places in 770 ms of which 9 ms to minimize.
[2024-06-01 14:37:42] [INFO ] Deduced a trap composed of 12 places in 779 ms of which 9 ms to minimize.
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 14 places in 750 ms of which 8 ms to minimize.
[2024-06-01 14:37:43] [INFO ] Deduced a trap composed of 72 places in 732 ms of which 8 ms to minimize.
[2024-06-01 14:37:44] [INFO ] Deduced a trap composed of 46 places in 672 ms of which 8 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 27 places in 710 ms of which 7 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 20 places in 729 ms of which 8 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 23 places in 766 ms of which 8 ms to minimize.
[2024-06-01 14:37:47] [INFO ] Deduced a trap composed of 23 places in 680 ms of which 8 ms to minimize.
[2024-06-01 14:37:48] [INFO ] Deduced a trap composed of 25 places in 707 ms of which 8 ms to minimize.
[2024-06-01 14:37:49] [INFO ] Deduced a trap composed of 22 places in 718 ms of which 7 ms to minimize.
[2024-06-01 14:37:49] [INFO ] Deduced a trap composed of 42 places in 692 ms of which 8 ms to minimize.
[2024-06-01 14:37:50] [INFO ] Deduced a trap composed of 48 places in 664 ms of which 8 ms to minimize.
[2024-06-01 14:37:51] [INFO ] Deduced a trap composed of 13 places in 708 ms of which 8 ms to minimize.
[2024-06-01 14:37:52] [INFO ] Deduced a trap composed of 15 places in 710 ms of which 8 ms to minimize.
[2024-06-01 14:37:52] [INFO ] Deduced a trap composed of 16 places in 654 ms of which 8 ms to minimize.
[2024-06-01 14:37:53] [INFO ] Deduced a trap composed of 26 places in 640 ms of which 8 ms to minimize.
[2024-06-01 14:37:54] [INFO ] Deduced a trap composed of 17 places in 657 ms of which 8 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 18/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1335 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:55] [INFO ] Deduced a trap composed of 23 places in 604 ms of which 7 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 1/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 308/1944 variables, 364/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:37:56] [INFO ] Deduced a trap composed of 15 places in 688 ms of which 7 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1944 variables, 1/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1944 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1944 variables, 0/1709 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1709 constraints, problems are : Problem set: 0 solved, 1 unsolved in 16377 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 20/20 constraints]
After SMT, in 17453ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 42 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 42 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2024-06-01 14:37:56] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:37:56] [INFO ] Invariant cache hit.
[2024-06-01 14:37:57] [INFO ] Implicit Places using invariants in 1317 ms returned []
[2024-06-01 14:37:57] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:37:57] [INFO ] Invariant cache hit.
[2024-06-01 14:37:58] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:38:03] [INFO ] Implicit Places using invariants and state equation in 5791 ms returned []
Implicit Place search using SMT with State Equation took 7110 ms to find 0 implicit places.
[2024-06-01 14:38:03] [INFO ] Redundant transitions in 76 ms returned []
Running 1688 sub problems to find dead transitions.
[2024-06-01 14:38:03] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:38:03] [INFO ] Invariant cache hit.
[2024-06-01 14:38:03] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 1.0)
(s19 1.0)
(s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
SMT process timed out in 30925ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 30968ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38210 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 10 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 0 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.1 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 38 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 14:38:34] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 14:38:34] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:38:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 14:38:34] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:38:34] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:38:34] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 54 ms. (727 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 473715 steps, run timeout after 3001 ms. (steps per millisecond=157 ) properties seen :0 out of 1
Probabilistic random walk after 473715 steps, saw 63729 distinct states, run finished after 3001 ms. (steps per millisecond=157 ) properties seen :0
[2024-06-01 14:38:37] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2024-06-01 14:38:37] [INFO ] Computed 23 invariants in 6 ms
[2024-06-01 14:38:37] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 881 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 22 places in 687 ms of which 8 ms to minimize.
[2024-06-01 14:38:40] [INFO ] Deduced a trap composed of 23 places in 722 ms of which 7 ms to minimize.
[2024-06-01 14:38:41] [INFO ] Deduced a trap composed of 20 places in 716 ms of which 8 ms to minimize.
[2024-06-01 14:38:42] [INFO ] Deduced a trap composed of 39 places in 771 ms of which 8 ms to minimize.
[2024-06-01 14:38:43] [INFO ] Deduced a trap composed of 43 places in 715 ms of which 8 ms to minimize.
[2024-06-01 14:38:43] [INFO ] Deduced a trap composed of 13 places in 685 ms of which 8 ms to minimize.
SMT process timed out in 6071ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 40 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 51 ms. (769 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 520965 steps, run timeout after 3001 ms. (steps per millisecond=173 ) properties seen :0 out of 1
Probabilistic random walk after 520965 steps, saw 76195 distinct states, run finished after 3001 ms. (steps per millisecond=173 ) properties seen :0
[2024-06-01 14:38:47] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:38:47] [INFO ] Invariant cache hit.
[2024-06-01 14:38:47] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1025 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:38:49] [INFO ] Deduced a trap composed of 43 places in 640 ms of which 8 ms to minimize.
[2024-06-01 14:38:50] [INFO ] Deduced a trap composed of 23 places in 725 ms of which 8 ms to minimize.
[2024-06-01 14:38:51] [INFO ] Deduced a trap composed of 12 places in 750 ms of which 8 ms to minimize.
[2024-06-01 14:38:51] [INFO ] Deduced a trap composed of 11 places in 720 ms of which 8 ms to minimize.
[2024-06-01 14:38:52] [INFO ] Deduced a trap composed of 22 places in 719 ms of which 8 ms to minimize.
[2024-06-01 14:38:53] [INFO ] Deduced a trap composed of 24 places in 719 ms of which 8 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 64 places in 728 ms of which 8 ms to minimize.
[2024-06-01 14:38:54] [INFO ] Deduced a trap composed of 46 places in 721 ms of which 8 ms to minimize.
[2024-06-01 14:38:55] [INFO ] Deduced a trap composed of 14 places in 700 ms of which 8 ms to minimize.
[2024-06-01 14:38:56] [INFO ] Deduced a trap composed of 13 places in 731 ms of which 8 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 34 places in 708 ms of which 8 ms to minimize.
[2024-06-01 14:38:57] [INFO ] Deduced a trap composed of 16 places in 618 ms of which 8 ms to minimize.
[2024-06-01 14:38:58] [INFO ] Deduced a trap composed of 17 places in 661 ms of which 7 ms to minimize.
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 95 places in 605 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 14/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:38:59] [INFO ] Deduced a trap composed of 23 places in 668 ms of which 7 ms to minimize.
[2024-06-01 14:39:00] [INFO ] Deduced a trap composed of 15 places in 694 ms of which 8 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 2/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1341 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 308/1944 variables, 364/1705 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:39:01] [INFO ] Deduced a trap composed of 53 places in 557 ms of which 7 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/1944 variables, 1/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/1944 variables, 0/1706 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1706 constraints, problems are : Problem set: 0 solved, 1 unsolved in 13840 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 17/17 constraints]
After SMT, in 14876ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 40 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 39 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 39 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2024-06-01 14:39:02] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:39:02] [INFO ] Invariant cache hit.
[2024-06-01 14:39:03] [INFO ] Implicit Places using invariants in 1219 ms returned []
[2024-06-01 14:39:03] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:39:03] [INFO ] Invariant cache hit.
[2024-06-01 14:39:04] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:39:08] [INFO ] Implicit Places using invariants and state equation in 5002 ms returned []
Implicit Place search using SMT with State Equation took 6223 ms to find 0 implicit places.
[2024-06-01 14:39:08] [INFO ] Redundant transitions in 53 ms returned []
Running 1688 sub problems to find dead transitions.
[2024-06-01 14:39:08] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:39:08] [INFO ] Invariant cache hit.
[2024-06-01 14:39:08] [INFO ] State equation strengthened by 497 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 584/1944 variables, and 607 constraints, problems are : Problem set: 0 solved, 1688 unsolved in 30049 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 0/584 constraints, ReadFeed: 0/497 constraints, PredecessorRefiner: 1688/1688 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1688 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/584 variables, 23/607 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2024-06-01 14:39:42] [INFO ] Deduced a trap composed of 78 places in 584 ms of which 9 ms to minimize.
[2024-06-01 14:39:43] [INFO ] Deduced a trap composed of 20 places in 729 ms of which 8 ms to minimize.
[2024-06-01 14:39:44] [INFO ] Deduced a trap composed of 13 places in 711 ms of which 8 ms to minimize.
[2024-06-01 14:39:44] [INFO ] Deduced a trap composed of 11 places in 666 ms of which 8 ms to minimize.
[2024-06-01 14:39:45] [INFO ] Deduced a trap composed of 21 places in 742 ms of which 8 ms to minimize.
[2024-06-01 14:39:46] [INFO ] Deduced a trap composed of 23 places in 670 ms of which 8 ms to minimize.
[2024-06-01 14:39:46] [INFO ] Deduced a trap composed of 64 places in 639 ms of which 8 ms to minimize.
[2024-06-01 14:39:47] [INFO ] Deduced a trap composed of 34 places in 646 ms of which 8 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 33 places in 643 ms of which 8 ms to minimize.
[2024-06-01 14:39:48] [INFO ] Deduced a trap composed of 60 places in 537 ms of which 7 ms to minimize.
[2024-06-01 14:39:49] [INFO ] Deduced a trap composed of 24 places in 607 ms of which 6 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 26 places in 690 ms of which 8 ms to minimize.
[2024-06-01 14:39:50] [INFO ] Deduced a trap composed of 74 places in 637 ms of which 8 ms to minimize.
[2024-06-01 14:39:51] [INFO ] Deduced a trap composed of 45 places in 667 ms of which 7 ms to minimize.
[2024-06-01 14:39:52] [INFO ] Deduced a trap composed of 38 places in 637 ms of which 7 ms to minimize.
[2024-06-01 14:39:52] [INFO ] Deduced a trap composed of 61 places in 612 ms of which 7 ms to minimize.
[2024-06-01 14:39:53] [INFO ] Deduced a trap composed of 31 places in 580 ms of which 6 ms to minimize.
[2024-06-01 14:39:53] [INFO ] Deduced a trap composed of 60 places in 576 ms of which 7 ms to minimize.
[2024-06-01 14:39:54] [INFO ] Deduced a trap composed of 39 places in 599 ms of which 7 ms to minimize.
[2024-06-01 14:39:55] [INFO ] Deduced a trap composed of 24 places in 622 ms of which 7 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 20/627 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
[2024-06-01 14:39:57] [INFO ] Deduced a trap composed of 12 places in 631 ms of which 7 ms to minimize.
[2024-06-01 14:39:57] [INFO ] Deduced a trap composed of 22 places in 764 ms of which 8 ms to minimize.
[2024-06-01 14:39:58] [INFO ] Deduced a trap composed of 60 places in 780 ms of which 8 ms to minimize.
[2024-06-01 14:39:59] [INFO ] Deduced a trap composed of 31 places in 748 ms of which 8 ms to minimize.
[2024-06-01 14:40:00] [INFO ] Deduced a trap composed of 11 places in 748 ms of which 8 ms to minimize.
[2024-06-01 14:40:00] [INFO ] Deduced a trap composed of 15 places in 737 ms of which 8 ms to minimize.
[2024-06-01 14:40:01] [INFO ] Deduced a trap composed of 11 places in 729 ms of which 8 ms to minimize.
[2024-06-01 14:40:02] [INFO ] Deduced a trap composed of 13 places in 716 ms of which 7 ms to minimize.
[2024-06-01 14:40:03] [INFO ] Deduced a trap composed of 23 places in 723 ms of which 8 ms to minimize.
[2024-06-01 14:40:03] [INFO ] Deduced a trap composed of 23 places in 739 ms of which 7 ms to minimize.
[2024-06-01 14:40:04] [INFO ] Deduced a trap composed of 12 places in 665 ms of which 8 ms to minimize.
[2024-06-01 14:40:05] [INFO ] Deduced a trap composed of 12 places in 710 ms of which 7 ms to minimize.
[2024-06-01 14:40:05] [INFO ] Deduced a trap composed of 29 places in 665 ms of which 8 ms to minimize.
[2024-06-01 14:40:06] [INFO ] Deduced a trap composed of 46 places in 661 ms of which 8 ms to minimize.
[2024-06-01 14:40:07] [INFO ] Deduced a trap composed of 48 places in 645 ms of which 8 ms to minimize.
[2024-06-01 14:40:07] [INFO ] Deduced a trap composed of 30 places in 651 ms of which 7 ms to minimize.
[2024-06-01 14:40:08] [INFO ] Deduced a trap composed of 40 places in 638 ms of which 8 ms to minimize.
[2024-06-01 14:40:09] [INFO ] Deduced a trap composed of 25 places in 651 ms of which 6 ms to minimize.
[2024-06-01 14:40:09] [INFO ] Deduced a trap composed of 65 places in 555 ms of which 6 ms to minimize.
SMT process timed out in 61482ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 61509ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67836 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 1 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 1 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 40 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 14:40:09] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 14:40:09] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:40:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-06-01 14:40:09] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:40:09] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:40:09] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 101 ms.
RANDOM walk for 40000 steps (8 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 476640 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 476640 steps, saw 63730 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2024-06-01 14:40:13] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2024-06-01 14:40:13] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 14:40:13] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 789 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:40:15] [INFO ] Deduced a trap composed of 58 places in 787 ms of which 9 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 14 places in 777 ms of which 9 ms to minimize.
[2024-06-01 14:40:16] [INFO ] Deduced a trap composed of 15 places in 786 ms of which 8 ms to minimize.
[2024-06-01 14:40:17] [INFO ] Deduced a trap composed of 31 places in 761 ms of which 9 ms to minimize.
[2024-06-01 14:40:18] [INFO ] Deduced a trap composed of 75 places in 757 ms of which 9 ms to minimize.
[2024-06-01 14:40:19] [INFO ] Deduced a trap composed of 17 places in 748 ms of which 8 ms to minimize.
SMT process timed out in 6203ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 63 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 63 ms. (625 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 513333 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :0 out of 1
Probabilistic random walk after 513333 steps, saw 75473 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :0
[2024-06-01 14:40:22] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:40:22] [INFO ] Invariant cache hit.
[2024-06-01 14:40:22] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1046 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 14/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/236 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 399/635 variables, 56/204 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 56/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/365 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 483/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:40:25] [INFO ] Deduced a trap composed of 22 places in 771 ms of which 9 ms to minimize.
[2024-06-01 14:40:25] [INFO ] Deduced a trap composed of 58 places in 792 ms of which 9 ms to minimize.
[2024-06-01 14:40:26] [INFO ] Deduced a trap composed of 11 places in 727 ms of which 9 ms to minimize.
[2024-06-01 14:40:27] [INFO ] Deduced a trap composed of 35 places in 816 ms of which 9 ms to minimize.
[2024-06-01 14:40:28] [INFO ] Deduced a trap composed of 13 places in 767 ms of which 8 ms to minimize.
[2024-06-01 14:40:29] [INFO ] Deduced a trap composed of 28 places in 721 ms of which 8 ms to minimize.
[2024-06-01 14:40:29] [INFO ] Deduced a trap composed of 26 places in 639 ms of which 5 ms to minimize.
[2024-06-01 14:40:30] [INFO ] Deduced a trap composed of 21 places in 465 ms of which 5 ms to minimize.
[2024-06-01 14:40:30] [INFO ] Deduced a trap composed of 24 places in 463 ms of which 5 ms to minimize.
[2024-06-01 14:40:31] [INFO ] Deduced a trap composed of 12 places in 464 ms of which 5 ms to minimize.
[2024-06-01 14:40:31] [INFO ] Deduced a trap composed of 17 places in 702 ms of which 8 ms to minimize.
[2024-06-01 14:40:32] [INFO ] Deduced a trap composed of 16 places in 626 ms of which 8 ms to minimize.
[2024-06-01 14:40:33] [INFO ] Deduced a trap composed of 15 places in 673 ms of which 8 ms to minimize.
[2024-06-01 14:40:34] [INFO ] Deduced a trap composed of 14 places in 687 ms of which 7 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 14/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1629 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 7/1636 variables, 7/1331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 7/1338 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1636 variables, 1/1339 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:40:34] [INFO ] Deduced a trap composed of 38 places in 679 ms of which 7 ms to minimize.
[2024-06-01 14:40:35] [INFO ] Deduced a trap composed of 20 places in 705 ms of which 8 ms to minimize.
[2024-06-01 14:40:36] [INFO ] Deduced a trap composed of 23 places in 630 ms of which 7 ms to minimize.
[2024-06-01 14:40:37] [INFO ] Deduced a trap composed of 25 places in 614 ms of which 7 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/1636 variables, 4/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1636 variables, 0/1343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 308/1944 variables, 364/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1944 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1944 variables, 0/1707 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1944/1944 variables, and 1707 constraints, problems are : Problem set: 0 solved, 1 unsolved in 14069 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 18/18 constraints]
After SMT, in 15132ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 9 ms.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 40 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 584/584 places, 1696/1696 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 40 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
[2024-06-01 14:40:37] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:40:37] [INFO ] Invariant cache hit.
[2024-06-01 14:40:38] [INFO ] Implicit Places using invariants in 945 ms returned []
[2024-06-01 14:40:38] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:40:38] [INFO ] Invariant cache hit.
[2024-06-01 14:40:39] [INFO ] State equation strengthened by 497 read => feed constraints.
[2024-06-01 14:40:43] [INFO ] Implicit Places using invariants and state equation in 4960 ms returned []
Implicit Place search using SMT with State Equation took 5907 ms to find 0 implicit places.
[2024-06-01 14:40:43] [INFO ] Redundant transitions in 43 ms returned []
Running 1688 sub problems to find dead transitions.
[2024-06-01 14:40:43] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:40:43] [INFO ] Invariant cache hit.
[2024-06-01 14:40:43] [INFO ] State equation strengthened by 497 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 584/584 constraints. Problems are: Problem set: 0 solved, 1688 unsolved
SMT process timed out in 30875ms, After SMT, problems are : Problem set: 0 solved, 1688 unsolved
Search for dead transitions found 0 dead transitions in 30897ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36897 ms. Remains : 584/584 places, 1696/1696 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 1285 edges and 584 vertex of which 443 / 584 are part of one of the 56 SCC in 1 ms
Free SCC test removed 387 places
Drop transitions (Empty/Sink Transition effects.) removed 774 transitions
Ensure Unique test removed 391 transitions
Reduce isomorphic transitions removed 1165 transitions.
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 55 Pre rules applied. Total rules applied 1 place count 197 transition count 476
Deduced a syphon composed of 55 places in 1 ms
Reduce places removed 55 places and 0 transitions.
Iterating global reduction 0 with 110 rules applied. Total rules applied 111 place count 142 transition count 476
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 119 place count 138 transition count 472
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 123 place count 138 transition count 468
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 24 rules applied. Total rules applied 147 place count 122 transition count 460
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 1 with 16 rules applied. Total rules applied 163 place count 114 transition count 452
Graph (trivial) has 57 edges and 114 vertex of which 57 / 114 are part of one of the 8 SCC in 0 ms
Free SCC test removed 49 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 171 place count 58 transition count 452
Drop transitions (Empty/Sink Transition effects.) removed 57 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 58 transitions.
Graph (complete) has 401 edges and 58 vertex of which 2 are kept as prefixes of interest. Removing 56 places using SCC suffix rule.0 ms
Discarding 56 places :
Also discarding 343 output transitions
Drop transitions (Output transitions of discarded places.) removed 343 transitions
Iterating post reduction 1 with 59 rules applied. Total rules applied 230 place count 2 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 49 transitions
Reduce isomorphic transitions removed 49 transitions.
Iterating post reduction 2 with 49 rules applied. Total rules applied 279 place count 2 transition count 2
Applied a total of 279 rules in 34 ms. Remains 2 /584 variables (removed 582) and now considering 2/1696 (removed 1694) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2 rows 2 cols
[2024-06-01 14:41:14] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 14:41:14] [INFO ] After 20ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 14:41:14] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-06-01 14:41:14] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 14:41:14] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 14:41:14] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 95 ms.
RANDOM walk for 40000 steps (8 resets) in 226 ms. (176 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 67 ms. (588 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 525825 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :0 out of 1
Probabilistic random walk after 525825 steps, saw 76907 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
[2024-06-01 14:41:17] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
// Phase 1: matrix 1360 rows 584 cols
[2024-06-01 14:41:17] [INFO ] Computed 23 invariants in 4 ms
[2024-06-01 14:41:17] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 399/635 variables, 56/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/635 variables, 56/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 490/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 726 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 399/635 variables, 56/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/635 variables, 56/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 490/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:41:19] [INFO ] Deduced a trap composed of 32 places in 694 ms of which 7 ms to minimize.
[2024-06-01 14:41:20] [INFO ] Deduced a trap composed of 23 places in 660 ms of which 7 ms to minimize.
[2024-06-01 14:41:21] [INFO ] Deduced a trap composed of 29 places in 623 ms of which 5 ms to minimize.
[2024-06-01 14:41:21] [INFO ] Deduced a trap composed of 22 places in 461 ms of which 6 ms to minimize.
[2024-06-01 14:41:22] [INFO ] Deduced a trap composed of 15 places in 688 ms of which 8 ms to minimize.
[2024-06-01 14:41:23] [INFO ] Deduced a trap composed of 13 places in 748 ms of which 8 ms to minimize.
[2024-06-01 14:41:23] [INFO ] Deduced a trap composed of 11 places in 718 ms of which 8 ms to minimize.
SMT process timed out in 6209ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 1696/1696 transitions.
Applied a total of 0 rules in 39 ms. Remains 584 /584 variables (removed 0) and now considering 1696/1696 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 584/584 places, 1696/1696 transitions.
RANDOM walk for 40000 steps (8 resets) in 178 ms. (223 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 475767 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 1
Probabilistic random walk after 475767 steps, saw 63730 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
[2024-06-01 14:41:27] [INFO ] Flow matrix only has 1360 transitions (discarded 336 similar events)
[2024-06-01 14:41:27] [INFO ] Invariant cache hit.
[2024-06-01 14:41:27] [INFO ] State equation strengthened by 497 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 399/635 variables, 56/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/635 variables, 56/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 490/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1629 variables, 0/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 7/1636 variables, 7/1317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1636 variables, 7/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1636 variables, 0/1324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 308/1944 variables, 364/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/1944 variables, 0/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1944/1944 variables, and 1688 constraints, problems are : Problem set: 0 solved, 1 unsolved in 738 ms.
Refiners :[Domain max(s): 584/584 constraints, Positive P Invariants (semi-flows): 23/23 constraints, State Equation: 584/584 constraints, ReadFeed: 497/497 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 64/65 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 64/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 170/236 variables, 66/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/236 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 399/635 variables, 56/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/635 variables, 56/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/635 variables, 7/253 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/635 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/635 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 637/1272 variables, 98/358 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1272 variables, 98/456 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1272 variables, 490/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1272 variables, 0/946 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 357/1629 variables, 7/953 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1629 variables, 357/1310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 14:41:29] [INFO ] Deduced a trap composed of 13 places in 791 ms of which 7 ms to minimize.
[2024-06-01 14:41:30] [INFO ] Deduced a trap composed of 14 places in 808 ms of which 9 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 12 places in 816 ms of which 8 ms to minimize.
[2024-06-01 14:41:31] [INFO ] Deduced a trap composed of 20 places in 769 ms of which 8 ms to minimize.

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Peterson-PT-7"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is Peterson-PT-7, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r514-smll-171654416900182"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-7.tgz
mv Peterson-PT-7 execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property QuasiLiveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;