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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 512K
-rw-r--r-- 1 mcc users 5.2K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 52K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 12:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:50 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 16K Feb 25 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K Feb 25 12:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 12:50 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 110K 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-04b-CTLFireability-00
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-01
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-02
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-03
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-04
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-05
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-06
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-07
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-08
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-09
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-10
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-11
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-12
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-13
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-14
FORMULA_NAME AutonomousCar-PT-04b-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678699338084

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-04b
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 09:22:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-13 09:22:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 09:22:20] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2023-03-13 09:22:20] [INFO ] Transformed 221 places.
[2023-03-13 09:22:20] [INFO ] Transformed 368 transitions.
[2023-03-13 09:22:20] [INFO ] Found NUPN structural information;
[2023-03-13 09:22:20] [INFO ] Parsed PT model containing 221 places and 368 transitions and 1658 arcs in 183 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Support contains 98 out of 221 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 221/221 places, 368/368 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 207 transition count 354
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 207 transition count 354
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 205 transition count 352
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 205 transition count 352
Applied a total of 32 rules in 41 ms. Remains 205 /221 variables (removed 16) and now considering 352/368 (removed 16) transitions.
// Phase 1: matrix 352 rows 205 cols
[2023-03-13 09:22:20] [INFO ] Computed 9 place invariants in 10 ms
[2023-03-13 09:22:20] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-13 09:22:20] [INFO ] Invariant cache hit.
[2023-03-13 09:22:20] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 518 ms to find 0 implicit places.
[2023-03-13 09:22:20] [INFO ] Invariant cache hit.
[2023-03-13 09:22:21] [INFO ] Dead Transitions using invariants and state equation in 210 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/221 places, 352/368 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 771 ms. Remains : 205/221 places, 352/368 transitions.
Support contains 98 out of 205 places after structural reductions.
[2023-03-13 09:22:21] [INFO ] Flatten gal took : 61 ms
[2023-03-13 09:22:21] [INFO ] Flatten gal took : 33 ms
[2023-03-13 09:22:21] [INFO ] Input system was already deterministic with 352 transitions.
Support contains 94 out of 205 places (down from 98) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 448 ms. (steps per millisecond=22 ) properties (out of 93) seen :57
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 36) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 36) seen :3
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 33) seen :1
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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :7
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 24) 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 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 22) 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 22) 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 22) 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 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 21) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 20) 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 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 20) seen :1
Running SMT prover for 19 properties.
[2023-03-13 09:22:22] [INFO ] Invariant cache hit.
[2023-03-13 09:22:22] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-13 09:22:22] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2023-03-13 09:22:23] [INFO ] After 448ms SMT Verify possible using state equation in natural domain returned unsat :4 sat :15
[2023-03-13 09:22:23] [INFO ] Deduced a trap composed of 22 places in 219 ms of which 9 ms to minimize.
[2023-03-13 09:22:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2023-03-13 09:22:23] [INFO ] Deduced a trap composed of 43 places in 52 ms of which 0 ms to minimize.
[2023-03-13 09:22:23] [INFO ] Deduced a trap composed of 47 places in 49 ms of which 1 ms to minimize.
[2023-03-13 09:22:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 130 ms
[2023-03-13 09:22:24] [INFO ] After 1359ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :15
Attempting to minimize the solution found.
Minimization took 528 ms.
[2023-03-13 09:22:24] [INFO ] After 2156ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :15
Fused 19 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 86 ms.
Support contains 22 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 352/352 transitions.
Graph (trivial) has 167 edges and 205 vertex of which 4 / 205 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 566 edges and 203 vertex of which 199 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 75 rules applied. Total rules applied 77 place count 199 transition count 271
Reduce places removed 74 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 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 1 with 98 rules applied. Total rules applied 175 place count 125 transition count 247
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 191 place count 112 transition count 244
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 196 place count 109 transition count 242
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 197 place count 108 transition count 242
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 197 place count 108 transition count 235
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 211 place count 101 transition count 235
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 221 place count 91 transition count 225
Iterating global reduction 5 with 10 rules applied. Total rules applied 231 place count 91 transition count 225
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 5 with 64 rules applied. Total rules applied 295 place count 91 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 295 place count 91 transition count 160
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 297 place count 90 transition count 160
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 351 place count 63 transition count 133
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 353 place count 61 transition count 124
Iterating global reduction 6 with 2 rules applied. Total rules applied 355 place count 61 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 356 place count 61 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 60 transition count 136
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 7 with 1 rules applied. Total rules applied 359 place count 60 transition count 135
Free-agglomeration rule applied 5 times.
Iterating global reduction 7 with 5 rules applied. Total rules applied 364 place count 60 transition count 130
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 369 place count 55 transition count 130
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 371 place count 55 transition count 130
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 372 place count 54 transition count 129
Applied a total of 372 rules in 69 ms. Remains 54 /205 variables (removed 151) and now considering 129/352 (removed 223) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 69 ms. Remains : 54/205 places, 129/352 transitions.
Incomplete random walk after 10000 steps, including 540 resets, run finished after 158 ms. (steps per millisecond=63 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 107 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 129 rows 54 cols
[2023-03-13 09:22:24] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-13 09:22:24] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 09:22:24] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-13 09:22:25] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2023-03-13 09:22:25] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-13 09:22:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-13 09:22:25] [INFO ] After 9ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-13 09:22:25] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-13 09:22:25] [INFO ] After 123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 129/129 transitions.
Graph (complete) has 322 edges and 54 vertex of which 53 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 0 with 3 rules applied. Total rules applied 4 place count 53 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 51 transition count 125
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 51 transition count 123
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 49 transition count 123
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 15 place count 44 transition count 104
Iterating global reduction 2 with 5 rules applied. Total rules applied 20 place count 44 transition count 104
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 44 transition count 102
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 44 transition count 101
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 24 place count 43 transition count 101
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 25 place count 42 transition count 100
Iterating global reduction 3 with 1 rules applied. Total rules applied 26 place count 42 transition count 100
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 3 with 6 rules applied. Total rules applied 32 place count 39 transition count 97
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 33 place count 38 transition count 92
Iterating global reduction 3 with 1 rules applied. Total rules applied 34 place count 38 transition count 92
Free-agglomeration rule applied 3 times.
Iterating global reduction 3 with 3 rules applied. Total rules applied 37 place count 38 transition count 89
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 40 place count 35 transition count 89
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 35 transition count 89
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 42 place count 34 transition count 88
Applied a total of 42 rules in 21 ms. Remains 34 /54 variables (removed 20) and now considering 88/129 (removed 41) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 34/54 places, 88/129 transitions.
Incomplete random walk after 10000 steps, including 440 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Finished Best-First random walk after 660 steps, including 4 resets, run visited all 1 properties in 2 ms. (steps per millisecond=330 )
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 20 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 352 transitions.
Computed a total of 40 stabilizing places and 41 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 184 transition count 331
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 106 place count 184 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 180 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 179 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 179 transition count 262
Applied a total of 116 rules in 26 ms. Remains 179 /205 variables (removed 26) and now considering 262/352 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 179/205 places, 262/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 184 transition count 331
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 106 place count 184 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 180 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 179 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 179 transition count 262
Applied a total of 116 rules in 45 ms. Remains 179 /205 variables (removed 26) and now considering 262/352 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 179/205 places, 262/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Graph (trivial) has 191 edges and 205 vertex of which 4 / 205 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 86 transitions
Trivial Post-agglo rules discarded 86 transitions
Performed 86 trivial Post agglomeration. Transition count delta: 86
Iterating post reduction 0 with 86 rules applied. Total rules applied 87 place count 202 transition count 263
Reduce places removed 86 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 1 with 114 rules applied. Total rules applied 201 place count 116 transition count 235
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 2 with 16 rules applied. Total rules applied 217 place count 100 transition count 235
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 217 place count 100 transition count 230
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 227 place count 95 transition count 230
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 240 place count 82 transition count 217
Iterating global reduction 3 with 13 rules applied. Total rules applied 253 place count 82 transition count 217
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 64 rules applied. Total rules applied 317 place count 82 transition count 153
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 317 place count 82 transition count 152
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 319 place count 81 transition count 152
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 321 place count 79 transition count 147
Iterating global reduction 4 with 2 rules applied. Total rules applied 323 place count 79 transition count 147
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 325 place count 79 transition count 145
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 326 place count 78 transition count 145
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 378 place count 52 transition count 119
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 384 place count 46 transition count 92
Iterating global reduction 6 with 6 rules applied. Total rules applied 390 place count 46 transition count 92
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 6 with 6 rules applied. Total rules applied 396 place count 46 transition count 86
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 399 place count 43 transition count 86
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 8 with 1 rules applied. Total rules applied 400 place count 43 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 402 place count 41 transition count 83
Applied a total of 402 rules in 30 ms. Remains 41 /205 variables (removed 164) and now considering 83/352 (removed 269) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 41/205 places, 83/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 83 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 187 transition count 334
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 187 transition count 334
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 100 place count 187 transition count 270
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 183 transition count 266
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 183 transition count 266
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 109 place count 182 transition count 265
Iterating global reduction 1 with 1 rules applied. Total rules applied 110 place count 182 transition count 265
Applied a total of 110 rules in 26 ms. Remains 182 /205 variables (removed 23) and now considering 265/352 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 182/205 places, 265/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 12 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 332
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 104 place count 185 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 182 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 182 transition count 265
Applied a total of 110 rules in 29 ms. Remains 182 /205 variables (removed 23) and now considering 265/352 (removed 87) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 182/205 places, 265/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 265 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Graph (trivial) has 169 edges and 205 vertex of which 4 / 205 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 76 transitions
Trivial Post-agglo rules discarded 76 transitions
Performed 76 trivial Post agglomeration. Transition count delta: 76
Iterating post reduction 0 with 76 rules applied. Total rules applied 77 place count 202 transition count 273
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 93 rules applied. Total rules applied 170 place count 126 transition count 256
Reduce places removed 9 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 12 rules applied. Total rules applied 182 place count 117 transition count 253
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 3 with 7 rules applied. Total rules applied 189 place count 114 transition count 249
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 191 place count 112 transition count 249
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 191 place count 112 transition count 240
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 209 place count 103 transition count 240
Discarding 14 places :
Symmetric choice reduction at 5 with 14 rule applications. Total rules 223 place count 89 transition count 226
Iterating global reduction 5 with 14 rules applied. Total rules applied 237 place count 89 transition count 226
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 5 with 65 rules applied. Total rules applied 302 place count 89 transition count 161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 302 place count 89 transition count 160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 304 place count 88 transition count 160
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 306 place count 86 transition count 155
Iterating global reduction 6 with 2 rules applied. Total rules applied 308 place count 86 transition count 155
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 310 place count 86 transition count 153
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 311 place count 85 transition count 153
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 8 with 46 rules applied. Total rules applied 357 place count 62 transition count 130
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 362 place count 57 transition count 108
Iterating global reduction 8 with 5 rules applied. Total rules applied 367 place count 57 transition count 108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 368 place count 57 transition count 107
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 370 place count 57 transition count 105
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 1 rules applied. Total rules applied 371 place count 57 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 372 place count 56 transition count 104
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 11 with 2 rules applied. Total rules applied 374 place count 54 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 375 place count 53 transition count 102
Applied a total of 375 rules in 51 ms. Remains 53 /205 variables (removed 152) and now considering 102/352 (removed 250) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 53/205 places, 102/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 102 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 188 transition count 335
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 188 transition count 335
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 98 place count 188 transition count 271
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 185 transition count 268
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 185 transition count 268
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 105 place count 184 transition count 267
Iterating global reduction 1 with 1 rules applied. Total rules applied 106 place count 184 transition count 267
Applied a total of 106 rules in 22 ms. Remains 184 /205 variables (removed 21) and now considering 267/352 (removed 85) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 184/205 places, 267/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 10 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 267 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Graph (trivial) has 181 edges and 205 vertex of which 4 / 205 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 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 202 transition count 268
Reduce places removed 81 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 103 rules applied. Total rules applied 185 place count 121 transition count 246
Reduce places removed 12 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 15 rules applied. Total rules applied 200 place count 109 transition count 243
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 205 place count 106 transition count 241
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 206 place count 105 transition count 241
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 206 place count 105 transition count 235
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 218 place count 99 transition count 235
Discarding 11 places :
Symmetric choice reduction at 5 with 11 rule applications. Total rules 229 place count 88 transition count 224
Iterating global reduction 5 with 11 rules applied. Total rules applied 240 place count 88 transition count 224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 240 place count 88 transition count 223
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 242 place count 87 transition count 223
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 244 place count 85 transition count 214
Iterating global reduction 5 with 2 rules applied. Total rules applied 246 place count 85 transition count 214
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 248 place count 85 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 84 transition count 212
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 7 with 52 rules applied. Total rules applied 301 place count 58 transition count 186
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 305 place count 54 transition count 152
Iterating global reduction 7 with 4 rules applied. Total rules applied 309 place count 54 transition count 152
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 7 with 3 rules applied. Total rules applied 312 place count 54 transition count 149
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 314 place count 53 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 315 place count 52 transition count 148
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 316 place count 52 transition count 147
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 10 with 2 rules applied. Total rules applied 318 place count 52 transition count 147
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 320 place count 50 transition count 145
Applied a total of 320 rules in 46 ms. Remains 50 /205 variables (removed 155) and now considering 145/352 (removed 207) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 50/205 places, 145/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:22:25] [INFO ] Input system was already deterministic with 145 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 184 transition count 331
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 106 place count 184 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 180 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 179 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 179 transition count 262
Applied a total of 116 rules in 21 ms. Remains 179 /205 variables (removed 26) and now considering 262/352 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 179/205 places, 262/352 transitions.
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:25] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 332
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 104 place count 185 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 181 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 180 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 180 transition count 263
Applied a total of 114 rules in 21 ms. Remains 180 /205 variables (removed 25) and now considering 263/352 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 180/205 places, 263/352 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 30 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 332
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 104 place count 185 transition count 268
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 107 place count 182 transition count 265
Iterating global reduction 1 with 3 rules applied. Total rules applied 110 place count 182 transition count 265
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 181 transition count 264
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 181 transition count 264
Applied a total of 112 rules in 20 ms. Remains 181 /205 variables (removed 24) and now considering 264/352 (removed 88) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 181/205 places, 264/352 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 264 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Graph (trivial) has 166 edges and 205 vertex of which 4 / 205 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 78 transitions
Trivial Post-agglo rules discarded 78 transitions
Performed 78 trivial Post agglomeration. Transition count delta: 78
Iterating post reduction 0 with 78 rules applied. Total rules applied 79 place count 202 transition count 271
Reduce places removed 78 places and 0 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 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 1 with 101 rules applied. Total rules applied 180 place count 124 transition count 248
Reduce places removed 13 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 16 rules applied. Total rules applied 196 place count 111 transition count 245
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 5 rules applied. Total rules applied 201 place count 108 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 202 place count 107 transition count 243
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 202 place count 107 transition count 234
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 220 place count 98 transition count 234
Discarding 13 places :
Symmetric choice reduction at 5 with 13 rule applications. Total rules 233 place count 85 transition count 221
Iterating global reduction 5 with 13 rules applied. Total rules applied 246 place count 85 transition count 221
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 65 transitions.
Iterating post reduction 5 with 65 rules applied. Total rules applied 311 place count 85 transition count 156
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 312 place count 84 transition count 152
Iterating global reduction 6 with 1 rules applied. Total rules applied 313 place count 84 transition count 152
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 314 place count 84 transition count 151
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 7 with 40 rules applied. Total rules applied 354 place count 64 transition count 131
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 356 place count 62 transition count 123
Iterating global reduction 7 with 2 rules applied. Total rules applied 358 place count 62 transition count 123
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 362 place count 62 transition count 119
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 364 place count 60 transition count 119
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 365 place count 60 transition count 118
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 366 place count 59 transition count 117
Applied a total of 366 rules in 22 ms. Remains 59 /205 variables (removed 146) and now considering 117/352 (removed 235) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 59/205 places, 117/352 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 6 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 5 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 185 transition count 332
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 185 transition count 332
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 104 place count 185 transition count 268
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 108 place count 181 transition count 264
Iterating global reduction 1 with 4 rules applied. Total rules applied 112 place count 181 transition count 264
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 113 place count 180 transition count 263
Iterating global reduction 1 with 1 rules applied. Total rules applied 114 place count 180 transition count 263
Applied a total of 114 rules in 39 ms. Remains 180 /205 variables (removed 25) and now considering 263/352 (removed 89) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 180/205 places, 263/352 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 263 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 184 transition count 331
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 106 place count 184 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 180 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 179 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 179 transition count 262
Applied a total of 116 rules in 24 ms. Remains 179 /205 variables (removed 26) and now considering 262/352 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 179/205 places, 262/352 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 262 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 189 transition count 336
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 189 transition count 336
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 96 place count 189 transition count 272
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 186 transition count 269
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 186 transition count 269
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 185 transition count 268
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 185 transition count 268
Applied a total of 104 rules in 19 ms. Remains 185 /205 variables (removed 20) and now considering 268/352 (removed 84) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19 ms. Remains : 185/205 places, 268/352 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 8 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 9 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 268 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 352/352 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 184 transition count 331
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 184 transition count 331
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 106 place count 184 transition count 267
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 180 transition count 263
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 180 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 115 place count 179 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 116 place count 179 transition count 262
Applied a total of 116 rules in 32 ms. Remains 179 /205 variables (removed 26) and now considering 262/352 (removed 90) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 179/205 places, 262/352 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 19 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 11 ms
[2023-03-13 09:22:26] [INFO ] Input system was already deterministic with 262 transitions.
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:22:26] [INFO ] Flatten gal took : 13 ms
[2023-03-13 09:22:26] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-13 09:22:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 352 transitions and 1626 arcs took 1 ms.
Total runtime 6544 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: 205 NrTr: 352 NrArc: 1626)

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

