Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r010-oct2-167813599200554.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is AutonomousCar-PT-02b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:57 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 12:57 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 12:57 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:57 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Feb 25 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 12:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 12:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 49K Mar 5 18:22 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 AutonomousCar-PT-02b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-02b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678698785487

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-02b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:13:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:13:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:13:08] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2023-03-13 09:13:08] [INFO ] Transformed 155 places.
[2023-03-13 09:13:08] [INFO ] Transformed 194 transitions.
[2023-03-13 09:13:08] [INFO ] Found NUPN structural information;
[2023-03-13 09:13:08] [INFO ] Parsed PT model containing 155 places and 194 transitions and 620 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 87 out of 155 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 155/155 places, 194/194 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 149 transition count 188
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 149 transition count 188
Applied a total of 12 rules in 19 ms. Remains 149 /155 variables (removed 6) and now considering 188/194 (removed 6) transitions.
// Phase 1: matrix 188 rows 149 cols
[2023-03-13 09:13:08] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-13 09:13:08] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-13 09:13:08] [INFO ] Invariant cache hit.
[2023-03-13 09:13:08] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2023-03-13 09:13:08] [INFO ] Invariant cache hit.
[2023-03-13 09:13:08] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 149/155 places, 188/194 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 759 ms. Remains : 149/155 places, 188/194 transitions.
Support contains 87 out of 149 places after structural reductions.
[2023-03-13 09:13:09] [INFO ] Flatten gal took : 42 ms
[2023-03-13 09:13:09] [INFO ] Flatten gal took : 33 ms
[2023-03-13 09:13:09] [INFO ] Input system was already deterministic with 188 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 406 ms. (steps per millisecond=24 ) properties (out of 87) seen :51
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 36) seen :10
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 24) seen :2
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :4
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :2
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 14) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 14) seen :2
Running SMT prover for 12 properties.
[2023-03-13 09:13:09] [INFO ] Invariant cache hit.
[2023-03-13 09:13:09] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-13 09:13:10] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:7
[2023-03-13 09:13:10] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:13:10] [INFO ] After 76ms SMT Verify possible using state equation in natural domain returned unsat :9 sat :3
[2023-03-13 09:13:10] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 5 ms to minimize.
[2023-03-13 09:13:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2023-03-13 09:13:10] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :9 sat :3
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-13 09:13:10] [INFO ] After 304ms SMT Verify possible using all constraints in natural domain returned unsat :9 sat :3
Fused 12 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 9 ms.
Support contains 8 out of 149 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 130 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 3 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 300 edges and 147 vertex of which 142 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 62 rules applied. Total rules applied 64 place count 142 transition count 119
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 72 rules applied. Total rules applied 136 place count 82 transition count 107
Reduce places removed 6 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 8 rules applied. Total rules applied 144 place count 76 transition count 105
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 4 rules applied. Total rules applied 148 place count 74 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 149 place count 73 transition count 103
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 149 place count 73 transition count 94
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 167 place count 64 transition count 94
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 178 place count 53 transition count 83
Iterating global reduction 5 with 11 rules applied. Total rules applied 189 place count 53 transition count 83
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 205 place count 53 transition count 67
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 207 place count 51 transition count 63
Iterating global reduction 6 with 2 rules applied. Total rules applied 209 place count 51 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 2 rules applied. Total rules applied 211 place count 51 transition count 61
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 212 place count 50 transition count 61
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 8 with 30 rules applied. Total rules applied 242 place count 35 transition count 46
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 243 place count 35 transition count 45
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 244 place count 34 transition count 42
Iterating global reduction 9 with 1 rules applied. Total rules applied 245 place count 34 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 247 place count 33 transition count 41
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -9
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 251 place count 31 transition count 50
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 252 place count 31 transition count 49
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 254 place count 31 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 255 place count 30 transition count 48
Applied a total of 255 rules in 32 ms. Remains 30 /149 variables (removed 119) and now considering 48/188 (removed 140) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 30/149 places, 48/188 transitions.
Finished random walk after 8394 steps, including 629 resets, run visited all 2 properties in 15 ms. (steps per millisecond=559 )
Successfully simplified 9 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 188 transitions.
Support contains 70 out of 149 places (down from 72) after GAL structural reductions.
Computed a total of 37 stabilizing places and 38 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 137 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 147 transition count 122
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 76 rules applied. Total rules applied 141 place count 83 transition count 110
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 7 rules applied. Total rules applied 148 place count 77 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 149 place count 76 transition count 109
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 149 place count 76 transition count 101
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 165 place count 68 transition count 101
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 177 place count 56 transition count 89
Iterating global reduction 4 with 12 rules applied. Total rules applied 189 place count 56 transition count 89
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 205 place count 56 transition count 73
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 205 place count 56 transition count 72
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 207 place count 55 transition count 72
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 210 place count 52 transition count 67
Iterating global reduction 5 with 3 rules applied. Total rules applied 213 place count 52 transition count 67
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 217 place count 52 transition count 63
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 219 place count 50 transition count 63
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 7 with 30 rules applied. Total rules applied 249 place count 35 transition count 48
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 250 place count 35 transition count 47
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 252 place count 33 transition count 41
Iterating global reduction 8 with 2 rules applied. Total rules applied 254 place count 33 transition count 41
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 256 place count 32 transition count 40
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 257 place count 32 transition count 39
Applied a total of 257 rules in 22 ms. Remains 32 /149 variables (removed 117) and now considering 39/188 (removed 149) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 32/149 places, 39/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 134 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 147 transition count 126
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 1 with 72 rules applied. Total rules applied 133 place count 87 transition count 114
Reduce places removed 6 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 9 rules applied. Total rules applied 142 place count 81 transition count 111
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 145 place count 78 transition count 111
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 145 place count 78 transition count 104
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 159 place count 71 transition count 104
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 171 place count 59 transition count 92
Iterating global reduction 4 with 12 rules applied. Total rules applied 183 place count 59 transition count 92
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 199 place count 59 transition count 76
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 199 place count 59 transition count 75
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 201 place count 58 transition count 75
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 204 place count 55 transition count 70
Iterating global reduction 5 with 3 rules applied. Total rules applied 207 place count 55 transition count 70
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 209 place count 55 transition count 68
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 210 place count 54 transition count 68
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 7 with 26 rules applied. Total rules applied 236 place count 41 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 237 place count 41 transition count 54
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 239 place count 39 transition count 48
Iterating global reduction 8 with 2 rules applied. Total rules applied 241 place count 39 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 243 place count 38 transition count 47
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 245 place count 38 transition count 45
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 246 place count 38 transition count 44
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 247 place count 37 transition count 44
Applied a total of 247 rules in 17 ms. Remains 37 /149 variables (removed 112) and now considering 44/188 (removed 144) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 37/149 places, 44/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 44 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 129 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 125 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 125 transition count 148
Applied a total of 64 rules in 10 ms. Remains 125 /149 variables (removed 24) and now considering 148/188 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 125/149 places, 148/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 130 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 126 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 126 transition count 149
Applied a total of 62 rules in 6 ms. Remains 126 /149 variables (removed 23) and now considering 149/188 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 126/149 places, 149/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 129 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 125 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 125 transition count 148
Applied a total of 64 rules in 8 ms. Remains 125 /149 variables (removed 24) and now considering 148/188 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 125/149 places, 148/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 130 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 57 place count 127 transition count 150
Iterating global reduction 1 with 3 rules applied. Total rules applied 60 place count 127 transition count 150
Applied a total of 60 rules in 5 ms. Remains 127 /149 variables (removed 22) and now considering 150/188 (removed 38) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 127/149 places, 150/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 150 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 131 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 63 rules applied. Total rules applied 64 place count 146 transition count 122
Reduce places removed 63 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 77 rules applied. Total rules applied 141 place count 83 transition count 108
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 151 place count 75 transition count 106
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 154 place count 73 transition count 105
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 154 place count 73 transition count 99
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 166 place count 67 transition count 99
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 178 place count 55 transition count 87
Iterating global reduction 4 with 12 rules applied. Total rules applied 190 place count 55 transition count 87
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 206 place count 55 transition count 71
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 207 place count 54 transition count 70
Iterating global reduction 5 with 1 rules applied. Total rules applied 208 place count 54 transition count 70
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 234 place count 41 transition count 57
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 236 place count 41 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 40 transition count 55
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 239 place count 38 transition count 49
Iterating global reduction 7 with 2 rules applied. Total rules applied 241 place count 38 transition count 49
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 38 transition count 48
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 38 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 244 place count 37 transition count 47
Applied a total of 244 rules in 17 ms. Remains 37 /149 variables (removed 112) and now considering 47/188 (removed 141) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 37/149 places, 47/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 47 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 132 transition count 171
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 132 transition count 171
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 132 transition count 155
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 52 place count 130 transition count 153
Iterating global reduction 1 with 2 rules applied. Total rules applied 54 place count 130 transition count 153
Applied a total of 54 rules in 9 ms. Remains 130 /149 variables (removed 19) and now considering 153/188 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 130/149 places, 153/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 133 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 133 transition count 172
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 48 place count 133 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 130 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 130 transition count 153
Applied a total of 54 rules in 5 ms. Remains 130 /149 variables (removed 19) and now considering 153/188 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 130/149 places, 153/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 130 transition count 169
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 130 transition count 169
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 130 transition count 153
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 58 place count 126 transition count 149
Iterating global reduction 1 with 4 rules applied. Total rules applied 62 place count 126 transition count 149
Applied a total of 62 rules in 5 ms. Remains 126 /149 variables (removed 23) and now considering 149/188 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 126/149 places, 149/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 129 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 146 transition count 126
Reduce places removed 59 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 74 rules applied. Total rules applied 134 place count 87 transition count 111
Reduce places removed 8 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 10 rules applied. Total rules applied 144 place count 79 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 146 place count 77 transition count 109
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 146 place count 77 transition count 103
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 158 place count 71 transition count 103
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 167 place count 62 transition count 94
Iterating global reduction 4 with 9 rules applied. Total rules applied 176 place count 62 transition count 94
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 4 with 16 rules applied. Total rules applied 192 place count 62 transition count 78
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 192 place count 62 transition count 77
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 194 place count 61 transition count 77
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 196 place count 59 transition count 73
Iterating global reduction 5 with 2 rules applied. Total rules applied 198 place count 59 transition count 73
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 202 place count 59 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 204 place count 57 transition count 69
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 7 with 28 rules applied. Total rules applied 232 place count 43 transition count 55
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 233 place count 43 transition count 54
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 235 place count 42 transition count 53
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 236 place count 42 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 238 place count 40 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 239 place count 39 transition count 50
Applied a total of 239 rules in 15 ms. Remains 39 /149 variables (removed 110) and now considering 50/188 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 39/149 places, 50/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 129 transition count 152
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 126 transition count 149
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 126 transition count 149
Applied a total of 62 rules in 5 ms. Remains 126 /149 variables (removed 23) and now considering 149/188 (removed 39) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 126/149 places, 149/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 149 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 134 transition count 173
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 134 transition count 173
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 46 place count 134 transition count 157
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 131 transition count 154
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 131 transition count 154
Applied a total of 52 rules in 5 ms. Remains 131 /149 variables (removed 18) and now considering 154/188 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 131/149 places, 154/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 154 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 133 transition count 172
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 133 transition count 172
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 48 place count 133 transition count 156
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 51 place count 130 transition count 153
Iterating global reduction 1 with 3 rules applied. Total rules applied 54 place count 130 transition count 153
Applied a total of 54 rules in 4 ms. Remains 130 /149 variables (removed 19) and now considering 153/188 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 130/149 places, 153/188 transitions.
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:10] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:10] [INFO ] Input system was already deterministic with 153 transitions.
Starting structural reductions in LTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 129 transition count 168
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 129 transition count 168
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 56 place count 129 transition count 152
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 125 transition count 148
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 125 transition count 148
Applied a total of 64 rules in 12 ms. Remains 125 /149 variables (removed 24) and now considering 148/188 (removed 40) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 125/149 places, 148/188 transitions.
[2023-03-13 09:13:11] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:11] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:13:11] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 149/149 places, 188/188 transitions.
Graph (trivial) has 122 edges and 149 vertex of which 4 / 149 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 146 transition count 125
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 75 rules applied. Total rules applied 136 place count 86 transition count 110
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 145 place count 78 transition count 109
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 146 place count 77 transition count 109
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 146 place count 77 transition count 99
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 166 place count 67 transition count 99
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 178 place count 55 transition count 87
Iterating global reduction 4 with 12 rules applied. Total rules applied 190 place count 55 transition count 87
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 207 place count 55 transition count 70
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 211 place count 51 transition count 64
Iterating global reduction 5 with 4 rules applied. Total rules applied 215 place count 51 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 5 with 4 rules applied. Total rules applied 219 place count 51 transition count 60
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 221 place count 49 transition count 60
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 241 place count 39 transition count 50
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 242 place count 39 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 243 place count 38 transition count 48
Applied a total of 243 rules in 23 ms. Remains 38 /149 variables (removed 111) and now considering 48/188 (removed 140) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 38/149 places, 48/188 transitions.
[2023-03-13 09:13:11] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:13:11] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:13:11] [INFO ] Input system was already deterministic with 48 transitions.
[2023-03-13 09:13:11] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:13:11] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:13:11] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:13:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 149 places, 188 transitions and 608 arcs took 1 ms.
Total runtime 3190 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 149 NrTr: 188 NrArc: 608)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.005sec

