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.r522-tall-167987247300378.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 PGCD-COL-D02N005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300378
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 452K
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Mar 23 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 23 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Mar 23 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 23 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 equiv_pt
-rw-r--r-- 1 mcc users 8 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 5 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 11K Mar 31 16:48 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 PGCD-COL-D02N005-CTLFireability-00
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-01
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-02
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-03
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-04
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-05
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-06
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-07
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-08
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-09
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-10
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-11
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-12
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-13
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-14
FORMULA_NAME PGCD-COL-D02N005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1680810895941

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=PGCD-COL-D02N005
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 19:54:57] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 19:54:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 19:54:57] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2023-04-06 19:54:57] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-06 19:54:57] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 494 ms
[2023-04-06 19:54:58] [INFO ] Imported 3 HL places and 3 HL transitions for a total of 9 PT places and 9.0 transition bindings in 17 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
[2023-04-06 19:54:58] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 5 ms.
[2023-04-06 19:54:58] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
All 16 properties of the HLPN use transition enablings in a way that makes the skeleton too coarse.
Arc [2:1*[(MOD (ADD $x 1) 3)]] contains successor/predecessor on variables of sort CD
[2023-04-06 19:54:58] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 5 ms.
[2023-04-06 19:54:58] [INFO ] Unfolded 16 HLPN properties in 0 ms.
Initial state reduction rules removed 4 formulas.
FORMULA PGCD-COL-D02N005-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PGCD-COL-D02N005-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 5 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 9 cols
[2023-04-06 19:54:58] [INFO ] Computed 4 invariants in 3 ms
[2023-04-06 19:54:58] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
[2023-04-06 19:54:58] [INFO ] Invariant cache hit.
[2023-04-06 19:54:58] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-04-06 19:54:58] [INFO ] Invariant cache hit.
[2023-04-06 19:54:58] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:54:58] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2023-04-06 19:54:58] [INFO ] Invariant cache hit.
[2023-04-06 19:54:58] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 294 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-06 19:54:58] [INFO ] Flatten gal took : 17 ms
[2023-04-06 19:54:58] [INFO ] Flatten gal took : 7 ms
[2023-04-06 19:54:58] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 224 ms. (steps per millisecond=44 ) properties (out of 18) seen :13
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-06 19:54:59] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 19:54:59] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:3
[2023-04-06 19:54:59] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2023-04-06 19:54:59] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-06 19:54:59] [INFO ] After 25ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :3
[2023-04-06 19:54:59] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:54:59] [INFO ] After 9ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :2 sat :3
[2023-04-06 19:54:59] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-04-06 19:54:59] [INFO ] After 105ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :3
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 3 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 9/9 places, 9/9 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Finished probabilistic random walk after 35319 steps, run visited all 3 properties in 138 ms. (steps per millisecond=255 )
Probabilistic random walk after 35319 steps, saw 8228 distinct states, run finished after 138 ms. (steps per millisecond=255 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 4 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 5 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 3 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 2 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 0 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:54:59] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:54:59] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:54:59] [INFO ] Invariant cache hit.
[2023-04-06 19:55:00] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 25 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 0 ms
[2023-04-06 19:55:00] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:00] [INFO ] Invariant cache hit.
[2023-04-06 19:55:00] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:00] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:00] [INFO ] Invariant cache hit.
[2023-04-06 19:55:00] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:00] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:00] [INFO ] Invariant cache hit.
[2023-04-06 19:55:00] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:55:00] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 9/9 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:00] [INFO ] Invariant cache hit.
[2023-04-06 19:55:00] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:00] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 3 ms
[2023-04-06 19:55:00] [INFO ] Flatten gal took : 3 ms
[2023-04-06 19:55:00] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-06 19:55:00] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 9 transitions and 42 arcs took 0 ms.
Total runtime 2787 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: 9 NrTr: 9 NrArc: 42)

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

net check time: 0m 0.000sec

init dd package: 0m 2.752sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 377 (3.8e+02) #states 8,484 (3)



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

