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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K 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:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 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 364K 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 ShieldRVt-PT-030B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-030B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717276641086

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:17:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:17:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:17:22] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-06-01 21:17:22] [INFO ] Transformed 1503 places.
[2024-06-01 21:17:22] [INFO ] Transformed 1503 transitions.
[2024-06-01 21:17:22] [INFO ] Found NUPN structural information;
[2024-06-01 21:17:22] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 260 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 12 ms.
Support contains 121 out of 1503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Discarding 297 places :
Symmetric choice reduction at 0 with 297 rule applications. Total rules 297 place count 1206 transition count 1206
Iterating global reduction 0 with 297 rules applied. Total rules applied 594 place count 1206 transition count 1206
Applied a total of 594 rules in 251 ms. Remains 1206 /1503 variables (removed 297) and now considering 1206/1503 (removed 297) transitions.
// Phase 1: matrix 1206 rows 1206 cols
[2024-06-01 21:17:22] [INFO ] Computed 121 invariants in 32 ms
[2024-06-01 21:17:23] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-06-01 21:17:23] [INFO ] Invariant cache hit.
[2024-06-01 21:17:24] [INFO ] Implicit Places using invariants and state equation in 760 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
Running 1205 sub problems to find dead transitions.
[2024-06-01 21:17:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1205 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1205 unsolved
SMT process timed out in 30334ms, After SMT, problems are : Problem set: 0 solved, 1205 unsolved
Search for dead transitions found 0 dead transitions in 30361ms
Starting structural reductions in LTL mode, iteration 1 : 1206/1503 places, 1206/1503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31909 ms. Remains : 1206/1503 places, 1206/1503 transitions.
Support contains 121 out of 1206 places after structural reductions.
[2024-06-01 21:17:54] [INFO ] Flatten gal took : 94 ms
[2024-06-01 21:17:54] [INFO ] Flatten gal took : 52 ms
[2024-06-01 21:17:55] [INFO ] Input system was already deterministic with 1206 transitions.
Support contains 113 out of 1206 places (down from 121) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 1825 ms. (21 steps per ms) remains 33/68 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 40 ms. (97 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 36 ms. (108 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 33/33 properties
[2024-06-01 21:17:56] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 422/475 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (OVERLAPS) 731/1206 variables, 80/121 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1206 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1206/2412 variables, 1206/1327 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2412 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 0/2412 variables, 0/1327 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2412/2412 variables, and 1327 constraints, problems are : Problem set: 0 solved, 33 unsolved in 3452 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 422/475 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 21:17:59] [INFO ] Deduced a trap composed of 42 places in 58 ms of which 11 ms to minimize.
[2024-06-01 21:18:00] [INFO ] Deduced a trap composed of 29 places in 61 ms of which 1 ms to minimize.
[2024-06-01 21:18:00] [INFO ] Deduced a trap composed of 35 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/475 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/475 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (OVERLAPS) 731/1206 variables, 80/124 constraints. Problems are: Problem set: 0 solved, 33 unsolved
[2024-06-01 21:18:00] [INFO ] Deduced a trap composed of 29 places in 107 ms of which 3 ms to minimize.
[2024-06-01 21:18:00] [INFO ] Deduced a trap composed of 38 places in 101 ms of which 3 ms to minimize.
[2024-06-01 21:18:01] [INFO ] Deduced a trap composed of 22 places in 185 ms of which 4 ms to minimize.
[2024-06-01 21:18:01] [INFO ] Deduced a trap composed of 36 places in 100 ms of which 2 ms to minimize.
[2024-06-01 21:18:01] [INFO ] Deduced a trap composed of 27 places in 110 ms of which 2 ms to minimize.
[2024-06-01 21:18:01] [INFO ] Deduced a trap composed of 42 places in 153 ms of which 2 ms to minimize.
[2024-06-01 21:18:01] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-06-01 21:18:01] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2024-06-01 21:18:01] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 1 ms to minimize.
[2024-06-01 21:18:02] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:18:02] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-06-01 21:18:02] [INFO ] Deduced a trap composed of 29 places in 81 ms of which 2 ms to minimize.
[2024-06-01 21:18:02] [INFO ] Deduced a trap composed of 27 places in 83 ms of which 2 ms to minimize.
[2024-06-01 21:18:02] [INFO ] Deduced a trap composed of 28 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:18:02] [INFO ] Deduced a trap composed of 49 places in 82 ms of which 2 ms to minimize.
[2024-06-01 21:18:03] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
[2024-06-01 21:18:03] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1206 variables, 17/141 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1206 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 33 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2412/2412 variables, and 1347 constraints, problems are : Problem set: 0 solved, 33 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1206/1206 constraints, PredecessorRefiner: 0/33 constraints, Known Traps: 20/20 constraints]
After SMT, in 8497ms problems are : Problem set: 0 solved, 33 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 1206 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 296 transitions
Trivial Post-agglo rules discarded 296 transitions
Performed 296 trivial Post agglomeration. Transition count delta: 296
Iterating post reduction 0 with 296 rules applied. Total rules applied 296 place count 1206 transition count 910
Reduce places removed 296 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 309 rules applied. Total rules applied 605 place count 910 transition count 897
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 618 place count 897 transition count 897
Performed 206 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 206 Pre rules applied. Total rules applied 618 place count 897 transition count 691
Deduced a syphon composed of 206 places in 3 ms
Reduce places removed 206 places and 0 transitions.
Iterating global reduction 3 with 412 rules applied. Total rules applied 1030 place count 691 transition count 691
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1042 place count 679 transition count 679
Iterating global reduction 3 with 12 rules applied. Total rules applied 1054 place count 679 transition count 679
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 1054 place count 679 transition count 669
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 1074 place count 669 transition count 669
Performed 274 Post agglomeration using F-continuation condition.Transition count delta: 274
Deduced a syphon composed of 274 places in 1 ms
Reduce places removed 274 places and 0 transitions.
Iterating global reduction 3 with 548 rules applied. Total rules applied 1622 place count 395 transition count 395
Renaming transitions due to excessive name length > 1024 char.
Performed 69 Post agglomeration using F-continuation condition.Transition count delta: -52
Deduced a syphon composed of 69 places in 1 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 1760 place count 326 transition count 447
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1761 place count 326 transition count 446
Free-agglomeration rule applied 7 times.
Iterating global reduction 4 with 7 rules applied. Total rules applied 1768 place count 326 transition count 439
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1775 place count 319 transition count 439
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1778 place count 319 transition count 436
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1779 place count 319 transition count 436
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1780 place count 318 transition count 435
Applied a total of 1780 rules in 237 ms. Remains 318 /1206 variables (removed 888) and now considering 435/1206 (removed 771) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 237 ms. Remains : 318/1206 places, 435/1206 transitions.
RANDOM walk for 40000 steps (19 resets) in 602 ms. (66 steps per ms) remains 17/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
// Phase 1: matrix 435 rows 318 cols
[2024-06-01 21:18:05] [INFO ] Computed 121 invariants in 1 ms
[2024-06-01 21:18:05] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 70/101 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 17/118 variables, 5/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 202/320 variables, 118/149 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/320 variables, 10/159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 254/574 variables, 109/268 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/574 variables, 47/315 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/574 variables, 8/323 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 0/323 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (OVERLAPS) 9/583 variables, 6/329 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/583 variables, 3/332 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/583 variables, 0/332 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 108/691 variables, 57/389 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/691 variables, 23/412 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/691 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 3/694 variables, 2/414 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/694 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/694 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 39/733 variables, 18/433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/733 variables, 6/439 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/733 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 3/736 variables, 2/441 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/736 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/736 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 16/752 variables, 10/452 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/752 variables, 3/455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/752 variables, 0/455 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (OVERLAPS) 1/753 variables, 1/456 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/753 variables, 1/457 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/753 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 0/753 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 753/753 variables, and 457 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 318/318 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 70/101 variables, 26/26 constraints. Problems are: Problem set: 0 solved, 17 unsolved
[2024-06-01 21:18:06] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/101 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/101 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 17/118 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 202/320 variables, 118/150 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/320 variables, 10/160 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/320 variables, 12/172 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/320 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 254/574 variables, 109/281 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/574 variables, 47/328 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/574 variables, 8/336 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/574 variables, 5/341 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/574 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 15 (OVERLAPS) 9/583 variables, 6/347 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/583 variables, 3/350 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/583 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 18 (OVERLAPS) 108/691 variables, 57/407 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/691 variables, 23/430 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/691 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 21 (OVERLAPS) 3/694 variables, 2/432 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/694 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/694 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 24 (OVERLAPS) 39/733 variables, 18/451 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/733 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/733 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 27 (OVERLAPS) 3/736 variables, 2/459 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/736 variables, 1/460 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/736 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 30 (OVERLAPS) 16/752 variables, 10/470 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/752 variables, 3/473 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/752 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 33 (OVERLAPS) 1/753 variables, 1/474 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/753 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/753 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 36 (OVERLAPS) 0/753 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 753/753 variables, and 475 constraints, problems are : Problem set: 0 solved, 17 unsolved in 2657 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 318/318 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 1/1 constraints]
After SMT, in 4338ms problems are : Problem set: 0 solved, 17 unsolved
Fused 17 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 906 ms.
Support contains 31 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 435/435 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 318 transition count 431
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 314 transition count 431
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 8 place count 314 transition count 420
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 30 place count 303 transition count 420
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 46 place count 295 transition count 412
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 68 place count 284 transition count 426
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 69 place count 284 transition count 425
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 283 transition count 424
Applied a total of 70 rules in 57 ms. Remains 283 /318 variables (removed 35) and now considering 424/435 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 283/318 places, 424/435 transitions.
RANDOM walk for 40000 steps (17 resets) in 454 ms. (87 steps per ms) remains 7/17 properties
BEST_FIRST walk for 40004 steps (8 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (9 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 99 ms. (400 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 92 ms. (430 steps per ms) remains 6/6 properties
// Phase 1: matrix 424 rows 283 cols
[2024-06-01 21:18:10] [INFO ] Computed 121 invariants in 2 ms
[2024-06-01 21:18:10] [INFO ] State equation strengthened by 18 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/53 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 121/178 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 268/446 variables, 100/183 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 46/229 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 7/453 variables, 4/239 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/453 variables, 1/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/453 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 164/617 variables, 77/317 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/617 variables, 31/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/617 variables, 0/348 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 6/623 variables, 4/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/623 variables, 4/356 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/623 variables, 0/356 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (OVERLAPS) 59/682 variables, 29/385 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/682 variables, 11/396 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/682 variables, 3/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/682 variables, 0/399 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (OVERLAPS) 3/685 variables, 2/401 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/685 variables, 3/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/685 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (OVERLAPS) 19/704 variables, 10/414 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/704 variables, 5/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/704 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (OVERLAPS) 3/707 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/707 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/707 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (OVERLAPS) 0/707 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 707/707 variables, and 422 constraints, problems are : Problem set: 0 solved, 6 unsolved in 594 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 283/283 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 39/53 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 4/57 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 121/178 variables, 57/74 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 9/83 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/178 variables, 3/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/178 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 268/446 variables, 100/186 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 46/232 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 6/238 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 3/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/446 variables, 0/241 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 7/453 variables, 4/245 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/453 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/453 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 164/617 variables, 77/323 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/617 variables, 31/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/617 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 6/623 variables, 4/358 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/623 variables, 4/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/623 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 23 (OVERLAPS) 59/682 variables, 29/391 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/682 variables, 11/402 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/682 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/682 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 3/685 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/685 variables, 3/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/685 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 30 (OVERLAPS) 19/704 variables, 10/420 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/704 variables, 5/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/704 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 33 (OVERLAPS) 3/707 variables, 2/427 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/707 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/707 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 36 (OVERLAPS) 0/707 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 707/707 variables, and 428 constraints, problems are : Problem set: 0 solved, 6 unsolved in 802 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 283/283 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 1411ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 1087 ms.
Support contains 14 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 424/424 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 283 transition count 421
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 280 transition count 421
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 6 place count 280 transition count 412
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 24 place count 271 transition count 412
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 30 place count 268 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -7
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 42 place count 262 transition count 416
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 44 place count 262 transition count 414
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 261 transition count 413
Applied a total of 45 rules in 34 ms. Remains 261 /283 variables (removed 22) and now considering 413/424 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 261/283 places, 413/424 transitions.
RANDOM walk for 40000 steps (20 resets) in 341 ms. (116 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (9 resets) in 117 ms. (339 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (11 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
// Phase 1: matrix 413 rows 261 cols
[2024-06-01 21:18:13] [INFO ] Computed 121 invariants in 1 ms
[2024-06-01 21:18:13] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 110/160 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 247/407 variables, 94/169 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/407 variables, 47/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 6/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 123/530 variables, 58/280 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/530 variables, 29/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/530 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 45/575 variables, 18/327 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/575 variables, 9/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/575 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 43/618 variables, 16/352 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/618 variables, 8/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/618 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 41/659 variables, 16/376 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/659 variables, 7/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/659 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 1/660 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/660 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/660 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (OVERLAPS) 14/674 variables, 8/393 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/674 variables, 4/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/674 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (OVERLAPS) 0/674 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 397 constraints, problems are : Problem set: 0 solved, 5 unsolved in 482 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 261/261 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 33/46 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/50 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 110/160 variables, 50/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 9/75 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/160 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 247/407 variables, 94/171 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/407 variables, 47/218 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/407 variables, 6/224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/407 variables, 3/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 123/530 variables, 58/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/530 variables, 29/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/530 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 45/575 variables, 18/332 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/575 variables, 9/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/575 variables, 0/341 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 43/618 variables, 16/357 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/618 variables, 8/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/618 variables, 0/365 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (OVERLAPS) 41/659 variables, 16/381 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/659 variables, 7/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/659 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 26 (OVERLAPS) 1/660 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/660 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/660 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 29 (OVERLAPS) 14/674 variables, 8/398 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/674 variables, 4/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/674 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 32 (OVERLAPS) 0/674 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 402 constraints, problems are : Problem set: 0 solved, 5 unsolved in 616 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 261/261 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 1104ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 735 ms.
Support contains 13 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 413/413 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 261 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 260 transition count 412
Applied a total of 2 rules in 9 ms. Remains 260 /261 variables (removed 1) and now considering 412/413 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 260/261 places, 412/413 transitions.
RANDOM walk for 40000 steps (22 resets) in 307 ms. (129 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 236603 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :3 out of 5
Probabilistic random walk after 236603 steps, saw 162495 distinct states, run finished after 3005 ms. (steps per millisecond=78 ) properties seen :3
// Phase 1: matrix 412 rows 260 cols
[2024-06-01 21:18:18] [INFO ] Computed 121 invariants in 1 ms
[2024-06-01 21:18:18] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 78/114 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 182/296 variables, 68/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 34/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 112/408 variables, 49/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/408 variables, 24/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/408 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 71/479 variables, 26/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/479 variables, 11/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/479 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 2/481 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/481 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/481 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 66/547 variables, 24/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/547 variables, 12/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/547 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 59/606 variables, 24/339 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/606 variables, 12/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/606 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 54/660 variables, 24/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/660 variables, 11/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/660 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 3/663 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/663 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 9/672 variables, 7/394 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/672 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/672 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (OVERLAPS) 0/672 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 396 constraints, problems are : Problem set: 0 solved, 2 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 260/260 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/32 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/36 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/36 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 78/114 variables, 36/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/114 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/114 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 182/296 variables, 68/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 34/160 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 6/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 112/408 variables, 49/216 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/408 variables, 24/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/408 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 71/479 variables, 26/266 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/479 variables, 11/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/479 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 2/481 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/481 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/481 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 66/547 variables, 24/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/547 variables, 12/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/547 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 59/606 variables, 24/341 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/606 variables, 12/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/606 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 54/660 variables, 24/377 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/660 variables, 11/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/660 variables, 0/388 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 3/663 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/663 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 34 (OVERLAPS) 9/672 variables, 7/396 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/672 variables, 2/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/672 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 37 (OVERLAPS) 0/672 variables, 0/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 672/672 variables, and 398 constraints, problems are : Problem set: 0 solved, 2 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 260/260 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 822ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 208 ms.
Support contains 7 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 412/412 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 260 transition count 409
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 257 transition count 409
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 255 transition count 407
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 253 transition count 409
Applied a total of 14 rules in 15 ms. Remains 253 /260 variables (removed 7) and now considering 409/412 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 253/260 places, 409/412 transitions.
RANDOM walk for 40000 steps (23 resets) in 283 ms. (140 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (10 resets) in 136 ms. (292 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 476921 steps, run timeout after 3001 ms. (steps per millisecond=158 ) properties seen :0 out of 2
Probabilistic random walk after 476921 steps, saw 119643 distinct states, run finished after 3001 ms. (steps per millisecond=158 ) properties seen :0
// Phase 1: matrix 409 rows 253 cols
[2024-06-01 21:18:23] [INFO ] Computed 121 invariants in 4 ms
[2024-06-01 21:18:23] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 77/112 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 184/296 variables, 68/124 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/296 variables, 34/158 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 6/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 0/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 109/405 variables, 48/212 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/405 variables, 24/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/405 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 69/474 variables, 26/262 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/474 variables, 13/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/474 variables, 0/275 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 66/540 variables, 24/299 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/540 variables, 12/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/540 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 62/602 variables, 24/335 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/602 variables, 12/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/602 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (OVERLAPS) 53/655 variables, 24/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/655 variables, 12/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/655 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (OVERLAPS) 7/662 variables, 4/387 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/662 variables, 2/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/662 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (OVERLAPS) 0/662 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 389 constraints, problems are : Problem set: 0 solved, 2 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/31 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/35 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 77/112 variables, 35/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/112 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 184/296 variables, 68/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/296 variables, 34/159 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/296 variables, 6/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/296 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/296 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 109/405 variables, 48/214 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/405 variables, 24/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/405 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 69/474 variables, 26/264 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/474 variables, 13/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/474 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 66/540 variables, 24/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/540 variables, 12/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/540 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 62/602 variables, 24/337 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/602 variables, 12/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/602 variables, 0/349 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 26 (OVERLAPS) 53/655 variables, 24/373 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/655 variables, 12/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/655 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 29 (OVERLAPS) 7/662 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/662 variables, 2/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/662 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 32 (OVERLAPS) 0/662 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 391 constraints, problems are : Problem set: 0 solved, 2 unsolved in 310 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 684ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 134 ms.
Support contains 7 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 409/409 transitions.
Applied a total of 0 rules in 6 ms. Remains 253 /253 variables (removed 0) and now considering 409/409 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 253/253 places, 409/409 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 409/409 transitions.
Applied a total of 0 rules in 5 ms. Remains 253 /253 variables (removed 0) and now considering 409/409 (removed 0) transitions.
[2024-06-01 21:18:23] [INFO ] Invariant cache hit.
[2024-06-01 21:18:24] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-06-01 21:18:24] [INFO ] Invariant cache hit.
[2024-06-01 21:18:24] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-01 21:18:24] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
[2024-06-01 21:18:24] [INFO ] Redundant transitions in 21 ms returned []
Running 404 sub problems to find dead transitions.
[2024-06-01 21:18:24] [INFO ] Invariant cache hit.
[2024-06-01 21:18:24] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 2/253 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 409/662 variables, 253/374 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 15/389 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (OVERLAPS) 0/662 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 389 constraints, problems are : Problem set: 0 solved, 404 unsolved in 16504 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 404 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 114/114 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/251 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 2/253 variables, 7/121 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/253 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (OVERLAPS) 409/662 variables, 253/374 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/662 variables, 15/389 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 404/793 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 8 (OVERLAPS) 0/662 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 404 unsolved
No progress, stopping.
After SMT solving in domain Int declared 662/662 variables, and 793 constraints, problems are : Problem set: 0 solved, 404 unsolved in 15359 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 253/253 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 0/0 constraints]
After SMT, in 31983ms problems are : Problem set: 0 solved, 404 unsolved
Search for dead transitions found 0 dead transitions in 31990ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32453 ms. Remains : 253/253 places, 409/409 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 108 edges and 253 vertex of which 4 / 253 are part of one of the 2 SCC in 8 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 107 edges and 249 vertex of which 4 / 249 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 247 transition count 400
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 105 edges and 245 vertex of which 2 / 245 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 18 place count 244 transition count 393
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 104 edges and 243 vertex of which 2 / 243 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 2 with 5 rules applied. Total rules applied 23 place count 242 transition count 390
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 29 place count 241 transition count 385
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 29 place count 241 transition count 383
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 34 place count 238 transition count 383
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 36 place count 237 transition count 382
Graph (trivial) has 100 edges and 237 vertex of which 2 / 237 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating global reduction 4 with 1 rules applied. Total rules applied 37 place count 236 transition count 382
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 39 place count 236 transition count 380
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 43 place count 236 transition count 376
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 44 place count 235 transition count 376
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 45 place count 235 transition count 376
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 46 place count 235 transition count 375
Applied a total of 46 rules in 66 ms. Remains 235 /253 variables (removed 18) and now considering 375/409 (removed 34) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 375 rows 235 cols
[2024-06-01 21:18:56] [INFO ] Computed 113 invariants in 1 ms
[2024-06-01 21:18:56] [INFO ] [Real]Absence check using 113 positive place invariants in 12 ms returned sat
[2024-06-01 21:18:56] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 21:18:56] [INFO ] [Nat]Absence check using 113 positive place invariants in 13 ms returned sat
[2024-06-01 21:18:56] [INFO ] After 106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-01 21:18:56] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-01 21:18:56] [INFO ] After 27ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 21:18:56] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 21:18:56] [INFO ] After 280ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 529 ms.
[2024-06-01 21:18:56] [INFO ] Flatten gal took : 38 ms
[2024-06-01 21:18:56] [INFO ] Flatten gal took : 39 ms
[2024-06-01 21:18:57] [INFO ] Input system was already deterministic with 1206 transitions.
Computed a total of 365 stabilizing places and 365 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 331 transitions
Trivial Post-agglo rules discarded 331 transitions
Performed 331 trivial Post agglomeration. Transition count delta: 331
Iterating post reduction 0 with 331 rules applied. Total rules applied 331 place count 1205 transition count 874
Reduce places removed 331 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 333 rules applied. Total rules applied 664 place count 874 transition count 872
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 666 place count 872 transition count 872
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 666 place count 872 transition count 656
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1098 place count 656 transition count 656
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 1116 place count 638 transition count 638
Iterating global reduction 3 with 18 rules applied. Total rules applied 1134 place count 638 transition count 638
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 1134 place count 638 transition count 622
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1166 place count 622 transition count 622
Performed 245 Post agglomeration using F-continuation condition.Transition count delta: 245
Deduced a syphon composed of 245 places in 0 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 1656 place count 377 transition count 377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1657 place count 377 transition count 376
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 1659 place count 376 transition count 375
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1661 place count 374 transition count 373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1662 place count 373 transition count 373
Applied a total of 1662 rules in 91 ms. Remains 373 /1206 variables (removed 833) and now considering 373/1206 (removed 833) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 91 ms. Remains : 373/1206 places, 373/1206 transitions.
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:18:57] [INFO ] Input system was already deterministic with 373 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 340 transitions
Trivial Post-agglo rules discarded 340 transitions
Performed 340 trivial Post agglomeration. Transition count delta: 340
Iterating post reduction 0 with 340 rules applied. Total rules applied 340 place count 1205 transition count 865
Reduce places removed 340 places and 0 transitions.
Iterating post reduction 1 with 340 rules applied. Total rules applied 680 place count 865 transition count 865
Performed 218 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 218 Pre rules applied. Total rules applied 680 place count 865 transition count 647
Deduced a syphon composed of 218 places in 1 ms
Reduce places removed 218 places and 0 transitions.
Iterating global reduction 2 with 436 rules applied. Total rules applied 1116 place count 647 transition count 647
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1136 place count 627 transition count 627
Iterating global reduction 2 with 20 rules applied. Total rules applied 1156 place count 627 transition count 627
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1156 place count 627 transition count 609
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1192 place count 609 transition count 609
Performed 244 Post agglomeration using F-continuation condition.Transition count delta: 244
Deduced a syphon composed of 244 places in 0 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 2 with 488 rules applied. Total rules applied 1680 place count 365 transition count 365
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1681 place count 365 transition count 364
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 1683 place count 364 transition count 363
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1685 place count 362 transition count 361
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1686 place count 361 transition count 361
Applied a total of 1686 rules in 78 ms. Remains 361 /1206 variables (removed 845) and now considering 361/1206 (removed 845) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 361/1206 places, 361/1206 transitions.
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:18:57] [INFO ] Input system was already deterministic with 361 transitions.
RANDOM walk for 8 steps (0 resets) in 5 ms. (1 steps per ms) remains 0/1 properties
FORMULA ShieldRVt-PT-030B-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1174 transition count 1174
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1173 transition count 1173
Applied a total of 66 rules in 94 ms. Remains 1173 /1206 variables (removed 33) and now considering 1173/1206 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 94 ms. Remains : 1173/1206 places, 1173/1206 transitions.
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:18:57] [INFO ] Input system was already deterministic with 1173 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 339 transitions
Trivial Post-agglo rules discarded 339 transitions
Performed 339 trivial Post agglomeration. Transition count delta: 339
Iterating post reduction 0 with 339 rules applied. Total rules applied 339 place count 1205 transition count 866
Reduce places removed 339 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 340 rules applied. Total rules applied 679 place count 866 transition count 865
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 680 place count 865 transition count 865
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 217 Pre rules applied. Total rules applied 680 place count 865 transition count 648
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 3 with 434 rules applied. Total rules applied 1114 place count 648 transition count 648
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1133 place count 629 transition count 629
Iterating global reduction 3 with 19 rules applied. Total rules applied 1152 place count 629 transition count 629
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1152 place count 629 transition count 612
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1186 place count 612 transition count 612
Performed 245 Post agglomeration using F-continuation condition.Transition count delta: 245
Deduced a syphon composed of 245 places in 0 ms
Reduce places removed 245 places and 0 transitions.
Iterating global reduction 3 with 490 rules applied. Total rules applied 1676 place count 367 transition count 367
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1677 place count 367 transition count 366
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 1679 place count 366 transition count 365
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1681 place count 364 transition count 363
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1682 place count 363 transition count 363
Applied a total of 1682 rules in 78 ms. Remains 363 /1206 variables (removed 843) and now considering 363/1206 (removed 843) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 78 ms. Remains : 363/1206 places, 363/1206 transitions.
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 12 ms
[2024-06-01 21:18:57] [INFO ] Input system was already deterministic with 363 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 1178 transition count 1178
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 1178 transition count 1178
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 1177 transition count 1177
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 1177 transition count 1177
Applied a total of 58 rules in 92 ms. Remains 1177 /1206 variables (removed 29) and now considering 1177/1206 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 1177/1206 places, 1177/1206 transitions.
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:18:57] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:18:57] [INFO ] Input system was already deterministic with 1177 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 1174 transition count 1174
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 1174 transition count 1174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 1173 transition count 1173
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 1173 transition count 1173
Applied a total of 66 rules in 87 ms. Remains 1173 /1206 variables (removed 33) and now considering 1173/1206 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 1173/1206 places, 1173/1206 transitions.
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 24 ms
[2024-06-01 21:18:58] [INFO ] Input system was already deterministic with 1173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1172 transition count 1172
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1171 transition count 1171
Applied a total of 70 rules in 88 ms. Remains 1171 /1206 variables (removed 35) and now considering 1171/1206 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1171/1206 places, 1171/1206 transitions.
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 22 ms
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:18:58] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1173 transition count 1173
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1172 transition count 1172
Applied a total of 68 rules in 91 ms. Remains 1172 /1206 variables (removed 34) and now considering 1172/1206 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 1172/1206 places, 1172/1206 transitions.
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 24 ms
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 24 ms
[2024-06-01 21:18:58] [INFO ] Input system was already deterministic with 1172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1176 transition count 1176
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1175 transition count 1175
Applied a total of 62 rules in 96 ms. Remains 1175 /1206 variables (removed 31) and now considering 1175/1206 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 97 ms. Remains : 1175/1206 places, 1175/1206 transitions.
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 24 ms
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:18:58] [INFO ] Input system was already deterministic with 1175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 1176 transition count 1176
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 1176 transition count 1176
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 1175 transition count 1175
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 1175 transition count 1175
Applied a total of 62 rules in 87 ms. Remains 1175 /1206 variables (removed 31) and now considering 1175/1206 (removed 31) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 88 ms. Remains : 1175/1206 places, 1175/1206 transitions.
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:18:58] [INFO ] Flatten gal took : 21 ms
[2024-06-01 21:18:58] [INFO ] Input system was already deterministic with 1175 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1173 transition count 1173
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1173 transition count 1173
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 1172 transition count 1172
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 1172 transition count 1172
Applied a total of 68 rules in 89 ms. Remains 1172 /1206 variables (removed 34) and now considering 1172/1206 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 89 ms. Remains : 1172/1206 places, 1172/1206 transitions.
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 23 ms
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 21 ms
[2024-06-01 21:18:59] [INFO ] Input system was already deterministic with 1172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1172 transition count 1172
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1171 transition count 1171
Applied a total of 70 rules in 87 ms. Remains 1171 /1206 variables (removed 35) and now considering 1171/1206 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 87 ms. Remains : 1171/1206 places, 1171/1206 transitions.
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:18:59] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1172 transition count 1172
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1172 transition count 1172
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 1171 transition count 1171
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 1171 transition count 1171
Applied a total of 70 rules in 106 ms. Remains 1171 /1206 variables (removed 35) and now considering 1171/1206 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 106 ms. Remains : 1171/1206 places, 1171/1206 transitions.
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:18:59] [INFO ] Input system was already deterministic with 1171 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 1179 transition count 1179
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 1179 transition count 1179
Applied a total of 54 rules in 74 ms. Remains 1179 /1206 variables (removed 27) and now considering 1179/1206 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 75 ms. Remains : 1179/1206 places, 1179/1206 transitions.
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 21 ms
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 22 ms
[2024-06-01 21:18:59] [INFO ] Input system was already deterministic with 1179 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 338 transitions
Trivial Post-agglo rules discarded 338 transitions
Performed 338 trivial Post agglomeration. Transition count delta: 338
Iterating post reduction 0 with 338 rules applied. Total rules applied 338 place count 1205 transition count 867
Reduce places removed 338 places and 0 transitions.
Iterating post reduction 1 with 338 rules applied. Total rules applied 676 place count 867 transition count 867
Performed 217 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 217 Pre rules applied. Total rules applied 676 place count 867 transition count 650
Deduced a syphon composed of 217 places in 1 ms
Reduce places removed 217 places and 0 transitions.
Iterating global reduction 2 with 434 rules applied. Total rules applied 1110 place count 650 transition count 650
Discarding 22 places :
Symmetric choice reduction at 2 with 22 rule applications. Total rules 1132 place count 628 transition count 628
Iterating global reduction 2 with 22 rules applied. Total rules applied 1154 place count 628 transition count 628
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 1154 place count 628 transition count 610
Deduced a syphon composed of 18 places in 2 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 1190 place count 610 transition count 610
Performed 244 Post agglomeration using F-continuation condition.Transition count delta: 244
Deduced a syphon composed of 244 places in 0 ms
Reduce places removed 244 places and 0 transitions.
Iterating global reduction 2 with 488 rules applied. Total rules applied 1678 place count 366 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1679 place count 366 transition count 365
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 1681 place count 365 transition count 364
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1683 place count 363 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1684 place count 362 transition count 362
Applied a total of 1684 rules in 84 ms. Remains 362 /1206 variables (removed 844) and now considering 362/1206 (removed 844) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 84 ms. Remains : 362/1206 places, 362/1206 transitions.
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 8 ms
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 8 ms
[2024-06-01 21:18:59] [INFO ] Input system was already deterministic with 362 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1206/1206 places, 1206/1206 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 337 transitions
Trivial Post-agglo rules discarded 337 transitions
Performed 337 trivial Post agglomeration. Transition count delta: 337
Iterating post reduction 0 with 337 rules applied. Total rules applied 337 place count 1205 transition count 868
Reduce places removed 337 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 338 rules applied. Total rules applied 675 place count 868 transition count 867
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 676 place count 867 transition count 867
Performed 216 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 216 Pre rules applied. Total rules applied 676 place count 867 transition count 651
Deduced a syphon composed of 216 places in 1 ms
Reduce places removed 216 places and 0 transitions.
Iterating global reduction 3 with 432 rules applied. Total rules applied 1108 place count 651 transition count 651
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1128 place count 631 transition count 631
Iterating global reduction 3 with 20 rules applied. Total rules applied 1148 place count 631 transition count 631
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1148 place count 631 transition count 614
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1182 place count 614 transition count 614
Performed 246 Post agglomeration using F-continuation condition.Transition count delta: 246
Deduced a syphon composed of 246 places in 0 ms
Reduce places removed 246 places and 0 transitions.
Iterating global reduction 3 with 492 rules applied. Total rules applied 1674 place count 368 transition count 368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1675 place count 368 transition count 367
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 1677 place count 367 transition count 366
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1679 place count 365 transition count 364
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1680 place count 364 transition count 364
Applied a total of 1680 rules in 74 ms. Remains 364 /1206 variables (removed 842) and now considering 364/1206 (removed 842) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 74 ms. Remains : 364/1206 places, 364/1206 transitions.
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 8 ms
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 8 ms
[2024-06-01 21:18:59] [INFO ] Input system was already deterministic with 364 transitions.
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 21 ms
[2024-06-01 21:18:59] [INFO ] Flatten gal took : 20 ms
[2024-06-01 21:18:59] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 21:19:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1206 places, 1206 transitions and 2952 arcs took 6 ms.
Total runtime 97761 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVt-PT-030B-CTLFireability-2023-15

BK_STOP 1717276740384

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/657/ctl_0_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/657/ctl_1_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/657/ctl_2_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/657/ctl_3_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/657/ctl_4_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/657/ctl_5_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/657/ctl_6_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/657/ctl_7_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/657/ctl_8_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/657/ctl_9_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/657/ctl_10_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/657/ctl_11_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/657/ctl_12_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/657/ctl_13_
ctl formula name ShieldRVt-PT-030B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/657/ctl_14_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="ShieldRVt-PT-030B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVt-PT-030B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r528-tall-171683762301002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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