net check time: 0m 0.000sec

init dd package: 0m 3.012sec


RS generation: 0m 0.333sec


-> reachability set: #nodes 6958 (7.0e+03) #states 3,612,744 (6)



starting MCC model checker
--------------------------

checking: A [AF [AX [EF [AG [[p49<=1 & 1<=p49]]]]] U [p2<=1 & 1<=p2]]
normalized: [~ [EG [~ [[p2<=1 & 1<=p2]]]] & ~ [E [~ [[p2<=1 & 1<=p2]] U [~ [[p2<=1 & 1<=p2]] & EG [EX [~ [E [true U ~ [E [true U ~ [[p49<=1 & 1<=p49]]]]]]]]]]]]

abstracting: (1<=p49)
states: 128,568 (5)
abstracting: (p49<=1)
states: 3,612,744 (6)
....................................................................................
EG iterations: 83
abstracting: (1<=p2)
states: 16,021 (4)
abstracting: (p2<=1)
states: 3,612,744 (6)
abstracting: (1<=p2)
states: 16,021 (4)
abstracting: (p2<=1)
states: 3,612,744 (6)
abstracting: (1<=p2)
states: 16,021 (4)
abstracting: (p2<=1)
states: 3,612,744 (6)
...........................................................
EG iterations: 59
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.668sec