net check time: 0m 0.000sec

init dd package: 0m 2.931sec


RS generation: 0m 7.013sec


-> reachability set: #nodes 34496 (3.4e+04) #states 3,571,962,900 (9)



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

checking: AX [EF [EG [[p186<=0 & 0<=p186]]]]
normalized: ~ [EX [~ [E [true U EG [[p186<=0 & 0<=p186]]]]]]

abstracting: (0<=p186)
states: 3,571,962,900 (9)
abstracting: (p186<=0)
states: 3,464,742,084 (9)
..............................................................................................................
before gc: list nodes free: 101695

after gc: idd nodes used:149956, unused:63850044; list nodes free:292943911
.........................................................
EG iterations: 167
.-> the formula is TRUE

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

MC time: 1m51.975sec

checking: AF [[AG [[[p51<=0 & 0<=p51] & [p177<=0 & 0<=p177]]] & AX [1<=0]]]
normalized: ~ [EG [~ [[~ [EX [~ [1<=0]]] & ~ [E [true U ~ [[[p177<=0 & 0<=p177] & [p51<=0 & 0<=p51]]]]]]]]]

abstracting: (0<=p51)
states: 3,571,962,900 (9)
abstracting: (p51<=0)
states: 3,434,006,052 (9)
abstracting: (0<=p177)
states: 3,571,962,900 (9)
abstracting: (p177<=0)
states: 3,429,001,812 (9)
abstracting: (1<=0)
states: 0
.......................................
before gc: list nodes free: 2040824

