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-167813599200538.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-01b, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r010-oct2-167813599200538
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.7K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 12:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 12:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 12:55 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 12:55 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 31K 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-01b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-01b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678698633479

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-01b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:10:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:10:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:10:36] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2023-03-13 09:10:36] [INFO ] Transformed 119 places.
[2023-03-13 09:10:36] [INFO ] Transformed 132 transitions.
[2023-03-13 09:10:36] [INFO ] Found NUPN structural information;
[2023-03-13 09:10:36] [INFO ] Parsed PT model containing 119 places and 132 transitions and 339 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 88 out of 119 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 119/119 places, 132/132 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 117 transition count 130
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 117 transition count 130
Applied a total of 4 rules in 17 ms. Remains 117 /119 variables (removed 2) and now considering 130/132 (removed 2) transitions.
// Phase 1: matrix 130 rows 117 cols
[2023-03-13 09:10:36] [INFO ] Computed 6 place invariants in 9 ms
[2023-03-13 09:10:36] [INFO ] Implicit Places using invariants in 327 ms returned []
[2023-03-13 09:10:36] [INFO ] Invariant cache hit.
[2023-03-13 09:10:36] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-13 09:10:36] [INFO ] Invariant cache hit.
[2023-03-13 09:10:37] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 117/119 places, 130/132 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 945 ms. Remains : 117/119 places, 130/132 transitions.
Support contains 88 out of 117 places after structural reductions.
[2023-03-13 09:10:37] [INFO ] Flatten gal took : 35 ms
[2023-03-13 09:10:37] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:10:37] [INFO ] Input system was already deterministic with 130 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 405 ms. (steps per millisecond=24 ) properties (out of 86) seen :50
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 36) seen :13
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 22) seen :7
Incomplete Best-First random walk after 1000 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :3
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 5 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 4 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 5 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-13 09:10:38] [INFO ] Invariant cache hit.
[2023-03-13 09:10:38] [INFO ] [Real]Absence check using 6 positive place invariants in 8 ms returned sat
[2023-03-13 09:10:38] [INFO ] After 130ms SMT Verify possible using state equation in real domain returned unsat :8 sat :1 real:3
[2023-03-13 09:10:38] [INFO ] Deduced a trap composed of 16 places in 118 ms of which 5 ms to minimize.
[2023-03-13 09:10:38] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 124 ms
[2023-03-13 09:10:38] [INFO ] After 259ms SMT Verify possible using trap constraints in real domain returned unsat :9 sat :0 real:3
[2023-03-13 09:10:38] [INFO ] After 364ms SMT Verify possible using all constraints in real domain returned unsat :9 sat :0 real:3
[2023-03-13 09:10:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-13 09:10:38] [INFO ] After 46ms SMT Verify possible using state equation in natural domain returned unsat :11 sat :1
[2023-03-13 09:10:38] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2023-03-13 09:10:38] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 0 ms to minimize.
[2023-03-13 09:10:38] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-13 09:10:38] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2023-03-13 09:10:38] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :11 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-13 09:10:38] [INFO ] After 345ms SMT Verify possible using all constraints in natural domain returned unsat :11 sat :1
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 117 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 106 edges and 117 vertex of which 2 / 117 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 203 edges and 116 vertex of which 113 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 113 transition count 72
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 61 rules applied. Total rules applied 117 place count 60 transition count 64
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 4 rules applied. Total rules applied 121 place count 57 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 56 transition count 63
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 122 place count 56 transition count 57
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 134 place count 50 transition count 57
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 142 place count 42 transition count 49
Iterating global reduction 4 with 8 rules applied. Total rules applied 150 place count 42 transition count 49
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 154 place count 42 transition count 45
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 154 place count 42 transition count 44
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 156 place count 41 transition count 44
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 158 place count 39 transition count 42
Iterating global reduction 5 with 2 rules applied. Total rules applied 160 place count 39 transition count 42
Performed 17 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 194 place count 22 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 195 place count 22 transition count 23
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 196 place count 21 transition count 21
Iterating global reduction 6 with 1 rules applied. Total rules applied 197 place count 21 transition count 21
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 6 with 2 rules applied. Total rules applied 199 place count 20 transition count 20
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 201 place count 20 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 202 place count 19 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 203 place count 18 transition count 19
Applied a total of 203 rules in 21 ms. Remains 18 /117 variables (removed 99) and now considering 19/130 (removed 111) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 18/117 places, 19/130 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Finished probabilistic random walk after 31 steps, run visited all 1 properties in 4 ms. (steps per millisecond=7 )
Probabilistic random walk after 31 steps, saw 22 distinct states, run finished after 4 ms. (steps per millisecond=7 ) properties seen :1
Successfully simplified 11 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:10:38] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:10:38] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 130 transitions.
Support contains 78 out of 117 places (down from 80) after GAL structural reductions.
Computed a total of 29 stabilizing places and 30 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 104 transition count 117
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 104 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 104 transition count 113
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 102 transition count 111
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 102 transition count 111
Applied a total of 34 rules in 7 ms. Remains 102 /117 variables (removed 15) and now considering 111/130 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 102/117 places, 111/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 111 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 109 edges and 117 vertex of which 4 / 117 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 114 transition count 71
Reduce places removed 56 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 66 rules applied. Total rules applied 123 place count 58 transition count 61
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 128 place count 53 transition count 61
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 128 place count 53 transition count 56
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 48 transition count 56
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 146 place count 40 transition count 48
Iterating global reduction 3 with 8 rules applied. Total rules applied 154 place count 40 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 158 place count 40 transition count 44
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 158 place count 40 transition count 43
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 160 place count 39 transition count 43
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 162 place count 37 transition count 41
Iterating global reduction 4 with 2 rules applied. Total rules applied 164 place count 37 transition count 41
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 4 with 2 rules applied. Total rules applied 166 place count 37 transition count 39
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 167 place count 36 transition count 39
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 6 with 22 rules applied. Total rules applied 189 place count 25 transition count 28
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 190 place count 25 transition count 27
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 7 with 2 rules applied. Total rules applied 192 place count 24 transition count 26
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 193 place count 24 transition count 25
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 195 place count 22 transition count 23
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 196 place count 21 transition count 23
Applied a total of 196 rules in 15 ms. Remains 21 /117 variables (removed 96) and now considering 23/130 (removed 107) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 21/117 places, 23/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 23 transitions.
Finished random walk after 47 steps, including 4 resets, run visited all 1 properties in 1 ms. (steps per millisecond=47 )
FORMULA AutonomousCar-PT-01b-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 96 transition count 105
Applied a total of 46 rules in 7 ms. Remains 96 /117 variables (removed 21) and now considering 105/130 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 96/117 places, 105/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 105 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 103 transition count 116
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 103 transition count 116
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 32 place count 103 transition count 112
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 34 place count 101 transition count 110
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 101 transition count 110
Applied a total of 36 rules in 5 ms. Remains 101 /117 variables (removed 16) and now considering 110/130 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 101/117 places, 110/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 101 transition count 110
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 99 transition count 108
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 99 transition count 108
Applied a total of 40 rules in 3 ms. Remains 99 /117 variables (removed 18) and now considering 108/130 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/117 places, 108/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 102 edges and 117 vertex of which 4 / 117 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 114 transition count 77
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 57 rules applied. Total rules applied 108 place count 64 transition count 70
Reduce places removed 3 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 6 rules applied. Total rules applied 114 place count 61 transition count 67
Reduce places removed 3 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 5 rules applied. Total rules applied 119 place count 58 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 57 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 120 place count 57 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 130 place count 52 transition count 60
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 139 place count 43 transition count 51
Iterating global reduction 5 with 9 rules applied. Total rules applied 148 place count 43 transition count 51
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 152 place count 43 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 152 place count 43 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 154 place count 42 transition count 46
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 156 place count 40 transition count 44
Iterating global reduction 6 with 2 rules applied. Total rules applied 158 place count 40 transition count 44
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 160 place count 40 transition count 42
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 161 place count 39 transition count 42
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 8 with 22 rules applied. Total rules applied 183 place count 28 transition count 31
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 184 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 185 place count 27 transition count 28
Iterating global reduction 9 with 1 rules applied. Total rules applied 186 place count 27 transition count 28
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 188 place count 26 transition count 27
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 189 place count 26 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 191 place count 24 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 192 place count 23 transition count 24
Applied a total of 192 rules in 15 ms. Remains 23 /117 variables (removed 94) and now considering 24/130 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 23/117 places, 24/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 101 transition count 114
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 101 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 101 transition count 110
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 98 transition count 107
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 98 transition count 107
Applied a total of 42 rules in 4 ms. Remains 98 /117 variables (removed 19) and now considering 107/130 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 98/117 places, 107/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 102 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 102 transition count 115
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 34 place count 102 transition count 111
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 37 place count 99 transition count 108
Iterating global reduction 1 with 3 rules applied. Total rules applied 40 place count 99 transition count 108
Applied a total of 40 rules in 4 ms. Remains 99 /117 variables (removed 18) and now considering 108/130 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 99/117 places, 108/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 108 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 105 transition count 118
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 105 transition count 118
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 102 transition count 115
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 102 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 101 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 101 transition count 114
Applied a total of 32 rules in 4 ms. Remains 101 /117 variables (removed 16) and now considering 114/130 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 101/117 places, 114/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 93 edges and 117 vertex of which 4 / 117 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 114 transition count 77
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 59 rules applied. Total rules applied 110 place count 64 transition count 68
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 115 place count 59 transition count 68
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 115 place count 59 transition count 65
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 121 place count 56 transition count 65
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 130 place count 47 transition count 56
Iterating global reduction 3 with 9 rules applied. Total rules applied 139 place count 47 transition count 56
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 140 place count 47 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 140 place count 47 transition count 54
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 46 transition count 54
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 143 place count 45 transition count 53
Iterating global reduction 4 with 1 rules applied. Total rules applied 144 place count 45 transition count 53
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 162 place count 36 transition count 44
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 163 place count 36 transition count 43
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 165 place count 34 transition count 41
Applied a total of 165 rules in 9 ms. Remains 34 /117 variables (removed 83) and now considering 41/130 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 34/117 places, 41/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 102 transition count 115
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 102 transition count 115
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 98 transition count 111
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 98 transition count 111
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 97 transition count 110
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 97 transition count 110
Applied a total of 40 rules in 3 ms. Remains 97 /117 variables (removed 20) and now considering 110/130 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 97/117 places, 110/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 110 transitions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 100 transition count 113
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 100 transition count 113
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 100 transition count 109
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 42 place count 96 transition count 105
Iterating global reduction 1 with 4 rules applied. Total rules applied 46 place count 96 transition count 105
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 47 place count 95 transition count 104
Iterating global reduction 1 with 1 rules applied. Total rules applied 48 place count 95 transition count 104
Applied a total of 48 rules in 5 ms. Remains 95 /117 variables (removed 22) and now considering 104/130 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 95/117 places, 104/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 104 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 100 edges and 117 vertex of which 4 / 117 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 114 transition count 77
Reduce places removed 50 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 57 rules applied. Total rules applied 108 place count 64 transition count 70
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 7 rules applied. Total rules applied 115 place count 60 transition count 67
Reduce places removed 3 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 5 rules applied. Total rules applied 120 place count 57 transition count 65
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 121 place count 56 transition count 65
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 121 place count 56 transition count 60
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 131 place count 51 transition count 60
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 140 place count 42 transition count 51
Iterating global reduction 5 with 9 rules applied. Total rules applied 149 place count 42 transition count 51
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 154 place count 42 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 154 place count 42 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 158 place count 40 transition count 44
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 159 place count 39 transition count 43
Iterating global reduction 6 with 1 rules applied. Total rules applied 160 place count 39 transition count 43
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 6 with 20 rules applied. Total rules applied 180 place count 29 transition count 33
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 181 place count 29 transition count 32
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 182 place count 28 transition count 30
Iterating global reduction 7 with 1 rules applied. Total rules applied 183 place count 28 transition count 30
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 7 with 2 rules applied. Total rules applied 185 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 186 place count 27 transition count 28
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 7 with 3 rules applied. Total rules applied 189 place count 27 transition count 28
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 190 place count 26 transition count 27
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 26 transition count 27
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 193 place count 24 transition count 25
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 23 transition count 25
Applied a total of 194 rules in 13 ms. Remains 23 /117 variables (removed 94) and now considering 25/130 (removed 105) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 13 ms. Remains : 23/117 places, 25/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 103 edges and 117 vertex of which 4 / 117 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 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 114 transition count 76
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 1 with 60 rules applied. Total rules applied 112 place count 63 transition count 67
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 6 rules applied. Total rules applied 118 place count 58 transition count 66
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 119 place count 57 transition count 66
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 5 Pre rules applied. Total rules applied 119 place count 57 transition count 61
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 129 place count 52 transition count 61
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 139 place count 42 transition count 51
Iterating global reduction 4 with 10 rules applied. Total rules applied 149 place count 42 transition count 51
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 154 place count 42 transition count 46
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 154 place count 42 transition count 44
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 158 place count 40 transition count 44
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 160 place count 38 transition count 42
Iterating global reduction 5 with 2 rules applied. Total rules applied 162 place count 38 transition count 42
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 164 place count 38 transition count 40
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 165 place count 37 transition count 40
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 7 with 20 rules applied. Total rules applied 185 place count 27 transition count 30
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 186 place count 26 transition count 28
Iterating global reduction 7 with 1 rules applied. Total rules applied 187 place count 26 transition count 28
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 188 place count 26 transition count 27
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 189 place count 26 transition count 27
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 190 place count 25 transition count 26
Iterating global reduction 7 with 1 rules applied. Total rules applied 191 place count 25 transition count 26
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 193 place count 23 transition count 24
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 194 place count 22 transition count 24
Applied a total of 194 rules in 12 ms. Remains 22 /117 variables (removed 95) and now considering 24/130 (removed 106) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 22/117 places, 24/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 24 transitions.
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
FORMULA AutonomousCar-PT-01b-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 104 transition count 117
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 104 transition count 117
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 104 transition count 113
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 31 place count 103 transition count 112
Iterating global reduction 1 with 1 rules applied. Total rules applied 32 place count 103 transition count 112
Applied a total of 32 rules in 4 ms. Remains 103 /117 variables (removed 14) and now considering 112/130 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 103/117 places, 112/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 117/117 places, 130/130 transitions.
Graph (trivial) has 91 edges and 117 vertex of which 4 / 117 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.
Drop transitions removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 115 transition count 87
Reduce places removed 41 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 1 with 48 rules applied. Total rules applied 90 place count 74 transition count 80
Reduce places removed 4 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 8 rules applied. Total rules applied 98 place count 70 transition count 76
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 102 place count 66 transition count 76
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 102 place count 66 transition count 72
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 110 place count 62 transition count 72
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 118 place count 54 transition count 64
Iterating global reduction 4 with 8 rules applied. Total rules applied 126 place count 54 transition count 64
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 131 place count 54 transition count 59
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 133 place count 52 transition count 57
Iterating global reduction 5 with 2 rules applied. Total rules applied 135 place count 52 transition count 57
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 163 place count 38 transition count 43
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 164 place count 38 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 6 with 2 rules applied. Total rules applied 166 place count 37 transition count 41
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 6 with 4 rules applied. Total rules applied 170 place count 37 transition count 41
Applied a total of 170 rules in 9 ms. Remains 37 /117 variables (removed 80) and now considering 41/130 (removed 89) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 37/117 places, 41/130 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 1 ms
[2023-03-13 09:10:39] [INFO ] Input system was already deterministic with 41 transitions.
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:10:39] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:10:39] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 7 ms.
[2023-03-13 09:10:39] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 117 places, 130 transitions and 335 arcs took 3 ms.
Total runtime 3471 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: 117 NrTr: 130 NrArc: 335)

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

