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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.2K Feb 25 12:55 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 12:55 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 25 12:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 7.8K Feb 25 12:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Feb 25 12:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 12:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:56 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 75K 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-03b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-03b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678698967550

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-03b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:16:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:16:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:16:09] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-03-13 09:16:09] [INFO ] Transformed 190 places.
[2023-03-13 09:16:09] [INFO ] Transformed 273 transitions.
[2023-03-13 09:16:09] [INFO ] Found NUPN structural information;
[2023-03-13 09:16:09] [INFO ] Parsed PT model containing 190 places and 273 transitions and 1051 arcs in 157 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 94 out of 190 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 190/190 places, 273/273 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 177 transition count 260
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 177 transition count 260
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 174 transition count 257
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 174 transition count 257
Applied a total of 32 rules in 27 ms. Remains 174 /190 variables (removed 16) and now considering 257/273 (removed 16) transitions.
// Phase 1: matrix 257 rows 174 cols
[2023-03-13 09:16:09] [INFO ] Computed 8 place invariants in 18 ms
[2023-03-13 09:16:10] [INFO ] Implicit Places using invariants in 323 ms returned []
[2023-03-13 09:16:10] [INFO ] Invariant cache hit.
[2023-03-13 09:16:10] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 561 ms to find 0 implicit places.
[2023-03-13 09:16:10] [INFO ] Invariant cache hit.
[2023-03-13 09:16:10] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/190 places, 257/273 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 776 ms. Remains : 174/190 places, 257/273 transitions.
Support contains 94 out of 174 places after structural reductions.
[2023-03-13 09:16:10] [INFO ] Flatten gal took : 48 ms
[2023-03-13 09:16:10] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:16:10] [INFO ] Input system was already deterministic with 257 transitions.
Incomplete random walk after 10000 steps, including 9 resets, run finished after 416 ms. (steps per millisecond=24 ) properties (out of 88) seen :39
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 49) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 46) seen :5
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 41) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 37) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 36) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 35) 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 35) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 35) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) 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 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) 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 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-13 09:16:11] [INFO ] Invariant cache hit.
[2023-03-13 09:16:11] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-13 09:16:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2023-03-13 09:16:12] [INFO ] After 796ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :26
[2023-03-13 09:16:13] [INFO ] Deduced a trap composed of 22 places in 66 ms of which 4 ms to minimize.
[2023-03-13 09:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2023-03-13 09:16:13] [INFO ] Deduced a trap composed of 34 places in 124 ms of which 0 ms to minimize.
[2023-03-13 09:16:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 150 ms
[2023-03-13 09:16:13] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 1 ms to minimize.
[2023-03-13 09:16:13] [INFO ] Deduced a trap composed of 42 places in 107 ms of which 3 ms to minimize.
[2023-03-13 09:16:13] [INFO ] Deduced a trap composed of 43 places in 143 ms of which 1 ms to minimize.
[2023-03-13 09:16:13] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 401 ms
[2023-03-13 09:16:13] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2023-03-13 09:16:13] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 0 ms to minimize.
[2023-03-13 09:16:14] [INFO ] Deduced a trap composed of 33 places in 145 ms of which 1 ms to minimize.
[2023-03-13 09:16:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 336 ms
[2023-03-13 09:16:14] [INFO ] After 2644ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :25
Attempting to minimize the solution found.
Minimization took 594 ms.
[2023-03-13 09:16:15] [INFO ] After 3536ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :25
Fused 31 Parikh solutions to 25 different solutions.
Parikh walk visited 1 properties in 309 ms.
Support contains 41 out of 174 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 174/174 places, 257/257 transitions.
Graph (trivial) has 103 edges and 174 vertex of which 2 / 174 are part of one of the 1 SCC in 3 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 422 edges and 173 vertex of which 172 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 172 transition count 210
Reduce places removed 45 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 58 rules applied. Total rules applied 105 place count 127 transition count 197
Reduce places removed 8 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 2 with 14 rules applied. Total rules applied 119 place count 119 transition count 191
Reduce places removed 6 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 8 rules applied. Total rules applied 127 place count 113 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 128 place count 112 transition count 189
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 128 place count 112 transition count 182
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 142 place count 105 transition count 182
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 148 place count 99 transition count 176
Iterating global reduction 5 with 6 rules applied. Total rules applied 154 place count 99 transition count 176
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 5 with 36 rules applied. Total rules applied 190 place count 99 transition count 140
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 191 place count 98 transition count 137
Iterating global reduction 6 with 1 rules applied. Total rules applied 192 place count 98 transition count 137
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 194 place count 98 transition count 135
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 195 place count 97 transition count 135
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 8 with 34 rules applied. Total rules applied 229 place count 80 transition count 118
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 230 place count 80 transition count 117
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 232 place count 79 transition count 116
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 233 place count 79 transition count 115
Free-agglomeration rule applied 5 times.
Iterating global reduction 9 with 5 rules applied. Total rules applied 238 place count 79 transition count 110
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 243 place count 74 transition count 110
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 244 place count 74 transition count 110
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 245 place count 73 transition count 109
Applied a total of 245 rules in 47 ms. Remains 73 /174 variables (removed 101) and now considering 109/257 (removed 148) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 73/174 places, 109/257 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 24) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 84 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 109 rows 73 cols
[2023-03-13 09:16:16] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-13 09:16:16] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-13 09:16:16] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-13 09:16:16] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-13 09:16:16] [INFO ] Deduced a trap composed of 12 places in 37 ms of which 1 ms to minimize.
[2023-03-13 09:16:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 61 ms
[2023-03-13 09:16:16] [INFO ] After 161ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-03-13 09:16:16] [INFO ] After 259ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 5 ms.
Support contains 18 out of 73 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 73/73 places, 109/109 transitions.
Graph (trivial) has 37 edges and 73 vertex of which 2 / 73 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 260 edges and 72 vertex of which 71 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 14 rules applied. Total rules applied 16 place count 71 transition count 93
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 19 rules applied. Total rules applied 35 place count 58 transition count 87
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 39 place count 55 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 40 place count 54 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 40 place count 54 transition count 85
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 42 place count 53 transition count 85
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 44 place count 51 transition count 81
Iterating global reduction 4 with 2 rules applied. Total rules applied 46 place count 51 transition count 81
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 48 place count 51 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 49 place count 50 transition count 79
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 50 place count 49 transition count 78
Iterating global reduction 6 with 1 rules applied. Total rules applied 51 place count 49 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 6 with 8 rules applied. Total rules applied 59 place count 45 transition count 74
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 60 place count 45 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 61 place count 44 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 62 place count 43 transition count 72
Applied a total of 62 rules in 27 ms. Remains 43 /73 variables (removed 30) and now considering 72/109 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 27 ms. Remains : 43/73 places, 72/109 transitions.
Incomplete random walk after 10000 steps, including 309 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 65 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 107 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Probably explored full state space saw : 37786 states, properties seen :2
Probabilistic random walk after 194563 steps, saw 37786 distinct states, run finished after 559 ms. (steps per millisecond=348 ) properties seen :2
Explored full state space saw : 37786 states, properties seen :0
Exhaustive walk after 194563 steps, saw 37786 distinct states, run finished after 99 ms. (steps per millisecond=1965 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 16 simplifications.
FORMULA AutonomousCar-PT-03b-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 16 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 257 transitions.
Support contains 83 out of 174 places (down from 84) after GAL structural reductions.
Computed a total of 38 stabilizing places and 39 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 158 transition count 241
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 68 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 154 transition count 201
Applied a total of 76 rules in 19 ms. Remains 154 /174 variables (removed 20) and now considering 201/257 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 154/174 places, 201/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Graph (trivial) has 163 edges and 174 vertex of which 4 / 174 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 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 171 transition count 183
Reduce places removed 71 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 92 rules applied. Total rules applied 164 place count 100 transition count 162
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 13 rules applied. Total rules applied 177 place count 88 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 178 place count 87 transition count 161
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 178 place count 87 transition count 154
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 192 place count 80 transition count 154
Discarding 10 places :
Symmetric choice reduction at 4 with 10 rule applications. Total rules 202 place count 70 transition count 144
Iterating global reduction 4 with 10 rules applied. Total rules applied 212 place count 70 transition count 144
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 248 place count 70 transition count 108
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 248 place count 70 transition count 107
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 250 place count 69 transition count 107
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 252 place count 67 transition count 103
Iterating global reduction 5 with 2 rules applied. Total rules applied 254 place count 67 transition count 103
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 256 place count 67 transition count 101
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 257 place count 66 transition count 101
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 7 with 46 rules applied. Total rules applied 303 place count 43 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 304 place count 43 transition count 77
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 309 place count 38 transition count 59
Iterating global reduction 8 with 5 rules applied. Total rules applied 314 place count 38 transition count 59
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 318 place count 38 transition count 55
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 320 place count 36 transition count 55
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 10 with 2 rules applied. Total rules applied 322 place count 35 transition count 54
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 323 place count 35 transition count 53
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 325 place count 33 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 326 place count 32 transition count 51
Applied a total of 326 rules in 24 ms. Remains 32 /174 variables (removed 142) and now considering 51/257 (removed 206) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 32/174 places, 51/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Graph (trivial) has 164 edges and 174 vertex of which 4 / 174 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 74 place count 171 transition count 181
Reduce places removed 73 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 1 with 94 rules applied. Total rules applied 168 place count 98 transition count 160
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 2 with 12 rules applied. Total rules applied 180 place count 86 transition count 160
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 180 place count 86 transition count 153
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 194 place count 79 transition count 153
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 204 place count 69 transition count 143
Iterating global reduction 3 with 10 rules applied. Total rules applied 214 place count 69 transition count 143
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 3 with 36 rules applied. Total rules applied 250 place count 69 transition count 107
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 250 place count 69 transition count 106
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 252 place count 68 transition count 106
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 254 place count 66 transition count 102
Iterating global reduction 4 with 2 rules applied. Total rules applied 256 place count 66 transition count 102
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 258 place count 66 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 259 place count 65 transition count 100
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 6 with 44 rules applied. Total rules applied 303 place count 43 transition count 78
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 304 place count 43 transition count 77
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 308 place count 39 transition count 63
Iterating global reduction 7 with 4 rules applied. Total rules applied 312 place count 39 transition count 63
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 7 with 4 rules applied. Total rules applied 316 place count 39 transition count 59
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 318 place count 37 transition count 59
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 320 place count 36 transition count 58
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 321 place count 36 transition count 57
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 323 place count 34 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 324 place count 33 transition count 55
Applied a total of 324 rules in 20 ms. Remains 33 /174 variables (removed 141) and now considering 55/257 (removed 202) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 33/174 places, 55/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 164 transition count 247
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 164 transition count 247
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 163 transition count 246
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 163 transition count 246
Applied a total of 22 rules in 7 ms. Remains 163 /174 variables (removed 11) and now considering 246/257 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 163/174 places, 246/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 246 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 158 transition count 241
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 68 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 154 transition count 201
Applied a total of 76 rules in 9 ms. Remains 154 /174 variables (removed 20) and now considering 201/257 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 154/174 places, 201/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 161 transition count 244
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 161 transition count 244
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 62 place count 161 transition count 208
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 65 place count 158 transition count 205
Iterating global reduction 1 with 3 rules applied. Total rules applied 68 place count 158 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 69 place count 157 transition count 204
Iterating global reduction 1 with 1 rules applied. Total rules applied 70 place count 157 transition count 204
Applied a total of 70 rules in 9 ms. Remains 157 /174 variables (removed 17) and now considering 204/257 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 157/174 places, 204/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 204 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Graph (trivial) has 153 edges and 174 vertex of which 4 / 174 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 64 transitions
Trivial Post-agglo rules discarded 64 transitions
Performed 64 trivial Post agglomeration. Transition count delta: 64
Iterating post reduction 0 with 64 rules applied. Total rules applied 65 place count 171 transition count 190
Reduce places removed 64 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 81 rules applied. Total rules applied 146 place count 107 transition count 173
Reduce places removed 10 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 13 rules applied. Total rules applied 159 place count 97 transition count 170
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 162 place count 94 transition count 170
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 162 place count 94 transition count 162
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 178 place count 86 transition count 162
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 189 place count 75 transition count 151
Iterating global reduction 4 with 11 rules applied. Total rules applied 200 place count 75 transition count 151
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 4 with 37 rules applied. Total rules applied 237 place count 75 transition count 114
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 237 place count 75 transition count 112
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 241 place count 73 transition count 112
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 243 place count 71 transition count 108
Iterating global reduction 5 with 2 rules applied. Total rules applied 245 place count 71 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 247 place count 71 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 248 place count 70 transition count 106
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 7 with 42 rules applied. Total rules applied 290 place count 49 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 291 place count 49 transition count 84
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 296 place count 44 transition count 66
Iterating global reduction 8 with 5 rules applied. Total rules applied 301 place count 44 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 8 with 4 rules applied. Total rules applied 305 place count 44 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 307 place count 42 transition count 62
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 10 with 2 rules applied. Total rules applied 309 place count 41 transition count 61
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 310 place count 41 transition count 60
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 311 place count 41 transition count 60
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 312 place count 40 transition count 59
Iterating global reduction 10 with 1 rules applied. Total rules applied 313 place count 40 transition count 59
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 315 place count 38 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 316 place count 37 transition count 57
Applied a total of 316 rules in 23 ms. Remains 37 /174 variables (removed 137) and now considering 57/257 (removed 200) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 37/174 places, 57/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 2 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 57 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 159 transition count 242
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 159 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 159 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 156 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 156 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 155 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 155 transition count 202
Applied a total of 74 rules in 9 ms. Remains 155 /174 variables (removed 19) and now considering 202/257 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 155/174 places, 202/257 transitions.
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:17] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:17] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 158 transition count 241
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 68 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 154 transition count 201
Applied a total of 76 rules in 9 ms. Remains 154 /174 variables (removed 20) and now considering 201/257 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 154/174 places, 201/257 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:18] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 159 transition count 242
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 159 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 159 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 156 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 156 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 155 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 155 transition count 202
Applied a total of 74 rules in 8 ms. Remains 155 /174 variables (removed 19) and now considering 202/257 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 155/174 places, 202/257 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:18] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 159 transition count 242
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 159 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 159 transition count 206
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 69 place count 156 transition count 203
Iterating global reduction 1 with 3 rules applied. Total rules applied 72 place count 156 transition count 203
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 73 place count 155 transition count 202
Iterating global reduction 1 with 1 rules applied. Total rules applied 74 place count 155 transition count 202
Applied a total of 74 rules in 8 ms. Remains 155 /174 variables (removed 19) and now considering 202/257 (removed 55) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 155/174 places, 202/257 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:18] [INFO ] Input system was already deterministic with 202 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Graph (trivial) has 146 edges and 174 vertex of which 4 / 174 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 66 place count 171 transition count 189
Reduce places removed 65 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 1 with 80 rules applied. Total rules applied 146 place count 106 transition count 174
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 9 rules applied. Total rules applied 155 place count 98 transition count 173
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 156 place count 97 transition count 173
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 156 place count 97 transition count 164
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 174 place count 88 transition count 164
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 183 place count 79 transition count 155
Iterating global reduction 4 with 9 rules applied. Total rules applied 192 place count 79 transition count 155
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 4 with 36 rules applied. Total rules applied 228 place count 79 transition count 119
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 229 place count 78 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 78 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 5 with 40 rules applied. Total rules applied 270 place count 58 transition count 98
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 271 place count 58 transition count 97
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 275 place count 54 transition count 83
Iterating global reduction 6 with 4 rules applied. Total rules applied 279 place count 54 transition count 83
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 281 place count 54 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 282 place count 53 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 284 place count 52 transition count 80
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 286 place count 52 transition count 78
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 1 rules applied. Total rules applied 287 place count 52 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 288 place count 51 transition count 77
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 290 place count 49 transition count 75
Applied a total of 290 rules in 18 ms. Remains 49 /174 variables (removed 125) and now considering 75/257 (removed 182) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 49/174 places, 75/257 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 3 ms
[2023-03-13 09:16:18] [INFO ] Input system was already deterministic with 75 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 158 transition count 241
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 158 transition count 241
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 68 place count 158 transition count 205
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 71 place count 155 transition count 202
Iterating global reduction 1 with 3 rules applied. Total rules applied 74 place count 155 transition count 202
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 75 place count 154 transition count 201
Iterating global reduction 1 with 1 rules applied. Total rules applied 76 place count 154 transition count 201
Applied a total of 76 rules in 8 ms. Remains 154 /174 variables (removed 20) and now considering 201/257 (removed 56) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 154/174 places, 201/257 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:18] [INFO ] Input system was already deterministic with 201 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 160 transition count 243
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 160 transition count 243
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 64 place count 160 transition count 207
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 157 transition count 204
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 157 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 71 place count 156 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 72 place count 156 transition count 203
Applied a total of 72 rules in 7 ms. Remains 156 /174 variables (removed 18) and now considering 203/257 (removed 54) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 156/174 places, 203/257 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:16:18] [INFO ] Input system was already deterministic with 203 transitions.
Starting structural reductions in LTL mode, iteration 0 : 174/174 places, 257/257 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 159 transition count 242
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 159 transition count 242
Ensure Unique test removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Iterating post reduction 0 with 36 rules applied. Total rules applied 66 place count 159 transition count 206
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 68 place count 157 transition count 204
Iterating global reduction 1 with 2 rules applied. Total rules applied 70 place count 157 transition count 204
Applied a total of 70 rules in 6 ms. Remains 157 /174 variables (removed 17) and now considering 204/257 (removed 53) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 157/174 places, 204/257 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:16:18] [INFO ] Input system was already deterministic with 204 transitions.
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:16:18] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:16:18] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:16:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 174 places, 257 transitions and 1019 arcs took 1 ms.
Total runtime 8712 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: 174 NrTr: 257 NrArc: 1019)

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