checking: EG [AG [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]
normalized: EG [~ [E [true U ~ [[[[1<=p5 & 1<=p8] & 1<=p2] | [[[1<=p3 & 1<=p6] & 1<=p0] | [[1<=p4 & 1<=p7] & 1<=p1]]]]]]]

abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-COL-D02N005-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.013sec

checking: EX [[EF [EG [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]] & [[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]
normalized: EX [[[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] & E [true U EG [[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]

abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
.
EG iterations: 1
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
.-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AX [EF [[[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]] | [[EF [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] & [p2<=0 | [p5<=0 | p8<=0]]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]]
normalized: ~ [EX [~ [E [true U [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[[p5<=0 | p8<=0] | p2<=0] & E [true U [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]] | [[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]]]]

abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
.-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EX [[AF [EG [AG [[[p3<=0 | p0<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]] | E [~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] U [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] | [[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]]]
normalized: EX [[E [~ [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]] U [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]] | ~ [EG [~ [EG [~ [E [true U ~ [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p3<=0 | p0<=0]]]]]]]]]]]

abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
.-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [A [AG [~ [[[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] & [[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]] U ~ [A [~ [A [~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] U ~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]] U [[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [[~ [E [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] U [[~ [EG [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]] & ~ [E [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]] U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] & [[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]]] & ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] & ~ [EG [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]] & ~ [E [[~ [E [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] U [[~ [EG [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]] & ~ [E [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]] U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] & [[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]]] & ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] & ~ [EG [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] U [[~ [E [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] U [[~ [EG [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]] & ~ [E [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]] U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] & [[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]]] & ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] & ~ [EG [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] & E [true U [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] & [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]]]]]]

abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.......
EG iterations: 7
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
..
EG iterations: 2
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.......
EG iterations: 7
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
..
EG iterations: 2
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.......
EG iterations: 7
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
..
EG iterations: 2
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA PGCD-COL-D02N005-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [EG [[AG [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] | AX [[[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]] | [[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]]] & [EF [[[[p0<=2 | p6<=0] & [[p1<=2 | p7<=0] & [p2<=2 | p8<=0]]] | ~ [A [~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] U ~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]]]] | EG [EX [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]]]
normalized: [[EG [EX [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]] | E [true U [~ [[~ [EG [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]] & ~ [E [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] & [[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]]]] | [[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]]]] & EG [[~ [EX [~ [[[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] | [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]] | ~ [E [true U ~ [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]]]]]

abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
...
EG iterations: 2
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p0<=2)
states: 4,548 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p1<=2)
states: 4,548 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p2<=2)
states: 4,548 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
..
EG iterations: 2
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
....
EG iterations: 3
-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: ~ [A [A [[[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] & [[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] U EF [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]] U A [[~ [AX [~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]] & ~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]] U AG [[[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] | [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]]]]
normalized: ~ [[~ [EG [~ [[~ [EG [E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]] & ~ [E [E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]] U [~ [[~ [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]] & EX [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]] & E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]]]]]]] & ~ [E [~ [[~ [EG [E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]] & ~ [E [E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]] U [~ [[~ [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]] & EX [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]] & E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]]]]] U [~ [[~ [EG [~ [E [true U [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] & ~ [E [~ [E [true U [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]] U [~ [[[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] & [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]] & ~ [E [true U [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]]] & ~ [[~ [EG [E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]] & ~ [E [E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]] U [~ [[~ [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]] & EX [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]] & E [true U ~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]]]]]]]]]]

abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
.abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)

EG iterations: 0
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.
EG iterations: 1
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
.abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)

EG iterations: 0
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
.abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)

EG iterations: 0

EG iterations: 0
-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.007sec

checking: AX [[AG [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]] & [[EG [[[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] | [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]] | [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]] | [[p0<=2 | p6<=0] & [[p1<=2 | p7<=0] & [p2<=2 | p8<=0]]]]] & [AX [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]] | EF [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]]]]
normalized: ~ [EX [~ [[[[E [true U [[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]] | ~ [EX [~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]]] & [[[[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]] | [[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]] | EG [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]] & ~ [E [true U ~ [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]]

abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
.
EG iterations: 1
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p0<=2)
states: 4,548 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p1<=2)
states: 4,548 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p2<=2)
states: 4,548 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
.abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
.-> the formula is FALSE

FORMULA PGCD-COL-D02N005-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [[EG [AG [[[[p0<=2 | p6<=0] & [[p1<=2 | p7<=0] & [p2<=2 | p8<=0]]] & [[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]] | ~ [E [EX [~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]] U A [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]] U ~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]]]]] | EF [~ [A [~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]] U [[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]]]
normalized: [E [true U ~ [[~ [EG [~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]] & ~ [E [~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]] U [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]] & ~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]]]]]] | ~ [EX [~ [[~ [E [EX [~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]] U [~ [EG [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]] & ~ [E [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] U [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] & [[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]]]]] | EG [~ [E [true U ~ [[[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]] & [[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]]]]]]]]]]]

abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p0<=2)
states: 4,548 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p1<=2)
states: 4,548 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p2<=2)
states: 4,548 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
.
EG iterations: 1
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
..
EG iterations: 2
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
..abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
.
EG iterations: 1
-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [E [[[~ [[[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]] | [[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]] & [~ [EG [~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]] & AF [~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]]] | [~ [AG [~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]] & A [[[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [[1<=p4 & 1<=p7] & 1<=p1]]] | [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]] U [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]] | [[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]]] U EF [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]]
normalized: EG [E [[[[~ [EG [~ [[[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] | [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] & ~ [E [~ [[[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] | [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]] U [~ [[[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]] & ~ [[[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] | [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]] & E [true U [[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]] | [[~ [EG [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]] & ~ [EG [~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]]] & ~ [[[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] | [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] U E [true U [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]

abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
..
EG iterations: 2
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.......
EG iterations: 7
.
EG iterations: 1
-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [~ [E [EG [~ [[[[[1<=p2 & [1<=p5 & 1<=p8]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p2 & [1<=p5 & 1<=p8]]]] | [[[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]] | [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]]] U EG [[[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]] | [[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]]] | EG [[[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]] | A [~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] U [[[[[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]] & [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]] | [[3<=p0 & 1<=p6] | [3<=p1 & 1<=p7]]] | [[[3<=p2 & 1<=p8] | [3<=p0 & 1<=p6]] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] & EX [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]]]]]
normalized: [~ [E [EG [~ [[[[[[1<=p3 & 1<=p6] & 1<=p0] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[1<=p5 & 1<=p8] & 1<=p2] | [[1<=p4 & 1<=p7] & 1<=p1]]] | [[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] | [[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]]]]]] U EG [[[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] | [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]] | EG [[[~ [EG [~ [[EX [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] & [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]] | [[[3<=p1 & 1<=p7] | [3<=p0 & 1<=p6]] | [[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] & [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]] & ~ [E [~ [[EX [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] & [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]] | [[[3<=p1 & 1<=p7] | [3<=p0 & 1<=p6]] | [[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] & [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]] U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] & ~ [[EX [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] & [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [[3<=p0 & 1<=p6] | [3<=p2 & 1<=p8]]] | [[[3<=p1 & 1<=p7] | [3<=p0 & 1<=p6]] | [[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]] & [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]]]] | [[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]]

abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
...
EG iterations: 2
.
EG iterations: 1
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.
EG iterations: 1
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
..
EG iterations: 2
-> the formula is TRUE

FORMULA PGCD-COL-D02N005-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: A [[AX [~ [EF [~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]]] & [AF [[[AF [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] & A [~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] U ~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]] & [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]] & [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]] | [[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]]] & [EX [EF [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]] | [A [~ [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] U [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]] | [[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]] & ~ [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]]]]]] U [[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]
normalized: [~ [EG [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]] & ~ [E [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] U [~ [[[[[~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]] & [~ [EG [~ [[[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] | [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]] & ~ [E [~ [[[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] | [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]] U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] & ~ [[[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] | [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]] | EX [E [true U [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]] & ~ [EG [~ [[[[[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]] | [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]] & [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] & [[~ [EG [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]] & ~ [E [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] & [[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]]]] & ~ [EG [~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]]]]] & ~ [EX [E [true U ~ [[[[[p4<=0 | p7<=0] | p1<=0] & [[p3<=0 | p6<=0] | p0<=0]] & [[p5<=0 | p8<=0] | p2<=0]]]]]]]] & ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]

abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
.abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.......
EG iterations: 7
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
..
EG iterations: 2
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
.......
EG iterations: 7
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
abstracting: (1<=p3)
states: 6,488 (3)
abstracting: (1<=p0)
states: 6,612 (3)
abstracting: (1<=p4)
states: 6,488 (3)
abstracting: (1<=p1)
states: 6,612 (3)
abstracting: (1<=p5)
states: 6,488 (3)
abstracting: (1<=p2)
states: 6,612 (3)
..
EG iterations: 2
abstracting: (p2<=0)
states: 1,872 (3)
abstracting: (p8<=0)
states: 1,872 (3)
abstracting: (p5<=0)
states: 1,996 (3)
abstracting: (p0<=0)
states: 1,872 (3)
abstracting: (p6<=0)
states: 1,872 (3)
abstracting: (p3<=0)
states: 1,996 (3)
abstracting: (p1<=0)
states: 1,872 (3)
abstracting: (p7<=0)
states: 1,872 (3)
abstracting: (p4<=0)
states: 1,996 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
abstracting: (1<=p6)
states: 6,612 (3)
abstracting: (3<=p0)
states: 3,936 (3)
abstracting: (1<=p7)
states: 6,612 (3)
abstracting: (3<=p1)
states: 3,936 (3)
abstracting: (1<=p8)
states: 6,612 (3)
abstracting: (3<=p2)
states: 3,936 (3)
.......
EG iterations: 7
-> the formula is FALSE

FORMULA PGCD-COL-D02N005-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 15053 (1.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 75640 36169 111809
used/not used/entry size/cache size: 47551 67061313 16 1024MB
basic ops cache: hits/miss/sum: 33846 20729 54575
used/not used/entry size/cache size: 38511 16738705 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: 5271 1953 7224
used/not used/entry size/cache size: 1953 8386655 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 67095510
1 12288
2 783
3 190
4 41
5 12
6 15
7 5
8 0
9 4
>= 10 16

Total processing time: 0m 4.360sec


BK_STOP 1680810906355

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


initing FirstDep: 0m 0.000sec


iterations count:486 (54), effective:159 (17)

initing FirstDep: 0m 0.000sec


iterations count:97 (10), effective:34 (3)

iterations count:18 (2), effective:3 (0)

iterations count:44 (4), effective:10 (1)

iterations count:97 (10), effective:34 (3)

iterations count:18 (2), effective:3 (0)

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

iterations count:18 (2), effective:3 (0)

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

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

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

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

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

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

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

iterations count:44 (4), effective:10 (1)

iterations count:18 (2), effective:3 (0)

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

iterations count:137 (15), effective:52 (5)

iterations count:97 (10), effective:34 (3)

iterations count:97 (10), effective:34 (3)

iterations count:23 (2), effective:5 (0)

iterations count:97 (10), effective:34 (3)

iterations count:44 (4), effective:10 (1)

iterations count:44 (4), effective:10 (1)

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

iterations count:44 (4), effective:10 (1)

iterations count:97 (10), effective:34 (3)

iterations count:97 (10), effective:34 (3)

iterations count:23 (2), effective:5 (0)

iterations count:97 (10), effective:34 (3)

iterations count:348 (38), effective:104 (11)

iterations count:97 (10), effective:34 (3)

iterations count:97 (10), effective:34 (3)

iterations count:23 (2), effective:5 (0)

iterations count:97 (10), effective:34 (3)

iterations count:97 (10), effective:34 (3)

iterations count:97 (10), effective:34 (3)

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

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

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

iterations count:18 (2), effective:3 (0)

iterations count:44 (4), effective:10 (1)

iterations count:97 (10), effective:34 (3)

iterations count:57 (6), effective:12 (1)

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

iterations count:44 (4), effective:10 (1)

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

iterations count:18 (2), effective:3 (0)

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

iterations count:44 (4), effective:10 (1)

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PGCD-COL-D02N005"
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 PGCD-COL-D02N005, 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 r522-tall-167987247300378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N005.tgz
mv PGCD-COL-D02N005 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 ;