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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.2K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 169K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 89K Jun 2 16:33 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 MedleyA-PT-16-CTLFireability-2024-00
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-01
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-02
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-03
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-04
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-05
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-06
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-07
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-08
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-09
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-10
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-11
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-12
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-13
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-14
FORMULA_NAME MedleyA-PT-16-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717365160228

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-16
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:52:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 21:52:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:52:43] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2024-06-02 21:52:43] [INFO ] Transformed 196 places.
[2024-06-02 21:52:43] [INFO ] Transformed 392 transitions.
[2024-06-02 21:52:43] [INFO ] Found NUPN structural information;
[2024-06-02 21:52:43] [INFO ] Parsed PT model containing 196 places and 392 transitions and 1186 arcs in 474 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 33 ms.
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
Support contains 94 out of 196 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 196/196 places, 390/390 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 180 transition count 367
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 180 transition count 367
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 39 place count 180 transition count 360
Applied a total of 39 rules in 78 ms. Remains 180 /196 variables (removed 16) and now considering 360/390 (removed 30) transitions.
// Phase 1: matrix 360 rows 180 cols
[2024-06-02 21:52:43] [INFO ] Computed 7 invariants in 47 ms
[2024-06-02 21:52:44] [INFO ] Implicit Places using invariants in 666 ms returned []
[2024-06-02 21:52:44] [INFO ] Invariant cache hit.
[2024-06-02 21:52:44] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
Running 359 sub problems to find dead transitions.
[2024-06-02 21:52:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:52:50] [INFO ] Deduced a trap composed of 18 places in 222 ms of which 40 ms to minimize.
[2024-06-02 21:52:50] [INFO ] Deduced a trap composed of 18 places in 197 ms of which 4 ms to minimize.
[2024-06-02 21:52:51] [INFO ] Deduced a trap composed of 17 places in 200 ms of which 3 ms to minimize.
[2024-06-02 21:52:51] [INFO ] Deduced a trap composed of 17 places in 174 ms of which 3 ms to minimize.
[2024-06-02 21:52:51] [INFO ] Deduced a trap composed of 28 places in 161 ms of which 2 ms to minimize.
[2024-06-02 21:52:51] [INFO ] Deduced a trap composed of 24 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:52:51] [INFO ] Deduced a trap composed of 22 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:52:51] [INFO ] Deduced a trap composed of 37 places in 132 ms of which 3 ms to minimize.
[2024-06-02 21:52:52] [INFO ] Deduced a trap composed of 17 places in 141 ms of which 3 ms to minimize.
[2024-06-02 21:52:52] [INFO ] Deduced a trap composed of 97 places in 113 ms of which 4 ms to minimize.
[2024-06-02 21:52:52] [INFO ] Deduced a trap composed of 112 places in 116 ms of which 2 ms to minimize.
[2024-06-02 21:52:52] [INFO ] Deduced a trap composed of 38 places in 182 ms of which 8 ms to minimize.
[2024-06-02 21:52:53] [INFO ] Deduced a trap composed of 38 places in 137 ms of which 3 ms to minimize.
[2024-06-02 21:52:53] [INFO ] Deduced a trap composed of 17 places in 137 ms of which 3 ms to minimize.
[2024-06-02 21:52:54] [INFO ] Deduced a trap composed of 29 places in 135 ms of which 3 ms to minimize.
[2024-06-02 21:52:54] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-06-02 21:52:54] [INFO ] Deduced a trap composed of 25 places in 180 ms of which 3 ms to minimize.
[2024-06-02 21:52:54] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
[2024-06-02 21:52:54] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 3 ms to minimize.
[2024-06-02 21:52:54] [INFO ] Deduced a trap composed of 35 places in 118 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:52:55] [INFO ] Deduced a trap composed of 29 places in 154 ms of which 3 ms to minimize.
[2024-06-02 21:52:55] [INFO ] Deduced a trap composed of 97 places in 134 ms of which 3 ms to minimize.
[2024-06-02 21:52:56] [INFO ] Deduced a trap composed of 115 places in 153 ms of which 3 ms to minimize.
[2024-06-02 21:52:56] [INFO ] Deduced a trap composed of 126 places in 201 ms of which 3 ms to minimize.
[2024-06-02 21:52:57] [INFO ] Deduced a trap composed of 40 places in 176 ms of which 3 ms to minimize.
[2024-06-02 21:52:57] [INFO ] Deduced a trap composed of 120 places in 154 ms of which 3 ms to minimize.
[2024-06-02 21:52:57] [INFO ] Deduced a trap composed of 33 places in 187 ms of which 3 ms to minimize.
[2024-06-02 21:52:57] [INFO ] Deduced a trap composed of 125 places in 176 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:53:02] [INFO ] Deduced a trap composed of 124 places in 148 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/36 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:53:05] [INFO ] Deduced a trap composed of 116 places in 197 ms of which 3 ms to minimize.
[2024-06-02 21:53:05] [INFO ] Deduced a trap composed of 115 places in 165 ms of which 3 ms to minimize.
[2024-06-02 21:53:05] [INFO ] Deduced a trap composed of 41 places in 142 ms of which 3 ms to minimize.
[2024-06-02 21:53:05] [INFO ] Deduced a trap composed of 127 places in 183 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 4/40 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (OVERLAPS) 360/540 variables, 180/220 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:53:15] [INFO ] Deduced a trap composed of 125 places in 174 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 540/540 variables, and 221 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 34/34 constraints]
Escalating to Integer solving :Problem set: 0 solved, 359 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/179 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 1 (OVERLAPS) 1/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 34/41 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:53:18] [INFO ] Deduced a trap composed of 133 places in 190 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:53:22] [INFO ] Deduced a trap composed of 129 places in 190 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 6 (OVERLAPS) 360/540 variables, 180/223 constraints. Problems are: Problem set: 0 solved, 359 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 359/582 constraints. Problems are: Problem set: 0 solved, 359 unsolved
[2024-06-02 21:53:30] [INFO ] Deduced a trap composed of 40 places in 104 ms of which 2 ms to minimize.
[2024-06-02 21:53:35] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/540 variables, 2/584 constraints. Problems are: Problem set: 0 solved, 359 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 584 constraints, problems are : Problem set: 0 solved, 359 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 359/359 constraints, Known Traps: 38/38 constraints]
After SMT, in 60518ms problems are : Problem set: 0 solved, 359 unsolved
Search for dead transitions found 0 dead transitions in 60588ms
Starting structural reductions in LTL mode, iteration 1 : 180/196 places, 360/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61907 ms. Remains : 180/196 places, 360/390 transitions.
Support contains 94 out of 180 places after structural reductions.
[2024-06-02 21:53:45] [INFO ] Flatten gal took : 75 ms
[2024-06-02 21:53:45] [INFO ] Flatten gal took : 34 ms
[2024-06-02 21:53:45] [INFO ] Input system was already deterministic with 360 transitions.
Support contains 92 out of 180 places (down from 94) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2703 ms. (14 steps per ms) remains 77/79 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 69/77 properties
BEST_FIRST walk for 4002 steps (8 resets) in 53 ms. (74 steps per ms) remains 64/69 properties
BEST_FIRST walk for 4002 steps (8 resets) in 69 ms. (57 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 77 ms. (51 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 70 ms. (56 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 66 ms. (59 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 45 ms. (87 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 23 ms. (166 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 42 ms. (93 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 40 ms. (97 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 52 ms. (75 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4003 steps (8 resets) in 36 ms. (108 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 64/64 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 62/64 properties
BEST_FIRST walk for 4000 steps (8 resets) in 47 ms. (83 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 54 ms. (72 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 45 ms. (86 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 35 ms. (111 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 33 ms. (117 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 54 ms. (72 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 62/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 60/62 properties
BEST_FIRST walk for 4001 steps (8 resets) in 51 ms. (76 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 49 ms. (80 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 63 ms. (62 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 46 ms. (85 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (8 resets) in 30 ms. (129 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4000 steps (8 resets) in 32 ms. (121 steps per ms) remains 60/60 properties
[2024-06-02 21:53:47] [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, 60 unsolved
At refinement iteration 1 (OVERLAPS) 110/180 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-02 21:53:48] [INFO ] Deduced a trap composed of 36 places in 108 ms of which 2 ms to minimize.
[2024-06-02 21:53:48] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 3 ms to minimize.
[2024-06-02 21:53:48] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 1 ms to minimize.
[2024-06-02 21:53:48] [INFO ] Deduced a trap composed of 25 places in 51 ms of which 1 ms to minimize.
[2024-06-02 21:53:49] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 1 ms to minimize.
[2024-06-02 21:53:49] [INFO ] Deduced a trap composed of 27 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:53:49] [INFO ] Deduced a trap composed of 41 places in 95 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 7/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-02 21:53:49] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-02 21:53:49] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-02 21:53:50] [INFO ] Deduced a trap composed of 38 places in 125 ms of which 2 ms to minimize.
[2024-06-02 21:53:50] [INFO ] Deduced a trap composed of 33 places in 120 ms of which 2 ms to minimize.
[2024-06-02 21:53:50] [INFO ] Deduced a trap composed of 40 places in 191 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/180 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 6 (OVERLAPS) 360/540 variables, 180/199 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/540 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 60 unsolved
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 540/540 variables, and 199 constraints, problems are : Problem set: 0 solved, 60 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 60 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 60 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 1 (OVERLAPS) 110/180 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/180 variables, 12/19 constraints. Problems are: Problem set: 2 solved, 58 unsolved
[2024-06-02 21:53:53] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 8 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/180 variables, 1/20 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/180 variables, 0/20 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 5 (OVERLAPS) 360/540 variables, 180/200 constraints. Problems are: Problem set: 2 solved, 58 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/540 variables, 58/258 constraints. Problems are: Problem set: 2 solved, 58 unsolved
[2024-06-02 21:53:57] [INFO ] Deduced a trap composed of 23 places in 121 ms of which 3 ms to minimize.
(s156 0timeout
^^^^^^^^
(error "Invalid token: 0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 1)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 1)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 1)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 1)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 0)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/540 variables, and 259 constraints, problems are : Problem set: 2 solved, 58 unsolved in 5011 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 180/180 constraints, PredecessorRefiner: 58/60 constraints, Known Traps: 14/14 constraints]
After SMT, in 10093ms problems are : Problem set: 2 solved, 58 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 68 out of 180 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 180/180 places, 360/360 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 180 transition count 352
Reduce places removed 8 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 17 rules applied. Total rules applied 25 place count 172 transition count 343
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 34 place count 163 transition count 343
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 34 place count 163 transition count 337
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 46 place count 157 transition count 337
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 54 place count 149 transition count 324
Iterating global reduction 3 with 8 rules applied. Total rules applied 62 place count 149 transition count 324
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 62 place count 149 transition count 323
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 64 place count 148 transition count 323
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 65 place count 147 transition count 319
Iterating global reduction 3 with 1 rules applied. Total rules applied 66 place count 147 transition count 319
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 94 place count 133 transition count 305
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -18
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 104 place count 128 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 111 place count 128 transition count 316
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 113 place count 126 transition count 314
Iterating global reduction 3 with 2 rules applied. Total rules applied 115 place count 126 transition count 314
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 117 place count 125 transition count 317
Free-agglomeration rule applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 123 place count 125 transition count 311
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 129 place count 119 transition count 311
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 130 place count 118 transition count 309
Iterating global reduction 4 with 1 rules applied. Total rules applied 131 place count 118 transition count 309
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 134 place count 118 transition count 306
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 136 place count 117 transition count 314
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 137 place count 117 transition count 314
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 138 place count 117 transition count 314
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 139 place count 116 transition count 313
Applied a total of 139 rules in 219 ms. Remains 116 /180 variables (removed 64) and now considering 313/360 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 116/180 places, 313/360 transitions.
RANDOM walk for 40000 steps (8 resets) in 875 ms. (45 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4002 steps (8 resets) in 34 ms. (114 steps per ms) remains 58/58 properties
BEST_FIRST walk for 4000 steps (8 resets) in 28 ms. (137 steps per ms) remains 55/58 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 29 ms. (133 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 38 ms. (102 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4000 steps (8 resets) in 37 ms. (105 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 55/55 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 54/55 properties
BEST_FIRST walk for 4001 steps (8 resets) in 27 ms. (142 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4000 steps (8 resets) in 41 ms. (95 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 28 ms. (137 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 38 ms. (102 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 43 ms. (90 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 54/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 53/54 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 41 ms. (95 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 48 ms. (81 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 29 ms. (133 steps per ms) remains 53/53 properties
BEST_FIRST walk for 4002 steps (8 resets) in 31 ms. (125 steps per ms) remains 52/53 properties
BEST_FIRST walk for 4001 steps (8 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (8 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 24 ms. (160 steps per ms) remains 47/52 properties
// Phase 1: matrix 313 rows 116 cols
[2024-06-02 21:53:59] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 21:53:59] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 60/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 21:53:59] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 1 ms to minimize.
[2024-06-02 21:53:59] [INFO ] Deduced a trap composed of 27 places in 131 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 21:54:00] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-02 21:54:00] [INFO ] Deduced a trap composed of 11 places in 102 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 313/429 variables, 116/127 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 3/130 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/429 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 130 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2550 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (OVERLAPS) 60/116 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 21:54:02] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 13 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/116 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/116 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 313/429 variables, 116/128 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 3/131 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/429 variables, 47/178 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-06-02 21:54:03] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-06-02 21:54:03] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/429 variables, 2/180 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/429 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/429 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 429/429 variables, and 180 constraints, problems are : Problem set: 0 solved, 47 unsolved in 16256 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 116/116 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 7/7 constraints]
After SMT, in 18873ms problems are : Problem set: 0 solved, 47 unsolved
Parikh walk visited 15 properties in 5574 ms.
Support contains 40 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 313/313 transitions.
Graph (trivial) has 58 edges and 116 vertex of which 6 / 116 are part of one of the 2 SCC in 3 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 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 5 place count 112 transition count 303
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 108 transition count 301
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 13 place count 106 transition count 301
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 13 place count 106 transition count 299
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 17 place count 104 transition count 299
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 104 transition count 298
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 19 place count 103 transition count 296
Iterating global reduction 4 with 1 rules applied. Total rules applied 20 place count 103 transition count 296
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 28 place count 99 transition count 292
Performed 9 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 46 place count 90 transition count 351
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 4 with 11 rules applied. Total rules applied 57 place count 90 transition count 340
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 71 place count 90 transition count 326
Free-agglomeration rule applied 3 times.
Iterating global reduction 5 with 3 rules applied. Total rules applied 74 place count 90 transition count 323
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 77 place count 87 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 6 with 11 rules applied. Total rules applied 88 place count 87 transition count 312
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 90 place count 87 transition count 312
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 91 place count 87 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 92 place count 86 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 93 place count 85 transition count 310
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 96 place count 85 transition count 307
Applied a total of 96 rules in 98 ms. Remains 85 /116 variables (removed 31) and now considering 307/313 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 99 ms. Remains : 85/116 places, 307/313 transitions.
RANDOM walk for 40000 steps (4588 resets) in 506 ms. (78 steps per ms) remains 20/32 properties
BEST_FIRST walk for 4003 steps (137 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (135 resets) in 13 ms. (285 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4001 steps (130 resets) in 47 ms. (83 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (137 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (136 resets) in 41 ms. (95 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (134 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (140 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (139 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (125 resets) in 46 ms. (85 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (129 resets) in 49 ms. (80 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (131 resets) in 32 ms. (121 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (137 resets) in 28 ms. (138 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (138 resets) in 33 ms. (117 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4004 steps (136 resets) in 16 ms. (235 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (138 resets) in 22 ms. (174 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4002 steps (142 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (128 resets) in 29 ms. (133 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (138 resets) in 15 ms. (250 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (139 resets) in 17 ms. (222 steps per ms) remains 20/20 properties
BEST_FIRST walk for 4003 steps (136 resets) in 21 ms. (181 steps per ms) remains 20/20 properties
[2024-06-02 21:54:24] [INFO ] Flow matrix only has 299 transitions (discarded 8 similar events)
// Phase 1: matrix 299 rows 85 cols
[2024-06-02 21:54:24] [INFO ] Computed 6 invariants in 19 ms
[2024-06-02 21:54:24] [INFO ] State equation strengthened by 38 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 54/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 21:54:24] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:54:24] [INFO ] Deduced a trap composed of 18 places in 67 ms of which 1 ms to minimize.
[2024-06-02 21:54:24] [INFO ] Deduced a trap composed of 10 places in 47 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 21:54:24] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/84 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (OVERLAPS) 1/85 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 21:54:24] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (OVERLAPS) 299/384 variables, 85/96 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 38/134 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 21:54:25] [INFO ] Deduced a trap composed of 18 places in 104 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/384 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/384 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 20 unsolved
[2024-06-02 21:54:25] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/384 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/384 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 14 (OVERLAPS) 0/384 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Real declared 384/384 variables, and 136 constraints, problems are : Problem set: 0 solved, 20 unsolved in 2190 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 20 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 1 (OVERLAPS) 54/84 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/84 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/84 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 4 (OVERLAPS) 1/85 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 6 (OVERLAPS) 299/384 variables, 85/98 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/384 variables, 38/136 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/384 variables, 20/156 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/384 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 20 unsolved
At refinement iteration 10 (OVERLAPS) 0/384 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 20 unsolved
No progress, stopping.
After SMT solving in domain Int declared 384/384 variables, and 156 constraints, problems are : Problem set: 0 solved, 20 unsolved in 3623 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 85/85 constraints, ReadFeed: 38/38 constraints, PredecessorRefiner: 20/20 constraints, Known Traps: 7/7 constraints]
After SMT, in 5860ms problems are : Problem set: 0 solved, 20 unsolved
Parikh walk visited 1 properties in 2853 ms.
Support contains 29 out of 85 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 85/85 places, 307/307 transitions.
Graph (trivial) has 30 edges and 85 vertex of which 2 / 85 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 84 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 83 transition count 304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 83 transition count 302
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 7 place count 81 transition count 302
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 12 place count 76 transition count 292
Iterating global reduction 2 with 5 rules applied. Total rules applied 17 place count 76 transition count 292
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 25 place count 76 transition count 284
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 3 with 4 rules applied. Total rules applied 29 place count 74 transition count 282
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 30 place count 74 transition count 281
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 38 place count 70 transition count 304
Drop transitions (Redundant composition of simpler transitions.) removed 15 transitions
Redundant transition composition rules discarded 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 53 place count 70 transition count 289
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 54 place count 70 transition count 289
Applied a total of 54 rules in 30 ms. Remains 70 /85 variables (removed 15) and now considering 289/307 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 70/85 places, 289/307 transitions.
RANDOM walk for 40000 steps (4596 resets) in 293 ms. (136 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (143 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (137 resets) in 18 ms. (210 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (140 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (140 resets) in 19 ms. (200 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (136 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (130 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (139 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (135 resets) in 16 ms. (235 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (128 resets) in 42 ms. (93 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (138 resets) in 41 ms. (95 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (133 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (142 resets) in 24 ms. (160 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (92 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (134 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (139 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4003 steps (138 resets) in 15 ms. (250 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4004 steps (134 resets) in 14 ms. (266 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (130 resets) in 13 ms. (285 steps per ms) remains 19/19 properties
BEST_FIRST walk for 4002 steps (140 resets) in 11 ms. (333 steps per ms) remains 19/19 properties
Finished probabilistic random walk after 39088 steps, run visited all 19 properties in 315 ms. (steps per millisecond=124 )
Probabilistic random walk after 39088 steps, saw 10661 distinct states, run finished after 326 ms. (steps per millisecond=119 ) properties seen :19
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 23 ms
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 38 ms
[2024-06-02 21:54:33] [INFO ] Input system was already deterministic with 360 transitions.
Computed a total of 17 stabilizing places and 17 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 202 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 169 transition count 314
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 134 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 132 transition count 310
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 77 place count 132 transition count 303
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 125 transition count 303
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 112 place count 104 transition count 264
Iterating global reduction 3 with 21 rules applied. Total rules applied 133 place count 104 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 143 place count 104 transition count 254
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 145 place count 102 transition count 254
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 145 place count 102 transition count 251
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 151 place count 99 transition count 251
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 154 place count 96 transition count 243
Iterating global reduction 5 with 3 rules applied. Total rules applied 157 place count 96 transition count 243
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 185 place count 82 transition count 229
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 188 place count 79 transition count 222
Iterating global reduction 5 with 3 rules applied. Total rules applied 191 place count 79 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 5 with 14 rules applied. Total rules applied 205 place count 79 transition count 208
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 205 place count 79 transition count 206
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 209 place count 77 transition count 206
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 217 place count 73 transition count 202
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 218 place count 72 transition count 201
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 86 edges and 70 vertex of which 26 / 70 are part of one of the 10 SCC in 1 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 221 place count 54 transition count 201
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 263 place count 54 transition count 159
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 265 place count 52 transition count 142
Iterating global reduction 7 with 2 rules applied. Total rules applied 267 place count 52 transition count 142
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 308 place count 52 transition count 101
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 7 with 6 rules applied. Total rules applied 314 place count 52 transition count 95
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 320 place count 46 transition count 95
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 322 place count 44 transition count 90
Iterating global reduction 9 with 2 rules applied. Total rules applied 324 place count 44 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 328 place count 42 transition count 88
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 9 with 4 rules applied. Total rules applied 332 place count 42 transition count 84
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 9 with 2 rules applied. Total rules applied 334 place count 42 transition count 82
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 336 place count 40 transition count 82
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 2 Pre rules applied. Total rules applied 336 place count 40 transition count 80
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 11 with 4 rules applied. Total rules applied 340 place count 38 transition count 80
Applied a total of 340 rules in 130 ms. Remains 38 /180 variables (removed 142) and now considering 80/360 (removed 280) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 131 ms. Remains : 38/180 places, 80/360 transitions.
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 9 ms
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:33] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 320
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 320
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 157 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 56 place count 155 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 58 place count 155 transition count 310
Applied a total of 58 rules in 11 ms. Remains 155 /180 variables (removed 25) and now considering 310/360 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 155/180 places, 310/360 transitions.
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 27 ms
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 30 ms
[2024-06-02 21:54:33] [INFO ] Input system was already deterministic with 310 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 202 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 169 transition count 314
Reduce places removed 35 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 39 rules applied. Total rules applied 75 place count 134 transition count 310
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 132 transition count 310
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 77 place count 132 transition count 303
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 91 place count 125 transition count 303
Discarding 22 places :
Symmetric choice reduction at 3 with 22 rule applications. Total rules 113 place count 103 transition count 262
Iterating global reduction 3 with 22 rules applied. Total rules applied 135 place count 103 transition count 262
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 145 place count 103 transition count 252
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 147 place count 101 transition count 252
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 147 place count 101 transition count 249
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 153 place count 98 transition count 249
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 156 place count 95 transition count 241
Iterating global reduction 5 with 3 rules applied. Total rules applied 159 place count 95 transition count 241
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 187 place count 81 transition count 227
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 190 place count 78 transition count 220
Iterating global reduction 5 with 3 rules applied. Total rules applied 193 place count 78 transition count 220
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 206 place count 78 transition count 207
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 206 place count 78 transition count 205
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 210 place count 76 transition count 205
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 218 place count 72 transition count 201
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 220 place count 72 transition count 201
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 221 place count 71 transition count 200
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 82 edges and 69 vertex of which 26 / 69 are part of one of the 10 SCC in 0 ms
Free SCC test removed 16 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 224 place count 53 transition count 200
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 42 transitions.
Iterating post reduction 6 with 42 rules applied. Total rules applied 266 place count 53 transition count 158
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 268 place count 51 transition count 141
Iterating global reduction 7 with 2 rules applied. Total rules applied 270 place count 51 transition count 141
Drop transitions (Redundant composition of simpler transitions.) removed 41 transitions
Redundant transition composition rules discarded 41 transitions
Iterating global reduction 7 with 41 rules applied. Total rules applied 311 place count 51 transition count 100
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 7 with 4 rules applied. Total rules applied 315 place count 51 transition count 96
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 319 place count 47 transition count 96
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 9 with 4 rules applied. Total rules applied 323 place count 45 transition count 94
Applied a total of 323 rules in 83 ms. Remains 45 /180 variables (removed 135) and now considering 94/360 (removed 266) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 83 ms. Remains : 45/180 places, 94/360 transitions.
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:54:33] [INFO ] Flatten gal took : 6 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 94 transitions.
RANDOM walk for 40000 steps (8513 resets) in 240 ms. (165 steps per ms) remains 1/1 properties
BEST_FIRST walk for 30193 steps (2114 resets) in 46 ms. (642 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-16-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 189 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 0 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 34 place count 169 transition count 316
Reduce places removed 33 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 136 transition count 312
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 74 place count 134 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 75 place count 133 transition count 311
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 75 place count 133 transition count 304
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 89 place count 126 transition count 304
Discarding 22 places :
Symmetric choice reduction at 4 with 22 rule applications. Total rules 111 place count 104 transition count 263
Iterating global reduction 4 with 22 rules applied. Total rules applied 133 place count 104 transition count 263
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 10 rules applied. Total rules applied 143 place count 104 transition count 253
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 145 place count 102 transition count 253
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 145 place count 102 transition count 251
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 149 place count 100 transition count 251
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 152 place count 97 transition count 243
Iterating global reduction 6 with 3 rules applied. Total rules applied 155 place count 97 transition count 243
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 183 place count 83 transition count 229
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 186 place count 80 transition count 222
Iterating global reduction 6 with 3 rules applied. Total rules applied 189 place count 80 transition count 222
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 6 with 13 rules applied. Total rules applied 202 place count 80 transition count 209
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 202 place count 80 transition count 207
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 206 place count 78 transition count 207
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 214 place count 74 transition count 203
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 215 place count 73 transition count 202
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 78 edges and 71 vertex of which 23 / 71 are part of one of the 9 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 218 place count 57 transition count 202
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 7 with 36 rules applied. Total rules applied 254 place count 57 transition count 166
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 256 place count 55 transition count 148
Iterating global reduction 8 with 2 rules applied. Total rules applied 258 place count 55 transition count 148
Drop transitions (Redundant composition of simpler transitions.) removed 40 transitions
Redundant transition composition rules discarded 40 transitions
Iterating global reduction 8 with 40 rules applied. Total rules applied 298 place count 55 transition count 108
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 8 with 4 rules applied. Total rules applied 302 place count 55 transition count 104
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 5 rules applied. Total rules applied 307 place count 51 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 308 place count 50 transition count 103
Discarding 1 places :
Symmetric choice reduction at 11 with 1 rule applications. Total rules 309 place count 49 transition count 100
Iterating global reduction 11 with 1 rules applied. Total rules applied 310 place count 49 transition count 100
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 11 with 4 rules applied. Total rules applied 314 place count 47 transition count 98
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 316 place count 47 transition count 96
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 11 with 1 rules applied. Total rules applied 317 place count 47 transition count 95
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 12 with 2 rules applied. Total rules applied 319 place count 46 transition count 94
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 320 place count 45 transition count 94
Applied a total of 320 rules in 67 ms. Remains 45 /180 variables (removed 135) and now considering 94/360 (removed 266) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 67 ms. Remains : 45/180 places, 94/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 7 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 94 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 158 transition count 324
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 158 transition count 324
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 158 transition count 321
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 156 transition count 319
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 156 transition count 319
Applied a total of 51 rules in 10 ms. Remains 156 /180 variables (removed 24) and now considering 319/360 (removed 41) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 156/180 places, 319/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 17 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 22 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 319 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 166 edges and 180 vertex of which 9 / 180 are part of one of the 2 SCC in 1 ms
Free SCC test removed 7 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 172 transition count 324
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 32 rules applied. Total rules applied 61 place count 144 transition count 320
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 67 place count 142 transition count 316
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 71 place count 138 transition count 316
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 71 place count 138 transition count 309
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 85 place count 131 transition count 309
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 101 place count 115 transition count 279
Iterating global reduction 4 with 16 rules applied. Total rules applied 117 place count 115 transition count 279
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 123 place count 115 transition count 273
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 123 place count 115 transition count 271
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 127 place count 113 transition count 271
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 128 place count 112 transition count 267
Iterating global reduction 5 with 1 rules applied. Total rules applied 129 place count 112 transition count 267
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 5 with 30 rules applied. Total rules applied 159 place count 97 transition count 252
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 162 place count 94 transition count 245
Iterating global reduction 5 with 3 rules applied. Total rules applied 165 place count 94 transition count 245
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 176 place count 94 transition count 234
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 176 place count 94 transition count 232
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 180 place count 92 transition count 232
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 186 place count 89 transition count 229
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 187 place count 89 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 189 place count 87 transition count 227
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 68 edges and 85 vertex of which 14 / 85 are part of one of the 6 SCC in 0 ms
Free SCC test removed 8 places
Iterating post reduction 5 with 3 rules applied. Total rules applied 192 place count 77 transition count 227
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 201 place count 77 transition count 218
Drop transitions (Redundant composition of simpler transitions.) removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 7 with 44 rules applied. Total rules applied 245 place count 77 transition count 174
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 2 rules applied. Total rules applied 247 place count 77 transition count 172
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 249 place count 75 transition count 172
Applied a total of 249 rules in 53 ms. Remains 75 /180 variables (removed 105) and now considering 172/360 (removed 188) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 75/180 places, 172/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 172 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 320
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 320
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 157 transition count 312
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 156 transition count 311
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 156 transition count 311
Applied a total of 56 rules in 8 ms. Remains 156 /180 variables (removed 24) and now considering 311/360 (removed 49) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 156/180 places, 311/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 311 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 160 transition count 327
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 160 transition count 327
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 48 place count 160 transition count 319
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 50 place count 158 transition count 317
Iterating global reduction 1 with 2 rules applied. Total rules applied 52 place count 158 transition count 317
Applied a total of 52 rules in 8 ms. Remains 158 /180 variables (removed 22) and now considering 317/360 (removed 43) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 158/180 places, 317/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 317 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 155 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 155 transition count 318
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 155 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 153 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 153 transition count 308
Applied a total of 62 rules in 8 ms. Remains 153 /180 variables (removed 27) and now considering 308/360 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 153/180 places, 308/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 322
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 54 place count 157 transition count 314
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 55 place count 156 transition count 313
Iterating global reduction 1 with 1 rules applied. Total rules applied 56 place count 156 transition count 313
Applied a total of 56 rules in 7 ms. Remains 156 /180 variables (removed 24) and now considering 313/360 (removed 47) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 156/180 places, 313/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 14 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 313 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 155 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 155 transition count 318
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 155 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 153 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 153 transition count 308
Applied a total of 62 rules in 8 ms. Remains 153 /180 variables (removed 27) and now considering 308/360 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 153/180 places, 308/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 13 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 157 transition count 322
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 157 transition count 322
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 52 place count 157 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 54 place count 155 transition count 314
Iterating global reduction 1 with 2 rules applied. Total rules applied 56 place count 155 transition count 314
Applied a total of 56 rules in 7 ms. Remains 155 /180 variables (removed 25) and now considering 314/360 (removed 46) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 155/180 places, 314/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 314 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Graph (trivial) has 187 edges and 180 vertex of which 13 / 180 are part of one of the 3 SCC in 1 ms
Free SCC test removed 10 places
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 169 transition count 317
Reduce places removed 32 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 69 place count 137 transition count 313
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 71 place count 135 transition count 313
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 71 place count 135 transition count 306
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 85 place count 128 transition count 306
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 105 place count 108 transition count 269
Iterating global reduction 3 with 20 rules applied. Total rules applied 125 place count 108 transition count 269
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 3 with 10 rules applied. Total rules applied 135 place count 108 transition count 259
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 137 place count 106 transition count 259
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 137 place count 106 transition count 256
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 143 place count 103 transition count 256
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 146 place count 100 transition count 248
Iterating global reduction 5 with 3 rules applied. Total rules applied 149 place count 100 transition count 248
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 5 with 22 rules applied. Total rules applied 171 place count 89 transition count 237
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 172 place count 88 transition count 234
Iterating global reduction 5 with 1 rules applied. Total rules applied 173 place count 88 transition count 234
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 5 with 13 rules applied. Total rules applied 186 place count 88 transition count 221
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 186 place count 88 transition count 219
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 190 place count 86 transition count 219
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 196 place count 83 transition count 216
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 197 place count 83 transition count 216
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 198 place count 82 transition count 215
Iterating global reduction 5 with 1 rules applied. Total rules applied 199 place count 82 transition count 215
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 200 place count 82 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 201 place count 81 transition count 213
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 85 edges and 79 vertex of which 24 / 79 are part of one of the 9 SCC in 0 ms
Free SCC test removed 15 places
Iterating post reduction 6 with 3 rules applied. Total rules applied 204 place count 64 transition count 213
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 7 with 37 rules applied. Total rules applied 241 place count 64 transition count 176
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 242 place count 63 transition count 166
Iterating global reduction 8 with 1 rules applied. Total rules applied 243 place count 63 transition count 166
Drop transitions (Redundant composition of simpler transitions.) removed 45 transitions
Redundant transition composition rules discarded 45 transitions
Iterating global reduction 8 with 45 rules applied. Total rules applied 288 place count 63 transition count 121
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 8 with 4 rules applied. Total rules applied 292 place count 63 transition count 117
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 296 place count 59 transition count 117
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 10 with 4 rules applied. Total rules applied 300 place count 57 transition count 115
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 302 place count 57 transition count 113
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 10 with 2 rules applied. Total rules applied 304 place count 57 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 11 with 2 rules applied. Total rules applied 306 place count 55 transition count 111
Applied a total of 306 rules in 54 ms. Remains 55 /180 variables (removed 125) and now considering 111/360 (removed 249) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 55 ms. Remains : 55/180 places, 111/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 5 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 5 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 160 transition count 327
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 160 transition count 327
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 48 place count 160 transition count 319
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 49 place count 159 transition count 318
Iterating global reduction 1 with 1 rules applied. Total rules applied 50 place count 159 transition count 318
Applied a total of 50 rules in 7 ms. Remains 159 /180 variables (removed 21) and now considering 318/360 (removed 42) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 159/180 places, 318/360 transitions.
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 30 ms
[2024-06-02 21:54:34] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:54:34] [INFO ] Input system was already deterministic with 318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 155 transition count 318
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 155 transition count 318
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 58 place count 155 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 60 place count 153 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 62 place count 153 transition count 308
Applied a total of 62 rules in 7 ms. Remains 153 /180 variables (removed 27) and now considering 308/360 (removed 52) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 153/180 places, 308/360 transitions.
[2024-06-02 21:54:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:35] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:54:35] [INFO ] Input system was already deterministic with 308 transitions.
Starting structural reductions in LTL mode, iteration 0 : 180/180 places, 360/360 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 156 transition count 320
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 156 transition count 320
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 56 place count 156 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 154 transition count 310
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 154 transition count 310
Applied a total of 60 rules in 7 ms. Remains 154 /180 variables (removed 26) and now considering 310/360 (removed 50) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 154/180 places, 310/360 transitions.
[2024-06-02 21:54:35] [INFO ] Flatten gal took : 10 ms
[2024-06-02 21:54:35] [INFO ] Flatten gal took : 11 ms
[2024-06-02 21:54:35] [INFO ] Input system was already deterministic with 310 transitions.
[2024-06-02 21:54:35] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:54:35] [INFO ] Flatten gal took : 12 ms
[2024-06-02 21:54:35] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-02 21:54:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 180 places, 360 transitions and 1108 arcs took 4 ms.
Total runtime 112557 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-16

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 180
TRANSITIONS: 360
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.007s, Sys 0.002s]


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


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

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

Process ID: 776
MODEL NAME: /home/mcc/execution/411/model
180 places, 360 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-16-CTLFireability-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-01 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-16-CTLFireability-2024-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717365292270

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

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-16, 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 r575-smll-171734919600122"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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