net check time: 0m 0.000sec

init dd package: 0m 2.923sec


RS generation: 0m 2.373sec


-> reachability set: #nodes 16854 (1.7e+04) #states 103,387,082 (8)



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

checking: AG [EX [0<=0]]
normalized: ~ [E [true U ~ [EX [0<=0]]]]

abstracting: (0<=0)
states: 103,387,082 (8)
.-> the formula is FALSE

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

MC time: 0m 3.173sec

checking: EG [[p109<=0 & 0<=p109]]
normalized: EG [[p109<=0 & 0<=p109]]

abstracting: (0<=p109)
states: 103,387,082 (8)
abstracting: (p109<=0)
states: 99,453,846 (7)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.219sec

checking: EF [AG [[p73<=1 & 1<=p73]]]
normalized: E [true U ~ [E [true U ~ [[p73<=1 & 1<=p73]]]]]

abstracting: (1<=p73)
states: 2,778,174 (6)
abstracting: (p73<=1)
states: 103,387,082 (8)
-> the formula is FALSE

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

MC time: 0m 0.339sec

checking: AG [[AF [E [[p53<=1 & 1<=p53] U EG [[p121<=1 & 1<=p121]]]] | EF [[EF [[p25<=0 & 0<=p25]] & [[p143<=0 & 0<=p143] | [p167<=0 & 0<=p167]]]]]]
normalized: ~ [E [true U ~ [[E [true U [[[p167<=0 & 0<=p167] | [p143<=0 & 0<=p143]] & E [true U [p25<=0 & 0<=p25]]]] | ~ [EG [~ [E [[p53<=1 & 1<=p53] U EG [[p121<=1 & 1<=p121]]]]]]]]]]