after gc: idd nodes used:384616, unused:63615384; list nodes free:291874497
...............................................................................................................................
EG iterations: 165
-> the formula is FALSE

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

MC time: 2m40.400sec

checking: EG [[[[p5<=0 & 0<=p5] | [p14<=0 & 0<=p14]] | [[p103<=0 & 0<=p103] | [p162<=0 & 0<=p162]]]]
normalized: EG [[[[p162<=0 & 0<=p162] | [p103<=0 & 0<=p103]] | [[p14<=0 & 0<=p14] | [p5<=0 & 0<=p5]]]]

abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p14)
states: 3,571,962,900 (9)
abstracting: (p14<=0)
states: 2,932,975,908 (9)
abstracting: (0<=p103)
states: 3,571,962,900 (9)
abstracting: (p103<=0)
states: 3,438,933,132 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
...................
EG iterations: 19
-> the formula is TRUE

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

MC time: 0m 1.636sec

checking: AX [EF [[[[1<=p73 & p73<=1] & [p52<=1 & 1<=p52]] & [[p101<=1 & 1<=p101] & [[p131<=1 & 1<=p131] & [p163<=1 & 1<=p163]]]]]]
normalized: ~ [EX [~ [E [true U [[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p101<=1 & 1<=p101]] & [[p52<=1 & 1<=p52] & [1<=p73 & p73<=1]]]]]]]

abstracting: (p73<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (1<=p52)
states: 197,667,408 (8)
abstracting: (p52<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p101)
states: 189,707,304 (8)
abstracting: (p101<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
.-> the formula is TRUE

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

MC time: 0m 3.901sec

checking: AG [[EX [EF [[p156<=1 & 1<=p156]]] & [[[p5<=0 & 0<=p5] | [p7<=0 & 0<=p7]] | [[p31<=0 & 0<=p31] | [p162<=0 & 0<=p162]]]]]
normalized: ~ [E [true U ~ [[[[[p162<=0 & 0<=p162] | [p31<=0 & 0<=p31]] | [[p7<=0 & 0<=p7] | [p5<=0 & 0<=p5]]] & EX [E [true U [p156<=1 & 1<=p156]]]]]]]

abstracting: (1<=p156)
states: 307,481,880 (8)
abstracting: (p156<=1)
states: 3,571,962,900 (9)
.abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p7)
states: 3,571,962,900 (9)
abstracting: (p7<=0)
states: 3,342,355,232 (9)
abstracting: (0<=p31)
states: 3,571,962,900 (9)
abstracting: (p31<=0)
states: 3,434,006,052 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
-> the formula is FALSE

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

MC time: 0m11.606sec

checking: [AF [[p71<=0 & 0<=p71]] & EX [AG [~ [A [EG [[p154<=1 & 1<=p154]] U [[[p78<=1 & 1<=p78] & [p5<=1 & 1<=p5]] & [[p12<=1 & 1<=p12] & [[p115<=1 & 1<=p115] & [p162<=1 & 1<=p162]]]]]]]]]
normalized: [EX [~ [E [true U [~ [EG [~ [[[[[p162<=1 & 1<=p162] & [p115<=1 & 1<=p115]] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & [p78<=1 & 1<=p78]]]]]] & ~ [E [~ [[[[[p162<=1 & 1<=p162] & [p115<=1 & 1<=p115]] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & [p78<=1 & 1<=p78]]]] U [~ [EG [[p154<=1 & 1<=p154]]] & ~ [[[[[p162<=1 & 1<=p162] & [p115<=1 & 1<=p115]] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & [p78<=1 & 1<=p78]]]]]]]]]]] & ~ [EG [~ [[p71<=0 & 0<=p71]]]]]

abstracting: (0<=p71)
states: 3,571,962,900 (9)
abstracting: (p71<=0)
states: 3,481,660,116 (9)
..........................................................
EG iterations: 58
abstracting: (1<=p78)
states: 143,233,908 (8)
abstracting: (p78<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p115)
states: 133,721,952 (8)
abstracting: (p115<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p154)
states: 31,792,992 (7)
abstracting: (p154<=1)
states: 3,571,962,900 (9)
...........................................................
EG iterations: 59
abstracting: (1<=p78)
states: 143,233,908 (8)
abstracting: (p78<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p115)
states: 133,721,952 (8)
abstracting: (p115<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p78)
states: 143,233,908 (8)
abstracting: (p78<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p115)
states: 133,721,952 (8)
abstracting: (p115<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.
EG iterations: 1
.-> the formula is FALSE

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

MC time: 0m12.195sec

checking: AG [[[p88<=1 & 1<=p88] | AF [[E [EF [[p42<=1 & 1<=p42]] U AG [[[[p46<=1 & 1<=p46] & [p79<=1 & 1<=p79]] & [[p101<=1 & 1<=p101] & [[p137<=1 & 1<=p137] & [p163<=1 & 1<=p163]]]]]] & [[p60<=1 & 1<=p60] & EG [[p148<=1 & 1<=p148]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[[EG [[p148<=1 & 1<=p148]] & [p60<=1 & 1<=p60]] & E [E [true U [p42<=1 & 1<=p42]] U ~ [E [true U ~ [[[[[p163<=1 & 1<=p163] & [p137<=1 & 1<=p137]] & [p101<=1 & 1<=p101]] & [[p79<=1 & 1<=p79] & [p46<=1 & 1<=p46]]]]]]]]]]] | [p88<=1 & 1<=p88]]]]]

abstracting: (1<=p88)
states: 133,029,768 (8)
abstracting: (p88<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p79)
states: 206,273,268 (8)
abstracting: (p79<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p101)
states: 189,707,304 (8)
abstracting: (p101<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p137)
states: 193,435,512 (8)
abstracting: (p137<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p42)
states: 137,956,848 (8)
abstracting: (p42<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p60)
states: 143,233,908 (8)
abstracting: (p60<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p148)
states: 31,792,992 (7)
abstracting: (p148<=1)
states: 3,571,962,900 (9)
...........................................................
EG iterations: 59

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 7.518sec

checking: AG [EF [[[E [[p133<=1 & 1<=p133] U [p147<=1 & 1<=p147]] | [[p99<=1 & 1<=p99] | [[[p5<=1 & 1<=p5] & [p14<=1 & 1<=p14]] & [[p68<=1 & 1<=p68] & [p162<=1 & 1<=p162]]]]] & [EF [[p3<=1 & 1<=p3]] | [[p64<=1 & 1<=p64] & [p51<=1 & 1<=p51]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[p51<=1 & 1<=p51] & [p64<=1 & 1<=p64]] | E [true U [p3<=1 & 1<=p3]]] & [[[[[p162<=1 & 1<=p162] & [p68<=1 & 1<=p68]] & [[p14<=1 & 1<=p14] & [p5<=1 & 1<=p5]]] | [p99<=1 & 1<=p99]] | E [[p133<=1 & 1<=p133] U [p147<=1 & 1<=p147]]]]]]]]