net check time: 0m 0.000sec

init dd package: 0m 2.838sec


RS generation: 0m 0.084sec


-> reachability set: #nodes 2864 (2.9e+03) #states 114,394 (5)



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

checking: A [EF [AX [[p98<=1 & 1<=p98]]] U EG [EX [EF [[p35<=1 & 1<=p35]]]]]
normalized: [~ [EG [~ [EG [EX [E [true U [p35<=1 & 1<=p35]]]]]]] & ~ [E [~ [EG [EX [E [true U [p35<=1 & 1<=p35]]]]] U [~ [EG [EX [E [true U [p35<=1 & 1<=p35]]]]] & ~ [E [true U ~ [EX [~ [[p98<=1 & 1<=p98]]]]]]]]]]

abstracting: (1<=p98)
states: 2,511 (3)
abstracting: (p98<=1)
states: 114,394 (5)
.abstracting: (1<=p35)
states: 2,484 (3)
abstracting: (p35<=1)
states: 114,394 (5)
.............................
EG iterations: 28
abstracting: (1<=p35)
states: 2,484 (3)
abstracting: (p35<=1)
states: 114,394 (5)
.............................
EG iterations: 28
abstracting: (1<=p35)
states: 2,484 (3)
abstracting: (p35<=1)
states: 114,394 (5)
.............................
EG iterations: 28
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.504sec