abstracting: (1<=p121)
states: 1,448,128 (6)
abstracting: (p121<=1)
states: 103,387,082 (8)
...............................................
EG iterations: 47
abstracting: (1<=p53)
states: 3,806,354 (6)
abstracting: (p53<=1)
states: 103,387,082 (8)

EG iterations: 0
abstracting: (0<=p25)
states: 103,387,082 (8)
abstracting: (p25<=0)
states: 103,386,482 (8)
abstracting: (0<=p143)
states: 103,387,082 (8)
abstracting: (p143<=0)
states: 99,441,134 (7)
abstracting: (0<=p167)
states: 103,387,082 (8)
abstracting: (p167<=0)
states: 88,339,730 (7)
-> the formula is TRUE

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

MC time: 0m 2.199sec

checking: AG [AX [A [AX [[[[p54<=1 & 1<=p54] & [p82<=1 & 1<=p82]] & [[p111<=1 & 1<=p111] & [p134<=1 & 1<=p134]]]] U ~ [EF [[[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p100<=1 & 1<=p100] & [p133<=1 & 1<=p133]]]]]]]]
normalized: ~ [E [true U EX [~ [[~ [EG [E [true U [[[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]] & ~ [E [E [true U [[[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] U [EX [~ [[[[p134<=1 & 1<=p134] & [p111<=1 & 1<=p111]] & [[p82<=1 & 1<=p82] & [p54<=1 & 1<=p54]]]]] & E [true U [[[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]]]]]]]]

abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p54)
states: 5,885,000 (6)
abstracting: (p54<=1)
states: 103,387,082 (8)
abstracting: (1<=p82)
states: 6,011,882 (6)
abstracting: (p82<=1)
states: 103,387,082 (8)
abstracting: (1<=p111)
states: 6,012,482 (6)
abstracting: (p111<=1)
states: 103,387,082 (8)
abstracting: (1<=p134)
states: 13,438,246 (7)
abstracting: (p134<=1)
states: 103,387,082 (8)
.abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
.........................................................................................
EG iterations: 89
.-> the formula is FALSE

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

MC time: 0m 7.755sec

checking: ~ [E [~ [[[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p107<=1 & 1<=p107] & [p133<=1 & 1<=p133]]]] U AX [[AF [EX [[[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p71<=1 & 1<=p71] & [p133<=1 & 1<=p133]]]]] & [p15<=1 & 1<=p15]]]]]
normalized: ~ [E [~ [[[[p133<=1 & 1<=p133] & [p107<=1 & 1<=p107]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] U ~ [EX [~ [[[p15<=1 & 1<=p15] & ~ [EG [~ [EX [[[[p133<=1 & 1<=p133] & [p71<=1 & 1<=p71]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]]]]]]]]]]]

abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p71)
states: 3,933,236 (6)
abstracting: (p71<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
..........................................
EG iterations: 41
abstracting: (1<=p15)
states: 5
abstracting: (p15<=1)
states: 103,387,082 (8)
.abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p107)
states: 3,933,236 (6)
abstracting: (p107<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
-> the formula is FALSE

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

MC time: 0m 1.586sec

checking: A [~ [[[AF [[p107<=1 & 1<=p107]] | [E [[p3<=1 & 1<=p3] U [p91<=1 & 1<=p91]] & [AG [[p158<=1 & 1<=p158]] | ~ [[p38<=1 & 1<=p38]]]]] & [~ [[[p60<=1 & 1<=p60] | [p155<=1 & 1<=p155]]] & ~ [[EX [[p163<=1 & 1<=p163]] | EX [[p68<=1 & 1<=p68]]]]]]] U ~ [AF [E [[p4<=1 & 1<=p4] U [p34<=1 & 1<=p34]]]]]
normalized: [~ [EG [~ [EG [~ [E [[p4<=1 & 1<=p4] U [p34<=1 & 1<=p34]]]]]]] & ~ [E [~ [EG [~ [E [[p4<=1 & 1<=p4] U [p34<=1 & 1<=p34]]]]] U [[[~ [[EX [[p68<=1 & 1<=p68]] | EX [[p163<=1 & 1<=p163]]]] & ~ [[[p155<=1 & 1<=p155] | [p60<=1 & 1<=p60]]]] & [[[~ [[p38<=1 & 1<=p38]] | ~ [E [true U ~ [[p158<=1 & 1<=p158]]]]] & E [[p3<=1 & 1<=p3] U [p91<=1 & 1<=p91]]] | ~ [EG [~ [[p107<=1 & 1<=p107]]]]]] & ~ [EG [~ [E [[p4<=1 & 1<=p4] U [p34<=1 & 1<=p34]]]]]]]]]

abstracting: (1<=p34)
states: 3,806,354 (6)
abstracting: (p34<=1)
states: 103,387,082 (8)
abstracting: (1<=p4)
states: 21,944,520 (7)
abstracting: (p4<=1)
states: 103,387,082 (8)
.......................................................
EG iterations: 55
abstracting: (1<=p107)
states: 3,933,236 (6)
abstracting: (p107<=1)
states: 103,387,082 (8)
......................................................
EG iterations: 54
abstracting: (1<=p91)
states: 3,933,236 (6)
abstracting: (p91<=1)
states: 103,387,082 (8)
abstracting: (1<=p3)
states: 21,944,520 (7)
abstracting: (p3<=1)
states: 103,387,082 (8)
abstracting: (1<=p158)
states: 8,510,163 (6)
abstracting: (p158<=1)
states: 103,387,082 (8)
abstracting: (1<=p38)
states: 3,806,354 (6)
abstracting: (p38<=1)
states: 103,387,082 (8)
abstracting: (1<=p60)
states: 2,778,174 (6)
abstracting: (p60<=1)
states: 103,387,082 (8)
abstracting: (1<=p155)
states: 2,959,461 (6)
abstracting: (p155<=1)
states: 103,387,082 (8)
abstracting: (1<=p163)
states: 2,959,461 (6)
abstracting: (p163<=1)
states: 103,387,082 (8)
.abstracting: (1<=p68)
states: 3,933,236 (6)
abstracting: (p68<=1)
states: 103,387,082 (8)
.abstracting: (1<=p34)
states: 3,806,354 (6)
abstracting: (p34<=1)
states: 103,387,082 (8)
abstracting: (1<=p4)
states: 21,944,520 (7)
abstracting: (p4<=1)
states: 103,387,082 (8)
.......................................................
EG iterations: 55
abstracting: (1<=p34)
states: 3,806,354 (6)
abstracting: (p34<=1)
states: 103,387,082 (8)
abstracting: (1<=p4)
states: 21,944,520 (7)
abstracting: (p4<=1)
states: 103,387,082 (8)
.......................................................
EG iterations: 55
.......................................................................
EG iterations: 71
-> the formula is TRUE

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

MC time: 0m31.714sec

checking: EF [[[p34<=1 & 1<=p34] & [AF [[p94<=0 & 0<=p94]] & [EG [[p30<=1 & 1<=p30]] | A [AF [[[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p107<=1 & 1<=p107] & [p133<=1 & 1<=p133]]]] U [[[p54<=1 & 1<=p54] & [p82<=1 & 1<=p82]] & [[p111<=1 & 1<=p111] & [p134<=1 & 1<=p134]]]]]]]]
normalized: E [true U [[[[~ [EG [~ [[[[p134<=1 & 1<=p134] & [p111<=1 & 1<=p111]] & [[p82<=1 & 1<=p82] & [p54<=1 & 1<=p54]]]]]] & ~ [E [~ [[[[p134<=1 & 1<=p134] & [p111<=1 & 1<=p111]] & [[p82<=1 & 1<=p82] & [p54<=1 & 1<=p54]]]] U [EG [~ [[[[p133<=1 & 1<=p133] & [p107<=1 & 1<=p107]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]] & ~ [[[[p134<=1 & 1<=p134] & [p111<=1 & 1<=p111]] & [[p82<=1 & 1<=p82] & [p54<=1 & 1<=p54]]]]]]]] | EG [[p30<=1 & 1<=p30]]] & ~ [EG [~ [[p94<=0 & 0<=p94]]]]] & [p34<=1 & 1<=p34]]]

abstracting: (1<=p34)
states: 3,806,354 (6)
abstracting: (p34<=1)
states: 103,387,082 (8)
abstracting: (0<=p94)
states: 103,387,082 (8)
abstracting: (p94<=0)
states: 99,453,846 (7)
.....................................................
EG iterations: 53
abstracting: (1<=p30)
states: 2,778,174 (6)
abstracting: (p30<=1)
states: 103,387,082 (8)
..............................................
EG iterations: 46
abstracting: (1<=p54)
states: 5,885,000 (6)
abstracting: (p54<=1)
states: 103,387,082 (8)
abstracting: (1<=p82)
states: 6,011,882 (6)
abstracting: (p82<=1)
states: 103,387,082 (8)
abstracting: (1<=p111)
states: 6,012,482 (6)
abstracting: (p111<=1)
states: 103,387,082 (8)
abstracting: (1<=p134)
states: 13,438,246 (7)
abstracting: (p134<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p107)
states: 3,933,236 (6)
abstracting: (p107<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
..................
EG iterations: 18
abstracting: (1<=p54)
states: 5,885,000 (6)
abstracting: (p54<=1)
states: 103,387,082 (8)
abstracting: (1<=p82)
states: 6,011,882 (6)
abstracting: (p82<=1)
states: 103,387,082 (8)
abstracting: (1<=p111)
states: 6,012,482 (6)
abstracting: (p111<=1)
states: 103,387,082 (8)
abstracting: (1<=p134)
states: 13,438,246 (7)
abstracting: (p134<=1)
states: 103,387,082 (8)
abstracting: (1<=p54)
states: 5,885,000 (6)
abstracting: (p54<=1)
states: 103,387,082 (8)
abstracting: (1<=p82)
states: 6,011,882 (6)
abstracting: (p82<=1)
states: 103,387,082 (8)
abstracting: (1<=p111)
states: 6,012,482 (6)
abstracting: (p111<=1)
states: 103,387,082 (8)
abstracting: (1<=p134)
states: 13,438,246 (7)
abstracting: (p134<=1)
states: 103,387,082 (8)
...........................................
EG iterations: 43
-> the formula is FALSE

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

MC time: 0m11.454sec

checking: A [A [EX [AF [[p78<=1 & 1<=p78]]] U A [~ [[~ [[[[p6<=1 & 1<=p6] & [p12<=1 & 1<=p12]] & [[p133<=1 & 1<=p133] & [p160<=1 & 1<=p160]]]] | AF [[p39<=1 & 1<=p39]]]] U [[p144<=1 & 1<=p144] | EF [[[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p61<=1 & 1<=p61] & [p133<=1 & 1<=p133]]]]]]] U [p21<=1 & 1<=p21]]
normalized: [~ [EG [~ [[p21<=1 & 1<=p21]]]] & ~ [E [~ [[p21<=1 & 1<=p21]] U [~ [[~ [EG [~ [[~ [EG [~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]]]] & ~ [E [~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]] U [[~ [EG [~ [[p39<=1 & 1<=p39]]]] | ~ [[[[p160<=1 & 1<=p160] & [p133<=1 & 1<=p133]] & [[p12<=1 & 1<=p12] & [p6<=1 & 1<=p6]]]]] & ~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]]]] & ~ [E [~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]] U [[~ [EG [~ [[p39<=1 & 1<=p39]]]] | ~ [[[[p160<=1 & 1<=p160] & [p133<=1 & 1<=p133]] & [[p12<=1 & 1<=p12] & [p6<=1 & 1<=p6]]]]] & ~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]]]]]]] U [~ [EX [~ [EG [~ [[p78<=1 & 1<=p78]]]]]] & ~ [[~ [EG [~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]]]] & ~ [E [~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]] U [[~ [EG [~ [[p39<=1 & 1<=p39]]]] | ~ [[[[p160<=1 & 1<=p160] & [p133<=1 & 1<=p133]] & [[p12<=1 & 1<=p12] & [p6<=1 & 1<=p6]]]]] & ~ [[E [true U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]] | [p144<=1 & 1<=p144]]]]]]]]]]]]] & ~ [[p21<=1 & 1<=p21]]]]]]

