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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 520K
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 25 12:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 12:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 25 12:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Feb 25 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.3K Feb 25 12:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:53 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 72K 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-04a-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-04a-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678699259324

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-04a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:21:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:21:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:21:02] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-13 09:21:02] [INFO ] Transformed 49 places.
[2023-03-13 09:21:02] [INFO ] Transformed 193 transitions.
[2023-03-13 09:21:02] [INFO ] Found NUPN structural information;
[2023-03-13 09:21:02] [INFO ] Parsed PT model containing 49 places and 193 transitions and 1306 arcs in 128 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 75 transitions
Reduce redundant transitions removed 75 transitions.
Support contains 40 out of 49 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 49/49 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 49 /49 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2023-03-13 09:21:02] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 49 cols
[2023-03-13 09:21:02] [INFO ] Computed 9 place invariants in 6 ms
[2023-03-13 09:21:02] [INFO ] Implicit Places using invariants in 304 ms returned []
[2023-03-13 09:21:02] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
[2023-03-13 09:21:02] [INFO ] Invariant cache hit.
[2023-03-13 09:21:02] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-13 09:21:02] [INFO ] Implicit Places using invariants and state equation in 213 ms returned [44, 47]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 562 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/49 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 118/118 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 574 ms. Remains : 47/49 places, 118/118 transitions.
Support contains 40 out of 47 places after structural reductions.
[2023-03-13 09:21:02] [INFO ] Flatten gal took : 37 ms
[2023-03-13 09:21:02] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:21:03] [INFO ] Input system was already deterministic with 118 transitions.
Incomplete random walk after 10000 steps, including 546 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 67) seen :62
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 99 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-13 09:21:03] [INFO ] Flow matrix only has 117 transitions (discarded 1 similar events)
// Phase 1: matrix 117 rows 47 cols
[2023-03-13 09:21:03] [INFO ] Computed 7 place invariants in 1 ms
[2023-03-13 09:21:03] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 09:21:03] [INFO ] After 150ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-13 09:21:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-13 09:21:04] [INFO ] After 93ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :1
[2023-03-13 09:21:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-13 09:21:04] [INFO ] After 18ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :3 sat :1
[2023-03-13 09:21:04] [INFO ] After 33ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-13 09:21:04] [INFO ] After 226ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :1
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 118/118 transitions.
Graph (complete) has 274 edges and 47 vertex of which 45 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 45 transition count 108
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 15 place count 39 transition count 108
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 35 transition count 88
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 35 transition count 88
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 29 place count 32 transition count 85
Free-agglomeration rule applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 33 place count 32 transition count 81
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 2 with 20 rules applied. Total rules applied 53 place count 28 transition count 65
Applied a total of 53 rules in 28 ms. Remains 28 /47 variables (removed 19) and now considering 65/118 (removed 53) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 28/47 places, 65/118 transitions.
Incomplete random walk after 10000 steps, including 212 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 191 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 841 steps, run visited all 1 properties in 10 ms. (steps per millisecond=84 )
Probabilistic random walk after 841 steps, saw 329 distinct states, run finished after 10 ms. (steps per millisecond=84 ) properties seen :1
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:21:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:21:04] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-04a-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-04a-CTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 118 transitions.
Support contains 38 out of 47 places (down from 40) after GAL structural reductions.
Computed a total of 3 stabilizing places and 2 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 112
Applied a total of 4 rules in 2 ms. Remains 45 /47 variables (removed 2) and now considering 112/118 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/47 places, 112/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 102/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 102/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 102/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 45 transition count 111
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 13 place count 39 transition count 111
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 13 place count 39 transition count 110
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 38 transition count 110
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 34 transition count 94
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 34 transition count 94
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 32 transition count 92
Applied a total of 27 rules in 12 ms. Remains 32 /47 variables (removed 15) and now considering 92/118 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 32/47 places, 92/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 15 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 92 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 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 0 with 3 rules applied. Total rules applied 3 place count 47 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 44 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 44 transition count 113
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 42 transition count 113
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 13 place count 39 transition count 102
Iterating global reduction 2 with 3 rules applied. Total rules applied 16 place count 39 transition count 102
Applied a total of 16 rules in 10 ms. Remains 39 /47 variables (removed 8) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 39/47 places, 102/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 45 transition count 112
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 45 transition count 112
Applied a total of 4 rules in 2 ms. Remains 45 /47 variables (removed 2) and now considering 112/118 (removed 6) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/47 places, 112/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 112 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 47 transition count 114
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 43 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 42 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 42 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 41 transition count 112
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 16 place count 37 transition count 96
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 37 transition count 96
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 3 with 2 rules applied. Total rules applied 22 place count 36 transition count 95
Applied a total of 22 rules in 12 ms. Remains 36 /47 variables (removed 11) and now considering 95/118 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 36/47 places, 95/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 102/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 44 transition count 107
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 44 transition count 107
Applied a total of 6 rules in 2 ms. Remains 44 /47 variables (removed 3) and now considering 107/118 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 44/47 places, 107/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 107 transitions.
Starting structural reductions in LTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 43 transition count 102
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 43 transition count 102
Applied a total of 8 rules in 2 ms. Remains 43 /47 variables (removed 4) and now considering 102/118 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 43/47 places, 102/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 11 place count 42 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 12 place count 41 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 12 place count 41 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 40 transition count 111
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 36 transition count 95
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 36 transition count 95
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 26 place count 34 transition count 93
Applied a total of 26 rules in 10 ms. Remains 34 /47 variables (removed 13) and now considering 93/118 (removed 25) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 34/47 places, 93/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 93 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 45 transition count 112
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 40 transition count 112
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 11 place count 40 transition count 111
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 39 transition count 111
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 18 place count 34 transition count 90
Iterating global reduction 2 with 5 rules applied. Total rules applied 23 place count 34 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 27 place count 32 transition count 88
Applied a total of 27 rules in 10 ms. Remains 32 /47 variables (removed 15) and now considering 88/118 (removed 30) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 32/47 places, 88/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 88 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 47/47 places, 118/118 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 113
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 42 transition count 113
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 42 transition count 112
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 41 transition count 112
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 17 place count 36 transition count 91
Iterating global reduction 2 with 5 rules applied. Total rules applied 22 place count 36 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 34 transition count 89
Applied a total of 26 rules in 9 ms. Remains 34 /47 variables (removed 13) and now considering 89/118 (removed 29) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 34/47 places, 89/118 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 4 ms
[2023-03-13 09:21:04] [INFO ] Input system was already deterministic with 89 transitions.
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 7 ms
[2023-03-13 09:21:04] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:21:04] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:21:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 47 places, 118 transitions and 765 arcs took 1 ms.
Total runtime 2945 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: 47 NrTr: 118 NrArc: 765)

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