checking: AF [EG [A [~ [[p109<=1 & 1<=p109]] U [[p41<=1 & 1<=p41] | [p61<=1 & 1<=p61]]]]]
normalized: ~ [EG [~ [EG [[~ [EG [~ [[[p61<=1 & 1<=p61] | [p41<=1 & 1<=p41]]]]] & ~ [E [~ [[[p61<=1 & 1<=p61] | [p41<=1 & 1<=p41]]] U [[p109<=1 & 1<=p109] & ~ [[[p61<=1 & 1<=p61] | [p41<=1 & 1<=p41]]]]]]]]]]]

abstracting: (1<=p41)
states: 3,962 (3)
abstracting: (p41<=1)
states: 114,394 (5)
abstracting: (1<=p61)
states: 2,944 (3)
abstracting: (p61<=1)
states: 114,394 (5)
abstracting: (1<=p109)
states: 2,511 (3)
abstracting: (p109<=1)
states: 114,394 (5)
abstracting: (1<=p41)
states: 3,962 (3)
abstracting: (p41<=1)
states: 114,394 (5)
abstracting: (1<=p61)
states: 2,944 (3)
abstracting: (p61<=1)
states: 114,394 (5)
abstracting: (1<=p41)
states: 3,962 (3)
abstracting: (p41<=1)
states: 114,394 (5)
abstracting: (1<=p61)
states: 2,944 (3)
abstracting: (p61<=1)
states: 114,394 (5)
.......................
EG iterations: 23
.......................
EG iterations: 23
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.372sec

checking: EG [A [[p56<=1 & 1<=p56] U EX [[~ [E [[p100<=1 & 1<=p100] U [p43<=1 & 1<=p43]]] | AG [[p10<=1 & 1<=p10]]]]]]
normalized: EG [[~ [EG [~ [EX [[~ [E [true U ~ [[p10<=1 & 1<=p10]]]] | ~ [E [[p100<=1 & 1<=p100] U [p43<=1 & 1<=p43]]]]]]]] & ~ [E [~ [EX [[~ [E [true U ~ [[p10<=1 & 1<=p10]]]] | ~ [E [[p100<=1 & 1<=p100] U [p43<=1 & 1<=p43]]]]]] U [~ [EX [[~ [E [true U ~ [[p10<=1 & 1<=p10]]]] | ~ [E [[p100<=1 & 1<=p100] U [p43<=1 & 1<=p43]]]]]] & ~ [[p56<=1 & 1<=p56]]]]]]]

abstracting: (1<=p56)
states: 2,944 (3)
abstracting: (p56<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p100)
states: 2,511 (3)
abstracting: (p100<=1)
states: 114,394 (5)
abstracting: (1<=p10)
states: 20,332 (4)
abstracting: (p10<=1)
states: 114,394 (5)
.abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p100)
states: 2,511 (3)
abstracting: (p100<=1)
states: 114,394 (5)
abstracting: (1<=p10)
states: 20,332 (4)
abstracting: (p10<=1)
states: 114,394 (5)
.abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p100)
states: 2,511 (3)
abstracting: (p100<=1)
states: 114,394 (5)
abstracting: (1<=p10)
states: 20,332 (4)
abstracting: (p10<=1)
states: 114,394 (5)
...
EG iterations: 2
.............................................
EG iterations: 45
-> the formula is TRUE

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

MC time: 0m 0.354sec

checking: EF [[[p20<=1 & 1<=p20] | [AG [[[p87<=1 & 1<=p87] & [p110<=1 & 1<=p110]]] & AF [[p34<=1 & 1<=p34]]]]]
normalized: E [true U [[~ [E [true U ~ [[[p110<=1 & 1<=p110] & [p87<=1 & 1<=p87]]]]] & ~ [EG [~ [[p34<=1 & 1<=p34]]]]] | [p20<=1 & 1<=p20]]]