abstracting: (1<=p21)
states: 600
abstracting: (p21<=1)
states: 103,387,082 (8)
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p12)
states: 22,415,340 (7)
abstracting: (p12<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p160)
states: 2,959,461 (6)
abstracting: (p160<=1)
states: 103,387,082 (8)
abstracting: (1<=p39)
states: 3,806,354 (6)
abstracting: (p39<=1)
states: 103,387,082 (8)
.......................................................
EG iterations: 55
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
...............
before gc: list nodes free: 1905126

after gc: idd nodes used:223495, unused:63776505; list nodes free:292596746
.....................................................................................................
EG iterations: 116
abstracting: (1<=p78)
states: 3,933,236 (6)
abstracting: (p78<=1)
states: 103,387,082 (8)
......................................................
EG iterations: 54
.abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p12)
states: 22,415,340 (7)
abstracting: (p12<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p160)
states: 2,959,461 (6)
abstracting: (p160<=1)
states: 103,387,082 (8)
abstracting: (1<=p39)
states: 3,806,354 (6)
abstracting: (p39<=1)
states: 103,387,082 (8)
.......................................................
EG iterations: 55
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
....................................................................................................................
EG iterations: 116
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p12)
states: 22,415,340 (7)
abstracting: (p12<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p160)
states: 2,959,461 (6)
abstracting: (p160<=1)
states: 103,387,082 (8)
abstracting: (1<=p39)
states: 3,806,354 (6)
abstracting: (p39<=1)
states: 103,387,082 (8)
.......................................................
EG iterations: 55
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p144)
states: 3,945,948 (6)
abstracting: (p144<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
....................................................................................................................
EG iterations: 116
....................................................................................................................
EG iterations: 116
abstracting: (1<=p21)
states: 600
abstracting: (p21<=1)
states: 103,387,082 (8)
abstracting: (1<=p21)
states: 600
abstracting: (p21<=1)
states: 103,387,082 (8)
.............................
EG iterations: 29
-> the formula is TRUE

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

MC time: 1m13.494sec

checking: E [[~ [EX [~ [[p64<=1 & 1<=p64]]]] | [[[p48<=1 & 1<=p48] & [p82<=1 & 1<=p82]] & [[p111<=1 & 1<=p111] & [p134<=1 & 1<=p134]]]] U EF [[[~ [[[[[p166<=1 & 1<=p166] & [p101<=1 & 1<=p101]] | ~ [[p113<=1 & 1<=p113]]] & A [[p94<=1 & 1<=p94] U [p124<=1 & 1<=p124]]]] & [p6<=1 & 1<=p6]] & [[p14<=1 & 1<=p14] & [[p104<=1 & 1<=p104] & [p133<=1 & 1<=p133]]]]]]
normalized: E [[[[[p134<=1 & 1<=p134] & [p111<=1 & 1<=p111]] & [[p82<=1 & 1<=p82] & [p48<=1 & 1<=p48]]] | ~ [EX [~ [[p64<=1 & 1<=p64]]]]] U E [true U [[[[p133<=1 & 1<=p133] & [p104<=1 & 1<=p104]] & [p14<=1 & 1<=p14]] & [[p6<=1 & 1<=p6] & ~ [[[~ [EG [~ [[p124<=1 & 1<=p124]]]] & ~ [E [~ [[p124<=1 & 1<=p124]] U [~ [[p94<=1 & 1<=p94]] & ~ [[p124<=1 & 1<=p124]]]]]] & [~ [[p113<=1 & 1<=p113]] | [[p101<=1 & 1<=p101] & [p166<=1 & 1<=p166]]]]]]]]]

abstracting: (1<=p166)
states: 2,959,461 (6)
abstracting: (p166<=1)
states: 103,387,082 (8)
abstracting: (1<=p101)
states: 3,933,236 (6)
abstracting: (p101<=1)
states: 103,387,082 (8)
abstracting: (1<=p113)
states: 1,448,128 (6)
abstracting: (p113<=1)
states: 103,387,082 (8)
abstracting: (1<=p124)
states: 1,448,128 (6)
abstracting: (p124<=1)
states: 103,387,082 (8)
abstracting: (1<=p94)
states: 3,933,236 (6)
abstracting: (p94<=1)
states: 103,387,082 (8)
abstracting: (1<=p124)
states: 1,448,128 (6)
abstracting: (p124<=1)
states: 103,387,082 (8)
abstracting: (1<=p124)
states: 1,448,128 (6)
abstracting: (p124<=1)
states: 103,387,082 (8)
.
EG iterations: 1
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p14)
states: 21,002,880 (7)
abstracting: (p14<=1)
states: 103,387,082 (8)
abstracting: (1<=p104)
states: 3,700,766 (6)
abstracting: (p104<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p64)
states: 3,933,236 (6)
abstracting: (p64<=1)
states: 103,387,082 (8)
.abstracting: (1<=p48)
states: 5,875,400 (6)
abstracting: (p48<=1)
states: 103,387,082 (8)
abstracting: (1<=p82)
states: 6,011,882 (6)
abstracting: (p82<=1)
states: 103,387,082 (8)
abstracting: (1<=p111)
states: 6,012,482 (6)
abstracting: (p111<=1)
states: 103,387,082 (8)
abstracting: (1<=p134)
states: 13,438,246 (7)
abstracting: (p134<=1)
states: 103,387,082 (8)
-> the formula is TRUE

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