checking: EX [AX [[[p104<=0 & 0<=p104] & AG [[p139<=0 & 0<=p139]]]]]
normalized: EX [~ [EX [~ [[[p104<=0 & 0<=p104] & ~ [E [true U ~ [[p139<=0 & 0<=p139]]]]]]]]]

abstracting: (0<=p139)
states: 3,612,744 (6)
abstracting: (p139<=0)
states: 3,513,618 (6)
abstracting: (0<=p104)
states: 3,612,744 (6)
abstracting: (p104<=0)
states: 3,434,802 (6)
..-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.741sec

checking: EF [[E [[p9<=1 & 1<=p9] U [p92<=1 & 1<=p92]] & [p0<=1 & 1<=p0]]]
normalized: E [true U [[p0<=1 & 1<=p0] & E [[p9<=1 & 1<=p9] U [p92<=1 & 1<=p92]]]]

abstracting: (1<=p92)
states: 65,824 (4)
abstracting: (p92<=1)
states: 3,612,744 (6)
abstracting: (1<=p9)
states: 418,176 (5)
abstracting: (p9<=1)
states: 3,612,744 (6)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 3,612,744 (6)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.029sec

checking: E [[EG [~ [[p20<=1 & 1<=p20]]] & A [AG [~ [A [[p147<=1 & 1<=p147] U [p61<=1 & 1<=p61]]]] U [p1<=1 & 1<=p1]]] U [p16<=1 & 1<=p16]]
normalized: E [[[~ [EG [~ [[p1<=1 & 1<=p1]]]] & ~ [E [~ [[p1<=1 & 1<=p1]] U [E [true U [~ [EG [~ [[p61<=1 & 1<=p61]]]] & ~ [E [~ [[p61<=1 & 1<=p61]] U [~ [[p147<=1 & 1<=p147]] & ~ [[p61<=1 & 1<=p61]]]]]]] & ~ [[p1<=1 & 1<=p1]]]]]] & EG [~ [[p20<=1 & 1<=p20]]]] U [p16<=1 & 1<=p16]]

abstracting: (1<=p16)
states: 600
abstracting: (p16<=1)
states: 3,612,744 (6)
abstracting: (1<=p20)
states: 600
abstracting: (p20<=1)
states: 3,612,744 (6)
...........................
EG iterations: 27
abstracting: (1<=p1)
states: 16,021 (4)
abstracting: (p1<=1)
states: 3,612,744 (6)
abstracting: (1<=p61)
states: 128,568 (5)
abstracting: (p61<=1)
states: 3,612,744 (6)
abstracting: (1<=p147)
states: 112,650 (5)
abstracting: (p147<=1)
states: 3,612,744 (6)
abstracting: (1<=p61)
states: 128,568 (5)
abstracting: (p61<=1)
states: 3,612,744 (6)
abstracting: (1<=p61)
states: 128,568 (5)
abstracting: (p61<=1)
states: 3,612,744 (6)
..........................................
EG iterations: 42
abstracting: (1<=p1)
states: 16,021 (4)
abstracting: (p1<=1)
states: 3,612,744 (6)
abstracting: (1<=p1)
states: 16,021 (4)
abstracting: (p1<=1)
states: 3,612,744 (6)
..
EG iterations: 2
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.550sec