abstracting: (1<=p20)
states: 2,484 (3)
abstracting: (p20<=1)
states: 114,394 (5)
abstracting: (1<=p34)
states: 3,962 (3)
abstracting: (p34<=1)
states: 114,394 (5)
.
EG iterations: 1
abstracting: (1<=p87)
states: 3,348 (3)
abstracting: (p87<=1)
states: 114,394 (5)
abstracting: (1<=p110)
states: 21,416 (4)
abstracting: (p110<=1)
states: 114,394 (5)
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: EX [EG [E [A [[[p28<=1 & 1<=p28] & [p96<=1 & 1<=p96]] U [[p64<=1 & 1<=p64] | [p107<=1 & 1<=p107]]] U ~ [EF [[p28<=1 & 1<=p28]]]]]]
normalized: EX [EG [E [[~ [EG [~ [[[p107<=1 & 1<=p107] | [p64<=1 & 1<=p64]]]]] & ~ [E [~ [[[p107<=1 & 1<=p107] | [p64<=1 & 1<=p64]]] U [~ [[[p96<=1 & 1<=p96] & [p28<=1 & 1<=p28]]] & ~ [[[p107<=1 & 1<=p107] | [p64<=1 & 1<=p64]]]]]]] U ~ [E [true U [p28<=1 & 1<=p28]]]]]]

abstracting: (1<=p28)
states: 3,962 (3)
abstracting: (p28<=1)
states: 114,394 (5)
abstracting: (1<=p64)
states: 2,944 (3)
abstracting: (p64<=1)
states: 114,394 (5)
abstracting: (1<=p107)
states: 2,511 (3)
abstracting: (p107<=1)
states: 114,394 (5)
abstracting: (1<=p28)
states: 3,962 (3)
abstracting: (p28<=1)
states: 114,394 (5)
abstracting: (1<=p96)
states: 2,511 (3)
abstracting: (p96<=1)
states: 114,394 (5)
abstracting: (1<=p64)
states: 2,944 (3)
abstracting: (p64<=1)
states: 114,394 (5)
abstracting: (1<=p107)
states: 2,511 (3)
abstracting: (p107<=1)
states: 114,394 (5)
abstracting: (1<=p64)
states: 2,944 (3)
abstracting: (p64<=1)
states: 114,394 (5)
abstracting: (1<=p107)
states: 2,511 (3)
abstracting: (p107<=1)
states: 114,394 (5)
........................
EG iterations: 24
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m 0.219sec

checking: [EX [[p96<=1 & 1<=p96]] | AF [EG [[[[[p41<=1 & 1<=p41] | [p34<=1 & 1<=p34]] & [EG [[p24<=1 & 1<=p24]] & EX [[p43<=1 & 1<=p43]]]] | [[p98<=0 & 0<=p98] | AG [[p23<=1 & 1<=p23]]]]]]]
normalized: [~ [EG [~ [EG [[[~ [E [true U ~ [[p23<=1 & 1<=p23]]]] | [p98<=0 & 0<=p98]] | [[EG [[p24<=1 & 1<=p24]] & EX [[p43<=1 & 1<=p43]]] & [[p34<=1 & 1<=p34] | [p41<=1 & 1<=p41]]]]]]]] | EX [[p96<=1 & 1<=p96]]]