MC time: 0m 2.097sec

checking: [AG [[[EX [[AF [[[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p100<=1 & 1<=p100] & [p133<=1 & 1<=p133]]]] & [p16<=0 & 0<=p16]]] & [p6<=1 & 1<=p6]] & [[p13<=1 & 1<=p13] & [[p100<=1 & 1<=p100] & [p133<=1 & 1<=p133]]]]] | AF [[[p146<=1 & 1<=p146] | ~ [A [AF [[[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p90<=1 & 1<=p90] & [p133<=1 & 1<=p133]]]] U ~ [[[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p100<=1 & 1<=p100] & [[p133<=1 & 1<=p133] & [p41<=1 & 1<=p41]]]]]]]]]]
normalized: [~ [EG [~ [[~ [[~ [EG [[[[[p41<=1 & 1<=p41] & [p133<=1 & 1<=p133]] & [p100<=1 & 1<=p100]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]]] & ~ [E [[[[[p41<=1 & 1<=p41] & [p133<=1 & 1<=p133]] & [p100<=1 & 1<=p100]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]] U [EG [~ [[[[p133<=1 & 1<=p133] & [p90<=1 & 1<=p90]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]]] & [[[[p41<=1 & 1<=p41] & [p133<=1 & 1<=p133]] & [p100<=1 & 1<=p100]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]]]]]] | [p146<=1 & 1<=p146]]]]] | ~ [E [true U ~ [[[[[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]] & [p13<=1 & 1<=p13]] & [[p6<=1 & 1<=p6] & EX [[[p16<=0 & 0<=p16] & ~ [EG [~ [[[[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]]]]]]]]]]]]

abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
..........................................
EG iterations: 42
abstracting: (0<=p16)
states: 103,387,082 (8)
abstracting: (p16<=0)
states: 103,386,932 (8)
.abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p146)
states: 3,945,948 (6)
abstracting: (p146<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p41)
states: 3,806,354 (6)
abstracting: (p41<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p90)
states: 3,933,236 (6)
abstracting: (p90<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
..........................................
EG iterations: 42
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p41)
states: 3,806,354 (6)
abstracting: (p41<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p41)
states: 3,806,354 (6)
abstracting: (p41<=1)
states: 103,387,082 (8)
...........................
EG iterations: 27
........................................................
EG iterations: 56
-> the formula is FALSE

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

MC time: 0m 7.663sec

checking: EF [[[p35<=1 & 1<=p35] | [EF [[E [[p29<=1 & 1<=p29] U [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p75<=1 & 1<=p75] & [p133<=1 & 1<=p133]]]] | EG [[p103<=1 & 1<=p103]]]] | [A [~ [[[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p100<=1 & 1<=p100] & [p133<=1 & 1<=p133]]]] U EX [[p68<=1 & 1<=p68]]] & [[p77<=1 & 1<=p77] | [[EG [[[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p47<=1 & 1<=p47] & [p133<=1 & 1<=p133]]]] & AF [[p165<=1 & 1<=p165]]] | [[[p6<=1 & 1<=p6] & [[p13<=1 & 1<=p13] & [p75<=1 & 1<=p75]]] & [[p133<=1 & 1<=p133] & [[p14<=1 & 1<=p14] & [p61<=1 & 1<=p61]]]]]]]]]]
normalized: E [true U [[[[[[[[[p61<=1 & 1<=p61] & [p14<=1 & 1<=p14]] & [p133<=1 & 1<=p133]] & [[[p75<=1 & 1<=p75] & [p13<=1 & 1<=p13]] & [p6<=1 & 1<=p6]]] | [~ [EG [~ [[p165<=1 & 1<=p165]]]] & EG [[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]] | [p77<=1 & 1<=p77]] & [~ [EG [~ [EX [[p68<=1 & 1<=p68]]]]] & ~ [E [~ [EX [[p68<=1 & 1<=p68]]] U [[[[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]] & ~ [EX [[p68<=1 & 1<=p68]]]]]]]] | E [true U [EG [[p103<=1 & 1<=p103]] | E [[p29<=1 & 1<=p29] U [[[p133<=1 & 1<=p133] & [p75<=1 & 1<=p75]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]]] | [p35<=1 & 1<=p35]]]

abstracting: (1<=p35)
states: 3,806,354 (6)
abstracting: (p35<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p75)
states: 3,700,766 (6)
abstracting: (p75<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p29)
states: 3,806,354 (6)
abstracting: (p29<=1)
states: 103,387,082 (8)
abstracting: (1<=p103)
states: 2,500,344 (6)
abstracting: (p103<=1)
states: 103,387,082 (8)
..............................................
EG iterations: 46
abstracting: (1<=p68)
states: 3,933,236 (6)
abstracting: (p68<=1)
states: 103,387,082 (8)
.abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p68)
states: 3,933,236 (6)
abstracting: (p68<=1)
states: 103,387,082 (8)
.abstracting: (1<=p68)
states: 3,933,236 (6)
abstracting: (p68<=1)
states: 103,387,082 (8)
......................................................
EG iterations: 53
abstracting: (1<=p77)
states: 6,002,282 (6)
abstracting: (p77<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
.......................................
EG iterations: 39
abstracting: (1<=p165)
states: 2,959,461 (6)
abstracting: (p165<=1)
states: 103,387,082 (8)
.
EG iterations: 1
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p75)
states: 3,700,766 (6)
abstracting: (p75<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p14)
states: 21,002,880 (7)
abstracting: (p14<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
-> the formula is TRUE

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

MC time: 0m12.999sec

checking: ~ [E [[[[[p145<=1 & 1<=p145] & [p6<=1 & 1<=p6]] & [[p8<=1 & 1<=p8] & [[p47<=1 & 1<=p47] & [p133<=1 & 1<=p133]]]] | [[[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p50<=1 & 1<=p50] & [p133<=1 & 1<=p133]]] | [[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p32<=1 & 1<=p32] & [p133<=1 & 1<=p133]]]]] U [[A [AX [1<=0] U AX [[p0<=1 & 1<=p0]]] | [EX [A [[p87<=1 & 1<=p87] U [[[p6<=1 & 1<=p6] & [p8<=1 & 1<=p8]] & [[p47<=1 & 1<=p47] & [p133<=1 & 1<=p133]]]]] | EG [[[p52<=1 & 1<=p52] | ~ [[p171<=1 & 1<=p171]]]]]] & AG [AX [~ [[[[p48<=1 & 1<=p48] & [p82<=1 & 1<=p82]] & [[p111<=1 & 1<=p111] & [p134<=1 & 1<=p134]]]]]]]]]
normalized: ~ [E [[[[[[p133<=1 & 1<=p133] & [p32<=1 & 1<=p32]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]] | [[[p133<=1 & 1<=p133] & [p50<=1 & 1<=p50]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]] | [[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [p8<=1 & 1<=p8]] & [[p6<=1 & 1<=p6] & [p145<=1 & 1<=p145]]]] U [~ [E [true U EX [[[[p134<=1 & 1<=p134] & [p111<=1 & 1<=p111]] & [[p82<=1 & 1<=p82] & [p48<=1 & 1<=p48]]]]]] & [[EG [[~ [[p171<=1 & 1<=p171]] | [p52<=1 & 1<=p52]]] | EX [[~ [EG [~ [[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]]]] & ~ [E [~ [[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]] U [~ [[p87<=1 & 1<=p87]] & ~ [[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [[p8<=1 & 1<=p8] & [p6<=1 & 1<=p6]]]]]]]]]] | [~ [EG [EX [~ [[p0<=1 & 1<=p0]]]]] & ~ [E [EX [~ [[p0<=1 & 1<=p0]]] U [EX [~ [1<=0]] & EX [~ [[p0<=1 & 1<=p0]]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 103,387,082 (8)
.abstracting: (1<=0)
states: 0
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 103,387,082 (8)
.abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 103,387,082 (8)
..........
before gc: list nodes free: 1961948

after gc: idd nodes used:255152, unused:63744848; list nodes free:296631059
..................................................................................................................
EG iterations: 123
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p87)
states: 3,933,236 (6)
abstracting: (p87<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
.....................
EG iterations: 21
.abstracting: (1<=p52)
states: 3,806,354 (6)
abstracting: (p52<=1)
states: 103,387,082 (8)
abstracting: (1<=p171)
states: 3,658,515 (6)
abstracting: (p171<=1)
states: 103,387,082 (8)
.......................................................................................................................
EG iterations: 119
abstracting: (1<=p48)
states: 5,875,400 (6)
abstracting: (p48<=1)
states: 103,387,082 (8)
abstracting: (1<=p82)
states: 6,011,882 (6)
abstracting: (p82<=1)
states: 103,387,082 (8)
abstracting: (1<=p111)
states: 6,012,482 (6)
abstracting: (p111<=1)
states: 103,387,082 (8)
abstracting: (1<=p134)
states: 13,438,246 (7)
abstracting: (p134<=1)
states: 103,387,082 (8)
.abstracting: (1<=p145)
states: 3,945,948 (6)
abstracting: (p145<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p50)
states: 3,806,354 (6)
abstracting: (p50<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p8)
states: 10,177,908 (7)
abstracting: (p8<=1)
states: 103,387,082 (8)
abstracting: (1<=p32)
states: 3,806,354 (6)
abstracting: (p32<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
-> the formula is TRUE

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

MC time: 1m11.258sec

checking: [A [[~ [EF [AG [[p34<=1 & 1<=p34]]]] & A [~ [E [[p142<=1 & 1<=p142] U [p123<=1 & 1<=p123]]] U ~ [EF [[[[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p75<=1 & 1<=p75] & [p133<=1 & 1<=p133]]] | [p102<=1 & 1<=p102]]]]]] U EF [~ [EX [[[[p108<=1 & 1<=p108] & [p6<=1 & 1<=p6]] & [[p13<=1 & 1<=p13] & [[p47<=1 & 1<=p47] & [p133<=1 & 1<=p133]]]]]]]] & AG [[A [[[p118<=1 & 1<=p118] | [~ [[p135<=1 & 1<=p135]] | ~ [[[[p54<=1 & 1<=p54] & [p82<=1 & 1<=p82]] & [[p105<=1 & 1<=p105] & [p134<=1 & 1<=p134]]]]]] U ~ [[[[p7<=1 & 1<=p7] & [p112<=1 & 1<=p112]] | AG [[p68<=1 & 1<=p68]]]]] | AF [[[[p6<=0 & 0<=p6] | [p14<=0 & 0<=p14]] | [[p71<=0 & 0<=p71] | [p133<=0 & 0<=p133]]]]]]]
normalized: [~ [E [true U ~ [[~ [EG [~ [[[[p133<=0 & 0<=p133] | [p71<=0 & 0<=p71]] | [[p14<=0 & 0<=p14] | [p6<=0 & 0<=p6]]]]]] | [~ [EG [[~ [E [true U ~ [[p68<=1 & 1<=p68]]]] | [[p112<=1 & 1<=p112] & [p7<=1 & 1<=p7]]]]] & ~ [E [[~ [E [true U ~ [[p68<=1 & 1<=p68]]]] | [[p112<=1 & 1<=p112] & [p7<=1 & 1<=p7]]] U [~ [[[~ [[[[p134<=1 & 1<=p134] & [p105<=1 & 1<=p105]] & [[p82<=1 & 1<=p82] & [p54<=1 & 1<=p54]]]] | ~ [[p135<=1 & 1<=p135]]] | [p118<=1 & 1<=p118]]] & [~ [E [true U ~ [[p68<=1 & 1<=p68]]]] | [[p112<=1 & 1<=p112] & [p7<=1 & 1<=p7]]]]]]]]]]] & [~ [EG [~ [E [true U ~ [EX [[[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [p13<=1 & 1<=p13]] & [[p6<=1 & 1<=p6] & [p108<=1 & 1<=p108]]]]]]]]] & ~ [E [~ [E [true U ~ [EX [[[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [p13<=1 & 1<=p13]] & [[p6<=1 & 1<=p6] & [p108<=1 & 1<=p108]]]]]]] U [~ [[[~ [EG [E [true U [[p102<=1 & 1<=p102] | [[[p133<=1 & 1<=p133] & [p75<=1 & 1<=p75]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]]] & ~ [E [E [true U [[p102<=1 & 1<=p102] | [[[p133<=1 & 1<=p133] & [p75<=1 & 1<=p75]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]] U [E [[p142<=1 & 1<=p142] U [p123<=1 & 1<=p123]] & E [true U [[p102<=1 & 1<=p102] | [[[p133<=1 & 1<=p133] & [p75<=1 & 1<=p75]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]]]]] & ~ [E [true U ~ [E [true U ~ [[p34<=1 & 1<=p34]]]]]]]] & ~ [E [true U ~ [EX [[[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [p13<=1 & 1<=p13]] & [[p6<=1 & 1<=p6] & [p108<=1 & 1<=p108]]]]]]]]]]]]

abstracting: (1<=p108)
states: 3,933,236 (6)
abstracting: (p108<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
.abstracting: (1<=p34)
states: 3,806,354 (6)
abstracting: (p34<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p75)
states: 3,700,766 (6)
abstracting: (p75<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p102)
states: 2,778,174 (6)
abstracting: (p102<=1)
states: 103,387,082 (8)
abstracting: (1<=p123)
states: 1,448,128 (6)
abstracting: (p123<=1)
states: 103,387,082 (8)
abstracting: (1<=p142)
states: 17,388,546 (7)
abstracting: (p142<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p75)
states: 3,700,766 (6)
abstracting: (p75<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p102)
states: 2,778,174 (6)
abstracting: (p102<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p75)
states: 3,700,766 (6)
abstracting: (p75<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p102)
states: 2,778,174 (6)
abstracting: (p102<=1)
states: 103,387,082 (8)
..................................................................
before gc: list nodes free: 4589299

after gc: idd nodes used:260179, unused:63739821; list nodes free:296608635
................................
EG iterations: 98
abstracting: (1<=p108)
states: 3,933,236 (6)
abstracting: (p108<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
.abstracting: (1<=p108)
states: 3,933,236 (6)
abstracting: (p108<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
..
EG iterations: 1
abstracting: (1<=p7)
states: 287,101 (5)
abstracting: (p7<=1)
states: 103,387,082 (8)
abstracting: (1<=p112)
states: 11,550 (4)
abstracting: (p112<=1)
states: 103,387,082 (8)
abstracting: (1<=p68)
states: 3,933,236 (6)
abstracting: (p68<=1)
states: 103,387,082 (8)
abstracting: (1<=p118)
states: 1,448,128 (6)
abstracting: (p118<=1)
states: 103,387,082 (8)
abstracting: (1<=p135)
states: 731,703 (5)
abstracting: (p135<=1)
states: 103,387,082 (8)
abstracting: (1<=p54)
states: 5,885,000 (6)
abstracting: (p54<=1)
states: 103,387,082 (8)
abstracting: (1<=p82)
states: 6,011,882 (6)
abstracting: (p82<=1)
states: 103,387,082 (8)
abstracting: (1<=p105)
states: 6,002,282 (6)
abstracting: (p105<=1)
states: 103,387,082 (8)
abstracting: (1<=p134)
states: 13,438,246 (7)
abstracting: (p134<=1)
states: 103,387,082 (8)
abstracting: (1<=p7)
states: 287,101 (5)
abstracting: (p7<=1)
states: 103,387,082 (8)
abstracting: (1<=p112)
states: 11,550 (4)
abstracting: (p112<=1)
states: 103,387,082 (8)
abstracting: (1<=p68)
states: 3,933,236 (6)
abstracting: (p68<=1)
states: 103,387,082 (8)
abstracting: (1<=p7)
states: 287,101 (5)
abstracting: (p7<=1)
states: 103,387,082 (8)
abstracting: (1<=p112)
states: 11,550 (4)
abstracting: (p112<=1)
states: 103,387,082 (8)
abstracting: (1<=p68)
states: 3,933,236 (6)
abstracting: (p68<=1)
states: 103,387,082 (8)
..................................
EG iterations: 34
abstracting: (0<=p6)
states: 103,387,082 (8)
abstracting: (p6<=0)
states: 63,096,453 (7)
abstracting: (0<=p14)
states: 103,387,082 (8)
abstracting: (p14<=0)
states: 82,384,202 (7)
abstracting: (0<=p71)
states: 103,387,082 (8)
abstracting: (p71<=0)
states: 99,453,846 (7)
abstracting: (0<=p133)
states: 103,387,082 (8)
abstracting: (p133<=0)
states: 87,899,980 (7)
.......................................
EG iterations: 39
-> the formula is TRUE

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

MC time: 0m32.920sec

checking: [EG [AF [[[AG [[[[p6<=0 & 0<=p6] | [p14<=0 & 0<=p14]] | [[p47<=0 & 0<=p47] | [p133<=0 & 0<=p133]]]] | [[[p127<=0 & 0<=p127] & [p151<=0 & 0<=p151]] | [p57<=0 & 0<=p57]]] | [[[p6<=0 & 0<=p6] | [p13<=0 & 0<=p13]] | [[p107<=0 & 0<=p107] | [p133<=0 & 0<=p133]]]]]] & E [E [[E [AF [[[[p6<=1 & 1<=p6] & [p14<=1 & 1<=p14]] & [[p47<=1 & 1<=p47] & [p133<=1 & 1<=p133]]]] U [[[[p6<=1 & 1<=p6] & [p14<=1 & 1<=p14]] & [[p100<=1 & 1<=p100] & [p133<=1 & 1<=p133]]] | [p107<=1 & 1<=p107]]] | [E [[p9<=1 & 1<=p9] U [p97<=1 & 1<=p97]] | [p154<=1 & 1<=p154]]] U EF [[p75<=1 & 1<=p75]]] U [A [[~ [AG [[p146<=1 & 1<=p146]]] | [EX [[[p143<=1 & 1<=p143] & [p167<=1 & 1<=p167]]] | E [[p33<=1 & 1<=p33] U [p132<=1 & 1<=p132]]]] U E [[p159<=1 & 1<=p159] U [[[p6<=1 & 1<=p6] & [p13<=1 & 1<=p13]] & [[p61<=1 & 1<=p61] & [p133<=1 & 1<=p133]]]]] | [p36<=1 & 1<=p36]]]]
normalized: [E [E [[[[p154<=1 & 1<=p154] | E [[p9<=1 & 1<=p9] U [p97<=1 & 1<=p97]]] | E [~ [EG [~ [[[[p133<=1 & 1<=p133] & [p47<=1 & 1<=p47]] & [[p14<=1 & 1<=p14] & [p6<=1 & 1<=p6]]]]]] U [[p107<=1 & 1<=p107] | [[[p133<=1 & 1<=p133] & [p100<=1 & 1<=p100]] & [[p14<=1 & 1<=p14] & [p6<=1 & 1<=p6]]]]]] U E [true U [p75<=1 & 1<=p75]]] U [[p36<=1 & 1<=p36] | [~ [EG [~ [E [[p159<=1 & 1<=p159] U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]]] & ~ [E [~ [E [[p159<=1 & 1<=p159] U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]] U [~ [[[E [[p33<=1 & 1<=p33] U [p132<=1 & 1<=p132]] | EX [[[p167<=1 & 1<=p167] & [p143<=1 & 1<=p143]]]] | E [true U ~ [[p146<=1 & 1<=p146]]]]] & ~ [E [[p159<=1 & 1<=p159] U [[[p133<=1 & 1<=p133] & [p61<=1 & 1<=p61]] & [[p13<=1 & 1<=p13] & [p6<=1 & 1<=p6]]]]]]]]]]] & EG [~ [EG [~ [[[[[p133<=0 & 0<=p133] | [p107<=0 & 0<=p107]] | [[p13<=0 & 0<=p13] | [p6<=0 & 0<=p6]]] | [[[p57<=0 & 0<=p57] | [[p151<=0 & 0<=p151] & [p127<=0 & 0<=p127]]] | ~ [E [true U ~ [[[[p133<=0 & 0<=p133] | [p47<=0 & 0<=p47]] | [[p14<=0 & 0<=p14] | [p6<=0 & 0<=p6]]]]]]]]]]]]]

abstracting: (0<=p6)
states: 103,387,082 (8)
abstracting: (p6<=0)
states: 63,096,453 (7)
abstracting: (0<=p14)
states: 103,387,082 (8)
abstracting: (p14<=0)
states: 82,384,202 (7)
abstracting: (0<=p47)
states: 103,387,082 (8)
abstracting: (p47<=0)
states: 99,799,968 (7)
abstracting: (0<=p133)
states: 103,387,082 (8)
abstracting: (p133<=0)
states: 87,899,980 (7)
abstracting: (0<=p127)
states: 103,387,082 (8)
abstracting: (p127<=0)
states: 101,938,954 (8)
abstracting: (0<=p151)
states: 103,387,082 (8)
abstracting: (p151<=0)
states: 99,728,567 (7)
abstracting: (0<=p57)
states: 103,387,082 (8)
abstracting: (p57<=0)
states: 99,453,846 (7)
abstracting: (0<=p6)
states: 103,387,082 (8)
abstracting: (p6<=0)
states: 63,096,453 (7)
abstracting: (0<=p13)
states: 103,387,082 (8)
abstracting: (p13<=0)
states: 80,971,742 (7)
abstracting: (0<=p107)
states: 103,387,082 (8)
abstracting: (p107<=0)
states: 99,453,846 (7)
abstracting: (0<=p133)
states: 103,387,082 (8)
abstracting: (p133<=0)
states: 87,899,980 (7)
...........
EG iterations: 11

EG iterations: 0
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p159)
states: 8,510,163 (6)
abstracting: (p159<=1)
states: 103,387,082 (8)
abstracting: (1<=p146)
states: 3,945,948 (6)
abstracting: (p146<=1)
states: 103,387,082 (8)
abstracting: (1<=p143)
states: 3,945,948 (6)
abstracting: (p143<=1)
states: 103,387,082 (8)
abstracting: (1<=p167)
states: 15,047,352 (7)
abstracting: (p167<=1)
states: 103,387,082 (8)
.abstracting: (1<=p132)
states: 8,145,288 (6)
abstracting: (p132<=1)
states: 103,387,082 (8)
abstracting: (1<=p33)
states: 3,806,354 (6)
abstracting: (p33<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p159)
states: 8,510,163 (6)
abstracting: (p159<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p13)
states: 22,415,340 (7)
abstracting: (p13<=1)
states: 103,387,082 (8)
abstracting: (1<=p61)
states: 3,933,236 (6)
abstracting: (p61<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p159)
states: 8,510,163 (6)
abstracting: (p159<=1)
states: 103,387,082 (8)
.......................................
EG iterations: 39
abstracting: (1<=p36)
states: 3,806,354 (6)
abstracting: (p36<=1)
states: 103,387,082 (8)
abstracting: (1<=p75)
states: 3,700,766 (6)
abstracting: (p75<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p14)
states: 21,002,880 (7)
abstracting: (p14<=1)
states: 103,387,082 (8)
abstracting: (1<=p100)
states: 3,933,236 (6)
abstracting: (p100<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
abstracting: (1<=p107)
states: 3,933,236 (6)
abstracting: (p107<=1)
states: 103,387,082 (8)
abstracting: (1<=p6)
states: 40,290,629 (7)
abstracting: (p6<=1)
states: 103,387,082 (8)
abstracting: (1<=p14)
states: 21,002,880 (7)
abstracting: (p14<=1)
states: 103,387,082 (8)
abstracting: (1<=p47)
states: 3,587,114 (6)
abstracting: (p47<=1)
states: 103,387,082 (8)
abstracting: (1<=p133)
states: 15,487,102 (7)
abstracting: (p133<=1)
states: 103,387,082 (8)
...............................
EG iterations: 31
abstracting: (1<=p97)
states: 3,933,236 (6)
abstracting: (p97<=1)
states: 103,387,082 (8)
abstracting: (1<=p9)
states: 9,029,504 (6)
abstracting: (p9<=1)
states: 103,387,082 (8)
abstracting: (1<=p154)
states: 2,959,461 (6)
abstracting: (p154<=1)
states: 103,387,082 (8)
-> the formula is TRUE

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

MC time: 0m10.343sec

totally nodes used: 201803723 (2.0e+08)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 267932012 652586646 920518658
used/not used/entry size/cache size: 37563666 29545198 16 1024MB
basic ops cache: hits/miss/sum: 13266825 29278242 42545067
used/not used/entry size/cache size: 5395443 11381773 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: 120001 360903 480904
used/not used/entry size/cache size: 107052 8281556 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 58227899
1 7492878
2 1153771
3 199872
4 30216
5 3760
6 429
7 37
8 2
9 0
>= 10 0

Total processing time: 4m37.525sec


BK_STOP 1678699256134

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.001sec

18320
iterations count:171586 (667), effective:7135 (27)

initing FirstDep: 0m 0.000sec


iterations count:20103 (78), effective:957 (3)

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

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

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

iterations count:17033 (66), effective:714 (2)

iterations count:17033 (66), effective:714 (2)

iterations count:791 (3), effective:6 (0)

iterations count:17033 (66), effective:714 (2)

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

iterations count:20780 (80), effective:1000 (3)

iterations count:1778 (6), effective:69 (0)

iterations count:1744 (6), effective:73 (0)

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

iterations count:1778 (6), effective:69 (0)

iterations count:1854 (7), effective:102 (0)

iterations count:1778 (6), effective:69 (0)

iterations count:742 (2), effective:26 (0)

iterations count:17133 (66), effective:704 (2)

iterations count:17133 (66), effective:704 (2)

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

iterations count:17133 (66), effective:704 (2)

iterations count:17133 (66), effective:704 (2)

iterations count:17133 (66), effective:704 (2)

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

iterations count:17133 (66), effective:704 (2)

iterations count:817 (3), effective:71 (0)

iterations count:17133 (66), effective:704 (2)

iterations count:17133 (66), effective:704 (2)

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

iterations count:17133 (66), effective:704 (2)

iterations count:12461 (48), effective:423 (1)

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

iterations count:24687 (96), effective:1150 (4)

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

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

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

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

iterations count:25481 (99), effective:1208 (4)

iterations count:16471 (64), effective:651 (2)

iterations count:4890 (19), effective:190 (0)

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

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

iterations count:12081 (47), effective:430 (1)

iterations count:469 (1), effective:15 (0)

iterations count:414 (1), effective:32 (0)

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

iterations count:25097 (97), effective:1190 (4)

iterations count:17539 (68), effective:735 (2)

iterations count:25097 (97), effective:1190 (4)

iterations count:22510 (87), effective:936 (3)

iterations count:25097 (97), effective:1190 (4)

iterations count:414 (1), effective:32 (0)

iterations count:414 (1), effective:32 (0)

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

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

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

iterations count:24289 (94), effective:1143 (4)

iterations count:10028 (39), effective:397 (1)

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

iterations count:7798 (30), effective:192 (0)

iterations count:10028 (39), effective:397 (1)

iterations count:10028 (39), effective:397 (1)

iterations count:19883 (77), effective:866 (3)

iterations count:1420 (5), effective:42 (0)

iterations count:1289 (5), effective:102 (0)

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

iterations count:16726 (65), effective:665 (2)

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

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