net check time: 0m 0.000sec

init dd package: 0m 3.122sec


RS generation: 0m 0.186sec


-> reachability set: #nodes 3512 (3.5e+03) #states 206,492 (5)



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

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

abstracting: (0<=p33)
states: 206,492 (5)
abstracting: (p33<=0)
states: 178,988 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: EG [AF [[p9<=1 & 1<=p9]]]
normalized: EG [~ [EG [~ [[p9<=1 & 1<=p9]]]]]

abstracting: (1<=p9)
states: 27,504 (4)
abstracting: (p9<=1)
states: 206,492 (5)
.
EG iterations: 1
............
EG iterations: 12
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.138sec

checking: EF [EG [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]]]]
normalized: E [true U EG [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]

abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
........
EG iterations: 8
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.174sec

checking: EG [[EF [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p27<=1 & 1<=p27] & [p41<=1 & 1<=p41]]]] & EG [EF [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p26<=1 & 1<=p26] & [p41<=1 & 1<=p41]]]]]]]
normalized: EG [[EG [E [true U [[[p41<=1 & 1<=p41] & [p26<=1 & 1<=p26]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]] & E [true U [[[p41<=1 & 1<=p41] & [p27<=1 & 1<=p27]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]

abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p27)
states: 27,504 (4)
abstracting: (p27<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p26)
states: 27,504 (4)
abstracting: (p26<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
........................
EG iterations: 24
.
EG iterations: 1
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.264sec

checking: AF [[[EX [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p17<=1 & 1<=p17] & [p41<=1 & 1<=p41]]]] & [EG [[p13<=1 & 1<=p13]] & [p1<=1 & 1<=p1]]] & [[p5<=1 & 1<=p5] & [[p34<=1 & 1<=p34] & [p41<=1 & 1<=p41]]]]]
normalized: ~ [EG [~ [[[[[p41<=1 & 1<=p41] & [p34<=1 & 1<=p34]] & [p5<=1 & 1<=p5]] & [[[p1<=1 & 1<=p1] & EG [[p13<=1 & 1<=p13]]] & EX [[[[p41<=1 & 1<=p41] & [p17<=1 & 1<=p17]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]]

abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p17)
states: 26,832 (4)
abstracting: (p17<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
............
EG iterations: 12
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p34)
states: 27,504 (4)
abstracting: (p34<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.118sec

checking: EG [E [[~ [EF [AG [[p40<=1 & 1<=p40]]]] | [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p15<=1 & 1<=p15] & [p41<=1 & 1<=p41]]]] U [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p33<=1 & 1<=p33] & [p41<=1 & 1<=p41]]]]]
normalized: EG [E [[[[[p41<=1 & 1<=p41] & [p15<=1 & 1<=p15]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | ~ [E [true U ~ [E [true U ~ [[p40<=1 & 1<=p40]]]]]]] U [[[p41<=1 & 1<=p41] & [p33<=1 & 1<=p33]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]

abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p33)
states: 27,504 (4)
abstracting: (p33<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p40)
states: 34,784 (4)
abstracting: (p40<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p15)
states: 27,504 (4)
abstracting: (p15<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
........................
EG iterations: 24
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.263sec

checking: EG [[[[p14<=0 & 0<=p14] | [[p18<=0 & 0<=p18] | [p28<=0 & 0<=p28]]] | [[p35<=0 & 0<=p35] | [[p42<=0 & 0<=p42] | [AX [A [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p15<=1 & 1<=p15] & [p41<=1 & 1<=p41]]] U [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p12<=1 & 1<=p12] & [p41<=1 & 1<=p41]]]]] & AG [EX [[p34<=1 & 1<=p34]]]]]]]]
normalized: EG [[[[[~ [E [true U ~ [EX [[p34<=1 & 1<=p34]]]]] & ~ [EX [~ [[~ [EG [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]] U [~ [[[[p41<=1 & 1<=p41] & [p15<=1 & 1<=p15]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]] & ~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]]]]] | [p42<=0 & 0<=p42]] | [p35<=0 & 0<=p35]] | [[[p28<=0 & 0<=p28] | [p18<=0 & 0<=p18]] | [p14<=0 & 0<=p14]]]]

abstracting: (0<=p14)
states: 206,492 (5)
abstracting: (p14<=0)
states: 171,670 (5)
abstracting: (0<=p18)
states: 206,492 (5)
abstracting: (p18<=0)
states: 171,671 (5)
abstracting: (0<=p28)
states: 206,492 (5)
abstracting: (p28<=0)
states: 171,670 (5)
abstracting: (0<=p35)
states: 206,492 (5)
abstracting: (p35<=0)
states: 171,670 (5)
abstracting: (0<=p42)
states: 206,492 (5)
abstracting: (p42<=0)
states: 152,499 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p15)
states: 27,504 (4)
abstracting: (p15<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.
EG iterations: 1
.abstracting: (1<=p34)
states: 27,504 (4)
abstracting: (p34<=1)
states: 206,492 (5)
.......
EG iterations: 6
-> the formula is TRUE

FORMULA AutonomousCar-PT-04a-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: A [~ [[p27<=1 & 1<=p27]] U ~ [AX [[[[p12<=1 & 1<=p12] | AF [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p20<=1 & 1<=p20] & [p41<=1 & 1<=p41]]]]] | [AF [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p31<=1 & 1<=p31] & [p41<=1 & 1<=p41]]]] | ~ [AF [[[[1<=p1 & p1<=1] & [p6<=1 & 1<=p6]] & [[p31<=1 & 1<=p31] & [p41<=1 & 1<=p41]]]]]]]]]]
normalized: [~ [EG [~ [EX [~ [[[EG [~ [[[[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]] & [[p6<=1 & 1<=p6] & [1<=p1 & p1<=1]]]]] | ~ [EG [~ [[[[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] | [~ [EG [~ [[[[p41<=1 & 1<=p41] & [p20<=1 & 1<=p20]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] | [p12<=1 & 1<=p12]]]]]]]] & ~ [E [~ [EX [~ [[[EG [~ [[[[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]] & [[p6<=1 & 1<=p6] & [1<=p1 & p1<=1]]]]] | ~ [EG [~ [[[[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] | [~ [EG [~ [[[[p41<=1 & 1<=p41] & [p20<=1 & 1<=p20]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] | [p12<=1 & 1<=p12]]]]]] U [[p27<=1 & 1<=p27] & ~ [EX [~ [[[EG [~ [[[[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]] & [[p6<=1 & 1<=p6] & [1<=p1 & p1<=1]]]]] | ~ [EG [~ [[[[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]] | [~ [EG [~ [[[[p41<=1 & 1<=p41] & [p20<=1 & 1<=p20]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] | [p12<=1 & 1<=p12]]]]]]]]]]

abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 7
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p31<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
......
EG iterations: 6
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p31<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 7
.abstracting: (1<=p27)
states: 27,504 (4)
abstracting: (p27<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 7
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p31<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
......
EG iterations: 6
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p31<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 7
.abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 7
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p31<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
......
EG iterations: 6
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p31<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 7
........
EG iterations: 7
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.221sec

checking: AF [AG [E [[A [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p8<=1 & 1<=p8] & [p41<=1 & 1<=p41]]] U [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p12<=1 & 1<=p12] & [p41<=1 & 1<=p41]]]] & [EF [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p19<=1 & 1<=p19] & [p41<=1 & 1<=p41]]]] & [[p13<=1 & 1<=p13] | [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p10<=1 & 1<=p10] & [p41<=1 & 1<=p41]]]]]] U AF [[[[p14<=1 & 1<=p14] & [p21<=1 & 1<=p21]] & [[p25<=1 & 1<=p25] & [[p32<=1 & 1<=p32] & [p42<=1 & 1<=p42]]]]]]]]
normalized: ~ [EG [E [true U ~ [E [[[[[[[p41<=1 & 1<=p41] & [p10<=1 & 1<=p10]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]] | [p13<=1 & 1<=p13]] & E [true U [[[p41<=1 & 1<=p41] & [p19<=1 & 1<=p19]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]] & [~ [EG [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]] U [~ [[[[p41<=1 & 1<=p41] & [p8<=1 & 1<=p8]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] & ~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]] U ~ [EG [~ [[[[[p42<=1 & 1<=p42] & [p32<=1 & 1<=p32]] & [p25<=1 & 1<=p25]] & [[p21<=1 & 1<=p21] & [p14<=1 & 1<=p14]]]]]]]]]]]

abstracting: (1<=p14)
states: 34,822 (4)
abstracting: (p14<=1)
states: 206,492 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p21<=1)
states: 206,492 (5)
abstracting: (1<=p25)
states: 34,821 (4)
abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (1<=p32)
states: 34,821 (4)
abstracting: (p32<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
......
EG iterations: 6
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p8)
states: 27,504 (4)
abstracting: (p8<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p19)
states: 27,504 (4)
abstracting: (p19<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p10<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.131sec

checking: [AG [AX [[EX [[p34<=0 & 0<=p34]] & [[[p1<=0 & 0<=p1] | [p6<=0 & 0<=p6]] | [[p31<=0 & 0<=p31] | [p41<=0 & 0<=p41]]]]]] | AG [E [~ [[E [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p29<=1 & 1<=p29] & [p41<=1 & 1<=p41]]] U [[[p1<=1 & 1<=p1] & [p4<=1 & 1<=p4]] & [[p41<=1 & 1<=p41] & [p45<=1 & 1<=p45]]]] | EX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]]]]] U [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p29<=1 & 1<=p29] & [p41<=1 & 1<=p41]]] | AX [~ [[p38<=1 & 1<=p38]]]]]]]
normalized: [~ [E [true U ~ [E [~ [[EX [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] | E [[[[p41<=1 & 1<=p41] & [p29<=1 & 1<=p29]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] U [[[p45<=1 & 1<=p45] & [p41<=1 & 1<=p41]] & [[p4<=1 & 1<=p4] & [p1<=1 & 1<=p1]]]]]] U [~ [EX [[p38<=1 & 1<=p38]]] | [[[p41<=1 & 1<=p41] & [p29<=1 & 1<=p29]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]] | ~ [E [true U EX [~ [[[[[p41<=0 & 0<=p41] | [p31<=0 & 0<=p31]] | [[p6<=0 & 0<=p6] | [p1<=0 & 0<=p1]]] & EX [[p34<=0 & 0<=p34]]]]]]]]

abstracting: (0<=p34)
states: 206,492 (5)
abstracting: (p34<=0)
states: 178,988 (5)
.abstracting: (0<=p1)
states: 206,492 (5)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p6)
states: 206,492 (5)
abstracting: (p6<=0)
states: 167,847 (5)
abstracting: (0<=p31)
states: 206,492 (5)
abstracting: (p31<=0)
states: 179,660 (5)
abstracting: (0<=p41)
states: 206,492 (5)
abstracting: (p41<=0)
states: 137,968 (5)
.abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p29)
states: 27,504 (4)
abstracting: (p29<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
.abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p4)
states: 38,645 (4)
abstracting: (p4<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p45)
states: 40,520 (4)
abstracting: (p45<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p29)
states: 27,504 (4)
abstracting: (p29<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.620sec

checking: E [AF [AX [AF [[[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p27<=1 & 1<=p27] & [p41<=1 & 1<=p41]]] | [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p12<=1 & 1<=p12] & [p41<=1 & 1<=p41]]]]]]] U [[[~ [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p10<=1 & 1<=p10] & [p41<=1 & 1<=p41]]]] & [[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]]] & [[p25<=1 & 1<=p25] & [[p35<=1 & 1<=p35] & [p42<=1 & 1<=p42]]]] | [~ [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p29<=1 & 1<=p29] & [p41<=1 & 1<=p41]]]] & A [[p20<=1 & 1<=p20] U [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p12<=1 & 1<=p12] & [p41<=1 & 1<=p41]]]]]]]
normalized: E [~ [EG [EX [EG [~ [[[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | [[[p41<=1 & 1<=p41] & [p27<=1 & 1<=p27]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]]] U [[[~ [EG [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] U [~ [[p20<=1 & 1<=p20]] & ~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]] & ~ [[[[p41<=1 & 1<=p41] & [p29<=1 & 1<=p29]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] | [[[[p42<=1 & 1<=p42] & [p35<=1 & 1<=p35]] & [p25<=1 & 1<=p25]] & [[[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]] & ~ [[[[p41<=1 & 1<=p41] & [p10<=1 & 1<=p10]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]

abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p10<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (p11<=1)
states: 206,492 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
abstracting: (1<=p25)
states: 34,821 (4)
abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (1<=p35)
states: 34,822 (4)
abstracting: (p35<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p29)
states: 27,504 (4)
abstracting: (p29<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p27)
states: 27,504 (4)
abstracting: (p27<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 7
....................................................
EG iterations: 51
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.673sec

checking: [EG [AF [[AG [[[[[1<=p1 & p1<=1] & [p5<=1 & 1<=p5]] & [[p33<=1 & 1<=p33] & [p41<=1 & 1<=p41]]] | [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p10<=1 & 1<=p10] & [p41<=1 & 1<=p41]]]]] | [EX [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p8<=1 & 1<=p8] & [p41<=1 & 1<=p41]]]] & [[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] | [[p24<=0 & 0<=p24] | [p41<=0 & 0<=p41]]] & [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p10<=1 & 1<=p10] & [p41<=1 & 1<=p41]]] | [p39<=1 & 1<=p39]]]]]]] | EX [[[EF [~ [A [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p27<=1 & 1<=p27] & [p41<=1 & 1<=p41]]] U [[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]]]]] & [EG [EX [[p20<=1 & 1<=p20]]] & [p1<=1 & 1<=p1]]] & [[p7<=1 & 1<=p7] & [[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]]]]]
normalized: [EX [[[E [true U ~ [[~ [EG [~ [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] U [~ [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & ~ [[[[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]] & [[p41<=1 & 1<=p41] & [p27<=1 & 1<=p27]]]]]]]]]] & [[p1<=1 & 1<=p1] & EG [EX [[p20<=1 & 1<=p20]]]]] & [[p7<=1 & 1<=p7] & [[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]]]]] | EG [~ [EG [~ [[[[[[p39<=1 & 1<=p39] | [[[p41<=1 & 1<=p41] & [p10<=1 & 1<=p10]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]] & [[[p41<=0 & 0<=p41] | [p24<=0 & 0<=p24]] | [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]] & EX [[[[p41<=1 & 1<=p41] & [p8<=1 & 1<=p8]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] | ~ [E [true U ~ [[[[[p41<=1 & 1<=p41] & [p10<=1 & 1<=p10]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] | [[[p41<=1 & 1<=p41] & [p33<=1 & 1<=p33]] & [[p5<=1 & 1<=p5] & [1<=p1 & p1<=1]]]]]]]]]]]]]

abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p33)
states: 27,504 (4)
abstracting: (p33<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p10<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p8)
states: 27,504 (4)
abstracting: (p8<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (0<=p1)
states: 206,492 (5)
abstracting: (p1<=0)
states: 1
abstracting: (0<=p7)
states: 206,492 (5)
abstracting: (p7<=0)
states: 170,055 (5)
abstracting: (0<=p24)
states: 206,492 (5)
abstracting: (p24<=0)
states: 179,660 (5)
abstracting: (0<=p41)
states: 206,492 (5)
abstracting: (p41<=0)
states: 137,968 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p10<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p39)
states: 34,784 (4)
abstracting: (p39<=1)
states: 206,492 (5)

EG iterations: 0
.
EG iterations: 1
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
.................
EG iterations: 16
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p27)
states: 27,504 (4)
abstracting: (p27<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
........
EG iterations: 8
.-> the formula is FALSE

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

MC time: 0m 0.159sec

checking: [AG [[EF [~ [A [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p15<=1 & 1<=p15] & [p41<=1 & 1<=p41]]] U [p38<=1 & 1<=p38]]]] | [[[p14<=1 & 1<=p14] & [p21<=1 & 1<=p21]] & [[p28<=1 & 1<=p28] & [[p32<=1 & 1<=p32] & [p42<=1 & 1<=p42]]]]]] & [EX [~ [E [[[A [[[[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]] & [[p25<=1 & 1<=p25] & [[p35<=1 & 1<=p35] & [p42<=1 & 1<=p42]]]] U [[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p12<=1 & 1<=p12] & [p41<=1 & 1<=p41]]]] & [p1<=1 & 1<=p1]] & [[p2<=1 & 1<=p2] & [[p34<=1 & 1<=p34] & [p41<=1 & 1<=p41]]]] U EX [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p15<=1 & 1<=p15] & [p41<=1 & 1<=p41]]]]]]] | EX [[E [[[[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]] & [[p25<=1 & 1<=p25] & [[p35<=1 & 1<=p35] & [p42<=1 & 1<=p42]]]] U [[[p14<=1 & 1<=p14] & [p18<=1 & 1<=p18]] & [[p25<=1 & 1<=p25] & [[p35<=1 & 1<=p35] & [p42<=1 & 1<=p42]]]]] | [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p10<=1 & 1<=p10] & [p41<=1 & 1<=p41]]]]]]]
normalized: [[EX [[[[[p41<=1 & 1<=p41] & [p10<=1 & 1<=p10]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] | E [[[[[p42<=1 & 1<=p42] & [p35<=1 & 1<=p35]] & [p25<=1 & 1<=p25]] & [[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]]] U [[[[p42<=1 & 1<=p42] & [p35<=1 & 1<=p35]] & [p25<=1 & 1<=p25]] & [[p18<=1 & 1<=p18] & [p14<=1 & 1<=p14]]]]]] | EX [~ [E [[[[[p41<=1 & 1<=p41] & [p34<=1 & 1<=p34]] & [p2<=1 & 1<=p2]] & [[p1<=1 & 1<=p1] & [~ [EG [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]] U [~ [[[[[p42<=1 & 1<=p42] & [p35<=1 & 1<=p35]] & [p25<=1 & 1<=p25]] & [[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]]]] & ~ [[[[p41<=1 & 1<=p41] & [p12<=1 & 1<=p12]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]]]]]] U EX [[[[p41<=1 & 1<=p41] & [p15<=1 & 1<=p15]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]] & ~ [E [true U ~ [[[[[[p42<=1 & 1<=p42] & [p32<=1 & 1<=p32]] & [p28<=1 & 1<=p28]] & [[p21<=1 & 1<=p21] & [p14<=1 & 1<=p14]]] | E [true U ~ [[~ [EG [~ [[p38<=1 & 1<=p38]]]] & ~ [E [~ [[p38<=1 & 1<=p38]] U [~ [[[[p41<=1 & 1<=p41] & [p15<=1 & 1<=p15]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] & ~ [[p38<=1 & 1<=p38]]]]]]]]]]]]]

abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p15)
states: 27,504 (4)
abstracting: (p15<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
...............
EG iterations: 15
abstracting: (1<=p14)
states: 34,822 (4)
abstracting: (p14<=1)
states: 206,492 (5)
abstracting: (1<=p21)
states: 34,822 (4)
abstracting: (p21<=1)
states: 206,492 (5)
abstracting: (1<=p28)
states: 34,822 (4)
abstracting: (p28<=1)
states: 206,492 (5)
abstracting: (1<=p32)
states: 34,821 (4)
abstracting: (p32<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p15)
states: 27,504 (4)
abstracting: (p15<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (p11<=1)
states: 206,492 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
abstracting: (1<=p25)
states: 34,821 (4)
abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (1<=p35)
states: 34,822 (4)
abstracting: (p35<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p12)
states: 27,504 (4)
abstracting: (p12<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.
EG iterations: 1
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p34)
states: 27,504 (4)
abstracting: (p34<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (1<=p14)
states: 34,822 (4)
abstracting: (p14<=1)
states: 206,492 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
abstracting: (1<=p25)
states: 34,821 (4)
abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (1<=p35)
states: 34,822 (4)
abstracting: (p35<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (p11<=1)
states: 206,492 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
abstracting: (1<=p25)
states: 34,821 (4)
abstracting: (p25<=1)
states: 206,492 (5)
abstracting: (1<=p35)
states: 34,822 (4)
abstracting: (p35<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p10<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.-> the formula is TRUE

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

MC time: 0m 0.103sec

checking: E [[[EF [[AX [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p31<=1 & 1<=p31] & [p41<=1 & 1<=p41]]]] & ~ [EG [[p26<=1 & 1<=p26]]]]] | [p30<=1 & 1<=p30]] | [[~ [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p10<=1 & 1<=p10] & [p41<=1 & 1<=p41]]]] & [EG [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p8<=1 & 1<=p8] & [p41<=1 & 1<=p41]]]] | A [[p38<=1 & 1<=p38] U [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]]]]] | [[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p33<=1 & 1<=p33] & [p41<=1 & 1<=p41]]]]] U [AG [[[EX [AG [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p20<=1 & 1<=p20] & [p41<=1 & 1<=p41]]]]] & [[p14<=1 & 1<=p14] & [p18<=1 & 1<=p18]]] & [[p28<=1 & 1<=p28] & [[p32<=1 & 1<=p32] & [p42<=1 & 1<=p42]]]]] & [A [[[[p1<=1 & 1<=p1] & [p2<=1 & 1<=p2]] & [[p13<=1 & 1<=p13] & [p41<=1 & 1<=p41]]] U [EX [[p13<=1 & 1<=p13]] | EX [[[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]] & [[p24<=1 & 1<=p24] & [p41<=1 & 1<=p41]]]]]] | [~ [A [AF [[[[p1<=1 & 1<=p1] & [p6<=1 & 1<=p6]] & [[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]]] U ~ [[[[p1<=1 & 1<=p1] & [p5<=1 & 1<=p5]] & [[p22<=1 & 1<=p22] & [p41<=1 & 1<=p41]]]]]] & E [[[[[[p11<=1 & 1<=p11] & [p18<=1 & 1<=p18]] & [[p28<=1 & 1<=p28] & [p35<=1 & 1<=p35]]] & [[[p42<=1 & 1<=p42] & [p1<=1 & 1<=p1]] & [[p5<=1 & 1<=p5] & [[p29<=1 & 1<=p29] & [p41<=1 & 1<=p41]]]]] | [p24<=1 & 1<=p24]] U [p45<=1 & 1<=p45]]]]]]
normalized: E [[[[[[p41<=1 & 1<=p41] & [p33<=1 & 1<=p33]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] | [[[~ [EG [~ [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]] & ~ [E [~ [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] U [~ [[p38<=1 & 1<=p38]] & ~ [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]]] | EG [[[[p41<=1 & 1<=p41] & [p8<=1 & 1<=p8]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] & ~ [[[[p41<=1 & 1<=p41] & [p10<=1 & 1<=p10]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]]] | [[p30<=1 & 1<=p30] | E [true U [~ [EG [[p26<=1 & 1<=p26]]] & ~ [EX [~ [[[[p41<=1 & 1<=p41] & [p31<=1 & 1<=p31]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]] U [[[E [[[p24<=1 & 1<=p24] | [[[[[p41<=1 & 1<=p41] & [p29<=1 & 1<=p29]] & [p5<=1 & 1<=p5]] & [[p1<=1 & 1<=p1] & [p42<=1 & 1<=p42]]] & [[[p35<=1 & 1<=p35] & [p28<=1 & 1<=p28]] & [[p18<=1 & 1<=p18] & [p11<=1 & 1<=p11]]]]] U [p45<=1 & 1<=p45]] & ~ [[~ [EG [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]] & ~ [E [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]] U [EG [~ [[[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p6<=1 & 1<=p6] & [p1<=1 & 1<=p1]]]]] & [[[p41<=1 & 1<=p41] & [p22<=1 & 1<=p22]] & [[p5<=1 & 1<=p5] & [p1<=1 & 1<=p1]]]]]]]]] | [~ [EG [~ [[EX [[[[p41<=1 & 1<=p41] & [p24<=1 & 1<=p24]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] | EX [[p13<=1 & 1<=p13]]]]]] & ~ [E [~ [[EX [[[[p41<=1 & 1<=p41] & [p24<=1 & 1<=p24]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] | EX [[p13<=1 & 1<=p13]]]] U [~ [[[[p41<=1 & 1<=p41] & [p13<=1 & 1<=p13]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]] & ~ [[EX [[[[p41<=1 & 1<=p41] & [p24<=1 & 1<=p24]] & [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] | EX [[p13<=1 & 1<=p13]]]]]]]]] & ~ [E [true U ~ [[[[[p42<=1 & 1<=p42] & [p32<=1 & 1<=p32]] & [p28<=1 & 1<=p28]] & [[[p18<=1 & 1<=p18] & [p14<=1 & 1<=p14]] & EX [~ [E [true U ~ [[[[p41<=1 & 1<=p41] & [p20<=1 & 1<=p20]] & [[p2<=1 & 1<=p2] & [p1<=1 & 1<=p1]]]]]]]]]]]]]]

abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p20)
states: 27,504 (4)
abstracting: (p20<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (1<=p14)
states: 34,822 (4)
abstracting: (p14<=1)
states: 206,492 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
abstracting: (1<=p28)
states: 34,822 (4)
abstracting: (p28<=1)
states: 206,492 (5)
abstracting: (1<=p32)
states: 34,821 (4)
abstracting: (p32<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
.abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p24)
states: 26,832 (4)
abstracting: (p24<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
.abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p24)
states: 26,832 (4)
abstracting: (p24<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (1<=p13)
states: 27,504 (4)
abstracting: (p13<=1)
states: 206,492 (5)
.abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p24)
states: 26,832 (4)
abstracting: (p24<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.......
EG iterations: 6
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
..
EG iterations: 2
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
........
EG iterations: 8
abstracting: (1<=p45)
states: 40,520 (4)
abstracting: (p45<=1)
states: 206,492 (5)
abstracting: (1<=p11)
states: 34,821 (4)
abstracting: (p11<=1)
states: 206,492 (5)
abstracting: (1<=p18)
states: 34,821 (4)
abstracting: (p18<=1)
states: 206,492 (5)
abstracting: (1<=p28)
states: 34,822 (4)
abstracting: (p28<=1)
states: 206,492 (5)
abstracting: (1<=p35)
states: 34,822 (4)
abstracting: (p35<=1)
states: 206,492 (5)
abstracting: (1<=p42)
states: 53,993 (4)
abstracting: (p42<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p29)
states: 27,504 (4)
abstracting: (p29<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p24)
states: 26,832 (4)
abstracting: (p24<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p2)
states: 27,708 (4)
abstracting: (p2<=1)
states: 206,492 (5)
abstracting: (1<=p31)
states: 26,832 (4)
abstracting: (p31<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
.abstracting: (1<=p26)
states: 27,504 (4)
abstracting: (p26<=1)
states: 206,492 (5)
............
EG iterations: 12
abstracting: (1<=p30)
states: 27,504 (4)
abstracting: (p30<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p6)
states: 38,645 (4)
abstracting: (p6<=1)
states: 206,492 (5)
abstracting: (1<=p10)
states: 26,832 (4)
abstracting: (p10<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p8)
states: 27,504 (4)
abstracting: (p8<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
........
EG iterations: 8
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p38)
states: 4,802 (3)
abstracting: (p38<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p7)
states: 36,437 (4)
abstracting: (p7<=1)
states: 206,492 (5)
abstracting: (1<=p22)
states: 27,504 (4)
abstracting: (p22<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
..
EG iterations: 2
abstracting: (1<=p1)
states: 206,491 (5)
abstracting: (p1<=1)
states: 206,492 (5)
abstracting: (1<=p5)
states: 38,645 (4)
abstracting: (p5<=1)
states: 206,492 (5)
abstracting: (1<=p33)
states: 27,504 (4)
abstracting: (p33<=1)
states: 206,492 (5)
abstracting: (1<=p41)
states: 68,524 (4)
abstracting: (p41<=1)
states: 206,492 (5)
-> the formula is FALSE

FORMULA AutonomousCar-PT-04a-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.355sec

totally nodes used: 1786706 (1.8e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4283250 8902659 13185909
used/not used/entry size/cache size: 9773556 57335308 16 1024MB
basic ops cache: hits/miss/sum: 755707 1170731 1926438
used/not used/entry size/cache size: 2092404 14684812 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: 16331 34967 51298
used/not used/entry size/cache size: 34922 8353686 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 65422725
1 1594907
2 82632
3 7925
4 619
5 53
6 2
7 1
8 0
9 0
>= 10 0

Total processing time: 0m 8.674sec


BK_STOP 1678699273735

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

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


initing FirstDep: 0m 0.000sec


iterations count:22872 (193), effective:1656 (14)

initing FirstDep: 0m 0.000sec


iterations count:11934 (101), effective:642 (5)

iterations count:7776 (65), effective:459 (3)

iterations count:9660 (81), effective:506 (4)

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

iterations count:10673 (90), effective:543 (4)

iterations count:250 (2), effective:4 (0)

iterations count:320 (2), effective:21 (0)

iterations count:4020 (34), effective:144 (1)

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

iterations count:6362 (53), effective:415 (3)

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

iterations count:920 (7), effective:26 (0)

iterations count:6535 (55), effective:421 (3)

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

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

iterations count:22055 (186), effective:1314 (11)

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

iterations count:5682 (48), effective:312 (2)

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

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

iterations count:423 (3), effective:7 (0)

iterations count:282 (2), effective:4 (0)

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

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

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

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

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

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

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

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

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

iterations count:3566 (30), effective:242 (2)

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="AutonomousCar-PT-04a"
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-04a, 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-167813599200578"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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