checking: EF [EG [[AX [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p46<=1 & 1<=p46] & [p108<=1 & 1<=p108]]]] | EX [AG [[p55<=0 & 0<=p55]]]]]]
normalized: E [true U EG [[EX [~ [E [true U ~ [[p55<=0 & 0<=p55]]]]] | ~ [EX [~ [[[[p108<=1 & 1<=p108] & [p46<=1 & 1<=p46]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]]]]]

abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p46)
states: 128,568 (5)
abstracting: (p46<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
.abstracting: (0<=p55)
states: 3,612,744 (6)
abstracting: (p55<=0)
states: 3,484,176 (6)
..
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.458sec

checking: [E [EX [AG [EF [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p73<=1 & 1<=p73] & [p108<=1 & 1<=p108]]]]]] U [p72<=1 & 1<=p72]] | EX [[p64<=1 & 1<=p64]]]
normalized: [E [EX [~ [E [true U ~ [E [true U [[[p108<=1 & 1<=p108] & [p73<=1 & 1<=p73]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]]]] U [p72<=1 & 1<=p72]] | EX [[p64<=1 & 1<=p64]]]

abstracting: (1<=p64)
states: 128,568 (5)
abstracting: (p64<=1)
states: 3,612,744 (6)
.abstracting: (1<=p72)
states: 87,912 (4)
abstracting: (p72<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p73)
states: 119,748 (5)
abstracting: (p73<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.770sec

checking: AG [[EX [EF [[[[[p5<=0 & 0<=p5] | [p8<=0 & 0<=p8]] | [[p58<=0 & 0<=p58] | [p108<=0 & 0<=p108]]] & [p79<=0 & 0<=p79]]]] & EF [AG [[p27<=1 & 1<=p27]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [E [true U ~ [[p27<=1 & 1<=p27]]]]] & EX [E [true U [[p79<=0 & 0<=p79] & [[[p108<=0 & 0<=p108] | [p58<=0 & 0<=p58]] | [[p8<=0 & 0<=p8] | [p5<=0 & 0<=p5]]]]]]]]]]

abstracting: (0<=p5)
states: 3,612,744 (6)
abstracting: (p5<=0)
states: 2,140,393 (6)
abstracting: (0<=p8)
states: 3,612,744 (6)
abstracting: (p8<=0)
states: 3,130,484 (6)
abstracting: (0<=p58)
states: 3,612,744 (6)
abstracting: (p58<=0)
states: 3,484,176 (6)
abstracting: (0<=p108)
states: 3,612,744 (6)
abstracting: (p108<=0)
states: 3,059,690 (6)
abstracting: (0<=p79)
states: 3,612,744 (6)
abstracting: (p79<=0)
states: 3,484,176 (6)
.abstracting: (1<=p27)
states: 104,922 (5)
abstracting: (p27<=1)
states: 3,612,744 (6)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: AF [[EG [[AX [~ [[p107<=1 & 1<=p107]]] & [~ [A [[p148<=1 & 1<=p148] U [p49<=1 & 1<=p49]]] & ~ [A [[p72<=1 & 1<=p72] U [p127<=1 & 1<=p127]]]]]] & EX [[AF [~ [[p19<=1 & 1<=p19]]] & EG [[p27<=1 & 1<=p27]]]]]]
normalized: ~ [EG [~ [[EX [[EG [[p27<=1 & 1<=p27]] & ~ [EG [[p19<=1 & 1<=p19]]]]] & EG [[[~ [[~ [EG [~ [[p127<=1 & 1<=p127]]]] & ~ [E [~ [[p127<=1 & 1<=p127]] U [~ [[p72<=1 & 1<=p72]] & ~ [[p127<=1 & 1<=p127]]]]]]] & ~ [[~ [EG [~ [[p49<=1 & 1<=p49]]]] & ~ [E [~ [[p49<=1 & 1<=p49]] U [~ [[p148<=1 & 1<=p148]] & ~ [[p49<=1 & 1<=p49]]]]]]]] & ~ [EX [[p107<=1 & 1<=p107]]]]]]]]]

abstracting: (1<=p107)
states: 177,942 (5)
abstracting: (p107<=1)
states: 3,612,744 (6)
.abstracting: (1<=p49)
states: 128,568 (5)
abstracting: (p49<=1)
states: 3,612,744 (6)
abstracting: (1<=p148)
states: 112,650 (5)
abstracting: (p148<=1)
states: 3,612,744 (6)
abstracting: (1<=p49)
states: 128,568 (5)
abstracting: (p49<=1)
states: 3,612,744 (6)
abstracting: (1<=p49)
states: 128,568 (5)
abstracting: (p49<=1)
states: 3,612,744 (6)
.........................................
EG iterations: 41
abstracting: (1<=p127)
states: 112,650 (5)
abstracting: (p127<=1)
states: 3,612,744 (6)
abstracting: (1<=p72)
states: 87,912 (4)
abstracting: (p72<=1)
states: 3,612,744 (6)
abstracting: (1<=p127)
states: 112,650 (5)
abstracting: (p127<=1)
states: 3,612,744 (6)
abstracting: (1<=p127)
states: 112,650 (5)
abstracting: (p127<=1)
states: 3,612,744 (6)
......................................................................................................
EG iterations: 102
...................................
EG iterations: 35
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,612,744 (6)
......................
EG iterations: 22
abstracting: (1<=p27)
states: 104,922 (5)
abstracting: (p27<=1)
states: 3,612,744 (6)
..................................
EG iterations: 34
..
EG iterations: 1
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 8.212sec

checking: EG [[EG [[AG [[p133<=0 & 0<=p133]] | [p72<=0 & 0<=p72]]] & [[EF [[p20<=1 & 1<=p20]] | [p148<=0 & 0<=p148]] | [[p43<=0 & 0<=p43] | [[p18<=0 & 0<=p18] | [p125<=0 & 0<=p125]]]]]]
normalized: EG [[[[[[p125<=0 & 0<=p125] | [p18<=0 & 0<=p18]] | [p43<=0 & 0<=p43]] | [[p148<=0 & 0<=p148] | E [true U [p20<=1 & 1<=p20]]]] & EG [[[p72<=0 & 0<=p72] | ~ [E [true U ~ [[p133<=0 & 0<=p133]]]]]]]]

abstracting: (0<=p133)
states: 3,612,744 (6)
abstracting: (p133<=0)
states: 3,273,294 (6)
abstracting: (0<=p72)
states: 3,612,744 (6)
abstracting: (p72<=0)
states: 3,524,832 (6)
.
EG iterations: 1
abstracting: (1<=p20)
states: 600
abstracting: (p20<=1)
states: 3,612,744 (6)
abstracting: (0<=p148)
states: 3,612,744 (6)
abstracting: (p148<=0)
states: 3,500,094 (6)
abstracting: (0<=p43)
states: 3,612,744 (6)
abstracting: (p43<=0)
states: 3,492,996 (6)
abstracting: (0<=p18)
states: 3,612,744 (6)
abstracting: (p18<=0)
states: 3,612,144 (6)
abstracting: (0<=p125)
states: 3,612,744 (6)
abstracting: (p125<=0)
states: 3,383,934 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.504sec

checking: E [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p69<=1 & 1<=p69] & [p108<=1 & 1<=p108]]] U EF [[~ [[[[[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]] & [[p28<=1 & 1<=p28] & [p108<=1 & 1<=p108]]] | [p136<=1 & 1<=p136]]] & [p107<=1 & 1<=p107]]]]
normalized: E [[[[p108<=1 & 1<=p108] & [p69<=1 & 1<=p69]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]] U E [true U [[p107<=1 & 1<=p107] & ~ [[[p136<=1 & 1<=p136] | [[[p108<=1 & 1<=p108] & [p28<=1 & 1<=p28]] & [[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]]]]]]]]

abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p8)
states: 482,260 (5)
abstracting: (p8<=1)
states: 3,612,744 (6)
abstracting: (1<=p28)
states: 128,568 (5)
abstracting: (p28<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p136)
states: 99,126 (4)
abstracting: (p136<=1)
states: 3,612,744 (6)
abstracting: (1<=p107)
states: 177,942 (5)
abstracting: (p107<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p69)
states: 128,568 (5)
abstracting: (p69<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
-> the formula is TRUE

FORMULA AutonomousCar-PT-02b-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.248sec

checking: AG [EX [[A [[[[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]] & [[p39<=1 & 1<=p39] & [p108<=1 & 1<=p108]]] U [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p58<=1 & 1<=p58] & [p108<=1 & 1<=p108]]]] | AF [[[[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]] & [[p28<=1 & 1<=p28] & [p108<=1 & 1<=p108]]]]]]]
normalized: ~ [E [true U ~ [EX [[~ [EG [~ [[[[p108<=1 & 1<=p108] & [p28<=1 & 1<=p28]] & [[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]]]]]] | [~ [EG [~ [[[[p108<=1 & 1<=p108] & [p58<=1 & 1<=p58]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]] & ~ [E [~ [[[[p108<=1 & 1<=p108] & [p58<=1 & 1<=p58]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]] U [~ [[[[p108<=1 & 1<=p108] & [p39<=1 & 1<=p39]] & [[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]]]] & ~ [[[[p108<=1 & 1<=p108] & [p58<=1 & 1<=p58]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]]]]]]]]]

abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p58)
states: 128,568 (5)
abstracting: (p58<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p8)
states: 482,260 (5)
abstracting: (p8<=1)
states: 3,612,744 (6)
abstracting: (1<=p39)
states: 128,568 (5)
abstracting: (p39<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p58)
states: 128,568 (5)
abstracting: (p58<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p58)
states: 128,568 (5)
abstracting: (p58<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
...........................
EG iterations: 27
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p8)
states: 482,260 (5)
abstracting: (p8<=1)
states: 3,612,744 (6)
abstracting: (1<=p28)
states: 128,568 (5)
abstracting: (p28<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
..............................
EG iterations: 30
.-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.905sec

checking: EF [[[AF [[[[[[[p50<=0 & 0<=p50] | [[p74<=0 & 0<=p74] | [p109<=0 & 0<=p109]]] & [p125<=0 & 0<=p125]] | AG [[p115<=0 & 0<=p115]]] & [p5<=1 & 1<=p5]] & [[p13<=1 & 1<=p13] & [[p43<=1 & 1<=p43] & [p108<=1 & 1<=p108]]]]] & [p5<=1 & 1<=p5]] & [[p8<=1 & 1<=p8] & [[p43<=1 & 1<=p43] & [p108<=1 & 1<=p108]]]]]
normalized: E [true U [[~ [EG [~ [[[[p5<=1 & 1<=p5] & [~ [E [true U ~ [[p115<=0 & 0<=p115]]]] | [[p125<=0 & 0<=p125] & [[[p109<=0 & 0<=p109] | [p74<=0 & 0<=p74]] | [p50<=0 & 0<=p50]]]]] & [[[p43<=1 & 1<=p43] & [p108<=1 & 1<=p108]] & [p13<=1 & 1<=p13]]]]]] & [p5<=1 & 1<=p5]] & [[[p108<=1 & 1<=p108] & [p43<=1 & 1<=p43]] & [p8<=1 & 1<=p8]]]]

abstracting: (1<=p8)
states: 482,260 (5)
abstracting: (p8<=1)
states: 3,612,744 (6)
abstracting: (1<=p43)
states: 119,748 (5)
abstracting: (p43<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p43)
states: 119,748 (5)
abstracting: (p43<=1)
states: 3,612,744 (6)
abstracting: (0<=p50)
states: 3,612,744 (6)
abstracting: (p50<=0)
states: 3,391,272 (6)
abstracting: (0<=p74)
states: 3,612,744 (6)
abstracting: (p74<=0)
states: 3,393,672 (6)
abstracting: (0<=p109)
states: 3,612,744 (6)
abstracting: (p109<=0)
states: 3,202,904 (6)
abstracting: (0<=p125)
states: 3,612,744 (6)
abstracting: (p125<=0)
states: 3,383,934 (6)
abstracting: (0<=p115)
states: 3,612,744 (6)
abstracting: (p115<=0)
states: 3,590,214 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
...........................
EG iterations: 27
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.721sec

checking: EG [[E [~ [[[p68<=1 & 1<=p68] | [[[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]] & [[p28<=1 & 1<=p28] & [p108<=1 & 1<=p108]]]]] U EG [[p52<=1 & 1<=p52]]] | [AG [[[p44<=0 & 0<=p44] | [[p80<=0 & 0<=p80] | [p109<=0 & 0<=p109]]]] & [AX [[[[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]] & [[p73<=1 & 1<=p73] & [p108<=1 & 1<=p108]]]] | [[p33<=0 & 0<=p33] & [[p90<=1 & 1<=p90] | [p81<=1 & 1<=p81]]]]]]]
normalized: EG [[[[[[[p81<=1 & 1<=p81] | [p90<=1 & 1<=p90]] & [p33<=0 & 0<=p33]] | ~ [EX [~ [[[[p108<=1 & 1<=p108] & [p73<=1 & 1<=p73]] & [[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]]]]]]] & ~ [E [true U ~ [[[[p109<=0 & 0<=p109] | [p80<=0 & 0<=p80]] | [p44<=0 & 0<=p44]]]]]] | E [~ [[[[[p108<=1 & 1<=p108] & [p28<=1 & 1<=p28]] & [[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]]] | [p68<=1 & 1<=p68]]] U EG [[p52<=1 & 1<=p52]]]]]

abstracting: (1<=p52)
states: 2,400 (3)
abstracting: (p52<=1)
states: 3,612,744 (6)
.........................
EG iterations: 25
abstracting: (1<=p68)
states: 104,922 (5)
abstracting: (p68<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p8)
states: 482,260 (5)
abstracting: (p8<=1)
states: 3,612,744 (6)
abstracting: (1<=p28)
states: 128,568 (5)
abstracting: (p28<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (0<=p44)
states: 3,612,744 (6)
abstracting: (p44<=0)
states: 3,393,672 (6)
abstracting: (0<=p80)
states: 3,612,744 (6)
abstracting: (p80<=0)
states: 3,391,272 (6)
abstracting: (0<=p109)
states: 3,612,744 (6)
abstracting: (p109<=0)
states: 3,202,904 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p8)
states: 482,260 (5)
abstracting: (p8<=1)
states: 3,612,744 (6)
abstracting: (1<=p73)
states: 119,748 (5)
abstracting: (p73<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
.abstracting: (0<=p33)
states: 3,612,744 (6)
abstracting: (p33<=0)
states: 3,484,176 (6)
abstracting: (1<=p90)
states: 65,824 (4)
abstracting: (p90<=1)
states: 3,612,744 (6)
abstracting: (1<=p81)
states: 2,400 (3)
abstracting: (p81<=1)
states: 3,612,744 (6)
............................
EG iterations: 28
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.910sec

checking: A [EG [~ [[EG [[p140<=1 & 1<=p140]] & EX [AF [[p82<=1 & 1<=p82]]]]]] U [[AX [1<=0] & ~ [[EF [~ [[p68<=1 & 1<=p68]]] & [[EF [[p121<=1 & 1<=p121]] | [EG [[p43<=1 & 1<=p43]] & AX [[p138<=1 & 1<=p138]]]] | [[[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] & [[p108<=1 & 1<=p108] & [p144<=1 & 1<=p144]]] | [p85<=1 & 1<=p85]]]]]] & [~ [[p19<=1 & 1<=p19]] & [AG [A [[p14<=1 & 1<=p14] U [p24<=1 & 1<=p24]]] | [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p28<=1 & 1<=p28] & [p108<=1 & 1<=p108]]]]]]]
normalized: [~ [EG [~ [[[[[[[p108<=1 & 1<=p108] & [p28<=1 & 1<=p28]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]] | ~ [E [true U ~ [[~ [EG [~ [[p24<=1 & 1<=p24]]]] & ~ [E [~ [[p24<=1 & 1<=p24]] U [~ [[p14<=1 & 1<=p14]] & ~ [[p24<=1 & 1<=p24]]]]]]]]]] & ~ [[p19<=1 & 1<=p19]]] & [~ [[[[[p85<=1 & 1<=p85] | [[[p144<=1 & 1<=p144] & [p108<=1 & 1<=p108]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]] | [[~ [EX [~ [[p138<=1 & 1<=p138]]]] & EG [[p43<=1 & 1<=p43]]] | E [true U [p121<=1 & 1<=p121]]]] & E [true U ~ [[p68<=1 & 1<=p68]]]]] & ~ [EX [~ [1<=0]]]]]]]] & ~ [E [~ [[[[[[[p108<=1 & 1<=p108] & [p28<=1 & 1<=p28]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]] | ~ [E [true U ~ [[~ [EG [~ [[p24<=1 & 1<=p24]]]] & ~ [E [~ [[p24<=1 & 1<=p24]] U [~ [[p14<=1 & 1<=p14]] & ~ [[p24<=1 & 1<=p24]]]]]]]]]] & ~ [[p19<=1 & 1<=p19]]] & [~ [[[[[p85<=1 & 1<=p85] | [[[p144<=1 & 1<=p144] & [p108<=1 & 1<=p108]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]] | [[~ [EX [~ [[p138<=1 & 1<=p138]]]] & EG [[p43<=1 & 1<=p43]]] | E [true U [p121<=1 & 1<=p121]]]] & E [true U ~ [[p68<=1 & 1<=p68]]]]] & ~ [EX [~ [1<=0]]]]]] U [~ [EG [~ [[EX [~ [EG [~ [[p82<=1 & 1<=p82]]]]] & EG [[p140<=1 & 1<=p140]]]]]] & ~ [[[[[[[p108<=1 & 1<=p108] & [p28<=1 & 1<=p28]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]] | ~ [E [true U ~ [[~ [EG [~ [[p24<=1 & 1<=p24]]]] & ~ [E [~ [[p24<=1 & 1<=p24]] U [~ [[p14<=1 & 1<=p14]] & ~ [[p24<=1 & 1<=p24]]]]]]]]]] & ~ [[p19<=1 & 1<=p19]]] & [~ [[[[[p85<=1 & 1<=p85] | [[[p144<=1 & 1<=p144] & [p108<=1 & 1<=p108]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]] | [[~ [EX [~ [[p138<=1 & 1<=p138]]]] & EG [[p43<=1 & 1<=p43]]] | E [true U [p121<=1 & 1<=p121]]]] & E [true U ~ [[p68<=1 & 1<=p68]]]]] & ~ [EX [~ [1<=0]]]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p68)
states: 104,922 (5)
abstracting: (p68<=1)
states: 3,612,744 (6)
abstracting: (1<=p121)
states: 132,168 (5)
abstracting: (p121<=1)
states: 3,612,744 (6)
abstracting: (1<=p43)
states: 119,748 (5)
abstracting: (p43<=1)
states: 3,612,744 (6)
......................................
EG iterations: 38
abstracting: (1<=p138)
states: 99,126 (4)
abstracting: (p138<=1)
states: 3,612,744 (6)
.abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p12)
states: 953,457 (5)
abstracting: (p12<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p144)
states: 112,650 (5)
abstracting: (p144<=1)
states: 3,612,744 (6)
abstracting: (1<=p85)
states: 228,448 (5)
abstracting: (p85<=1)
states: 3,612,744 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
abstracting: (1<=p14)
states: 5
abstracting: (p14<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p28)
states: 128,568 (5)
abstracting: (p28<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p140)
states: 99,126 (4)
abstracting: (p140<=1)
states: 3,612,744 (6)
....................................................................................
EG iterations: 84
abstracting: (1<=p82)
states: 2,400 (3)
abstracting: (p82<=1)
states: 3,612,744 (6)
...................................
EG iterations: 35
.
EG iterations: 0
abstracting: (1<=0)
states: 0
.abstracting: (1<=p68)
states: 104,922 (5)
abstracting: (p68<=1)
states: 3,612,744 (6)
abstracting: (1<=p121)
states: 132,168 (5)
abstracting: (p121<=1)
states: 3,612,744 (6)
abstracting: (1<=p43)
states: 119,748 (5)
abstracting: (p43<=1)
states: 3,612,744 (6)
......................................
EG iterations: 38
abstracting: (1<=p138)
states: 99,126 (4)
abstracting: (p138<=1)
states: 3,612,744 (6)
.abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p12)
states: 953,457 (5)
abstracting: (p12<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p144)
states: 112,650 (5)
abstracting: (p144<=1)
states: 3,612,744 (6)
abstracting: (1<=p85)
states: 228,448 (5)
abstracting: (p85<=1)
states: 3,612,744 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
abstracting: (1<=p14)
states: 5
abstracting: (p14<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p28)
states: 128,568 (5)
abstracting: (p28<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=0)
states: 0
.abstracting: (1<=p68)
states: 104,922 (5)
abstracting: (p68<=1)
states: 3,612,744 (6)
abstracting: (1<=p121)
states: 132,168 (5)
abstracting: (p121<=1)
states: 3,612,744 (6)
abstracting: (1<=p43)
states: 119,748 (5)
abstracting: (p43<=1)
states: 3,612,744 (6)
......................................
EG iterations: 38
abstracting: (1<=p138)
states: 99,126 (4)
abstracting: (p138<=1)
states: 3,612,744 (6)
.abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p12)
states: 953,457 (5)
abstracting: (p12<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p144)
states: 112,650 (5)
abstracting: (p144<=1)
states: 3,612,744 (6)
abstracting: (1<=p85)
states: 228,448 (5)
abstracting: (p85<=1)
states: 3,612,744 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
abstracting: (1<=p14)
states: 5
abstracting: (p14<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
.
EG iterations: 1
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p28)
states: 128,568 (5)
abstracting: (p28<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.577sec

checking: [E [EF [~ [[p117<=1 & 1<=p117]]] U [[[AX [[[p46<=1 & 1<=p46] | [[p50<=1 & 1<=p50] & [[p80<=1 & 1<=p80] & [p109<=1 & 1<=p109]]]]] & [AG [[p23<=1 & 1<=p23]] | ~ [[[p130<=1 & 1<=p130] | [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p76<=1 & 1<=p76] & [p108<=1 & 1<=p108]]]]]]] | [p24<=1 & 1<=p24]] & [E [~ [[p36<=1 & 1<=p36]] U AX [[p112<=1 & 1<=p112]]] | AX [EX [[p47<=1 & 1<=p47]]]]]] & [EX [EX [[p47<=0 & 0<=p47]]] & A [E [[p141<=1 & 1<=p141] U [[p50<=1 & 1<=p50] & [[p80<=1 & 1<=p80] & [p109<=1 & 1<=p109]]]] U AF [[p128<=1 & 1<=p128]]]]]
normalized: [E [E [true U ~ [[p117<=1 & 1<=p117]]] U [[[~ [EX [~ [[[[[p109<=1 & 1<=p109] & [p80<=1 & 1<=p80]] & [p50<=1 & 1<=p50]] | [p46<=1 & 1<=p46]]]]] & [~ [[[[[p108<=1 & 1<=p108] & [p76<=1 & 1<=p76]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]] | [p130<=1 & 1<=p130]]] | ~ [E [true U ~ [[p23<=1 & 1<=p23]]]]]] | [p24<=1 & 1<=p24]] & [~ [EX [~ [EX [[p47<=1 & 1<=p47]]]]] | E [~ [[p36<=1 & 1<=p36]] U ~ [EX [~ [[p112<=1 & 1<=p112]]]]]]]] & [[~ [EG [EG [~ [[p128<=1 & 1<=p128]]]]] & ~ [E [EG [~ [[p128<=1 & 1<=p128]]] U [~ [E [[p141<=1 & 1<=p141] U [[p50<=1 & 1<=p50] & [[p109<=1 & 1<=p109] & [p80<=1 & 1<=p80]]]]] & EG [~ [[p128<=1 & 1<=p128]]]]]]] & EX [EX [[p47<=0 & 0<=p47]]]]]

abstracting: (0<=p47)
states: 3,612,744 (6)
abstracting: (p47<=0)
states: 3,484,176 (6)
..abstracting: (1<=p128)
states: 99,126 (4)
abstracting: (p128<=1)
states: 3,612,744 (6)
.
EG iterations: 1
abstracting: (1<=p80)
states: 221,472 (5)
abstracting: (p80<=1)
states: 3,612,744 (6)
abstracting: (1<=p109)
states: 409,840 (5)
abstracting: (p109<=1)
states: 3,612,744 (6)
abstracting: (1<=p50)
states: 221,472 (5)
abstracting: (p50<=1)
states: 3,612,744 (6)
abstracting: (1<=p141)
states: 99,126 (4)
abstracting: (p141<=1)
states: 3,612,744 (6)
abstracting: (1<=p128)
states: 99,126 (4)
abstracting: (p128<=1)
states: 3,612,744 (6)
.
EG iterations: 1
abstracting: (1<=p128)
states: 99,126 (4)
abstracting: (p128<=1)
states: 3,612,744 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p112)
states: 22,530 (4)
abstracting: (p112<=1)
states: 3,612,744 (6)
.abstracting: (1<=p36)
states: 128,568 (5)
abstracting: (p36<=1)
states: 3,612,744 (6)
abstracting: (1<=p47)
states: 128,568 (5)
abstracting: (p47<=1)
states: 3,612,744 (6)
..abstracting: (1<=p24)
states: 128,568 (5)
abstracting: (p24<=1)
states: 3,612,744 (6)
abstracting: (1<=p23)
states: 2,400 (3)
abstracting: (p23<=1)
states: 3,612,744 (6)
abstracting: (1<=p130)
states: 99,126 (4)
abstracting: (p130<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p76)
states: 128,568 (5)
abstracting: (p76<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p46)
states: 128,568 (5)
abstracting: (p46<=1)
states: 3,612,744 (6)
abstracting: (1<=p50)
states: 221,472 (5)
abstracting: (p50<=1)
states: 3,612,744 (6)
abstracting: (1<=p80)
states: 221,472 (5)
abstracting: (p80<=1)
states: 3,612,744 (6)
abstracting: (1<=p109)
states: 409,840 (5)
abstracting: (p109<=1)
states: 3,612,744 (6)
.abstracting: (1<=p117)
states: 132,168 (5)
abstracting: (p117<=1)
states: 3,612,744 (6)
-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.453sec

checking: EX [[EX [E [[A [[p147<=1 & 1<=p147] U [p131<=1 & 1<=p131]] & [[p117<=1 & 1<=p117] | [p49<=1 & 1<=p49]]] U EF [[p6<=1 & 1<=p6]]]] & [E [~ [A [[p36<=1 & 1<=p36] U [p19<=1 & 1<=p19]]] U EX [EG [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p43<=1 & 1<=p43] & [p108<=1 & 1<=p108]]]]]] | [[AG [A [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p73<=1 & 1<=p73] & [p108<=1 & 1<=p108]]] U [p107<=1 & 1<=p107]]] & AX [[p122<=0 & 0<=p122]]] & [A [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p76<=1 & 1<=p76] & [p108<=1 & 1<=p108]]] U [[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p73<=1 & 1<=p73] & [p108<=1 & 1<=p108]]]] & [EX [[p33<=1 & 1<=p33]] | [AX [[p45<=1 & 1<=p45]] | [[[p64<=1 & 1<=p64] & [p5<=1 & 1<=p5]] & [[p12<=1 & 1<=p12] & [[p108<=1 & 1<=p108] & [p135<=1 & 1<=p135]]]]]]]]]]]
normalized: EX [[[[[[[[[[[p135<=1 & 1<=p135] & [p108<=1 & 1<=p108]] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & [p64<=1 & 1<=p64]]] | ~ [EX [~ [[p45<=1 & 1<=p45]]]]] | EX [[p33<=1 & 1<=p33]]] & [~ [EG [~ [[[[p108<=1 & 1<=p108] & [p73<=1 & 1<=p73]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]] & ~ [E [~ [[[[p108<=1 & 1<=p108] & [p73<=1 & 1<=p73]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]] U [~ [[[[p108<=1 & 1<=p108] & [p76<=1 & 1<=p76]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]] & ~ [[[[p108<=1 & 1<=p108] & [p73<=1 & 1<=p73]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]]]]] & [~ [EX [~ [[p122<=0 & 0<=p122]]]] & ~ [E [true U ~ [[~ [EG [~ [[p107<=1 & 1<=p107]]]] & ~ [E [~ [[p107<=1 & 1<=p107]] U [~ [[[[p108<=1 & 1<=p108] & [p73<=1 & 1<=p73]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]] & ~ [[p107<=1 & 1<=p107]]]]]]]]]]] | E [~ [[~ [EG [~ [[p19<=1 & 1<=p19]]]] & ~ [E [~ [[p19<=1 & 1<=p19]] U [~ [[p36<=1 & 1<=p36]] & ~ [[p19<=1 & 1<=p19]]]]]]] U EX [EG [[[[p108<=1 & 1<=p108] & [p43<=1 & 1<=p43]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]]] & EX [E [[[[p49<=1 & 1<=p49] | [p117<=1 & 1<=p117]] & [~ [EG [~ [[p131<=1 & 1<=p131]]]] & ~ [E [~ [[p131<=1 & 1<=p131]] U [~ [[p147<=1 & 1<=p147]] & ~ [[p131<=1 & 1<=p131]]]]]]] U E [true U [p6<=1 & 1<=p6]]]]]]

abstracting: (1<=p6)
states: 16,021 (4)
abstracting: (p6<=1)
states: 3,612,744 (6)
abstracting: (1<=p131)
states: 99,126 (4)
abstracting: (p131<=1)
states: 3,612,744 (6)
abstracting: (1<=p147)
states: 112,650 (5)
abstracting: (p147<=1)
states: 3,612,744 (6)
abstracting: (1<=p131)
states: 99,126 (4)
abstracting: (p131<=1)
states: 3,612,744 (6)
abstracting: (1<=p131)
states: 99,126 (4)
abstracting: (p131<=1)
states: 3,612,744 (6)
....................................................................................
EG iterations: 84
abstracting: (1<=p117)
states: 132,168 (5)
abstracting: (p117<=1)
states: 3,612,744 (6)
abstracting: (1<=p49)
states: 128,568 (5)
abstracting: (p49<=1)
states: 3,612,744 (6)
.abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p43)
states: 119,748 (5)
abstracting: (p43<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
...........................
EG iterations: 27
.abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,612,744 (6)
abstracting: (1<=p36)
states: 128,568 (5)
abstracting: (p36<=1)
states: 3,612,744 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,612,744 (6)
abstracting: (1<=p19)
states: 600
abstracting: (p19<=1)
states: 3,612,744 (6)
............................
EG iterations: 28
abstracting: (1<=p107)
states: 177,942 (5)
abstracting: (p107<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p73)
states: 119,748 (5)
abstracting: (p73<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p107)
states: 177,942 (5)
abstracting: (p107<=1)
states: 3,612,744 (6)
abstracting: (1<=p107)
states: 177,942 (5)
abstracting: (p107<=1)
states: 3,612,744 (6)
..........................................
EG iterations: 42
abstracting: (0<=p122)
states: 3,612,744 (6)
abstracting: (p122<=0)
states: 3,480,576 (6)
.abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p73)
states: 119,748 (5)
abstracting: (p73<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p76)
states: 128,568 (5)
abstracting: (p76<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p73)
states: 119,748 (5)
abstracting: (p73<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p13)
states: 906,477 (5)
abstracting: (p13<=1)
states: 3,612,744 (6)
abstracting: (1<=p73)
states: 119,748 (5)
abstracting: (p73<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
...........................
EG iterations: 27
abstracting: (1<=p33)
states: 128,568 (5)
abstracting: (p33<=1)
states: 3,612,744 (6)
.abstracting: (1<=p45)
states: 219,072 (5)
abstracting: (p45<=1)
states: 3,612,744 (6)
.abstracting: (1<=p64)
states: 128,568 (5)
abstracting: (p64<=1)
states: 3,612,744 (6)
abstracting: (1<=p5)
states: 1,472,351 (6)
abstracting: (p5<=1)
states: 3,612,744 (6)
abstracting: (1<=p12)
states: 953,457 (5)
abstracting: (p12<=1)
states: 3,612,744 (6)
abstracting: (1<=p108)
states: 553,054 (5)
abstracting: (p108<=1)
states: 3,612,744 (6)
abstracting: (1<=p135)
states: 99,126 (4)
abstracting: (p135<=1)
states: 3,612,744 (6)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-02b-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 6.005sec

totally nodes used: 26297758 (2.6e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34909502 88724686 123634188
used/not used/entry size/cache size: 54731487 12377377 16 1024MB
basic ops cache: hits/miss/sum: 2315308 5307401 7622709
used/not used/entry size/cache size: 7933006 8844210 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 25483 89026 114509
used/not used/entry size/cache size: 88533 8300075 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 46498949
1 15966340
2 3762867
3 739058
4 122302
5 17041
6 2074
7 215
8 15
9 2
>= 10 1

Total processing time: 0m38.694sec


BK_STOP 1678698830040

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec


iterations count:32983 (175), effective:1626 (8)

initing FirstDep: 0m 0.000sec


iterations count:189 (1), effective:1 (0)

iterations count:188 (1), effective:0 (0)

iterations count:11627 (61), effective:492 (2)

iterations count:203 (1), effective:4 (0)

iterations count:190 (1), effective:1 (0)

iterations count:5630 (29), effective:276 (1)

iterations count:188 (1), effective:0 (0)

iterations count:188 (1), effective:0 (0)

iterations count:5625 (29), effective:282 (1)

iterations count:5193 (27), effective:294 (1)

iterations count:12636 (67), effective:627 (3)

iterations count:9794 (52), effective:468 (2)

iterations count:188 (1), effective:0 (0)

iterations count:330 (1), effective:17 (0)

iterations count:223 (1), effective:1 (0)

iterations count:188 (1), effective:0 (0)

iterations count:190 (1), effective:1 (0)

iterations count:201 (1), effective:1 (0)

iterations count:16384 (87), effective:811 (4)

iterations count:204 (1), effective:6 (0)

iterations count:8763 (46), effective:493 (2)

iterations count:188 (1), effective:0 (0)

iterations count:215 (1), effective:1 (0)

iterations count:1443 (7), effective:105 (0)

iterations count:195 (1), effective:3 (0)

iterations count:7505 (39), effective:411 (2)

iterations count:215 (1), effective:1 (0)

iterations count:11622 (61), effective:492 (2)

iterations count:192 (1), effective:1 (0)

iterations count:192 (1), effective:1 (0)

iterations count:215 (1), effective:1 (0)

iterations count:11622 (61), effective:492 (2)

iterations count:192 (1), effective:1 (0)

iterations count:192 (1), effective:1 (0)

iterations count:215 (1), effective:1 (0)

iterations count:11622 (61), effective:492 (2)

iterations count:192 (1), effective:1 (0)

iterations count:192 (1), effective:1 (0)

iterations count:1326 (7), effective:95 (0)

iterations count:238 (1), effective:2 (0)

iterations count:12501 (66), effective:650 (3)

iterations count:190 (1), effective:1 (0)

iterations count:190 (1), effective:1 (0)

iterations count:11315 (60), effective:667 (3)

iterations count:340 (1), effective:4 (0)

iterations count:190 (1), effective:1 (0)

iterations count:188 (1), effective:0 (0)

iterations count:191 (1), effective:1 (0)

iterations count:14156 (75), effective:685 (3)

iterations count:202 (1), effective:1 (0)

iterations count:292 (1), effective:1 (0)

iterations count:459 (2), effective:20 (0)

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="AutonomousCar-PT-02b"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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-5348"
echo " Executing tool marciexred"
echo " Input is AutonomousCar-PT-02b, 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 r010-oct2-167813599200554"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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