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.r355-tall-171683759200633.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ShieldPPPt-PT-020B, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683759200633
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 14:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Apr 11 14:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 14:41 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Apr 11 14:41 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 376K 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

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-12
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-13
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-14
FORMULA_NAME ShieldPPPt-PT-020B-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717013654161

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPt-PT-020B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 20:14:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:14:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:14:15] [INFO ] Load time of PNML (sax parser for PT used): 210 ms
[2024-05-29 20:14:15] [INFO ] Transformed 1563 places.
[2024-05-29 20:14:15] [INFO ] Transformed 1423 transitions.
[2024-05-29 20:14:15] [INFO ] Found NUPN structural information;
[2024-05-29 20:14:15] [INFO ] Parsed PT model containing 1563 places and 1423 transitions and 3566 arcs in 403 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 14 ms.
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 76 out of 1563 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1563/1563 places, 1423/1423 transitions.
Discarding 206 places :
Symmetric choice reduction at 0 with 206 rule applications. Total rules 206 place count 1357 transition count 1217
Iterating global reduction 0 with 206 rules applied. Total rules applied 412 place count 1357 transition count 1217
Applied a total of 412 rules in 286 ms. Remains 1357 /1563 variables (removed 206) and now considering 1217/1423 (removed 206) transitions.
// Phase 1: matrix 1217 rows 1357 cols
[2024-05-29 20:14:16] [INFO ] Computed 221 invariants in 32 ms
[2024-05-29 20:14:16] [INFO ] Implicit Places using invariants in 674 ms returned []
[2024-05-29 20:14:16] [INFO ] Invariant cache hit.
[2024-05-29 20:14:17] [INFO ] Implicit Places using invariants and state equation in 1031 ms returned []
Implicit Place search using SMT with State Equation took 1735 ms to find 0 implicit places.
Running 1216 sub problems to find dead transitions.
[2024-05-29 20:14:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1356 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
SMT process timed out in 30351ms, After SMT, problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 30404ms
Starting structural reductions in LTL mode, iteration 1 : 1357/1563 places, 1217/1423 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32456 ms. Remains : 1357/1563 places, 1217/1423 transitions.
Support contains 76 out of 1357 places after structural reductions.
[2024-05-29 20:14:48] [INFO ] Flatten gal took : 105 ms
[2024-05-29 20:14:48] [INFO ] Flatten gal took : 58 ms
[2024-05-29 20:14:48] [INFO ] Input system was already deterministic with 1217 transitions.
Support contains 72 out of 1357 places (down from 76) after GAL structural reductions.
FORMULA ShieldPPPt-PT-020B-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1852 ms. (21 steps per ms) remains 8/45 properties
BEST_FIRST walk for 40004 steps (8 resets) in 193 ms. (206 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 168 ms. (236 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 104 ms. (380 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
[2024-05-29 20:14:49] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 269/285 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1357 variables, 183/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1217/2574 variables, 1357/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2574 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/2574 variables, 0/1578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2574/2574 variables, and 1578 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 221/221 constraints, State Equation: 1357/1357 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 269/285 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/285 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1357 variables, 183/221 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 20:14:52] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 35 ms to minimize.
[2024-05-29 20:14:52] [INFO ] Deduced a trap composed of 19 places in 174 ms of which 4 ms to minimize.
[2024-05-29 20:14:52] [INFO ] Deduced a trap composed of 19 places in 167 ms of which 4 ms to minimize.
[2024-05-29 20:14:52] [INFO ] Deduced a trap composed of 20 places in 155 ms of which 4 ms to minimize.
[2024-05-29 20:14:52] [INFO ] Deduced a trap composed of 19 places in 148 ms of which 3 ms to minimize.
[2024-05-29 20:14:53] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 3 ms to minimize.
[2024-05-29 20:14:53] [INFO ] Deduced a trap composed of 19 places in 145 ms of which 4 ms to minimize.
[2024-05-29 20:14:53] [INFO ] Deduced a trap composed of 20 places in 142 ms of which 3 ms to minimize.
[2024-05-29 20:14:53] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-29 20:14:53] [INFO ] Deduced a trap composed of 22 places in 134 ms of which 3 ms to minimize.
[2024-05-29 20:14:53] [INFO ] Deduced a trap composed of 24 places in 142 ms of which 3 ms to minimize.
[2024-05-29 20:14:54] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2024-05-29 20:14:54] [INFO ] Deduced a trap composed of 20 places in 130 ms of which 3 ms to minimize.
[2024-05-29 20:14:54] [INFO ] Deduced a trap composed of 27 places in 124 ms of which 3 ms to minimize.
[2024-05-29 20:14:54] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 3 ms to minimize.
[2024-05-29 20:14:54] [INFO ] Deduced a trap composed of 21 places in 108 ms of which 3 ms to minimize.
[2024-05-29 20:14:54] [INFO ] Deduced a trap composed of 17 places in 104 ms of which 2 ms to minimize.
[2024-05-29 20:14:54] [INFO ] Deduced a trap composed of 22 places in 110 ms of which 2 ms to minimize.
[2024-05-29 20:14:55] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 2 ms to minimize.
[2024-05-29 20:14:55] [INFO ] Deduced a trap composed of 36 places in 98 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 20/241 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-05-29 20:14:55] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
[2024-05-29 20:14:55] [INFO ] Deduced a trap composed of 28 places in 90 ms of which 3 ms to minimize.
[2024-05-29 20:14:55] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 2 ms to minimize.
[2024-05-29 20:14:55] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 1 ms to minimize.
[2024-05-29 20:14:55] [INFO ] Deduced a trap composed of 25 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 5/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1357 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 6262ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 16 out of 1357 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1357 transition count 942
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1082 transition count 939
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1079 transition count 939
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 154 Pre rules applied. Total rules applied 556 place count 1079 transition count 785
Deduced a syphon composed of 154 places in 1 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 3 with 308 rules applied. Total rules applied 864 place count 925 transition count 785
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 871 place count 918 transition count 778
Iterating global reduction 3 with 7 rules applied. Total rules applied 878 place count 918 transition count 778
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 878 place count 918 transition count 774
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 886 place count 914 transition count 774
Performed 328 Post agglomeration using F-continuation condition.Transition count delta: 328
Deduced a syphon composed of 328 places in 3 ms
Reduce places removed 328 places and 0 transitions.
Iterating global reduction 3 with 656 rules applied. Total rules applied 1542 place count 586 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1543 place count 586 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1545 place count 585 transition count 444
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 4 with 116 rules applied. Total rules applied 1661 place count 527 transition count 444
Partial Free-agglomeration rule applied 61 times.
Drop transitions (Partial Free agglomeration) removed 61 transitions
Iterating global reduction 4 with 61 rules applied. Total rules applied 1722 place count 527 transition count 444
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1723 place count 526 transition count 443
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1724 place count 525 transition count 443
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1724 place count 525 transition count 441
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1728 place count 523 transition count 441
Applied a total of 1728 rules in 309 ms. Remains 523 /1357 variables (removed 834) and now considering 441/1217 (removed 776) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 523/1357 places, 441/1217 transitions.
RANDOM walk for 40000 steps (8 resets) in 1747 ms. (22 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 223 ms. (178 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 250 ms. (159 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 3/3 properties
// Phase 1: matrix 441 rows 523 cols
[2024-05-29 20:14:57] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 20:14:57] [INFO ] State equation strengthened by 27 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/341 variables, 75/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 29/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/346 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/356 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 125/481 variables, 66/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/481 variables, 17/354 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/481 variables, 1/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/481 variables, 0/355 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 11/492 variables, 10/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/492 variables, 9/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/492 variables, 0/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 29/521 variables, 13/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/521 variables, 1/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/521 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 157/678 variables, 100/488 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/678 variables, 24/512 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/678 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/678 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 8/686 variables, 9/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/686 variables, 8/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/686 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 10/696 variables, 5/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/696 variables, 0/536 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 106/802 variables, 62/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/802 variables, 18/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/802 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 6/808 variables, 7/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/808 variables, 6/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/808 variables, 0/629 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 8/816 variables, 4/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/816 variables, 0/633 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 91/907 variables, 56/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/907 variables, 12/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/907 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/907 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 6/913 variables, 11/713 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/913 variables, 4/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/913 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 15/928 variables, 7/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/928 variables, 0/724 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 30/958 variables, 30/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/958 variables, 6/760 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/958 variables, 4/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/958 variables, 0/764 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 6/964 variables, 4/768 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/964 variables, 2/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/964 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 0/964 variables, 0/770 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 964/964 variables, and 770 constraints, problems are : Problem set: 0 solved, 3 unsolved in 839 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 523/523 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:14:58] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:14:58] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:14:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:14:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 109/206 variables, 97/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 135/341 variables, 75/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 29/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:14:58] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:14:58] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 2/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/346 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/356 variables, 5/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 125/481 variables, 66/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/481 variables, 17/363 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/481 variables, 1/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/481 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 11/492 variables, 10/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/492 variables, 9/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/492 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 29/521 variables, 13/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/521 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/521 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 157/678 variables, 100/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/678 variables, 24/521 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/678 variables, 2/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/678 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 8/686 variables, 9/532 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/686 variables, 8/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/686 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 10/696 variables, 5/545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/696 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 106/802 variables, 62/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/802 variables, 18/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/802 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 6/808 variables, 7/632 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/808 variables, 6/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/808 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 8/816 variables, 4/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/816 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 91/907 variables, 56/698 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/907 variables, 12/710 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/907 variables, 1/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/907 variables, 0/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 6/913 variables, 11/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/913 variables, 4/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/913 variables, 0/726 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 15/928 variables, 7/733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/928 variables, 0/733 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 30/958 variables, 30/763 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/958 variables, 6/769 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/958 variables, 4/773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/958 variables, 0/773 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 6/964 variables, 4/777 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/964 variables, 2/779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/964 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 0/964 variables, 0/779 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 964/964 variables, and 779 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1337 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 523/523 constraints, ReadFeed: 27/27 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 6/6 constraints]
After SMT, in 2189ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 233 ms.
Support contains 9 out of 523 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 523/523 places, 441/441 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 523 transition count 440
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 522 transition count 440
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 516 transition count 434
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 516 transition count 433
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 515 transition count 433
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 18 place count 513 transition count 431
Applied a total of 18 rules in 64 ms. Remains 513 /523 variables (removed 10) and now considering 431/441 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 513/523 places, 431/441 transitions.
RANDOM walk for 40000 steps (8 resets) in 472 ms. (84 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 204 ms. (195 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 189353 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :0 out of 3
Probabilistic random walk after 189353 steps, saw 151114 distinct states, run finished after 3005 ms. (steps per millisecond=63 ) properties seen :0
// Phase 1: matrix 431 rows 513 cols
[2024-05-29 20:15:02] [INFO ] Computed 220 invariants in 2 ms
[2024-05-29 20:15:02] [INFO ] State equation strengthened by 21 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 109/206 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/206 variables, 16/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 135/341 variables, 75/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 29/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/346 variables, 5/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/346 variables, 5/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/346 variables, 0/266 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/356 variables, 5/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/356 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 122/478 variables, 66/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/478 variables, 19/356 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/478 variables, 1/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/478 variables, 0/357 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 7/485 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/485 variables, 7/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/485 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 11/496 variables, 6/378 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/496 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/496 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 146/642 variables, 84/463 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/642 variables, 26/489 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/642 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/642 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 8/650 variables, 9/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/650 variables, 8/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/650 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 14/664 variables, 7/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/664 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 115/779 variables, 67/581 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/779 variables, 19/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/779 variables, 0/600 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (OVERLAPS) 5/784 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/784 variables, 5/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/784 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 8/792 variables, 4/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/792 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (OVERLAPS) 98/890 variables, 62/677 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/890 variables, 20/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/890 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (OVERLAPS) 4/894 variables, 6/703 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/894 variables, 4/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/894 variables, 0/707 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 4/898 variables, 2/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/898 variables, 0/709 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (OVERLAPS) 30/928 variables, 21/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/928 variables, 7/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/928 variables, 0/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (OVERLAPS) 1/929 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/929 variables, 1/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/929 variables, 0/739 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 2/931 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/931 variables, 0/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (OVERLAPS) 13/944 variables, 10/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/944 variables, 4/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/944 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (OVERLAPS) 0/944 variables, 0/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 944/944 variables, and 754 constraints, problems are : Problem set: 0 solved, 3 unsolved in 949 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 513/513 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:03] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 4 ms to minimize.
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 109/206 variables, 97/137 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/206 variables, 16/153 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/206 variables, 1/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/206 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 135/341 variables, 75/229 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 29/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/341 variables, 3/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/341 variables, 2/263 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:04] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/341 variables, 1/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/341 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/346 variables, 5/269 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/346 variables, 5/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/346 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/356 variables, 5/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/356 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 122/478 variables, 66/345 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/478 variables, 19/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/478 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/478 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 7/485 variables, 8/373 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/485 variables, 7/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/485 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 11/496 variables, 6/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/496 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/496 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 146/642 variables, 84/471 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/642 variables, 26/497 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/642 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/642 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (OVERLAPS) 8/650 variables, 9/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/650 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/650 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (OVERLAPS) 14/664 variables, 7/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/664 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 115/779 variables, 67/589 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/779 variables, 19/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/779 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (OVERLAPS) 5/784 variables, 6/614 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/784 variables, 5/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/784 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (OVERLAPS) 8/792 variables, 4/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/792 variables, 0/623 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 98/890 variables, 62/685 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/890 variables, 20/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/890 variables, 0/705 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (OVERLAPS) 4/894 variables, 6/711 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/894 variables, 4/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/894 variables, 0/715 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 4/898 variables, 2/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/898 variables, 0/717 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 30/928 variables, 21/738 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/928 variables, 7/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/928 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 1/929 variables, 1/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/929 variables, 1/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/929 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 2/931 variables, 1/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/931 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (OVERLAPS) 13/944 variables, 10/758 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/944 variables, 4/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/944 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 0/944 variables, 0/762 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 944/944 variables, and 762 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1540 ms.
Refiners :[Positive P Invariants (semi-flows): 220/220 constraints, State Equation: 513/513 constraints, ReadFeed: 21/21 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 2500ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 257 ms.
Support contains 9 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 23 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 513/513 places, 431/431 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 431/431 transitions.
Applied a total of 0 rules in 13 ms. Remains 513 /513 variables (removed 0) and now considering 431/431 (removed 0) transitions.
[2024-05-29 20:15:05] [INFO ] Invariant cache hit.
[2024-05-29 20:15:06] [INFO ] Implicit Places using invariants in 278 ms returned [496, 500]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 292 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 511/513 places, 431/431 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 509 transition count 429
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 509 transition count 429
Applied a total of 4 rules in 19 ms. Remains 509 /511 variables (removed 2) and now considering 429/431 (removed 2) transitions.
// Phase 1: matrix 429 rows 509 cols
[2024-05-29 20:15:06] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 20:15:06] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-29 20:15:06] [INFO ] Invariant cache hit.
[2024-05-29 20:15:06] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 20:15:06] [INFO ] Implicit Places using invariants and state equation in 559 ms returned []
Implicit Place search using SMT with State Equation took 855 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 509/513 places, 429/431 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1182 ms. Remains : 509/513 places, 429/431 transitions.
RANDOM walk for 40000 steps (8 resets) in 396 ms. (100 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 192 ms. (207 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 142 ms. (279 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 227389 steps, run timeout after 3001 ms. (steps per millisecond=75 ) properties seen :0 out of 3
Probabilistic random walk after 227389 steps, saw 182708 distinct states, run finished after 3004 ms. (steps per millisecond=75 ) properties seen :0
[2024-05-29 20:15:10] [INFO ] Invariant cache hit.
[2024-05-29 20:15:10] [INFO ] State equation strengthened by 19 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 108/205 variables, 97/133 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/205 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 133/338 variables, 73/221 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/338 variables, 28/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/338 variables, 3/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/343 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/343 variables, 5/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/343 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 10/353 variables, 5/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/353 variables, 0/267 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 121/474 variables, 66/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 20/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 6/480 variables, 7/360 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/480 variables, 6/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/480 variables, 0/366 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 10/490 variables, 5/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/490 variables, 0/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 146/636 variables, 84/455 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/636 variables, 26/481 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/636 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/636 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 8/644 variables, 9/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/644 variables, 8/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/644 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (OVERLAPS) 14/658 variables, 7/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/658 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 34 (OVERLAPS) 115/773 variables, 67/573 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/773 variables, 19/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/773 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (OVERLAPS) 5/778 variables, 6/598 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/778 variables, 5/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/778 variables, 0/603 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 8/786 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/786 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 98/884 variables, 62/669 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/884 variables, 20/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/884 variables, 0/689 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 4/888 variables, 6/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/888 variables, 4/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/888 variables, 0/699 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 4/892 variables, 2/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/892 variables, 0/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 30/922 variables, 21/722 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/922 variables, 7/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/922 variables, 0/729 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (OVERLAPS) 1/923 variables, 1/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/923 variables, 1/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/923 variables, 0/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (OVERLAPS) 2/925 variables, 1/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/925 variables, 0/732 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (OVERLAPS) 13/938 variables, 10/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (INCLUDED_ONLY) 0/938 variables, 4/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/938 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (OVERLAPS) 0/938 variables, 0/746 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 746 constraints, problems are : Problem set: 0 solved, 3 unsolved in 871 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 44/53 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 44/97 variables, 19/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 1 ms to minimize.
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 3/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 108/205 variables, 97/136 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/205 variables, 15/151 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/205 variables, 1/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/205 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 133/338 variables, 73/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/338 variables, 28/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/338 variables, 3/256 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/338 variables, 2/258 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 2 ms to minimize.
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/338 variables, 2/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/338 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 5/343 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/343 variables, 5/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/343 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 10/353 variables, 5/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/353 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 121/474 variables, 66/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/474 variables, 20/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/474 variables, 0/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 6/480 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/480 variables, 6/374 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
At refinement iteration 26 (INCLUDED_ONLY) 0/480 variables, 1/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/480 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 10/490 variables, 5/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:11] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/490 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/490 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 146/636 variables, 84/465 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/636 variables, 26/491 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/636 variables, 1/492 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:12] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
At refinement iteration 34 (INCLUDED_ONLY) 0/636 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/636 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 36 (OVERLAPS) 8/644 variables, 9/502 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/644 variables, 8/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:12] [INFO ] Deduced a trap composed of 5 places in 60 ms of which 1 ms to minimize.
At refinement iteration 38 (INCLUDED_ONLY) 0/644 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/644 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 40 (OVERLAPS) 14/658 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/658 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 42 (OVERLAPS) 115/773 variables, 67/585 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/773 variables, 19/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/773 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 45 (OVERLAPS) 5/778 variables, 6/610 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/778 variables, 5/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/778 variables, 0/615 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 48 (OVERLAPS) 8/786 variables, 4/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/786 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 50 (OVERLAPS) 98/884 variables, 62/681 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/884 variables, 20/701 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-29 20:15:12] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 2 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/884 variables, 1/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/884 variables, 0/702 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 54 (OVERLAPS) 4/888 variables, 6/708 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/888 variables, 4/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/888 variables, 0/712 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 57 (OVERLAPS) 4/892 variables, 2/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 58 (INCLUDED_ONLY) 0/892 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 59 (OVERLAPS) 30/922 variables, 21/735 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/922 variables, 7/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 61 (INCLUDED_ONLY) 0/922 variables, 0/742 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 62 (OVERLAPS) 1/923 variables, 1/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/923 variables, 1/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 64 (INCLUDED_ONLY) 0/923 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 65 (OVERLAPS) 2/925 variables, 1/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 66 (INCLUDED_ONLY) 0/925 variables, 0/745 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 67 (OVERLAPS) 13/938 variables, 10/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 68 (INCLUDED_ONLY) 0/938 variables, 4/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/938 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 70 (OVERLAPS) 0/938 variables, 0/759 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 759 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1935 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints]
After SMT, in 2819ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 335 ms.
Support contains 9 out of 509 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 429/429 transitions.
Applied a total of 0 rules in 12 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 509/509 places, 429/429 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 509/509 places, 429/429 transitions.
Applied a total of 0 rules in 10 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
[2024-05-29 20:15:13] [INFO ] Invariant cache hit.
[2024-05-29 20:15:13] [INFO ] Implicit Places using invariants in 266 ms returned []
[2024-05-29 20:15:13] [INFO ] Invariant cache hit.
[2024-05-29 20:15:13] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-29 20:15:14] [INFO ] Implicit Places using invariants and state equation in 511 ms returned []
Implicit Place search using SMT with State Equation took 781 ms to find 0 implicit places.
[2024-05-29 20:15:14] [INFO ] Redundant transitions in 25 ms returned []
Running 421 sub problems to find dead transitions.
[2024-05-29 20:15:14] [INFO ] Invariant cache hit.
[2024-05-29 20:15:14] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:15:17] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-29 20:15:17] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:15:17] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2024-05-29 20:15:17] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-29 20:15:17] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-29 20:15:18] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-29 20:15:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:15:18] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-29 20:15:18] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 3 ms to minimize.
[2024-05-29 20:15:18] [INFO ] Deduced a trap composed of 6 places in 32 ms of which 1 ms to minimize.
[2024-05-29 20:15:18] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-29 20:15:18] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 0 ms to minimize.
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 2 ms to minimize.
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 2 ms to minimize.
[2024-05-29 20:15:19] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 20/205 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 8 places in 80 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 7 places in 63 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-29 20:15:21] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 7 places in 48 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:15:22] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 20/225 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:25] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (OVERLAPS) 6/509 variables, 33/259 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 0 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-29 20:15:30] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-29 20:15:31] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 1 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-29 20:15:33] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 13/272 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:38] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 1/273 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:41] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/509 variables, 1/274 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 509/938 variables, and 274 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 0/509 constraints, ReadFeed: 0/19 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 56/56 constraints]
Escalating to Integer solving :Problem set: 0 solved, 421 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/503 variables, 185/185 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/503 variables, 47/232 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:45] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:15:45] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-29 20:15:45] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 20:15:45] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-29 20:15:45] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/503 variables, 5/237 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 4 (OVERLAPS) 6/509 variables, 33/270 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/509 variables, 9/279 constraints. Problems are: Problem set: 0 solved, 421 unsolved
[2024-05-29 20:15:52] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-05-29 20:15:52] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 20:15:52] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 1 ms to minimize.
[2024-05-29 20:15:52] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-29 20:15:52] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 2 ms to minimize.
[2024-05-29 20:15:52] [INFO ] Deduced a trap composed of 3 places in 69 ms of which 2 ms to minimize.
[2024-05-29 20:15:53] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/509 variables, 7/286 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/509 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 8 (OVERLAPS) 429/938 variables, 509/795 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/938 variables, 19/814 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/938 variables, 421/1235 constraints. Problems are: Problem set: 0 solved, 421 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/938 variables, 0/1235 constraints. Problems are: Problem set: 0 solved, 421 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 938/938 variables, and 1235 constraints, problems are : Problem set: 0 solved, 421 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 218/218 constraints, State Equation: 509/509 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 421/421 constraints, Known Traps: 68/68 constraints]
After SMT, in 60100ms problems are : Problem set: 0 solved, 421 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60932 ms. Remains : 509/509 places, 429/429 transitions.
Attempting over-approximation, by ignoring read arcs.
Partial Free-agglomeration rule applied 117 times.
Drop transitions (Partial Free agglomeration) removed 117 transitions
Iterating global reduction 0 with 117 rules applied. Total rules applied 117 place count 509 transition count 429
Applied a total of 117 rules in 23 ms. Remains 509 /509 variables (removed 0) and now considering 429/429 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 429 rows 509 cols
[2024-05-29 20:16:14] [INFO ] Computed 218 invariants in 2 ms
[2024-05-29 20:16:14] [INFO ] [Real]Absence check using 218 positive place invariants in 25 ms returned sat
[2024-05-29 20:16:14] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 20:16:14] [INFO ] [Nat]Absence check using 218 positive place invariants in 25 ms returned sat
[2024-05-29 20:16:14] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 20:16:14] [INFO ] State equation strengthened by 115 read => feed constraints.
[2024-05-29 20:16:14] [INFO ] After 126ms SMT Verify possible using 115 Read/Feed constraints in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 6 places in 85 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 1 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 4 places in 79 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-05-29 20:16:15] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
[2024-05-29 20:16:16] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-05-29 20:16:16] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1149 ms
[2024-05-29 20:16:16] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 1 ms to minimize.
[2024-05-29 20:16:16] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 2 ms to minimize.
[2024-05-29 20:16:16] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 214 ms
TRAPS : Iteration 1
[2024-05-29 20:16:16] [INFO ] Deduced a trap composed of 3 places in 75 ms of which 2 ms to minimize.
[2024-05-29 20:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 119 ms
TRAPS : Iteration 2
[2024-05-29 20:16:16] [INFO ] After 1932ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-29 20:16:16] [INFO ] After 2306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 2460 ms.
[2024-05-29 20:16:16] [INFO ] Flatten gal took : 50 ms
[2024-05-29 20:16:16] [INFO ] Flatten gal took : 42 ms
[2024-05-29 20:16:17] [INFO ] Input system was already deterministic with 1217 transitions.
Computed a total of 324 stabilizing places and 324 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1356 transition count 933
Reduce places removed 283 places and 0 transitions.
Iterating post reduction 1 with 283 rules applied. Total rules applied 566 place count 1073 transition count 933
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 154 Pre rules applied. Total rules applied 566 place count 1073 transition count 779
Deduced a syphon composed of 154 places in 0 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 2 with 308 rules applied. Total rules applied 874 place count 919 transition count 779
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 886 place count 907 transition count 767
Iterating global reduction 2 with 12 rules applied. Total rules applied 898 place count 907 transition count 767
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 898 place count 907 transition count 758
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 916 place count 898 transition count 758
Performed 315 Post agglomeration using F-continuation condition.Transition count delta: 315
Deduced a syphon composed of 315 places in 1 ms
Reduce places removed 315 places and 0 transitions.
Iterating global reduction 2 with 630 rules applied. Total rules applied 1546 place count 583 transition count 443
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1547 place count 583 transition count 442
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1549 place count 582 transition count 441
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1551 place count 580 transition count 439
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1552 place count 579 transition count 439
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 1552 place count 579 transition count 437
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1556 place count 577 transition count 437
Applied a total of 1556 rules in 149 ms. Remains 577 /1357 variables (removed 780) and now considering 437/1217 (removed 780) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 149 ms. Remains : 577/1357 places, 437/1217 transitions.
[2024-05-29 20:16:17] [INFO ] Flatten gal took : 18 ms
[2024-05-29 20:16:17] [INFO ] Flatten gal took : 16 ms
[2024-05-29 20:16:17] [INFO ] Input system was already deterministic with 437 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 154 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 155 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 20:16:17] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:16:17] [INFO ] Flatten gal took : 30 ms
[2024-05-29 20:16:17] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 160 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 160 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 20:16:17] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:16:17] [INFO ] Flatten gal took : 29 ms
[2024-05-29 20:16:17] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 1346 transition count 1206
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1344 transition count 1204
Applied a total of 26 rules in 161 ms. Remains 1344 /1357 variables (removed 13) and now considering 1204/1217 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 1344/1357 places, 1204/1217 transitions.
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 28 ms
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 27 ms
[2024-05-29 20:16:18] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 161 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:16:18] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1343 transition count 1203
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1343 transition count 1203
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1342 transition count 1202
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1342 transition count 1202
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1341 transition count 1201
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1341 transition count 1201
Applied a total of 32 rules in 158 ms. Remains 1341 /1357 variables (removed 16) and now considering 1201/1217 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 158 ms. Remains : 1341/1357 places, 1201/1217 transitions.
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 25 ms
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:16:18] [INFO ] Input system was already deterministic with 1201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1344 transition count 1204
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1344 transition count 1204
Applied a total of 26 rules in 77 ms. Remains 1344 /1357 variables (removed 13) and now considering 1204/1217 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 78 ms. Remains : 1344/1357 places, 1204/1217 transitions.
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:16:18] [INFO ] Flatten gal took : 24 ms
[2024-05-29 20:16:18] [INFO ] Input system was already deterministic with 1204 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1347 transition count 1207
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1347 transition count 1207
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 1346 transition count 1206
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 1346 transition count 1206
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 1345 transition count 1205
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 1345 transition count 1205
Applied a total of 24 rules in 172 ms. Remains 1345 /1357 variables (removed 12) and now considering 1205/1217 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 172 ms. Remains : 1345/1357 places, 1205/1217 transitions.
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 24 ms
[2024-05-29 20:16:19] [INFO ] Input system was already deterministic with 1205 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 275 transitions
Trivial Post-agglo rules discarded 275 transitions
Performed 275 trivial Post agglomeration. Transition count delta: 275
Iterating post reduction 0 with 275 rules applied. Total rules applied 275 place count 1356 transition count 941
Reduce places removed 275 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 278 rules applied. Total rules applied 553 place count 1081 transition count 938
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 556 place count 1078 transition count 938
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 556 place count 1078 transition count 785
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 862 place count 925 transition count 785
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 873 place count 914 transition count 774
Iterating global reduction 3 with 11 rules applied. Total rules applied 884 place count 914 transition count 774
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 884 place count 914 transition count 765
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 902 place count 905 transition count 765
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Deduced a syphon composed of 316 places in 0 ms
Reduce places removed 316 places and 0 transitions.
Iterating global reduction 3 with 632 rules applied. Total rules applied 1534 place count 589 transition count 449
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1536 place count 587 transition count 447
Applied a total of 1536 rules in 129 ms. Remains 587 /1357 variables (removed 770) and now considering 447/1217 (removed 770) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 129 ms. Remains : 587/1357 places, 447/1217 transitions.
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:16:19] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 280 transitions
Trivial Post-agglo rules discarded 280 transitions
Performed 280 trivial Post agglomeration. Transition count delta: 280
Iterating post reduction 0 with 280 rules applied. Total rules applied 280 place count 1356 transition count 936
Reduce places removed 280 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 281 rules applied. Total rules applied 561 place count 1076 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 1075 transition count 935
Performed 155 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 155 Pre rules applied. Total rules applied 562 place count 1075 transition count 780
Deduced a syphon composed of 155 places in 1 ms
Reduce places removed 155 places and 0 transitions.
Iterating global reduction 3 with 310 rules applied. Total rules applied 872 place count 920 transition count 780
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 882 place count 910 transition count 770
Iterating global reduction 3 with 10 rules applied. Total rules applied 892 place count 910 transition count 770
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 892 place count 910 transition count 763
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 906 place count 903 transition count 763
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 3 with 620 rules applied. Total rules applied 1526 place count 593 transition count 453
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1527 place count 593 transition count 452
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1529 place count 592 transition count 451
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1531 place count 590 transition count 449
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1532 place count 589 transition count 449
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1532 place count 589 transition count 447
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1536 place count 587 transition count 447
Applied a total of 1536 rules in 131 ms. Remains 587 /1357 variables (removed 770) and now considering 447/1217 (removed 770) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 131 ms. Remains : 587/1357 places, 447/1217 transitions.
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 11 ms
[2024-05-29 20:16:19] [INFO ] Input system was already deterministic with 447 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 281 transitions
Trivial Post-agglo rules discarded 281 transitions
Performed 281 trivial Post agglomeration. Transition count delta: 281
Iterating post reduction 0 with 281 rules applied. Total rules applied 281 place count 1357 transition count 936
Reduce places removed 281 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 282 rules applied. Total rules applied 563 place count 1076 transition count 935
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 564 place count 1075 transition count 935
Performed 151 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 151 Pre rules applied. Total rules applied 564 place count 1075 transition count 784
Deduced a syphon composed of 151 places in 1 ms
Reduce places removed 151 places and 0 transitions.
Iterating global reduction 3 with 302 rules applied. Total rules applied 866 place count 924 transition count 784
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 877 place count 913 transition count 773
Iterating global reduction 3 with 11 rules applied. Total rules applied 888 place count 913 transition count 773
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 888 place count 913 transition count 764
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 906 place count 904 transition count 764
Performed 318 Post agglomeration using F-continuation condition.Transition count delta: 318
Deduced a syphon composed of 318 places in 0 ms
Reduce places removed 318 places and 0 transitions.
Iterating global reduction 3 with 636 rules applied. Total rules applied 1542 place count 586 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1543 place count 586 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1545 place count 585 transition count 444
Applied a total of 1545 rules in 113 ms. Remains 585 /1357 variables (removed 772) and now considering 444/1217 (removed 773) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 113 ms. Remains : 585/1357 places, 444/1217 transitions.
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 15 ms
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 15 ms
[2024-05-29 20:16:19] [INFO ] Input system was already deterministic with 444 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1345 transition count 1205
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1345 transition count 1205
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 1344 transition count 1204
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 1344 transition count 1204
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 1343 transition count 1203
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 1343 transition count 1203
Applied a total of 28 rules in 161 ms. Remains 1343 /1357 variables (removed 14) and now considering 1203/1217 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 161 ms. Remains : 1343/1357 places, 1203/1217 transitions.
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:16:19] [INFO ] Flatten gal took : 26 ms
[2024-05-29 20:16:19] [INFO ] Input system was already deterministic with 1203 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1357/1357 places, 1217/1217 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 283 transitions
Trivial Post-agglo rules discarded 283 transitions
Performed 283 trivial Post agglomeration. Transition count delta: 283
Iterating post reduction 0 with 283 rules applied. Total rules applied 283 place count 1356 transition count 933
Reduce places removed 283 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 284 rules applied. Total rules applied 567 place count 1073 transition count 932
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 568 place count 1072 transition count 932
Performed 153 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 153 Pre rules applied. Total rules applied 568 place count 1072 transition count 779
Deduced a syphon composed of 153 places in 1 ms
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 3 with 306 rules applied. Total rules applied 874 place count 919 transition count 779
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 885 place count 908 transition count 768
Iterating global reduction 3 with 11 rules applied. Total rules applied 896 place count 908 transition count 768
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 896 place count 908 transition count 760
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 912 place count 900 transition count 760
Performed 311 Post agglomeration using F-continuation condition.Transition count delta: 311
Deduced a syphon composed of 311 places in 1 ms
Reduce places removed 311 places and 0 transitions.
Iterating global reduction 3 with 622 rules applied. Total rules applied 1534 place count 589 transition count 449
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1535 place count 589 transition count 448
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1537 place count 588 transition count 447
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1539 place count 586 transition count 445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1540 place count 585 transition count 445
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 1540 place count 585 transition count 443
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1544 place count 583 transition count 443
Applied a total of 1544 rules in 126 ms. Remains 583 /1357 variables (removed 774) and now considering 443/1217 (removed 774) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 126 ms. Remains : 583/1357 places, 443/1217 transitions.
[2024-05-29 20:16:20] [INFO ] Flatten gal took : 10 ms
[2024-05-29 20:16:20] [INFO ] Flatten gal took : 11 ms
[2024-05-29 20:16:20] [INFO ] Input system was already deterministic with 443 transitions.
[2024-05-29 20:16:20] [INFO ] Flatten gal took : 23 ms
[2024-05-29 20:16:20] [INFO ] Flatten gal took : 24 ms
[2024-05-29 20:16:20] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-29 20:16:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1357 places, 1217 transitions and 3154 arcs took 6 ms.
Total runtime 124875 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldPPPt-PT-020B

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 1357
TRANSITIONS: 1217
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.015s, Sys 0.008s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.004s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

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

Process ID: 1009
MODEL NAME: /home/mcc/execution/412/model
1357 places, 1217 transitions.

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

BK_TIME_CONFINEMENT_REACHED

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

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

MEDDLY ERROR: Insufficient memory

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="ShieldPPPt-PT-020B"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ShieldPPPt-PT-020B, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r355-tall-171683759200633"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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