abstracting: (1<=p147)
states: 31,792,992 (7)
abstracting: (p147<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p133)
states: 133,721,952 (8)
abstracting: (p133<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p99)
states: 82,450,368 (7)
abstracting: (p99<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p14)
states: 638,986,992 (8)
abstracting: (p14<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p68)
states: 143,233,908 (8)
abstracting: (p68<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p3)
states: 905,979,776 (8)
abstracting: (p3<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p64)
states: 143,233,908 (8)
abstracting: (p64<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p51)
states: 137,956,848 (8)
abstracting: (p51<=1)
states: 3,571,962,900 (9)
-> the formula is FALSE

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

MC time: 0m12.345sec

checking: [A [E [EF [[p69<=1 & 1<=p69]] U [p180<=1 & 1<=p180]] U [[AG [[p182<=1 & 1<=p182]] | [[p82<=1 & 1<=p82] | [[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] & [[p68<=1 & 1<=p68] & [p162<=1 & 1<=p162]]]]] & ~ [AF [[p145<=1 & 1<=p145]]]]] | [EG [[AG [[p70<=1 & 1<=p70]] | AX [[p147<=1 & 1<=p147]]]] | EG [[AG [[p183<=0 & 0<=p183]] | [p22<=0 & 0<=p22]]]]]
normalized: [[~ [EG [~ [[[~ [E [true U ~ [[p182<=1 & 1<=p182]]]] | [[[[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]] & [[p162<=1 & 1<=p162] & [p68<=1 & 1<=p68]]] | [p82<=1 & 1<=p82]]] & EG [~ [[p145<=1 & 1<=p145]]]]]]] & ~ [E [~ [[[~ [E [true U ~ [[p182<=1 & 1<=p182]]]] | [[[[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]] & [[p162<=1 & 1<=p162] & [p68<=1 & 1<=p68]]] | [p82<=1 & 1<=p82]]] & EG [~ [[p145<=1 & 1<=p145]]]]] U [~ [[[~ [E [true U ~ [[p182<=1 & 1<=p182]]]] | [[[[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]] & [[p162<=1 & 1<=p162] & [p68<=1 & 1<=p68]]] | [p82<=1 & 1<=p82]]] & EG [~ [[p145<=1 & 1<=p145]]]]] & ~ [E [E [true U [p69<=1 & 1<=p69]] U [p180<=1 & 1<=p180]]]]]]] | [EG [[[p22<=0 & 0<=p22] | ~ [E [true U ~ [[p183<=0 & 0<=p183]]]]]] | EG [[~ [EX [~ [[p147<=1 & 1<=p147]]]] | ~ [E [true U ~ [[p70<=1 & 1<=p70]]]]]]]]

abstracting: (1<=p70)
states: 97,288,224 (7)
abstracting: (p70<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p147)
states: 31,792,992 (7)
abstracting: (p147<=1)
states: 3,571,962,900 (9)
..
EG iterations: 1
abstracting: (0<=p183)
states: 3,571,962,900 (9)
abstracting: (p183<=0)
states: 3,464,742,084 (9)
abstracting: (0<=p22)
states: 3,571,962,900 (9)
abstracting: (p22<=0)
states: 3,571,962,300 (9)
..........................
EG iterations: 26
abstracting: (1<=p180)
states: 202,633,805 (8)
abstracting: (p180<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p69)
states: 143,233,908 (8)
abstracting: (p69<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p145)
states: 31,792,992 (7)
abstracting: (p145<=1)
states: 3,571,962,900 (9)
.....................................
before gc: list nodes free: 490083

after gc: idd nodes used:306102, unused:63693898; list nodes free:292227444
.......................
EG iterations: 60
abstracting: (1<=p82)
states: 133,029,768 (8)
abstracting: (p82<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p68)
states: 143,233,908 (8)
abstracting: (p68<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p182)
states: 146,528,525 (8)
abstracting: (p182<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p145)
states: 31,792,992 (7)
abstracting: (p145<=1)
states: 3,571,962,900 (9)
............................................................
EG iterations: 60
abstracting: (1<=p82)
states: 133,029,768 (8)
abstracting: (p82<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p68)
states: 143,233,908 (8)
abstracting: (p68<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p182)
states: 146,528,525 (8)
abstracting: (p182<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p145)
states: 31,792,992 (7)
abstracting: (p145<=1)
states: 3,571,962,900 (9)
............................................................
EG iterations: 60
abstracting: (1<=p82)
states: 133,029,768 (8)
abstracting: (p82<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p68)
states: 143,233,908 (8)
abstracting: (p68<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p182)
states: 146,528,525 (8)
abstracting: (p182<=1)
states: 3,571,962,900 (9)
...................................................
EG iterations: 51
-> the formula is FALSE

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

MC time: 0m42.107sec