abstracting: (1<=p96)
states: 2,511 (3)
abstracting: (p96<=1)
states: 114,394 (5)
.abstracting: (1<=p41)
states: 3,962 (3)
abstracting: (p41<=1)
states: 114,394 (5)
abstracting: (1<=p34)
states: 3,962 (3)
abstracting: (p34<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
.abstracting: (1<=p24)
states: 3,962 (3)
abstracting: (p24<=1)
states: 114,394 (5)
...................
EG iterations: 19
abstracting: (0<=p98)
states: 114,394 (5)
abstracting: (p98<=0)
states: 111,883 (5)
abstracting: (1<=p23)
states: 3,962 (3)
abstracting: (p23<=1)
states: 114,394 (5)
...............................................
EG iterations: 47
................................................
EG iterations: 48
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.410sec

checking: E [[~ [[p27<=1 & 1<=p27]] | A [[p8<=1 & 1<=p8] U [p3<=1 & 1<=p3]]] U [AX [[p32<=1 & 1<=p32]] & [~ [[p12<=1 & 1<=p12]] & [[p115<=1 & 1<=p115] | [p105<=1 & 1<=p105]]]]]
normalized: E [[[~ [EG [~ [[p3<=1 & 1<=p3]]]] & ~ [E [~ [[p3<=1 & 1<=p3]] U [~ [[p8<=1 & 1<=p8]] & ~ [[p3<=1 & 1<=p3]]]]]] | ~ [[p27<=1 & 1<=p27]]] U [[[[p105<=1 & 1<=p105] | [p115<=1 & 1<=p115]] & ~ [[p12<=1 & 1<=p12]]] & ~ [EX [~ [[p32<=1 & 1<=p32]]]]]]

abstracting: (1<=p32)
states: 2,484 (3)
abstracting: (p32<=1)
states: 114,394 (5)
.abstracting: (1<=p12)
states: 20,332 (4)
abstracting: (p12<=1)
states: 114,394 (5)
abstracting: (1<=p115)
states: 2,565 (3)
abstracting: (p115<=1)
states: 114,394 (5)
abstracting: (1<=p105)
states: 2,511 (3)
abstracting: (p105<=1)
states: 114,394 (5)
abstracting: (1<=p27)
states: 3,962 (3)
abstracting: (p27<=1)
states: 114,394 (5)
abstracting: (1<=p3)
states: 8,470 (3)
abstracting: (p3<=1)
states: 114,394 (5)
abstracting: (1<=p8)
states: 1,531 (3)
abstracting: (p8<=1)
states: 114,394 (5)
abstracting: (1<=p3)
states: 8,470 (3)
abstracting: (p3<=1)
states: 114,394 (5)
abstracting: (1<=p3)
states: 8,470 (3)
abstracting: (p3<=1)
states: 114,394 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.032sec

checking: AF [AG [[[p71<=0 & 0<=p71] & [[[p72<=1 & 1<=p72] | [[p4<=0 & 0<=p4] | [p32<=0 & 0<=p32]]] & [[p78<=1 & 1<=p78] | [[p92<=1 & 1<=p92] | [[p38<=1 & 1<=p38] & [p77<=1 & 1<=p77]]]]]]]]
normalized: ~ [EG [E [true U ~ [[[[[p78<=1 & 1<=p78] | [[[p77<=1 & 1<=p77] & [p38<=1 & 1<=p38]] | [p92<=1 & 1<=p92]]] & [[[p32<=0 & 0<=p32] | [p4<=0 & 0<=p4]] | [p72<=1 & 1<=p72]]] & [p71<=0 & 0<=p71]]]]]]

abstracting: (0<=p71)
states: 114,394 (5)
abstracting: (p71<=0)
states: 112,276 (5)
abstracting: (1<=p72)
states: 2,118 (3)
abstracting: (p72<=1)
states: 114,394 (5)
abstracting: (0<=p4)
states: 114,394 (5)
abstracting: (p4<=0)
states: 105,924 (5)
abstracting: (0<=p32)
states: 114,394 (5)
abstracting: (p32<=0)
states: 111,910 (5)
abstracting: (1<=p92)
states: 26,059 (4)
abstracting: (p92<=1)
states: 114,394 (5)
abstracting: (1<=p38)
states: 6,446 (3)
abstracting: (p38<=1)
states: 114,394 (5)
abstracting: (1<=p77)
states: 14,576 (4)
abstracting: (p77<=1)
states: 114,394 (5)
abstracting: (1<=p78)
states: 1,050 (3)
abstracting: (p78<=1)
states: 114,394 (5)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.043sec

checking: AG [[EF [[p0<=1 & 1<=p0]] | [[~ [A [EX [[p115<=1 & 1<=p115]] U ~ [A [[p59<=1 & 1<=p59] U [p84<=1 & 1<=p84]]]]] & ~ [E [[p42<=1 & 1<=p42] U AX [[p74<=1 & 1<=p74]]]]] | [[p47<=1 & 1<=p47] & AF [[p54<=1 & 1<=p54]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [[p54<=1 & 1<=p54]]]] & [p47<=1 & 1<=p47]] | [~ [E [[p42<=1 & 1<=p42] U ~ [EX [~ [[p74<=1 & 1<=p74]]]]]] & ~ [[~ [EG [[~ [EG [~ [[p84<=1 & 1<=p84]]]] & ~ [E [~ [[p84<=1 & 1<=p84]] U [~ [[p59<=1 & 1<=p59]] & ~ [[p84<=1 & 1<=p84]]]]]]]] & ~ [E [[~ [EG [~ [[p84<=1 & 1<=p84]]]] & ~ [E [~ [[p84<=1 & 1<=p84]] U [~ [[p59<=1 & 1<=p59]] & ~ [[p84<=1 & 1<=p84]]]]]] U [~ [EX [[p115<=1 & 1<=p115]]] & [~ [EG [~ [[p84<=1 & 1<=p84]]]] & ~ [E [~ [[p84<=1 & 1<=p84]] U [~ [[p59<=1 & 1<=p59]] & ~ [[p84<=1 & 1<=p84]]]]]]]]]]]]] | E [true U [p0<=1 & 1<=p0]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 114,394 (5)
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
abstracting: (1<=p59)
states: 2,944 (3)
abstracting: (p59<=1)
states: 114,394 (5)
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
..........................................................
EG iterations: 58
abstracting: (1<=p115)
states: 2,565 (3)
abstracting: (p115<=1)
states: 114,394 (5)
.abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
abstracting: (1<=p59)
states: 2,944 (3)
abstracting: (p59<=1)
states: 114,394 (5)
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
..........................................................
EG iterations: 58
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
abstracting: (1<=p59)
states: 2,944 (3)
abstracting: (p59<=1)
states: 114,394 (5)
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
abstracting: (1<=p84)
states: 8,453 (3)
abstracting: (p84<=1)
states: 114,394 (5)
..........................................................
EG iterations: 58
............................
EG iterations: 28
abstracting: (1<=p74)
states: 2,118 (3)
abstracting: (p74<=1)
states: 114,394 (5)
.abstracting: (1<=p42)
states: 3,962 (3)
abstracting: (p42<=1)
states: 114,394 (5)
abstracting: (1<=p47)
states: 600
abstracting: (p47<=1)
states: 114,394 (5)
abstracting: (1<=p54)
states: 2,944 (3)
abstracting: (p54<=1)
states: 114,394 (5)
..............................
EG iterations: 30
-> the formula is FALSE

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

MC time: 0m 0.906sec

checking: AF [[EG [[[[p0<=0 & 0<=p0] & [[[p29<=1 & 1<=p29] | [p5<=1 & 1<=p5]] | [[p67<=1 & 1<=p67] | [p66<=1 & 1<=p66]]]] & [[p73<=0 & 0<=p73] & [[p65<=1 & 1<=p65] & [p37<=1 & 1<=p37]]]]] & [[p49<=0 & 0<=p49] & [EF [[p98<=1 & 1<=p98]] | A [[p42<=1 & 1<=p42] U [p95<=1 & 1<=p95]]]]]]
normalized: ~ [EG [~ [[EG [[[[[[p66<=1 & 1<=p66] | [p67<=1 & 1<=p67]] | [[p5<=1 & 1<=p5] | [p29<=1 & 1<=p29]]] & [p0<=0 & 0<=p0]] & [[[p65<=1 & 1<=p65] & [p37<=1 & 1<=p37]] & [p73<=0 & 0<=p73]]]] & [[E [true U [p98<=1 & 1<=p98]] | [~ [EG [~ [[p95<=1 & 1<=p95]]]] & ~ [E [~ [[p95<=1 & 1<=p95]] U [~ [[p42<=1 & 1<=p42]] & ~ [[p95<=1 & 1<=p95]]]]]]] & [p49<=0 & 0<=p49]]]]]]

abstracting: (0<=p49)
states: 114,394 (5)
abstracting: (p49<=0)
states: 113,794 (5)
abstracting: (1<=p95)
states: 2,511 (3)
abstracting: (p95<=1)
states: 114,394 (5)
abstracting: (1<=p42)
states: 3,962 (3)
abstracting: (p42<=1)
states: 114,394 (5)
abstracting: (1<=p95)
states: 2,511 (3)
abstracting: (p95<=1)
states: 114,394 (5)
abstracting: (1<=p95)
states: 2,511 (3)
abstracting: (p95<=1)
states: 114,394 (5)
.
EG iterations: 1
abstracting: (1<=p98)
states: 2,511 (3)
abstracting: (p98<=1)
states: 114,394 (5)
abstracting: (0<=p73)
states: 114,394 (5)
abstracting: (p73<=0)
states: 112,276 (5)
abstracting: (1<=p37)
states: 3,812 (3)
abstracting: (p37<=1)
states: 114,394 (5)
abstracting: (1<=p65)
states: 2,944 (3)
abstracting: (p65<=1)
states: 114,394 (5)
abstracting: (0<=p0)
states: 114,394 (5)
abstracting: (p0<=0)
states: 114,393 (5)
abstracting: (1<=p29)
states: 3,962 (3)
abstracting: (p29<=1)
states: 114,394 (5)
abstracting: (1<=p5)
states: 40,664 (4)
abstracting: (p5<=1)
states: 114,394 (5)
abstracting: (1<=p67)
states: 2,944 (3)
abstracting: (p67<=1)
states: 114,394 (5)
abstracting: (1<=p66)
states: 2,944 (3)
abstracting: (p66<=1)
states: 114,394 (5)
..........
EG iterations: 10

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.120sec

checking: [A [[p104<=1 & 1<=p104] U AG [[[E [[p43<=1 & 1<=p43] U [p24<=1 & 1<=p24]] | ~ [[[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]] & [[p37<=1 & 1<=p37] & [p76<=1 & 1<=p76]]]]] | [[p96<=1 & 1<=p96] | [p34<=1 & 1<=p34]]]]] | [A [[p63<=1 & 1<=p63] U E [EF [[p83<=1 & 1<=p83]] U [p57<=1 & 1<=p57]]] | [AG [EF [[p34<=0 & 0<=p34]]] & EG [[AX [[p39<=1 & 1<=p39]] | EX [EG [[p63<=0 & 0<=p63]]]]]]]]
normalized: [[[EG [[EX [EG [[p63<=0 & 0<=p63]]] | ~ [EX [~ [[p39<=1 & 1<=p39]]]]]] & ~ [E [true U ~ [E [true U [p34<=0 & 0<=p34]]]]]] | [~ [EG [~ [E [E [true U [p83<=1 & 1<=p83]] U [p57<=1 & 1<=p57]]]]] & ~ [E [~ [E [E [true U [p83<=1 & 1<=p83]] U [p57<=1 & 1<=p57]]] U [~ [[p63<=1 & 1<=p63]] & ~ [E [E [true U [p83<=1 & 1<=p83]] U [p57<=1 & 1<=p57]]]]]]]] | [~ [EG [E [true U ~ [[[[p34<=1 & 1<=p34] | [p96<=1 & 1<=p96]] | [~ [[[[p76<=1 & 1<=p76] & [p37<=1 & 1<=p37]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]] | E [[p43<=1 & 1<=p43] U [p24<=1 & 1<=p24]]]]]]]] & ~ [E [E [true U ~ [[[[p34<=1 & 1<=p34] | [p96<=1 & 1<=p96]] | [~ [[[[p76<=1 & 1<=p76] & [p37<=1 & 1<=p37]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]] | E [[p43<=1 & 1<=p43] U [p24<=1 & 1<=p24]]]]]] U [~ [[p104<=1 & 1<=p104]] & E [true U ~ [[[[p34<=1 & 1<=p34] | [p96<=1 & 1<=p96]] | [~ [[[[p76<=1 & 1<=p76] & [p37<=1 & 1<=p37]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]] | E [[p43<=1 & 1<=p43] U [p24<=1 & 1<=p24]]]]]]]]]]]

abstracting: (1<=p24)
states: 3,962 (3)
abstracting: (p24<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p37)
states: 3,812 (3)
abstracting: (p37<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p96)
states: 2,511 (3)
abstracting: (p96<=1)
states: 114,394 (5)
abstracting: (1<=p34)
states: 3,962 (3)
abstracting: (p34<=1)
states: 114,394 (5)
abstracting: (1<=p104)
states: 2,511 (3)
abstracting: (p104<=1)
states: 114,394 (5)
abstracting: (1<=p24)
states: 3,962 (3)
abstracting: (p24<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p37)
states: 3,812 (3)
abstracting: (p37<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p96)
states: 2,511 (3)
abstracting: (p96<=1)
states: 114,394 (5)
abstracting: (1<=p34)
states: 3,962 (3)
abstracting: (p34<=1)
states: 114,394 (5)
abstracting: (1<=p24)
states: 3,962 (3)
abstracting: (p24<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p37)
states: 3,812 (3)
abstracting: (p37<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p96)
states: 2,511 (3)
abstracting: (p96<=1)
states: 114,394 (5)
abstracting: (1<=p34)
states: 3,962 (3)
abstracting: (p34<=1)
states: 114,394 (5)
...............
EG iterations: 15
abstracting: (1<=p57)
states: 2,944 (3)
abstracting: (p57<=1)
states: 114,394 (5)
abstracting: (1<=p83)
states: 513
abstracting: (p83<=1)
states: 114,394 (5)
abstracting: (1<=p63)
states: 2,944 (3)
abstracting: (p63<=1)
states: 114,394 (5)
abstracting: (1<=p57)
states: 2,944 (3)
abstracting: (p57<=1)
states: 114,394 (5)
abstracting: (1<=p83)
states: 513
abstracting: (p83<=1)
states: 114,394 (5)
abstracting: (1<=p57)
states: 2,944 (3)
abstracting: (p57<=1)
states: 114,394 (5)
abstracting: (1<=p83)
states: 513
abstracting: (p83<=1)
states: 114,394 (5)
.........................
EG iterations: 25
abstracting: (0<=p34)
states: 114,394 (5)
abstracting: (p34<=0)
states: 110,432 (5)
abstracting: (1<=p39)
states: 6,446 (3)
abstracting: (p39<=1)
states: 114,394 (5)
.abstracting: (0<=p63)
states: 114,394 (5)
abstracting: (p63<=0)
states: 111,450 (5)
.........................
EG iterations: 25
..
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.740sec

checking: AX [A [~ [[p96<=1 & 1<=p96]] U [E [[[p38<=1 & 1<=p38] & [[p77<=1 & 1<=p77] & [p105<=1 & 1<=p105]]] U [p94<=1 & 1<=p94]] | [[[p105<=1 & 1<=p105] & [[p43<=1 & 1<=p43] | [[[p70<=1 & 1<=p70] & [p67<=1 & 1<=p67]] & [[p78<=1 & 1<=p78] & [p10<=1 & 1<=p10]]]]] | [~ [AG [[[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]] & [[p21<=1 & 1<=p21] & [p76<=1 & 1<=p76]]]]] & AG [[p36<=1 & 1<=p36]]]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[[[~ [E [true U ~ [[p36<=1 & 1<=p36]]]] & E [true U ~ [[[[p76<=1 & 1<=p76] & [p21<=1 & 1<=p21]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]]]] | [[[[[p10<=1 & 1<=p10] & [p78<=1 & 1<=p78]] & [[p67<=1 & 1<=p67] & [p70<=1 & 1<=p70]]] | [p43<=1 & 1<=p43]] & [p105<=1 & 1<=p105]]] | E [[[[p105<=1 & 1<=p105] & [p77<=1 & 1<=p77]] & [p38<=1 & 1<=p38]] U [p94<=1 & 1<=p94]]]]]] & ~ [E [~ [[[[~ [E [true U ~ [[p36<=1 & 1<=p36]]]] & E [true U ~ [[[[p76<=1 & 1<=p76] & [p21<=1 & 1<=p21]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]]]] | [[[[[p10<=1 & 1<=p10] & [p78<=1 & 1<=p78]] & [[p67<=1 & 1<=p67] & [p70<=1 & 1<=p70]]] | [p43<=1 & 1<=p43]] & [p105<=1 & 1<=p105]]] | E [[[[p105<=1 & 1<=p105] & [p77<=1 & 1<=p77]] & [p38<=1 & 1<=p38]] U [p94<=1 & 1<=p94]]]] U [~ [[[[~ [E [true U ~ [[p36<=1 & 1<=p36]]]] & E [true U ~ [[[[p76<=1 & 1<=p76] & [p21<=1 & 1<=p21]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]]]] | [[[[[p10<=1 & 1<=p10] & [p78<=1 & 1<=p78]] & [[p67<=1 & 1<=p67] & [p70<=1 & 1<=p70]]] | [p43<=1 & 1<=p43]] & [p105<=1 & 1<=p105]]] | E [[[[p105<=1 & 1<=p105] & [p77<=1 & 1<=p77]] & [p38<=1 & 1<=p38]] U [p94<=1 & 1<=p94]]]] & [p96<=1 & 1<=p96]]]]]]]]

abstracting: (1<=p96)
states: 2,511 (3)
abstracting: (p96<=1)
states: 114,394 (5)
abstracting: (1<=p94)
states: 2,565 (3)
abstracting: (p94<=1)
states: 114,394 (5)
abstracting: (1<=p38)
states: 6,446 (3)
abstracting: (p38<=1)
states: 114,394 (5)
abstracting: (1<=p77)
states: 14,576 (4)
abstracting: (p77<=1)
states: 114,394 (5)
abstracting: (1<=p105)
states: 2,511 (3)
abstracting: (p105<=1)
states: 114,394 (5)
abstracting: (1<=p105)
states: 2,511 (3)
abstracting: (p105<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p70)
states: 2,118 (3)
abstracting: (p70<=1)
states: 114,394 (5)
abstracting: (1<=p67)
states: 2,944 (3)
abstracting: (p67<=1)
states: 114,394 (5)
abstracting: (1<=p78)
states: 1,050 (3)
abstracting: (p78<=1)
states: 114,394 (5)
abstracting: (1<=p10)
states: 20,332 (4)
abstracting: (p10<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p21)
states: 3,962 (3)
abstracting: (p21<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p36)
states: 1,674 (3)
abstracting: (p36<=1)
states: 114,394 (5)
abstracting: (1<=p94)
states: 2,565 (3)
abstracting: (p94<=1)
states: 114,394 (5)
abstracting: (1<=p38)
states: 6,446 (3)
abstracting: (p38<=1)
states: 114,394 (5)
abstracting: (1<=p77)
states: 14,576 (4)
abstracting: (p77<=1)
states: 114,394 (5)
abstracting: (1<=p105)
states: 2,511 (3)
abstracting: (p105<=1)
states: 114,394 (5)
abstracting: (1<=p105)
states: 2,511 (3)
abstracting: (p105<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p70)
states: 2,118 (3)
abstracting: (p70<=1)
states: 114,394 (5)
abstracting: (1<=p67)
states: 2,944 (3)
abstracting: (p67<=1)
states: 114,394 (5)
abstracting: (1<=p78)
states: 1,050 (3)
abstracting: (p78<=1)
states: 114,394 (5)
abstracting: (1<=p10)
states: 20,332 (4)
abstracting: (p10<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p21)
states: 3,962 (3)
abstracting: (p21<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p36)
states: 1,674 (3)
abstracting: (p36<=1)
states: 114,394 (5)
abstracting: (1<=p94)
states: 2,565 (3)
abstracting: (p94<=1)
states: 114,394 (5)
abstracting: (1<=p38)
states: 6,446 (3)
abstracting: (p38<=1)
states: 114,394 (5)
abstracting: (1<=p77)
states: 14,576 (4)
abstracting: (p77<=1)
states: 114,394 (5)
abstracting: (1<=p105)
states: 2,511 (3)
abstracting: (p105<=1)
states: 114,394 (5)
abstracting: (1<=p105)
states: 2,511 (3)
abstracting: (p105<=1)
states: 114,394 (5)
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p70)
states: 2,118 (3)
abstracting: (p70<=1)
states: 114,394 (5)
abstracting: (1<=p67)
states: 2,944 (3)
abstracting: (p67<=1)
states: 114,394 (5)
abstracting: (1<=p78)
states: 1,050 (3)
abstracting: (p78<=1)
states: 114,394 (5)
abstracting: (1<=p10)
states: 20,332 (4)
abstracting: (p10<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p21)
states: 3,962 (3)
abstracting: (p21<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p36)
states: 1,674 (3)
abstracting: (p36<=1)
states: 114,394 (5)
..........................................................
EG iterations: 58
.-> the formula is TRUE

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

MC time: 0m 0.679sec

checking: [EX [[[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]] & [[p40<=1 & 1<=p40] & [p76<=1 & 1<=p76]]]] | [EG [[[EX [[p93<=1 & 1<=p93]] | [E [[p99<=1 & 1<=p99] U [p30<=1 & 1<=p30]] | AX [[p107<=1 & 1<=p107]]]] | [EX [~ [E [[p45<=1 & 1<=p45] U [p72<=1 & 1<=p72]]]] | [[p102<=1 & 1<=p102] | [p116<=1 & 1<=p116]]]]] | AG [AX [[[E [[p89<=1 & 1<=p89] U [p43<=1 & 1<=p43]] & E [[[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]] & [[p40<=1 & 1<=p40] & [p76<=1 & 1<=p76]]] U [p7<=1 & 1<=p7]]] | AX [AF [[p63<=1 & 1<=p63]]]]]]]]
normalized: [EX [[[[p76<=1 & 1<=p76] & [p40<=1 & 1<=p40]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]] | [~ [E [true U EX [~ [[~ [EX [EG [~ [[p63<=1 & 1<=p63]]]]] | [E [[[[p76<=1 & 1<=p76] & [p40<=1 & 1<=p40]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]] U [p7<=1 & 1<=p7]] & E [[p89<=1 & 1<=p89] U [p43<=1 & 1<=p43]]]]]]]] | EG [[[[[p116<=1 & 1<=p116] | [p102<=1 & 1<=p102]] | EX [~ [E [[p45<=1 & 1<=p45] U [p72<=1 & 1<=p72]]]]] | [[~ [EX [~ [[p107<=1 & 1<=p107]]]] | E [[p99<=1 & 1<=p99] U [p30<=1 & 1<=p30]]] | EX [[p93<=1 & 1<=p93]]]]]]]

abstracting: (1<=p93)
states: 8,453 (3)
abstracting: (p93<=1)
states: 114,394 (5)
.abstracting: (1<=p30)
states: 3,962 (3)
abstracting: (p30<=1)
states: 114,394 (5)
abstracting: (1<=p99)
states: 2,511 (3)
abstracting: (p99<=1)
states: 114,394 (5)
abstracting: (1<=p107)
states: 2,511 (3)
abstracting: (p107<=1)
states: 114,394 (5)
.abstracting: (1<=p72)
states: 2,118 (3)
abstracting: (p72<=1)
states: 114,394 (5)
abstracting: (1<=p45)
states: 600
abstracting: (p45<=1)
states: 114,394 (5)
.abstracting: (1<=p102)
states: 13,017 (4)
abstracting: (p102<=1)
states: 114,394 (5)
abstracting: (1<=p116)
states: 2,565 (3)
abstracting: (p116<=1)
states: 114,394 (5)
...
EG iterations: 3
abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p89)
states: 3,348 (3)
abstracting: (p89<=1)
states: 114,394 (5)
abstracting: (1<=p7)
states: 1,531 (3)
abstracting: (p7<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p40)
states: 3,962 (3)
abstracting: (p40<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p63)
states: 2,944 (3)
abstracting: (p63<=1)
states: 114,394 (5)
.........................
EG iterations: 25
..abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p40)
states: 3,962 (3)
abstracting: (p40<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
.-> the formula is TRUE

FORMULA AutonomousCar-PT-01b-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.256sec

checking: [A [[[A [[p43<=1 & 1<=p43] U [p106<=1 & 1<=p106]] | [AX [[p81<=1 & 1<=p81]] | EG [[p26<=1 & 1<=p26]]]] | [[[p2<=1 & 1<=p2] | AX [[p75<=1 & 1<=p75]]] | [~ [AF [[p106<=1 & 1<=p106]]] | AF [[[AF [[p72<=1 & 1<=p72]] | E [[p106<=1 & 1<=p106] U [p27<=1 & 1<=p27]]] | [[p61<=1 & 1<=p61] | [p30<=1 & 1<=p30]]]]]]] U [AG [~ [[p3<=1 & 1<=p3]]] | AF [EX [[p58<=1 & 1<=p58]]]]] | [AF [EG [[p52<=1 & 1<=p52]]] & EX [[E [[[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]] & [[p33<=1 & 1<=p33] & [p76<=1 & 1<=p76]]] U [p66<=1 & 1<=p66]] & [p57<=1 & 1<=p57]]]]]
normalized: [[~ [EG [~ [[~ [E [true U [p3<=1 & 1<=p3]]] | ~ [EG [~ [EX [[p58<=1 & 1<=p58]]]]]]]]] & ~ [E [~ [[~ [E [true U [p3<=1 & 1<=p3]]] | ~ [EG [~ [EX [[p58<=1 & 1<=p58]]]]]]] U [~ [[~ [E [true U [p3<=1 & 1<=p3]]] | ~ [EG [~ [EX [[p58<=1 & 1<=p58]]]]]]] & ~ [[[[~ [EG [~ [[p106<=1 & 1<=p106]]]] & ~ [E [~ [[p106<=1 & 1<=p106]] U [~ [[p106<=1 & 1<=p106]] & ~ [[p43<=1 & 1<=p43]]]]]] | [~ [EX [~ [[p81<=1 & 1<=p81]]]] | EG [[p26<=1 & 1<=p26]]]] | [[[p2<=1 & 1<=p2] | ~ [EX [~ [[p75<=1 & 1<=p75]]]]] | [~ [EG [~ [[[[p30<=1 & 1<=p30] | [p61<=1 & 1<=p61]] | [E [[p106<=1 & 1<=p106] U [p27<=1 & 1<=p27]] | ~ [EG [~ [[p72<=1 & 1<=p72]]]]]]]]] | EG [~ [[p106<=1 & 1<=p106]]]]]]]]]]] | [EX [[[p57<=1 & 1<=p57] & E [[[[p76<=1 & 1<=p76] & [p33<=1 & 1<=p33]] & [[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]] U [p66<=1 & 1<=p66]]]] & ~ [EG [~ [EG [[p52<=1 & 1<=p52]]]]]]]

abstracting: (1<=p52)
states: 11,408 (4)
abstracting: (p52<=1)
states: 114,394 (5)
........................
EG iterations: 24
................................
EG iterations: 32
abstracting: (1<=p66)
states: 2,944 (3)
abstracting: (p66<=1)
states: 114,394 (5)
abstracting: (1<=p6)
states: 50,665 (4)
abstracting: (p6<=1)
states: 114,394 (5)
abstracting: (1<=p9)
states: 26,456 (4)
abstracting: (p9<=1)
states: 114,394 (5)
abstracting: (1<=p33)
states: 3,962 (3)
abstracting: (p33<=1)
states: 114,394 (5)
abstracting: (1<=p76)
states: 21,056 (4)
abstracting: (p76<=1)
states: 114,394 (5)
abstracting: (1<=p57)
states: 2,944 (3)
abstracting: (p57<=1)
states: 114,394 (5)
.abstracting: (1<=p106)
states: 2,511 (3)
abstracting: (p106<=1)
states: 114,394 (5)
..............................................
EG iterations: 46
abstracting: (1<=p72)
states: 2,118 (3)
abstracting: (p72<=1)
states: 114,394 (5)
....................................
EG iterations: 36
abstracting: (1<=p27)
states: 3,962 (3)
abstracting: (p27<=1)
states: 114,394 (5)
abstracting: (1<=p106)
states: 2,511 (3)
abstracting: (p106<=1)
states: 114,394 (5)
abstracting: (1<=p61)
states: 2,944 (3)
abstracting: (p61<=1)
states: 114,394 (5)
abstracting: (1<=p30)
states: 3,962 (3)
abstracting: (p30<=1)
states: 114,394 (5)
................
EG iterations: 16
abstracting: (1<=p75)
states: 2,118 (3)
abstracting: (p75<=1)
states: 114,394 (5)
.abstracting: (1<=p2)
states: 1,531 (3)
abstracting: (p2<=1)
states: 114,394 (5)
abstracting: (1<=p26)
states: 3,962 (3)
abstracting: (p26<=1)
states: 114,394 (5)
...................
EG iterations: 19
abstracting: (1<=p81)
states: 513
abstracting: (p81<=1)
states: 114,394 (5)
.abstracting: (1<=p43)
states: 3,962 (3)
abstracting: (p43<=1)
states: 114,394 (5)
abstracting: (1<=p106)
states: 2,511 (3)
abstracting: (p106<=1)
states: 114,394 (5)
abstracting: (1<=p106)
states: 2,511 (3)
abstracting: (p106<=1)
states: 114,394 (5)
abstracting: (1<=p106)
states: 2,511 (3)
abstracting: (p106<=1)
states: 114,394 (5)
..............................................
EG iterations: 46
abstracting: (1<=p58)
states: 2,944 (3)
abstracting: (p58<=1)
states: 114,394 (5)
........................
EG iterations: 23
abstracting: (1<=p3)
states: 8,470 (3)
abstracting: (p3<=1)
states: 114,394 (5)
abstracting: (1<=p58)
states: 2,944 (3)
abstracting: (p58<=1)
states: 114,394 (5)
........................
EG iterations: 23
abstracting: (1<=p3)
states: 8,470 (3)
abstracting: (p3<=1)
states: 114,394 (5)
abstracting: (1<=p58)
states: 2,944 (3)
abstracting: (p58<=1)
states: 114,394 (5)
........................
EG iterations: 23
abstracting: (1<=p3)
states: 8,470 (3)
abstracting: (p3<=1)
states: 114,394 (5)
.............................................
EG iterations: 45
-> the formula is FALSE

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

MC time: 0m 1.627sec

totally nodes used: 5312506 (5.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6004292 14360821 20365113
used/not used/entry size/cache size: 17395871 49712993 16 1024MB
basic ops cache: hits/miss/sum: 497526 1289952 1787478
used/not used/entry size/cache size: 2271208 14506008 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: 6842 30343 37185
used/not used/entry size/cache size: 30288 8358320 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 62377153
1 4228501
2 434581
3 60524
4 7322
5 719
6 60
7 4
8 0
9 0
>= 10 0

Total processing time: 0m12.124sec


BK_STOP 1678698651763

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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:5997 (46), effective:427 (3)

initing FirstDep: 0m 0.000sec


iterations count:2859 (21), effective:243 (1)

iterations count:1716 (13), effective:126 (0)

iterations count:1716 (13), effective:126 (0)

iterations count:1068 (8), effective:80 (0)

iterations count:1716 (13), effective:126 (0)

iterations count:230 (1), effective:21 (0)

iterations count:449 (3), effective:36 (0)

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

iterations count:449 (3), effective:36 (0)

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

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

iterations count:449 (3), effective:36 (0)

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

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

iterations count:1482 (11), effective:113 (0)

iterations count:1250 (9), effective:99 (0)

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

iterations count:450 (3), effective:37 (0)

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

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

iterations count:235 (1), effective:8 (0)

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

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

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

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

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

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

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

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

iterations count:2090 (16), effective:151 (1)

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

iterations count:2361 (18), effective:194 (1)

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

iterations count:2361 (18), effective:194 (1)

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

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

iterations count:2361 (18), effective:194 (1)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:2078 (15), effective:148 (1)

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

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

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

iterations count:480 (3), effective:36 (0)

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

iterations count:449 (3), effective:36 (0)

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

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

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

iterations count:475 (3), effective:36 (0)

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

iterations count:2368 (18), effective:191 (1)

iterations count:2368 (18), effective:191 (1)

iterations count:2152 (16), effective:151 (1)

iterations count:2368 (18), effective:191 (1)

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-01b"
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-01b, 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-167813599200538"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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