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-171683762301018.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-040B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683762301018
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 912K
-rw-r--r-- 1 mcc users 8.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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.5K Apr 23 07:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 19:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.6K Apr 11 21:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 11 21:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 21:32 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Apr 11 21:32 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 489K 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-040B-CTLFireability-2024-00
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-01
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-02
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-03
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-04
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-05
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-06
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-07
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-08
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-09
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-10
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2024-11
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-12
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-13
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-14
FORMULA_NAME ShieldRVt-PT-040B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717277220207

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-040B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 21:27:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 21:27:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 21:27:01] [INFO ] Load time of PNML (sax parser for PT used): 162 ms
[2024-06-01 21:27:01] [INFO ] Transformed 2003 places.
[2024-06-01 21:27:01] [INFO ] Transformed 2003 transitions.
[2024-06-01 21:27:01] [INFO ] Found NUPN structural information;
[2024-06-01 21:27:01] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 301 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 20 ms.
Support contains 140 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 402 places :
Symmetric choice reduction at 0 with 402 rule applications. Total rules 402 place count 1601 transition count 1601
Iterating global reduction 0 with 402 rules applied. Total rules applied 804 place count 1601 transition count 1601
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 805 place count 1600 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 806 place count 1600 transition count 1600
Applied a total of 806 rules in 712 ms. Remains 1600 /2003 variables (removed 403) and now considering 1600/2003 (removed 403) transitions.
// Phase 1: matrix 1600 rows 1600 cols
[2024-06-01 21:27:02] [INFO ] Computed 161 invariants in 28 ms
[2024-06-01 21:27:03] [INFO ] Implicit Places using invariants in 603 ms returned []
[2024-06-01 21:27:03] [INFO ] Invariant cache hit.
[2024-06-01 21:27:04] [INFO ] Implicit Places using invariants and state equation in 1156 ms returned []
Implicit Place search using SMT with State Equation took 1788 ms to find 0 implicit places.
Running 1599 sub problems to find dead transitions.
[2024-06-01 21:27:04] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1599/3200 variables, and 0 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 1599/1599 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1599 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1599/3200 variables, and 0 constraints, problems are : Problem set: 0 solved, 1599 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 0/161 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 0/1599 constraints, Known Traps: 0/0 constraints]
After SMT, in 60523ms problems are : Problem set: 0 solved, 1599 unsolved
Search for dead transitions found 0 dead transitions in 60554ms
Starting structural reductions in LTL mode, iteration 1 : 1600/2003 places, 1600/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 63085 ms. Remains : 1600/2003 places, 1600/2003 transitions.
Support contains 140 out of 1600 places after structural reductions.
[2024-06-01 21:28:05] [INFO ] Flatten gal took : 123 ms
[2024-06-01 21:28:05] [INFO ] Flatten gal took : 78 ms
[2024-06-01 21:28:05] [INFO ] Input system was already deterministic with 1600 transitions.
RANDOM walk for 40000 steps (8 resets) in 1734 ms. (23 steps per ms) remains 36/85 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 8 ms. (444 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 35 ms. (111 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 36/36 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 36/36 properties
[2024-06-01 21:28:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 1 (OVERLAPS) 1231/1301 variables, 127/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1301 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 3 (OVERLAPS) 299/1600 variables, 34/161 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1600 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 5 (OVERLAPS) 1600/3200 variables, 1600/1761 constraints. Problems are: Problem set: 0 solved, 36 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3200 variables, 0/1761 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3200/3200 variables, and 1761 constraints, problems are : Problem set: 0 solved, 36 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 1600/1600 constraints, PredecessorRefiner: 36/36 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 36 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 36 unsolved
Problem AtomicPropp26 is UNSAT
At refinement iteration 1 (OVERLAPS) 1231/1301 variables, 127/127 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-01 21:28:11] [INFO ] Deduced a trap composed of 37 places in 156 ms of which 26 ms to minimize.
[2024-06-01 21:28:11] [INFO ] Deduced a trap composed of 34 places in 99 ms of which 3 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 56 places in 72 ms of which 2 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 71 places in 73 ms of which 2 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 1 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 51 places in 76 ms of which 2 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 57 places in 65 ms of which 2 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 55 places in 84 ms of which 13 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:28:12] [INFO ] Deduced a trap composed of 38 places in 77 ms of which 2 ms to minimize.
[2024-06-01 21:28:13] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-06-01 21:28:13] [INFO ] Deduced a trap composed of 63 places in 145 ms of which 3 ms to minimize.
[2024-06-01 21:28:13] [INFO ] Deduced a trap composed of 52 places in 142 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1301 variables, 15/142 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-01 21:28:14] [INFO ] Deduced a trap composed of 57 places in 94 ms of which 2 ms to minimize.
[2024-06-01 21:28:14] [INFO ] Deduced a trap composed of 58 places in 86 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/1301 variables, 2/144 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1301 variables, 0/144 constraints. Problems are: Problem set: 1 solved, 35 unsolved
At refinement iteration 5 (OVERLAPS) 299/1600 variables, 34/178 constraints. Problems are: Problem set: 1 solved, 35 unsolved
[2024-06-01 21:28:16] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1600/3200 variables, and 179 constraints, problems are : Problem set: 1 solved, 35 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 161/161 constraints, State Equation: 0/1600 constraints, PredecessorRefiner: 0/36 constraints, Known Traps: 18/18 constraints]
After SMT, in 10046ms problems are : Problem set: 1 solved, 35 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 65 out of 1600 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 406 transitions
Trivial Post-agglo rules discarded 406 transitions
Performed 406 trivial Post agglomeration. Transition count delta: 406
Iterating post reduction 0 with 406 rules applied. Total rules applied 406 place count 1600 transition count 1194
Reduce places removed 406 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 419 rules applied. Total rules applied 825 place count 1194 transition count 1181
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 838 place count 1181 transition count 1181
Performed 273 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 273 Pre rules applied. Total rules applied 838 place count 1181 transition count 908
Deduced a syphon composed of 273 places in 5 ms
Reduce places removed 273 places and 0 transitions.
Iterating global reduction 3 with 546 rules applied. Total rules applied 1384 place count 908 transition count 908
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 1403 place count 889 transition count 889
Iterating global reduction 3 with 19 rules applied. Total rules applied 1422 place count 889 transition count 889
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 1422 place count 889 transition count 874
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 1452 place count 874 transition count 874
Performed 356 Post agglomeration using F-continuation condition.Transition count delta: 356
Deduced a syphon composed of 356 places in 1 ms
Reduce places removed 356 places and 0 transitions.
Iterating global reduction 3 with 712 rules applied. Total rules applied 2164 place count 518 transition count 518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2165 place count 518 transition count 517
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 2167 place count 517 transition count 516
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: -78
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 2365 place count 418 transition count 594
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 2369 place count 418 transition count 590
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 2373 place count 414 transition count 590
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 2376 place count 414 transition count 587
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2377 place count 413 transition count 586
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2378 place count 412 transition count 586
Applied a total of 2378 rules in 323 ms. Remains 412 /1600 variables (removed 1188) and now considering 586/1600 (removed 1014) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 323 ms. Remains : 412/1600 places, 586/1600 transitions.
RANDOM walk for 40000 steps (8 resets) in 515 ms. (77 steps per ms) remains 21/35 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/21 properties
BEST_FIRST walk for 4002 steps (8 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 20/20 properties
// Phase 1: matrix 586 rows 412 cols
[2024-06-01 21:28:17] [INFO ] Computed 160 invariants in 3 ms
[2024-06-01 21:28:17] [INFO ] State equation strengthened by 73 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 86/123 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 52/175 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 302/477 variables, 175/232 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 67/299 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 235/712 variables, 105/404 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/712 variables, 45/449 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (OVERLAPS) 10/722 variables, 6/457 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/722 variables, 4/461 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/722 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (OVERLAPS) 128/850 variables, 58/519 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/850 variables, 22/541 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/850 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (OVERLAPS) 3/853 variables, 2/543 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/853 variables, 1/544 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/853 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (OVERLAPS) 75/928 variables, 34/578 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/928 variables, 13/591 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/928 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (OVERLAPS) 3/931 variables, 2/593 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/931 variables, 3/596 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/931 variables, 0/596 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 27 (OVERLAPS) 46/977 variables, 18/614 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/977 variables, 6/620 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/977 variables, 2/622 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/977 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (OVERLAPS) 6/983 variables, 3/625 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/983 variables, 0/625 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 15/998 variables, 14/639 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/998 variables, 4/643 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/998 variables, 2/645 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/998 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 37 (OVERLAPS) 0/998 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 998/998 variables, and 645 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3038 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 412/412 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/37 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 86/123 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (OVERLAPS) 52/175 variables, 25/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 302/477 variables, 175/232 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 67/299 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/477 variables, 15/314 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/477 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (OVERLAPS) 235/712 variables, 105/419 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/712 variables, 45/464 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/712 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/712 variables, 5/471 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/712 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 10/722 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/722 variables, 4/481 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/722 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 17 (OVERLAPS) 128/850 variables, 58/539 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/850 variables, 22/561 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/850 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 20 (OVERLAPS) 3/853 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/853 variables, 1/564 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/853 variables, 0/564 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 23 (OVERLAPS) 75/928 variables, 34/598 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/928 variables, 13/611 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/928 variables, 0/611 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 26 (OVERLAPS) 3/931 variables, 2/613 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/931 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/931 variables, 0/616 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 29 (OVERLAPS) 46/977 variables, 18/634 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/977 variables, 6/640 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/977 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/977 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 33 (OVERLAPS) 6/983 variables, 3/645 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/983 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 35 (OVERLAPS) 15/998 variables, 14/659 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/998 variables, 4/663 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/998 variables, 2/665 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/998 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 39 (OVERLAPS) 0/998 variables, 0/665 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 998/998 variables, and 665 constraints, problems are : Problem set: 0 solved, 20 unsolved in 5280 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 412/412 constraints, ReadFeed: 73/73 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 0/0 constraints]
After SMT, in 8340ms problems are : Problem set: 0 solved, 20 unsolved
Fused 20 Parikh solutions to 14 different solutions.
Parikh walk visited 0 properties in 1394 ms.
Support contains 37 out of 412 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 412/412 places, 586/586 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 412 transition count 582
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 408 transition count 582
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 8 place count 408 transition count 566
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 40 place count 392 transition count 566
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 58 place count 383 transition count 557
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 80 place count 372 transition count 571
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 81 place count 372 transition count 570
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 83 place count 370 transition count 568
Applied a total of 83 rules in 39 ms. Remains 370 /412 variables (removed 42) and now considering 568/586 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 370/412 places, 568/586 transitions.
RANDOM walk for 40000 steps (8 resets) in 383 ms. (104 steps per ms) remains 14/20 properties
BEST_FIRST walk for 40003 steps (8 resets) in 151 ms. (263 steps per ms) remains 13/14 properties
BEST_FIRST walk for 40004 steps (12 resets) in 177 ms. (224 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 181 ms. (219 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 166 ms. (239 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 172 ms. (231 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 194 ms. (205 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 117 ms. (339 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 112 ms. (354 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
// Phase 1: matrix 568 rows 370 cols
[2024-06-01 21:28:27] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 21:28:27] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 46/68 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 140/208 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 237/445 variables, 97/184 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/445 variables, 47/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 3/448 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 112/560 variables, 54/287 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/560 variables, 21/308 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/560 variables, 1/309 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 6/566 variables, 4/313 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/566 variables, 2/315 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/566 variables, 0/315 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 49/615 variables, 22/337 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/615 variables, 8/345 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/615 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 42/657 variables, 16/361 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/657 variables, 7/368 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/657 variables, 0/368 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 2/659 variables, 1/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/659 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 46/705 variables, 19/388 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/705 variables, 7/395 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/705 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 1/706 variables, 1/396 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/706 variables, 1/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/706 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 45/751 variables, 16/413 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/751 variables, 7/420 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/751 variables, 0/420 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 2/753 variables, 1/421 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/753 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 44/797 variables, 18/439 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/797 variables, 8/447 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/797 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (OVERLAPS) 44/841 variables, 16/463 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/841 variables, 8/471 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/841 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (OVERLAPS) 41/882 variables, 16/487 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/882 variables, 8/495 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/882 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (OVERLAPS) 41/923 variables, 16/511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/923 variables, 7/518 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/923 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (OVERLAPS) 1/924 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/924 variables, 1/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (INCLUDED_ONLY) 0/924 variables, 0/520 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (OVERLAPS) 14/938 variables, 8/528 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/938 variables, 4/532 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (INCLUDED_ONLY) 0/938 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (OVERLAPS) 0/938 variables, 0/532 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 938/938 variables, and 532 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2223 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 370/370 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 46/68 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 140/208 variables, 68/87 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 6/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 237/445 variables, 97/190 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/445 variables, 47/237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 1/238 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 7/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 3/448 variables, 1/246 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/246 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (OVERLAPS) 112/560 variables, 54/300 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/560 variables, 21/321 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/560 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/560 variables, 0/322 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 6/566 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/566 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/566 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 49/615 variables, 22/350 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/615 variables, 8/358 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/615 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 42/657 variables, 16/374 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/657 variables, 7/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/657 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 2/659 variables, 1/382 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/659 variables, 0/382 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (OVERLAPS) 46/705 variables, 19/401 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/705 variables, 7/408 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/705 variables, 0/408 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (OVERLAPS) 1/706 variables, 1/409 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/706 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/706 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (OVERLAPS) 45/751 variables, 16/426 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/751 variables, 7/433 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/751 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (OVERLAPS) 2/753 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/753 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 44/797 variables, 18/452 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/797 variables, 8/460 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/797 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 42 (OVERLAPS) 44/841 variables, 16/476 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/841 variables, 8/484 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/841 variables, 0/484 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 45 (OVERLAPS) 41/882 variables, 16/500 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/882 variables, 8/508 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/882 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 48 (OVERLAPS) 41/923 variables, 16/524 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/923 variables, 7/531 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/923 variables, 0/531 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 51 (OVERLAPS) 1/924 variables, 1/532 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 52 (INCLUDED_ONLY) 0/924 variables, 1/533 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 53 (INCLUDED_ONLY) 0/924 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 54 (OVERLAPS) 14/938 variables, 8/541 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/938 variables, 4/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 56 (INCLUDED_ONLY) 0/938 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 57 (OVERLAPS) 0/938 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 938/938 variables, and 545 constraints, problems are : Problem set: 0 solved, 13 unsolved in 3503 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 370/370 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 5737ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3116 ms.
Support contains 22 out of 370 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 370/370 places, 568/568 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 370 transition count 564
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 366 transition count 564
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 8 place count 366 transition count 556
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 24 place count 358 transition count 556
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 2 with 4 rules applied. Total rules applied 28 place count 356 transition count 554
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 40 place count 350 transition count 561
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 41 place count 350 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 349 transition count 559
Applied a total of 42 rules in 44 ms. Remains 349 /370 variables (removed 21) and now considering 559/568 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 349/370 places, 559/568 transitions.
RANDOM walk for 40000 steps (12 resets) in 421 ms. (94 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (12 resets) in 180 ms. (221 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 156 ms. (254 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 119 ms. (333 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 113 ms. (350 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 105 ms. (377 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 109 ms. (363 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40002 steps (8 resets) in 106 ms. (373 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
Interrupted probabilistic random walk after 150001 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 13
Probabilistic random walk after 150001 steps, saw 104935 distinct states, run finished after 3009 ms. (steps per millisecond=49 ) properties seen :0
// Phase 1: matrix 559 rows 349 cols
[2024-06-01 21:28:40] [INFO ] Computed 160 invariants in 2 ms
[2024-06-01 21:28:40] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 45/67 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 138/205 variables, 67/86 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (OVERLAPS) 235/440 variables, 96/182 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/440 variables, 48/230 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (OVERLAPS) 109/549 variables, 50/281 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 25/306 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/549 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (OVERLAPS) 44/593 variables, 16/322 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/593 variables, 8/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/593 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (OVERLAPS) 44/637 variables, 16/346 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/637 variables, 8/354 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/637 variables, 0/354 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (OVERLAPS) 44/681 variables, 16/370 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/681 variables, 8/378 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/681 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (OVERLAPS) 44/725 variables, 16/394 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/725 variables, 8/402 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/725 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (OVERLAPS) 44/769 variables, 16/418 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/769 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/769 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (OVERLAPS) 44/813 variables, 16/442 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/813 variables, 8/450 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/813 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (OVERLAPS) 41/854 variables, 16/466 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/854 variables, 8/474 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/854 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (OVERLAPS) 40/894 variables, 16/490 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/894 variables, 8/498 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/894 variables, 0/498 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (OVERLAPS) 14/908 variables, 8/506 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/908 variables, 4/510 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/908 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (OVERLAPS) 0/908 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Real declared 908/908 variables, and 510 constraints, problems are : Problem set: 0 solved, 13 unsolved in 1577 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 349/349 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (OVERLAPS) 45/67 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/67 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 138/205 variables, 67/86 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/205 variables, 6/92 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/205 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 235/440 variables, 96/188 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 48/236 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 7/244 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/244 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 11 (OVERLAPS) 109/549 variables, 50/294 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/549 variables, 25/319 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/549 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 14 (OVERLAPS) 44/593 variables, 16/335 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/593 variables, 8/343 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/593 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 17 (OVERLAPS) 44/637 variables, 16/359 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/637 variables, 8/367 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/637 variables, 0/367 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 20 (OVERLAPS) 44/681 variables, 16/383 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/681 variables, 8/391 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/681 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 23 (OVERLAPS) 44/725 variables, 16/407 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/725 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/725 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 26 (OVERLAPS) 44/769 variables, 16/431 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/769 variables, 8/439 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/769 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 29 (OVERLAPS) 44/813 variables, 16/455 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/813 variables, 8/463 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/813 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 32 (OVERLAPS) 41/854 variables, 16/479 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/854 variables, 8/487 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/854 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 35 (OVERLAPS) 40/894 variables, 16/503 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/894 variables, 8/511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/894 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 38 (OVERLAPS) 14/908 variables, 8/519 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/908 variables, 4/523 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/908 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 41 (OVERLAPS) 0/908 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 13 unsolved
No progress, stopping.
After SMT solving in domain Int declared 908/908 variables, and 523 constraints, problems are : Problem set: 0 solved, 13 unsolved in 2302 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 349/349 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints]
After SMT, in 3892ms problems are : Problem set: 0 solved, 13 unsolved
Fused 13 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 3181 ms.
Support contains 22 out of 349 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 559/559 transitions.
Applied a total of 0 rules in 9 ms. Remains 349 /349 variables (removed 0) and now considering 559/559 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 349/349 places, 559/559 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 349/349 places, 559/559 transitions.
Applied a total of 0 rules in 8 ms. Remains 349 /349 variables (removed 0) and now considering 559/559 (removed 0) transitions.
[2024-06-01 21:28:47] [INFO ] Invariant cache hit.
[2024-06-01 21:28:47] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-06-01 21:28:47] [INFO ] Invariant cache hit.
[2024-06-01 21:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 21:28:47] [INFO ] Implicit Places using invariants and state equation in 325 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-06-01 21:28:47] [INFO ] Redundant transitions in 25 ms returned []
Running 549 sub problems to find dead transitions.
[2024-06-01 21:28:47] [INFO ] Invariant cache hit.
[2024-06-01 21:28:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 7/349 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 559/908 variables, 349/509 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/908 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (OVERLAPS) 0/908 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Real declared 908/908 variables, and 510 constraints, problems are : Problem set: 0 solved, 549 unsolved in 26061 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 349/349 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/342 variables, 153/153 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/342 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (OVERLAPS) 7/349 variables, 7/160 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/349 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (OVERLAPS) 559/908 variables, 349/509 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/908 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/908 variables, 549/1059 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/908 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 8 (OVERLAPS) 0/908 variables, 0/1059 constraints. Problems are: Problem set: 0 solved, 549 unsolved
No progress, stopping.
After SMT solving in domain Int declared 908/908 variables, and 1059 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30008 ms.
Refiners :[Positive P Invariants (semi-flows): 160/160 constraints, State Equation: 349/349 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 0/0 constraints]
After SMT, in 56233ms problems are : Problem set: 0 solved, 549 unsolved
Search for dead transitions found 0 dead transitions in 56238ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56771 ms. Remains : 349/349 places, 559/559 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 134 edges and 349 vertex of which 4 / 349 are part of one of the 2 SCC in 5 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1166 edges and 347 vertex of which 345 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 132 edges and 343 vertex of which 4 / 343 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 7 place count 341 transition count 551
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (trivial) has 131 edges and 339 vertex of which 4 / 339 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 1 with 10 rules applied. Total rules applied 17 place count 337 transition count 544
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 130 edges and 335 vertex of which 6 / 335 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 29 place count 332 transition count 535
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 128 edges and 329 vertex of which 6 / 329 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 44 place count 326 transition count 524
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 126 edges and 323 vertex of which 8 / 323 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 15 rules applied. Total rules applied 59 place count 319 transition count 513
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 122 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 20 rules applied. Total rules applied 79 place count 311 transition count 498
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 118 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 98 place count 303 transition count 484
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 114 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 117 place count 295 transition count 470
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 110 edges and 291 vertex of which 6 / 291 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 136 place count 288 transition count 456
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 106 edges and 285 vertex of which 4 / 285 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 9 with 14 rules applied. Total rules applied 150 place count 283 transition count 446
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 103 edges and 281 vertex of which 2 / 281 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 10 with 9 rules applied. Total rules applied 159 place count 280 transition count 440
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 164 place count 279 transition count 436
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 3 Pre rules applied. Total rules applied 164 place count 279 transition count 433
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 12 with 9 rules applied. Total rules applied 173 place count 273 transition count 433
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 100 edges and 273 vertex of which 4 / 273 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 12 with 2 rules applied. Total rules applied 175 place count 271 transition count 432
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (trivial) has 99 edges and 270 vertex of which 4 / 270 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 13 with 6 rules applied. Total rules applied 181 place count 268 transition count 428
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 98 edges and 266 vertex of which 6 / 266 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 9 rules applied. Total rules applied 190 place count 263 transition count 422
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 95 edges and 260 vertex of which 4 / 260 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 15 with 16 rules applied. Total rules applied 206 place count 258 transition count 410
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 94 edges and 256 vertex of which 6 / 256 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 10 rules applied. Total rules applied 216 place count 253 transition count 403
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 91 edges and 250 vertex of which 6 / 250 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 232 place count 247 transition count 391
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 89 edges and 244 vertex of which 8 / 244 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 247 place count 240 transition count 380
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (complete) has 763 edges and 236 vertex of which 230 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Graph (trivial) has 82 edges and 230 vertex of which 8 / 230 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 21 rules applied. Total rules applied 268 place count 226 transition count 358
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 78 edges and 222 vertex of which 8 / 222 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 19 rules applied. Total rules applied 287 place count 218 transition count 344
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 74 edges and 214 vertex of which 8 / 214 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 306 place count 210 transition count 330
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 70 edges and 206 vertex of which 8 / 206 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 325 place count 202 transition count 316
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 66 edges and 198 vertex of which 8 / 198 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 344 place count 194 transition count 302
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 62 edges and 190 vertex of which 8 / 190 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 363 place count 186 transition count 288
Reduce places removed 4 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 58 edges and 182 vertex of which 8 / 182 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 382 place count 178 transition count 274
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 54 edges and 175 vertex of which 6 / 175 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 26 with 17 rules applied. Total rules applied 399 place count 172 transition count 261
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 52 edges and 169 vertex of which 6 / 169 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 27 with 13 rules applied. Total rules applied 412 place count 166 transition count 252
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (complete) has 506 edges and 163 vertex of which 160 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Graph (trivial) has 48 edges and 160 vertex of which 4 / 160 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 28 with 17 rules applied. Total rules applied 429 place count 158 transition count 237
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 46 edges and 156 vertex of which 2 / 156 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 29 with 10 rules applied. Total rules applied 439 place count 155 transition count 230
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 45 edges and 154 vertex of which 2 / 154 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 30 with 5 rules applied. Total rules applied 444 place count 153 transition count 227
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 31 with 6 rules applied. Total rules applied 450 place count 152 transition count 222
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 32 with 3 Pre rules applied. Total rules applied 450 place count 152 transition count 219
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 32 with 9 rules applied. Total rules applied 459 place count 146 transition count 219
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 42 edges and 146 vertex of which 2 / 146 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 32 with 2 rules applied. Total rules applied 461 place count 145 transition count 218
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 33 with 2 rules applied. Total rules applied 463 place count 145 transition count 216
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 2 places and 0 transitions.
Iterating global reduction 34 with 3 rules applied. Total rules applied 466 place count 143 transition count 215
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 34 with 3 rules applied. Total rules applied 469 place count 143 transition count 212
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 35 with 11 rules applied. Total rules applied 480 place count 143 transition count 201
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 35 with 1 rules applied. Total rules applied 481 place count 143 transition count 201
Applied a total of 481 rules in 89 ms. Remains 143 /349 variables (removed 206) and now considering 201/559 (removed 358) transitions.
Running SMT prover for 13 properties.
// Phase 1: matrix 201 rows 143 cols
[2024-06-01 21:29:44] [INFO ] Computed 58 invariants in 0 ms
[2024-06-01 21:29:44] [INFO ] [Real]Absence check using 58 positive place invariants in 6 ms returned sat
[2024-06-01 21:29:44] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:13
[2024-06-01 21:29:44] [INFO ] [Nat]Absence check using 58 positive place invariants in 7 ms returned sat
[2024-06-01 21:29:44] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :13
TRAPS : Iteration 0
[2024-06-01 21:29:44] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :13
[2024-06-01 21:29:44] [INFO ] After 459ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :13
Over-approximation ignoring read arcs solved 0 properties in 638 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
[2024-06-01 21:29:44] [INFO ] Flatten gal took : 49 ms
[2024-06-01 21:29:44] [INFO ] Flatten gal took : 46 ms
[2024-06-01 21:29:44] [INFO ] Input system was already deterministic with 1600 transitions.
Computed a total of 494 stabilizing places and 494 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1564 transition count 1564
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1564 transition count 1564
Applied a total of 72 rules in 104 ms. Remains 1564 /1600 variables (removed 36) and now considering 1564/1600 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 104 ms. Remains : 1564/1600 places, 1564/1600 transitions.
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 40 ms
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 38 ms
[2024-06-01 21:29:45] [INFO ] Input system was already deterministic with 1564 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 1567 transition count 1567
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 1567 transition count 1567
Applied a total of 66 rules in 98 ms. Remains 1567 /1600 variables (removed 33) and now considering 1567/1600 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 1567/1600 places, 1567/1600 transitions.
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 36 ms
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 35 ms
[2024-06-01 21:29:45] [INFO ] Input system was already deterministic with 1567 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 1561 transition count 1561
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 1561 transition count 1561
Applied a total of 78 rules in 99 ms. Remains 1561 /1600 variables (removed 39) and now considering 1561/1600 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 99 ms. Remains : 1561/1600 places, 1561/1600 transitions.
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:29:45] [INFO ] Input system was already deterministic with 1561 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1562 transition count 1562
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1562 transition count 1562
Applied a total of 76 rules in 120 ms. Remains 1562 /1600 variables (removed 38) and now considering 1562/1600 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 120 ms. Remains : 1562/1600 places, 1562/1600 transitions.
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 29 ms
[2024-06-01 21:29:45] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:29:45] [INFO ] Input system was already deterministic with 1562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1562 transition count 1562
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1562 transition count 1562
Applied a total of 76 rules in 93 ms. Remains 1562 /1600 variables (removed 38) and now considering 1562/1600 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 1562/1600 places, 1562/1600 transitions.
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 29 ms
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 31 ms
[2024-06-01 21:29:46] [INFO ] Input system was already deterministic with 1562 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1563 transition count 1563
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1563 transition count 1563
Applied a total of 74 rules in 91 ms. Remains 1563 /1600 variables (removed 37) and now considering 1563/1600 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 1563/1600 places, 1563/1600 transitions.
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:29:46] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1563 transition count 1563
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1563 transition count 1563
Applied a total of 74 rules in 90 ms. Remains 1563 /1600 variables (removed 37) and now considering 1563/1600 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 91 ms. Remains : 1563/1600 places, 1563/1600 transitions.
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:29:46] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 1562 transition count 1562
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 1562 transition count 1562
Applied a total of 76 rules in 121 ms. Remains 1562 /1600 variables (removed 38) and now considering 1562/1600 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121 ms. Remains : 1562/1600 places, 1562/1600 transitions.
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:29:46] [INFO ] Flatten gal took : 28 ms
[2024-06-01 21:29:46] [INFO ] Input system was already deterministic with 1562 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 1599 transition count 1150
Reduce places removed 449 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 450 rules applied. Total rules applied 899 place count 1150 transition count 1149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 900 place count 1149 transition count 1149
Performed 297 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 297 Pre rules applied. Total rules applied 900 place count 1149 transition count 852
Deduced a syphon composed of 297 places in 1 ms
Reduce places removed 297 places and 0 transitions.
Iterating global reduction 3 with 594 rules applied. Total rules applied 1494 place count 852 transition count 852
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1523 place count 823 transition count 823
Iterating global reduction 3 with 29 rules applied. Total rules applied 1552 place count 823 transition count 823
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 1552 place count 823 transition count 798
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 1602 place count 798 transition count 798
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2228 place count 485 transition count 485
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2229 place count 485 transition count 484
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 2231 place count 484 transition count 483
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2233 place count 482 transition count 481
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2234 place count 481 transition count 481
Applied a total of 2234 rules in 162 ms. Remains 481 /1600 variables (removed 1119) and now considering 481/1600 (removed 1119) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 162 ms. Remains : 481/1600 places, 481/1600 transitions.
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 11 ms
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 11 ms
[2024-06-01 21:29:47] [INFO ] Input system was already deterministic with 481 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 1565 transition count 1565
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 1565 transition count 1565
Applied a total of 70 rules in 93 ms. Remains 1565 /1600 variables (removed 35) and now considering 1565/1600 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 93 ms. Remains : 1565/1600 places, 1565/1600 transitions.
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:29:47] [INFO ] Input system was already deterministic with 1565 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1564 transition count 1564
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1564 transition count 1564
Applied a total of 72 rules in 92 ms. Remains 1564 /1600 variables (removed 36) and now considering 1564/1600 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 92 ms. Remains : 1564/1600 places, 1564/1600 transitions.
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:29:47] [INFO ] Input system was already deterministic with 1564 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 36 places :
Symmetric choice reduction at 0 with 36 rule applications. Total rules 36 place count 1564 transition count 1564
Iterating global reduction 0 with 36 rules applied. Total rules applied 72 place count 1564 transition count 1564
Applied a total of 72 rules in 109 ms. Remains 1564 /1600 variables (removed 36) and now considering 1564/1600 (removed 36) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110 ms. Remains : 1564/1600 places, 1564/1600 transitions.
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 25 ms
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:29:47] [INFO ] Input system was already deterministic with 1564 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 449 transitions
Trivial Post-agglo rules discarded 449 transitions
Performed 449 trivial Post agglomeration. Transition count delta: 449
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 1599 transition count 1150
Reduce places removed 449 places and 0 transitions.
Iterating post reduction 1 with 449 rules applied. Total rules applied 898 place count 1150 transition count 1150
Performed 299 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 299 Pre rules applied. Total rules applied 898 place count 1150 transition count 851
Deduced a syphon composed of 299 places in 1 ms
Reduce places removed 299 places and 0 transitions.
Iterating global reduction 2 with 598 rules applied. Total rules applied 1496 place count 851 transition count 851
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1525 place count 822 transition count 822
Iterating global reduction 2 with 29 rules applied. Total rules applied 1554 place count 822 transition count 822
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 1554 place count 822 transition count 797
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 1604 place count 797 transition count 797
Performed 310 Post agglomeration using F-continuation condition.Transition count delta: 310
Deduced a syphon composed of 310 places in 1 ms
Reduce places removed 310 places and 0 transitions.
Iterating global reduction 2 with 620 rules applied. Total rules applied 2224 place count 487 transition count 487
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2225 place count 487 transition count 486
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2227 place count 486 transition count 485
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2229 place count 484 transition count 483
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2230 place count 483 transition count 483
Applied a total of 2230 rules in 115 ms. Remains 483 /1600 variables (removed 1117) and now considering 483/1600 (removed 1117) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 115 ms. Remains : 483/1600 places, 483/1600 transitions.
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 21:29:47] [INFO ] Flatten gal took : 10 ms
[2024-06-01 21:29:47] [INFO ] Input system was already deterministic with 483 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 1563 transition count 1563
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 1563 transition count 1563
Applied a total of 74 rules in 144 ms. Remains 1563 /1600 variables (removed 37) and now considering 1563/1600 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 144 ms. Remains : 1563/1600 places, 1563/1600 transitions.
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:29:48] [INFO ] Input system was already deterministic with 1563 transitions.
Starting structural reductions in LTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 1566 transition count 1566
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 1566 transition count 1566
Applied a total of 68 rules in 121 ms. Remains 1566 /1600 variables (removed 34) and now considering 1566/1600 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 122 ms. Remains : 1566/1600 places, 1566/1600 transitions.
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 26 ms
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 27 ms
[2024-06-01 21:29:48] [INFO ] Input system was already deterministic with 1566 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 1600/1600 places, 1600/1600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 442 transitions
Trivial Post-agglo rules discarded 442 transitions
Performed 442 trivial Post agglomeration. Transition count delta: 442
Iterating post reduction 0 with 442 rules applied. Total rules applied 442 place count 1599 transition count 1157
Reduce places removed 442 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 444 rules applied. Total rules applied 886 place count 1157 transition count 1155
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 888 place count 1155 transition count 1155
Performed 292 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 292 Pre rules applied. Total rules applied 888 place count 1155 transition count 863
Deduced a syphon composed of 292 places in 1 ms
Reduce places removed 292 places and 0 transitions.
Iterating global reduction 3 with 584 rules applied. Total rules applied 1472 place count 863 transition count 863
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 1497 place count 838 transition count 838
Iterating global reduction 3 with 25 rules applied. Total rules applied 1522 place count 838 transition count 838
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 1522 place count 838 transition count 817
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 1564 place count 817 transition count 817
Performed 313 Post agglomeration using F-continuation condition.Transition count delta: 313
Deduced a syphon composed of 313 places in 1 ms
Reduce places removed 313 places and 0 transitions.
Iterating global reduction 3 with 626 rules applied. Total rules applied 2190 place count 504 transition count 504
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2191 place count 504 transition count 503
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 2193 place count 503 transition count 502
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2195 place count 501 transition count 500
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2196 place count 500 transition count 500
Applied a total of 2196 rules in 121 ms. Remains 500 /1600 variables (removed 1100) and now considering 500/1600 (removed 1100) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 122 ms. Remains : 500/1600 places, 500/1600 transitions.
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 13 ms
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 32 ms
[2024-06-01 21:29:48] [INFO ] Input system was already deterministic with 500 transitions.
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 30 ms
[2024-06-01 21:29:48] [INFO ] Flatten gal took : 30 ms
[2024-06-01 21:29:48] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2024-06-01 21:29:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1600 places, 1600 transitions and 3920 arcs took 9 ms.
Total runtime 167406 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-040B-CTLFireability-2024-00
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-01
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-02
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-03
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-04
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-05
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-06
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-07
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-08
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-09
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-10
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2024-11
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2023-12
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2023-13
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2023-14
Could not compute solution for formula : ShieldRVt-PT-040B-CTLFireability-2023-15

BK_STOP 1717277389179

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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-040B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/637/ctl_0_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/637/ctl_1_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/637/ctl_2_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/637/ctl_3_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/637/ctl_4_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/637/ctl_5_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/637/ctl_6_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/637/ctl_7_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/637/ctl_8_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/637/ctl_9_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/637/ctl_10_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/637/ctl_11_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/637/ctl_12_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/637/ctl_13_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/637/ctl_14_
ctl formula name ShieldRVt-PT-040B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/637/ctl_15_
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-040B"
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-040B, 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-171683762301018"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B 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 ;