checking: ~ [E [[[~ [[EF [[[[p52<=1 & 1<=p52] & [p73<=1 & 1<=p73]] & [[p101<=1 & 1<=p101] & [[p137<=1 & 1<=p137] & [p163<=1 & 1<=p163]]]]] & AG [[p97<=1 & 1<=p97]]]] & [p44<=1 & 1<=p44]] | ~ [[p109<=1 & 1<=p109]]] U [EX [[AX [[[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] & [[p133<=1 & 1<=p133] & [p162<=1 & 1<=p162]]]] & AF [[p120<=1 & 1<=p120]]]] | [p35<=1 & 1<=p35]]]]
normalized: ~ [E [[[~ [[E [true U [[[p73<=1 & 1<=p73] & [p52<=1 & 1<=p52]] & [[[p163<=1 & 1<=p163] & [p137<=1 & 1<=p137]] & [p101<=1 & 1<=p101]]]] & ~ [E [true U ~ [[p97<=1 & 1<=p97]]]]]] & [p44<=1 & 1<=p44]] | ~ [[p109<=1 & 1<=p109]]] U [[p35<=1 & 1<=p35] | EX [[~ [EG [~ [[p120<=1 & 1<=p120]]]] & ~ [EX [~ [[[[p162<=1 & 1<=p162] & [p133<=1 & 1<=p133]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]]]]]]]]]

abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p133)
states: 133,721,952 (8)
abstracting: (p133<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p120)
states: 133,721,952 (8)
abstracting: (p120<=1)
states: 3,571,962,900 (9)
....................................................................
EG iterations: 68
.abstracting: (1<=p35)
states: 137,956,848 (8)
abstracting: (p35<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p109)
states: 40,800 (4)
abstracting: (p109<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p44)
states: 86,198,112 (7)
abstracting: (p44<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p97)
states: 133,029,768 (8)
abstracting: (p97<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p101)
states: 189,707,304 (8)
abstracting: (p101<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p137)
states: 193,435,512 (8)
abstracting: (p137<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p52)
states: 197,667,408 (8)
abstracting: (p52<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (p73<=1)
states: 3,571,962,900 (9)
-> the formula is TRUE

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

MC time: 0m40.175sec

checking: AX [EX [[[EX [[p89<=0 & 0<=p89]] & EF [[[[p5<=0 & 0<=p5] | [p14<=0 & 0<=p14]] | [[p85<=0 & 0<=p85] | [p162<=0 & 0<=p162]]]]] & [AF [[E [[[[p5<=1 & 1<=p5] & [p14<=1 & 1<=p14]] & [[p59<=1 & 1<=p59] & [p162<=1 & 1<=p162]]] U [p134<=1 & 1<=p134]] | [p148<=1 & 1<=p148]]] & [[[p5<=0 & 0<=p5] | [p13<=0 & 0<=p13]] | [[p31<=0 & 0<=p31] | [p162<=0 & 0<=p162]]]]]]]
normalized: ~ [EX [~ [EX [[[[[[p162<=0 & 0<=p162] | [p31<=0 & 0<=p31]] | [[p13<=0 & 0<=p13] | [p5<=0 & 0<=p5]]] & ~ [EG [~ [[[p148<=1 & 1<=p148] | E [[[[p162<=1 & 1<=p162] & [p59<=1 & 1<=p59]] & [[p14<=1 & 1<=p14] & [p5<=1 & 1<=p5]]] U [p134<=1 & 1<=p134]]]]]]] & [E [true U [[[p162<=0 & 0<=p162] | [p85<=0 & 0<=p85]] | [[p14<=0 & 0<=p14] | [p5<=0 & 0<=p5]]]] & EX [[p89<=0 & 0<=p89]]]]]]]]

abstracting: (0<=p89)
states: 3,571,962,900 (9)
abstracting: (p89<=0)
states: 3,438,933,132 (9)
.abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p14)
states: 3,571,962,900 (9)
abstracting: (p14<=0)
states: 2,932,975,908 (9)
abstracting: (0<=p85)
states: 3,571,962,900 (9)
abstracting: (p85<=0)
states: 3,438,933,132 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
abstracting: (1<=p134)
states: 133,721,952 (8)
abstracting: (p134<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p14)
states: 638,986,992 (8)
abstracting: (p14<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p59)
states: 143,233,908 (8)
abstracting: (p59<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p148)
states: 31,792,992 (7)
abstracting: (p148<=1)
states: 3,571,962,900 (9)
.......................................
before gc: list nodes free: 1131189

after gc: idd nodes used:398674, unused:63601326; list nodes free:293912467
..........................
EG iterations: 65
abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p13)
states: 3,571,962,900 (9)
abstracting: (p13<=0)
states: 2,878,978,788 (9)
abstracting: (0<=p31)
states: 3,571,962,900 (9)
abstracting: (p31<=0)
states: 3,434,006,052 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
..-> the formula is FALSE

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

MC time: 0m51.770sec

checking: A [EG [~ [[[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] & [[p126<=1 & 1<=p126] & [p162<=1 & 1<=p162]]]]] U E [[AX [[[[[[p5<=1 & 1<=p5] & [p7<=1 & 1<=p7]] & [[p31<=1 & 1<=p31] & [p162<=1 & 1<=p162]]] | [p144<=1 & 1<=p144]] & ~ [[[[p46<=1 & 1<=p46] & [p73<=1 & 1<=p73]] & [[p107<=1 & 1<=p107] & [[p131<=1 & 1<=p131] & [p163<=1 & 1<=p163]]]]]]] & ~ [EG [[[[p46<=1 & 1<=p46] & [p73<=1 & 1<=p73]] & [[p107<=1 & 1<=p107] & [[p131<=1 & 1<=p131] & [p163<=1 & 1<=p163]]]]]]] U [p136<=1 & 1<=p136]]]
normalized: [~ [EG [~ [E [[~ [EG [[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p73<=1 & 1<=p73] & [p46<=1 & 1<=p46]]]]] & ~ [EX [~ [[~ [[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p73<=1 & 1<=p73] & [p46<=1 & 1<=p46]]]] & [[p144<=1 & 1<=p144] | [[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]]]]] U [p136<=1 & 1<=p136]]]]] & ~ [E [~ [E [[~ [EG [[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p73<=1 & 1<=p73] & [p46<=1 & 1<=p46]]]]] & ~ [EX [~ [[~ [[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p73<=1 & 1<=p73] & [p46<=1 & 1<=p46]]]] & [[p144<=1 & 1<=p144] | [[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]]]]] U [p136<=1 & 1<=p136]]] U [~ [EG [~ [[[[p162<=1 & 1<=p162] & [p126<=1 & 1<=p126]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]]]] & ~ [E [[~ [EG [[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p73<=1 & 1<=p73] & [p46<=1 & 1<=p46]]]]] & ~ [EX [~ [[~ [[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p73<=1 & 1<=p73] & [p46<=1 & 1<=p46]]]] & [[p144<=1 & 1<=p144] | [[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]]]]] U [p136<=1 & 1<=p136]]]]]]]

abstracting: (1<=p136)
states: 133,721,952 (8)
abstracting: (p136<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p144)
states: 31,792,992 (7)
abstracting: (p144<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (p73<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (p73<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
................
EG iterations: 16
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p126)
states: 133,721,952 (8)
abstracting: (p126<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
...................................................
EG iterations: 51
abstracting: (1<=p136)
states: 133,721,952 (8)
abstracting: (p136<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p144)
states: 31,792,992 (7)
abstracting: (p144<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (p73<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (p73<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
................
EG iterations: 16
abstracting: (1<=p136)
states: 133,721,952 (8)
abstracting: (p136<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p144)
states: 31,792,992 (7)
abstracting: (p144<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (p73<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p73)
states: 206,234,868 (8)
abstracting: (p73<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
................
EG iterations: 16
..............................................
EG iterations: 46
-> the formula is TRUE

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

MC time: 0m30.692sec

checking: EF [AG [[[[AG [[[[p5<=0 & 0<=p5] | [p13<=0 & 0<=p13]] | [[p130<=0 & 0<=p130] | [p162<=0 & 0<=p162]]]] & EG [~ [E [[[[p46<=1 & 1<=p46] & [p79<=1 & 1<=p79]] & [[p101<=1 & 1<=p101] & [[p137<=1 & 1<=p137] & [p163<=1 & 1<=p163]]]] U [p17<=1 & 1<=p17]]]]] & [[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]]] & [[[p85<=1 & 1<=p85] & [p162<=1 & 1<=p162]] & [[[[p199<=0 & 0<=p199] | [p5<=0 & 0<=p5]] | [[p12<=0 & 0<=p12] | [[p48<=0 & 0<=p48] | [p162<=0 & 0<=p162]]]] & [[[p127<=0 & 0<=p127] | [p5<=0 & 0<=p5]] | [[p7<=0 & 0<=p7] | [[p72<=0 & 0<=p72] | [p162<=0 & 0<=p162]]]]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[[[[p162<=0 & 0<=p162] | [p72<=0 & 0<=p72]] | [p7<=0 & 0<=p7]] | [[p5<=0 & 0<=p5] | [p127<=0 & 0<=p127]]] & [[[[p162<=0 & 0<=p162] | [p48<=0 & 0<=p48]] | [p12<=0 & 0<=p12]] | [[p5<=0 & 0<=p5] | [p199<=0 & 0<=p199]]]] & [[p162<=1 & 1<=p162] & [p85<=1 & 1<=p85]]] & [[[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]] & [EG [~ [E [[[[[p163<=1 & 1<=p163] & [p137<=1 & 1<=p137]] & [p101<=1 & 1<=p101]] & [[p79<=1 & 1<=p79] & [p46<=1 & 1<=p46]]] U [p17<=1 & 1<=p17]]]] & ~ [E [true U ~ [[[[p162<=0 & 0<=p162] | [p130<=0 & 0<=p130]] | [[p13<=0 & 0<=p13] | [p5<=0 & 0<=p5]]]]]]]]]]]]]

abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p13)
states: 3,571,962,900 (9)
abstracting: (p13<=0)
states: 2,878,978,788 (9)
abstracting: (0<=p130)
states: 3,571,962,900 (9)
abstracting: (p130<=0)
states: 3,444,949,188 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
abstracting: (1<=p17)
states: 600
abstracting: (p17<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p46)
states: 197,629,008 (8)
abstracting: (p46<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p79)
states: 206,273,268 (8)
abstracting: (p79<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p101)
states: 189,707,304 (8)
abstracting: (p101<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p137)
states: 193,435,512 (8)
abstracting: (p137<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
.....................
EG iterations: 21
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p13)
states: 692,984,112 (8)
abstracting: (p13<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p85)
states: 133,029,768 (8)
abstracting: (p85<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (0<=p199)
states: 3,571,962,900 (9)
abstracting: (p199<=0)
states: 3,252,998,340 (9)
abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p12)
states: 3,571,962,900 (9)
abstracting: (p12<=0)
states: 2,878,978,788 (9)
abstracting: (0<=p48)
states: 3,571,962,900 (9)
abstracting: (p48<=0)
states: 3,434,006,052 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
abstracting: (0<=p127)
states: 3,571,962,900 (9)
abstracting: (p127<=0)
states: 3,438,240,948 (9)
abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p7)
states: 3,571,962,900 (9)
abstracting: (p7<=0)
states: 3,342,355,232 (9)
abstracting: (0<=p72)
states: 3,571,962,900 (9)
abstracting: (p72<=0)
states: 3,436,018,452 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
-> the formula is FALSE

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

MC time: 0m 6.324sec

checking: [~ [A [AX [EX [[p140<=1 & 1<=p140]]] U [EF [[p51<=1 & 1<=p51]] & ~ [AX [[p111<=1 & 1<=p111]]]]]] & [EF [[1<=p189 & p189<=1]] & [EF [[[[[p5<=0 & 0<=p5] | [p7<=0 & 0<=p7]] | [[p48<=0 & 0<=p48] | [p162<=0 & 0<=p162]]] & [p171<=0 & 0<=p171]]] | [EG [[[[~ [E [[p119<=1 & 1<=p119] U [p140<=1 & 1<=p140]]] & [p5<=1 & 1<=p5]] & [[p12<=1 & 1<=p12] & [[p31<=1 & 1<=p31] & [p162<=1 & 1<=p162]]]] | EF [EG [[p168<=0 & 0<=p168]]]]] | [EX [[p108<=0 & 0<=p108]] & [AF [[p37<=1 & 1<=p37]] | EG [~ [A [[[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] & [[p72<=1 & 1<=p72] & [p162<=1 & 1<=p162]]] U [[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] & [[p41<=1 & 1<=p41] & [p162<=1 & 1<=p162]]]]]]]]]]]]
normalized: [[[[[[EG [~ [[~ [EG [~ [[[[p162<=1 & 1<=p162] & [p41<=1 & 1<=p41]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]]]] & ~ [E [~ [[[[p162<=1 & 1<=p162] & [p41<=1 & 1<=p41]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]] U [~ [[[[p162<=1 & 1<=p162] & [p72<=1 & 1<=p72]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]] & ~ [[[[p162<=1 & 1<=p162] & [p41<=1 & 1<=p41]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]]]]]]]] | ~ [EG [~ [[p37<=1 & 1<=p37]]]]] & EX [[p108<=0 & 0<=p108]]] | EG [[E [true U EG [[p168<=0 & 0<=p168]]] | [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [p12<=1 & 1<=p12]] & [[p5<=1 & 1<=p5] & ~ [E [[p119<=1 & 1<=p119] U [p140<=1 & 1<=p140]]]]]]]] | E [true U [[p171<=0 & 0<=p171] & [[[p162<=0 & 0<=p162] | [p48<=0 & 0<=p48]] | [[p7<=0 & 0<=p7] | [p5<=0 & 0<=p5]]]]]] & E [true U [1<=p189 & p189<=1]]] & ~ [[~ [EG [~ [[EX [~ [[p111<=1 & 1<=p111]]] & E [true U [p51<=1 & 1<=p51]]]]]] & ~ [E [~ [[EX [~ [[p111<=1 & 1<=p111]]] & E [true U [p51<=1 & 1<=p51]]]] U [EX [~ [EX [[p140<=1 & 1<=p140]]]] & ~ [[EX [~ [[p111<=1 & 1<=p111]]] & E [true U [p51<=1 & 1<=p51]]]]]]]]]]

abstracting: (1<=p51)
states: 137,956,848 (8)
abstracting: (p51<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p111)
states: 133,721,952 (8)
abstracting: (p111<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p140)
states: 115,950,912 (8)
abstracting: (p140<=1)
states: 3,571,962,900 (9)
..abstracting: (1<=p51)
states: 137,956,848 (8)
abstracting: (p51<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p111)
states: 133,721,952 (8)
abstracting: (p111<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p51)
states: 137,956,848 (8)
abstracting: (p51<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p111)
states: 133,721,952 (8)
abstracting: (p111<=1)
states: 3,571,962,900 (9)
..
EG iterations: 1
abstracting: (p189<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p189)
states: 262,859,280 (8)
abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p7)
states: 3,571,962,900 (9)
abstracting: (p7<=0)
states: 3,342,355,232 (9)
abstracting: (0<=p48)
states: 3,571,962,900 (9)
abstracting: (p48<=0)
states: 3,434,006,052 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
abstracting: (0<=p171)
states: 3,571,962,900 (9)
abstracting: (p171<=0)
states: 3,369,329,095 (9)
abstracting: (1<=p140)
states: 115,950,912 (8)
abstracting: (p140<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p119)
states: 133,721,952 (8)
abstracting: (p119<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (0<=p168)
states: 3,571,962,900 (9)
abstracting: (p168<=0)
states: 3,542,657,195 (9)
.....................................
before gc: list nodes free: 3808609

after gc: idd nodes used:547413, unused:63452587; list nodes free:293246469
.......................................................................................................................................................
EG iterations: 188

EG iterations: 0
abstracting: (0<=p108)
states: 3,571,962,900 (9)
abstracting: (p108<=0)
states: 3,571,922,100 (9)
.abstracting: (1<=p37)
states: 137,956,848 (8)
abstracting: (p37<=1)
states: 3,571,962,900 (9)
....................................................................
EG iterations: 68
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p41)
states: 137,956,848 (8)
abstracting: (p41<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p72)
states: 135,944,448 (8)
abstracting: (p72<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p41)
states: 137,956,848 (8)
abstracting: (p41<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p41)
states: 137,956,848 (8)
abstracting: (p41<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
...................................................
EG iterations: 51
...................................................
EG iterations: 51
-> the formula is FALSE

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

MC time: 2m47.602sec

checking: [[AF [[[p136<=1 & 1<=p136] | [AF [[[[p5<=0 & 0<=p5] | [p12<=0 & 0<=p12]] | [[p41<=0 & 0<=p41] | [p162<=0 & 0<=p162]]]] & [p43<=1 & 1<=p43]]]] | AG [EF [[p127<=1 & 1<=p127]]]] | [E [[p95<=1 & 1<=p95] U [p179<=1 & 1<=p179]] | [EX [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p96<=1 & 1<=p96] & [p162<=1 & 1<=p162]]]] | [AG [[[[~ [A [[p171<=1 & 1<=p171] U [[[p5<=1 & 1<=p5] & [p7<=1 & 1<=p7]] & [[p72<=1 & 1<=p72] & [p162<=1 & 1<=p162]]]]] | [[p136<=0 & 0<=p136] | [p78<=0 & 0<=p78]]] & AX [[[[p5<=0 & 0<=p5] | [p12<=0 & 0<=p12]] | [[p72<=0 & 0<=p72] | [p162<=0 & 0<=p162]]]]] & [[p190<=0 & 0<=p190] & [p135<=0 & 0<=p135]]]] & EG [AF [[[[[p5<=0 & 0<=p5] | [p13<=0 & 0<=p13]] | [[p72<=0 & 0<=p72] | [p162<=0 & 0<=p162]]] & [[[p46<=0 & 0<=p46] | [p73<=0 & 0<=p73]] | [[p101<=0 & 0<=p101] | [[p137<=0 & 0<=p137] | [p163<=0 & 0<=p163]]]]]]]]]]]
normalized: [[[[EG [~ [EG [~ [[[[[[p163<=0 & 0<=p163] | [p137<=0 & 0<=p137]] | [p101<=0 & 0<=p101]] | [[p73<=0 & 0<=p73] | [p46<=0 & 0<=p46]]] & [[[p162<=0 & 0<=p162] | [p72<=0 & 0<=p72]] | [[p13<=0 & 0<=p13] | [p5<=0 & 0<=p5]]]]]]]] & ~ [E [true U ~ [[[[p135<=0 & 0<=p135] & [p190<=0 & 0<=p190]] & [~ [EX [~ [[[[p162<=0 & 0<=p162] | [p72<=0 & 0<=p72]] | [[p12<=0 & 0<=p12] | [p5<=0 & 0<=p5]]]]]] & [[[p78<=0 & 0<=p78] | [p136<=0 & 0<=p136]] | ~ [[~ [EG [~ [[[[p162<=1 & 1<=p162] & [p72<=1 & 1<=p72]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] & ~ [E [~ [[[[p162<=1 & 1<=p162] & [p72<=1 & 1<=p72]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]] U [~ [[p171<=1 & 1<=p171]] & ~ [[[[p162<=1 & 1<=p162] & [p72<=1 & 1<=p72]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]]]]]]]]]]]] | EX [[[[p162<=1 & 1<=p162] & [p96<=1 & 1<=p96]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]] | E [[p95<=1 & 1<=p95] U [p179<=1 & 1<=p179]]] | [~ [E [true U ~ [E [true U [p127<=1 & 1<=p127]]]]] | ~ [EG [~ [[[[p43<=1 & 1<=p43] & ~ [EG [~ [[[[p162<=0 & 0<=p162] | [p41<=0 & 0<=p41]] | [[p12<=0 & 0<=p12] | [p5<=0 & 0<=p5]]]]]]] | [p136<=1 & 1<=p136]]]]]]]

abstracting: (1<=p136)
states: 133,721,952 (8)
abstracting: (p136<=1)
states: 3,571,962,900 (9)
abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p12)
states: 3,571,962,900 (9)
abstracting: (p12<=0)
states: 2,878,978,788 (9)
abstracting: (0<=p41)
states: 3,571,962,900 (9)
abstracting: (p41<=0)
states: 3,434,006,052 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
...................................................
EG iterations: 51
abstracting: (1<=p43)
states: 92,850,912 (7)
abstracting: (p43<=1)
states: 3,571,962,900 (9)
.........
before gc: list nodes free: 2030551

after gc: idd nodes used:529300, unused:63470700; list nodes free:293342707
.....................................
EG iterations: 46
abstracting: (1<=p127)
states: 133,721,952 (8)
abstracting: (p127<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p179)
states: 759,102,893 (8)
abstracting: (p179<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p95)
states: 133,029,768 (8)
abstracting: (p95<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p13)
states: 692,984,112 (8)
abstracting: (p13<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p96)
states: 133,029,768 (8)
abstracting: (p96<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p72)
states: 135,944,448 (8)
abstracting: (p72<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p171)
states: 202,633,805 (8)
abstracting: (p171<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p72)
states: 135,944,448 (8)
abstracting: (p72<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p72)
states: 135,944,448 (8)
abstracting: (p72<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.........................
EG iterations: 25
abstracting: (0<=p136)
states: 3,571,962,900 (9)
abstracting: (p136<=0)
states: 3,438,240,948 (9)
abstracting: (0<=p78)
states: 3,571,962,900 (9)
abstracting: (p78<=0)
states: 3,428,728,992 (9)
abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p12)
states: 3,571,962,900 (9)
abstracting: (p12<=0)
states: 2,878,978,788 (9)
abstracting: (0<=p72)
states: 3,571,962,900 (9)
abstracting: (p72<=0)
states: 3,436,018,452 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
.abstracting: (0<=p190)
states: 3,571,962,900 (9)
abstracting: (p190<=0)
states: 3,309,103,620 (9)
abstracting: (0<=p135)
states: 3,571,962,900 (9)
abstracting: (p135<=0)
states: 3,438,240,948 (9)
abstracting: (0<=p5)
states: 3,571,962,900 (9)
abstracting: (p5<=0)
states: 2,247,754,125 (9)
abstracting: (0<=p13)
states: 3,571,962,900 (9)
abstracting: (p13<=0)
states: 2,878,978,788 (9)
abstracting: (0<=p72)
states: 3,571,962,900 (9)
abstracting: (p72<=0)
states: 3,436,018,452 (9)
abstracting: (0<=p162)
states: 3,571,962,900 (9)
abstracting: (p162<=0)
states: 3,168,821,700 (9)
abstracting: (0<=p46)
states: 3,571,962,900 (9)
abstracting: (p46<=0)
states: 3,374,333,892 (9)
abstracting: (0<=p73)
states: 3,571,962,900 (9)
abstracting: (p73<=0)
states: 3,365,728,032 (9)
abstracting: (0<=p101)
states: 3,571,962,900 (9)
abstracting: (p101<=0)
states: 3,382,255,596 (9)
abstracting: (0<=p137)
states: 3,571,962,900 (9)
abstracting: (p137<=0)
states: 3,378,527,388 (9)
abstracting: (0<=p163)
states: 3,571,962,900 (9)
abstracting: (p163<=0)
states: 3,148,487,658 (9)
...................................................
EG iterations: 51
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 1m 0.419sec

checking: E [[~ [[[[p52<=1 & 1<=p52] & [p79<=1 & 1<=p79]] & [[p107<=1 & 1<=p107] & [[p131<=1 & 1<=p131] & [p163<=1 & 1<=p163]]]]] | AG [~ [[[[p5<=1 & 1<=p5] & [p7<=1 & 1<=p7]] & [[p126<=1 & 1<=p126] & [p162<=1 & 1<=p162]]]]]] U [A [[[~ [[[[p5<=1 & 1<=p5] & [p13<=1 & 1<=p13]] & [[p68<=1 & 1<=p68] & [p162<=1 & 1<=p162]]]] & [EF [[p180<=1 & 1<=p180]] & E [[p92<=1 & 1<=p92] U [p81<=1 & 1<=p81]]]] | [[[p78<=1 & 1<=p78] | [[p42<=1 & 1<=p42] | [[[p52<=1 & 1<=p52] & [p79<=1 & 1<=p79]] & [[p107<=1 & 1<=p107] & [[p131<=1 & 1<=p131] & [p163<=1 & 1<=p163]]]]]] & [[[[[p5<=1 & 1<=p5] & [p7<=1 & 1<=p7]] & [[p126<=1 & 1<=p126] & [p162<=1 & 1<=p162]]] | [p202<=1 & 1<=p202]] | [[p80<=1 & 1<=p80] | [p160<=1 & 1<=p160]]]]] U A [EG [[p80<=1 & 1<=p80]] U [E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]] | AX [[[[p5<=1 & 1<=p5] & [p7<=1 & 1<=p7]] & [[p31<=1 & 1<=p31] & [p162<=1 & 1<=p162]]]]]]] & A [EF [[[p175<=1 & 1<=p175] | [[p51<=1 & 1<=p51] | ~ [[[[p5<=1 & 1<=p5] & [p12<=1 & 1<=p12]] & [[p100<=1 & 1<=p100] & [p162<=1 & 1<=p162]]]]]]] U EG [E [[p62<=1 & 1<=p62] U [p106<=1 & 1<=p106]]]]]]
normalized: E [[~ [E [true U [[[p162<=1 & 1<=p162] & [p126<=1 & 1<=p126]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]] | ~ [[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p79<=1 & 1<=p79] & [p52<=1 & 1<=p52]]]]] U [[~ [EG [~ [EG [E [[p62<=1 & 1<=p62] U [p106<=1 & 1<=p106]]]]]] & ~ [E [~ [EG [E [[p62<=1 & 1<=p62] U [p106<=1 & 1<=p106]]]] U [~ [E [true U [[~ [[[[p162<=1 & 1<=p162] & [p100<=1 & 1<=p100]] & [[p12<=1 & 1<=p12] & [p5<=1 & 1<=p5]]]] | [p51<=1 & 1<=p51]] | [p175<=1 & 1<=p175]]]] & ~ [EG [E [[p62<=1 & 1<=p62] U [p106<=1 & 1<=p106]]]]]]]] & [~ [EG [~ [[~ [EG [~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]]]] & ~ [E [~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]] U [~ [EG [[p80<=1 & 1<=p80]]] & ~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]]]] & ~ [E [~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]] U [~ [EG [[p80<=1 & 1<=p80]]] & ~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]]]]]]] U [~ [[[[[[p160<=1 & 1<=p160] | [p80<=1 & 1<=p80]] | [[p202<=1 & 1<=p202] | [[[p162<=1 & 1<=p162] & [p126<=1 & 1<=p126]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]] & [[[[[[p163<=1 & 1<=p163] & [p131<=1 & 1<=p131]] & [p107<=1 & 1<=p107]] & [[p79<=1 & 1<=p79] & [p52<=1 & 1<=p52]]] | [p42<=1 & 1<=p42]] | [p78<=1 & 1<=p78]]] | [[E [[p92<=1 & 1<=p92] U [p81<=1 & 1<=p81]] & E [true U [p180<=1 & 1<=p180]]] & ~ [[[[p162<=1 & 1<=p162] & [p68<=1 & 1<=p68]] & [[p13<=1 & 1<=p13] & [p5<=1 & 1<=p5]]]]]]] & ~ [[~ [EG [~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]]]] & ~ [E [~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]] U [~ [EG [[p80<=1 & 1<=p80]]] & ~ [[~ [EX [~ [[[[p162<=1 & 1<=p162] & [p31<=1 & 1<=p31]] & [[p7<=1 & 1<=p7] & [p5<=1 & 1<=p5]]]]]] | E [[p30<=1 & 1<=p30] U [p152<=1 & 1<=p152]]]]]]]]]]]]]]]

abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p80)
states: 40,800 (4)
abstracting: (p80<=1)
states: 3,571,962,900 (9)
................................
EG iterations: 32
abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
................................
before gc: list nodes free: 5776305

after gc: idd nodes used:847591, unused:63152409; list nodes free:291917105
......................................................................................................................................
EG iterations: 165
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p13)
states: 692,984,112 (8)
abstracting: (p13<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p68)
states: 143,233,908 (8)
abstracting: (p68<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p180)
states: 202,633,805 (8)
abstracting: (p180<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p81)
states: 133,029,768 (8)
abstracting: (p81<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p92)
states: 133,029,768 (8)
abstracting: (p92<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p78)
states: 143,233,908 (8)
abstracting: (p78<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p42)
states: 137,956,848 (8)
abstracting: (p42<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p52)
states: 197,667,408 (8)
abstracting: (p52<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p79)
states: 206,273,268 (8)
abstracting: (p79<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p126)
states: 133,721,952 (8)
abstracting: (p126<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p202)
states: 146,528,525 (8)
abstracting: (p202<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p80)
states: 40,800 (4)
abstracting: (p80<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p160)
states: 307,481,880 (8)
abstracting: (p160<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p80)
states: 40,800 (4)
abstracting: (p80<=1)
states: 3,571,962,900 (9)
................................
EG iterations: 32
abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
................
before gc: list nodes free: 3156713

after gc: idd nodes used:840081, unused:63159919; list nodes free:291960493
......................................................................................................
before gc: list nodes free: 3110685

after gc: idd nodes used:697848, unused:63302152; list nodes free:292583849
................................................
EG iterations: 165
abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p80)
states: 40,800 (4)
abstracting: (p80<=1)
states: 3,571,962,900 (9)
................................
EG iterations: 32
abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
.abstracting: (1<=p152)
states: 31,792,992 (7)
abstracting: (p152<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p30)
states: 92,850,912 (7)
abstracting: (p30<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p31)
states: 137,956,848 (8)
abstracting: (p31<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
........................................
before gc: list nodes free: 4750492

after gc: idd nodes used:910864, unused:63089136; list nodes free:291602514
..............................................................................................................................
EG iterations: 165
.......................
before gc: list nodes free: 2968800

after gc: idd nodes used:817322, unused:63182678; list nodes free:292053519
..............................................................................................................................................
EG iterations: 165
abstracting: (1<=p106)
states: 133,029,768 (8)
abstracting: (p106<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p62)
states: 143,233,908 (8)
abstracting: (p62<=1)
states: 3,571,962,900 (9)
..................
before gc: list nodes free: 2886268

after gc: idd nodes used:684764, unused:63315236; list nodes free:292651919
...............................................
EG iterations: 65
abstracting: (1<=p175)
states: 142,961,088 (8)
abstracting: (p175<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p51)
states: 137,956,848 (8)
abstracting: (p51<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p12)
states: 692,984,112 (8)
abstracting: (p12<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p100)
states: 126,252,768 (8)
abstracting: (p100<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p106)
states: 133,029,768 (8)
abstracting: (p106<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p62)
states: 143,233,908 (8)
abstracting: (p62<=1)
states: 3,571,962,900 (9)
.................................................................
EG iterations: 65
abstracting: (1<=p106)
states: 133,029,768 (8)
abstracting: (p106<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p62)
states: 143,233,908 (8)
abstracting: (p62<=1)
states: 3,571,962,900 (9)
.................................................................
EG iterations: 65
........................................
EG iterations: 40
abstracting: (1<=p52)
states: 197,667,408 (8)
abstracting: (p52<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p79)
states: 206,273,268 (8)
abstracting: (p79<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p107)
states: 189,748,104 (8)
abstracting: (p107<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p131)
states: 193,394,112 (8)
abstracting: (p131<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p163)
states: 423,475,242 (8)
abstracting: (p163<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p5)
states: 1,324,208,775 (9)
abstracting: (p5<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p7)
states: 229,607,668 (8)
abstracting: (p7<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p126)
states: 133,721,952 (8)
abstracting: (p126<=1)
states: 3,571,962,900 (9)
abstracting: (1<=p162)
states: 403,141,200 (8)
abstracting: (p162<=1)
states: 3,571,962,900 (9)
-> the formula is TRUE

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

MC time: 15m20.540sec

totally nodes used: 781276343 (7.8e+08)
number of garbage collections: 12
fire ops cache: hits/miss/sum: 1121489270 2850614876 3972104146
used/not used/entry size/cache size: 52195391 14913473 16 1024MB
basic ops cache: hits/miss/sum: 45524480 92040844 137565324
used/not used/entry size/cache size: 5246411 11530805 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: 324654 1158530 1483184
used/not used/entry size/cache size: 86631 8301977 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 50840026
1 12899925
2 2733285
3 533659
4 88159
5 12243
6 1426
7 133
8 8
9 0
>= 10 0

Total processing time: 27m35.793sec


BK_STOP 1678701002661

--------------------
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

31597 37906 40476
iterations count:342551 (973), effective:21992 (62)

initing FirstDep: 0m 0.000sec


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

iterations count:38292 (108), effective:1481 (4)

iterations count:34851 (99), effective:1137 (3)

iterations count:44259 (125), effective:2042 (5)

iterations count:35348 (100), effective:1221 (3)

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

iterations count:29210 (82), effective:975 (2)

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

iterations count:27241 (77), effective:753 (2)

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

iterations count:822 (2), effective:31 (0)

iterations count:62205 (176), effective:2631 (7)

iterations count:47518 (134), effective:2415 (6)

iterations count:32636 (92), effective:1112 (3)

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

iterations count:43856 (124), effective:2008 (5)

iterations count:26237 (74), effective:752 (2)

iterations count:385 (1), effective:9 (0)

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

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

iterations count:390 (1), effective:10 (0)

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

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

iterations count:27673 (78), effective:795 (2)

iterations count:27163 (77), effective:719 (2)

iterations count:2079 (5), effective:43 (0)

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

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

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

iterations count:561 (1), effective:13 (0)

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

iterations count:48019 (136), effective:2397 (6)

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

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

iterations count:27190 (77), effective:756 (2)

iterations count:27190 (77), effective:756 (2)

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

iterations count:27190 (77), effective:756 (2)

iterations count:58888 (167), effective:3154 (8)

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

iterations count:862 (2), effective:44 (0)

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

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

iterations count:26292 (74), effective:757 (2)

iterations count:26777 (76), effective:742 (2)

iterations count:853 (2), effective:43 (0)

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

iterations count:44161 (125), effective:1905 (5)

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

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

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

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

iterations count:385 (1), effective:9 (0)

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

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

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

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

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

iterations count:466 (1), effective:12 (0)

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

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

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

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

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

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

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

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

iterations count:33874 (96), effective:1381 (3)

iterations count:36544 (103), effective:1456 (4)

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

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