About the Execution of Marcie+red for PGCD-COL-D02N100
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 8970.432 | 143820.00 | 149316.00 | 778.10 | FTFFTFTFFTTTFFFT | normal |
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-167987247300394.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-D02N100, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r522-tall-167987247300394
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 5.8K Mar 23 15:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K Mar 23 15:21 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 23 15:21 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Mar 23 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 23 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K 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 7.5K Mar 23 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 77K Mar 23 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 23 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Mar 23 15:27 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-D02N100-CTLFireability-00
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-01
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-02
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-03
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-04
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-05
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-06
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-07
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-08
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-09
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-10
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-11
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-12
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-13
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-14
FORMULA_NAME PGCD-COL-D02N100-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1680810938802
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-D02N100
Applying reductions before tool marcie
Invoking reducer
Running Version 202304061127
[2023-04-06 19:55:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-04-06 19:55:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 19:55:40] [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:55:40] [WARNING] Using fallBack plugin, rng conformance not checked
[2023-04-06 19:55:40] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 393 ms
[2023-04-06 19:55:40] [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 18 ms.
[2023-04-06 19:55:40] [INFO ] Built PT skeleton of HLPN with 3 places and 3 transitions 14 arcs in 4 ms.
[2023-04-06 19:55:40] [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:55:40] [INFO ] Unfolded HLPN to a Petri net with 9 places and 9 transitions 42 arcs in 6 ms.
[2023-04-06 19:55:40] [INFO ] Unfolded 16 HLPN properties in 1 ms.
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:55:40] [INFO ] Computed 4 invariants in 3 ms
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 131 ms found 0 transitions.
[2023-04-06 19:55:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Implicit Places using invariants in 22 ms returned []
[2023-04-06 19:55:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-04-06 19:55:41] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
[2023-04-06 19:55:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 315 ms. Remains : 9/9 places, 9/9 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-04-06 19:55:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 16 ms
FORMULA PGCD-COL-D02N100-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 7 ms
[2023-04-06 19:55:41] [INFO ] Input system was already deterministic with 9 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 18) seen :16
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-04-06 19:55:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-06 19:55:41] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2023-04-06 19:55:41] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2023-04-06 19:55:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-04-06 19:55:41] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2023-04-06 19:55:41] [INFO ] After 49ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-04-06 19:55:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 5 ms
FORMULA PGCD-COL-D02N100-CTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 4 ms
[2023-04-06 19:55:41] [INFO ] Input system was already deterministic with 9 transitions.
Computed a total of 0 stabilizing places and 0 stable 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:55:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:55:41] [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:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [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:41] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 3 ms
[2023-04-06 19:55:41] [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 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 60 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 4 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [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:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [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 1 ms. Remains 9 /9 variables (removed 0) and now considering 9/9 (removed 0) transitions.
[2023-04-06 19:55:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [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 23 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [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:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [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:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [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:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 0 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [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:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:41] [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:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:41] [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:41] [INFO ] Invariant cache hit.
[2023-04-06 19:55:42] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [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:42] [INFO ] Invariant cache hit.
[2023-04-06 19:55:42] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 0 ms
[2023-04-06 19:55:42] [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:42] [INFO ] Invariant cache hit.
[2023-04-06 19:55:42] [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:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [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:42] [INFO ] Invariant cache hit.
[2023-04-06 19:55:42] [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:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [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:42] [INFO ] Invariant cache hit.
[2023-04-06 19:55:42] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 9/9 places, 9/9 transitions.
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 1 ms
[2023-04-06 19:55:42] [INFO ] Input system was already deterministic with 9 transitions.
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 3 ms
[2023-04-06 19:55:42] [INFO ] Flatten gal took : 2 ms
[2023-04-06 19:55:42] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-04-06 19:55:42] [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 1904 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.730sec
RS generation: 0m11.503sec
-> reachability set: #nodes 49631 (5.0e+04) #states 5,588,167,526 (9)
starting MCC model checker
--------------------------
checking: EF [AG [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[1<=p4 & 1<=p7] & 1<=p1] | [[1<=p3 & 1<=p6] & 1<=p0]] | [[1<=p5 & 1<=p8] & 1<=p2]]]]]]
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m13.673sec
checking: EX [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]
normalized: EX [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
.-> the formula is TRUE
FORMULA PGCD-COL-D02N100-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.453sec
checking: EX [AG [EF [[AG [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] | [[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]]]
normalized: EX [~ [E [true U ~ [E [true U [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] | ~ [E [true U ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]]]]]
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
.-> the formula is TRUE
FORMULA PGCD-COL-D02N100-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m56.256sec
checking: AG [[[EX [AX [EX [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]] | [1<=p0 & 1<=p3]] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]
normalized: ~ [E [true U ~ [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [[1<=p0 & 1<=p3] | EX [~ [EX [~ [EX [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]]]]]
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
...abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
-> the formula is TRUE
FORMULA PGCD-COL-D02N100-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: AF [[AG [[[[1<=p8 & 1<=p5] & 1<=p2] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]] & [[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 [true U ~ [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p8 & 1<=p5]]]]]]]]]]
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EF [AX [[AG [[[p2<=0 | [p5<=0 | p8<=0]] & [[p0<=0 | [p3<=0 | p6<=0]] & [p1<=0 | [p4<=0 | p7<=0]]]]] & [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] & ~ [E [true U ~ [[[[p1<=0 | [p4<=0 | p7<=0]] & [p0<=0 | [p3<=0 | p6<=0]]] & [p2<=0 | [p5<=0 | p8<=0]]]]]]]]]]]
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
.-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.370sec
checking: AF [~ [E [~ [[[~ [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] | [1<=p0 & 1<=p3]] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]] U AG [EF [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]]]]
normalized: ~ [EG [E [~ [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [[1<=p0 & 1<=p3] | ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]] U ~ [E [true U ~ [E [true U [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]]
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
EG iterations: 0
-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.069sec
checking: EX [E [~ [EG [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]] U AX [[EF [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] & ~ [A [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]] U [[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]]]]]
normalized: EX [E [~ [EG [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]] U ~ [EX [~ [[~ [[~ [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 [~ [[[[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 [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]]]
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
..
EG iterations: 2
.abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.
EG iterations: 1
.-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.688sec
checking: [~ [E [EF [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]] U EX [[[AF [[[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]]]]]]] | AG [EX [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]]
normalized: [~ [E [true U ~ [EX [[[[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 EX [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [[1<=p2 & [1<=p5 & 1<=p8]] | ~ [EG [~ [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]]]]]]
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
.abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
.-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m18.536sec
checking: AX [[EG [AX [E [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] U [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]] | [[[p0<=2 | p6<=0] & [[p1<=2 | p7<=0] & [p2<=2 | p8<=0]]] | [[EX [[[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]]]]]]]
normalized: ~ [EX [~ [[[[[[p1<=0 | [p4<=0 | p7<=0]] & [p0<=0 | [p3<=0 | p6<=0]]] & [[p2<=0 | [p5<=0 | p8<=0]] & EX [[[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]]]] | [[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]] | EG [~ [EX [~ [E [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] U [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]]]]]]
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
...
EG iterations: 2
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
.abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
.-> the formula is TRUE
FORMULA PGCD-COL-D02N100-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.919sec
checking: AG [[EF [[[[AX [[[p0<=2 | p6<=0] & [[p1<=2 | p7<=0] & [p2<=2 | p8<=0]]]] | [[[p0<=2 | p6<=0] & [[p1<=2 | p7<=0] & [p2<=2 | p8<=0]]] | [[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]]]]] | [AX [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]] & [AG [[[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]] & AG [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]]] & [[[p0<=2 | p6<=0] & [[p1<=2 | p7<=0] & [p2<=2 | p8<=0]]] | [[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]]]]
normalized: ~ [E [true U ~ [[[[[[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]] | [[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]] & ~ [E [true U ~ [[~ [E [true U ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]] & [[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]] & ~ [EX [~ [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]] | E [true U [[[p1<=0 | [p4<=0 | p7<=0]] & [p0<=0 | [p3<=0 | p6<=0]]] & [[p2<=0 | [p5<=0 | p8<=0]] & [[[[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]] | [[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]] | ~ [EX [~ [[[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]]]]]]]]]]]]
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
.abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.077sec
checking: [EG [A [[EX [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]] & ~ [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]] U EX [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]] & [AX [AF [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]] | [EX [AG [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]]]] & ~ [A [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] U AF [E [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] U [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]]]]]]
normalized: [[[~ [[~ [EG [EG [~ [E [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] U [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]] & ~ [E [EG [~ [E [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] U [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]] U [~ [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]] & EG [~ [E [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] U [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]]]]] & EX [~ [E [true U ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]] | ~ [EX [EG [~ [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]] & EG [[~ [EG [~ [EX [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]] & ~ [E [~ [EX [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]] U [~ [[~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]] & EX [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]] & ~ [EX [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]]]
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
..
EG iterations: 1
EG iterations: 0
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
.abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE
FORMULA PGCD-COL-D02N100-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AF [[[EX [E [[[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]]]]]] & [EF [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]] | [[[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]]]]]]] & [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]] & [EX [[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]] | ~ [E [[[3<=p0 & 1<=p6] | [[3<=p1 & 1<=p7] | [3<=p2 & 1<=p8]]] U [[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]]]]]]
normalized: ~ [EG [~ [[[[~ [E [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] U [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]] | EX [[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [p0<=0 | p3<=0]]]] & [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]] & [[[[[[p1<=0 | [p4<=0 | p7<=0]] & [p0<=0 | [p3<=0 | p6<=0]]] & [p2<=0 | [p5<=0 | p8<=0]]] | [[[p2<=2 | p8<=0] & [p1<=2 | p7<=0]] & [p0<=2 | p6<=0]]] | E [true U [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]] & EX [E [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] U ~ [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
.abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
..
EG iterations: 2
-> the formula is FALSE
FORMULA PGCD-COL-D02N100-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.406sec
checking: [E [AF [EX [EF [[[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]] U [[EG [[[~ [AG [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]] | [1<=p0 & 1<=p3]] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]] | [1<=p0 & 1<=p3]] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]] & [AG [AF [[[1<=p0 & 1<=p3] | [[1<=p1 & 1<=p4] | [1<=p2 & 1<=p5]]]]] | [AF [[[[[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]]]] | [[[[[p0<=0 | p3<=0] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]] | [[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]] & [p0<=0 | p3<=0]] & [[p1<=0 | p4<=0] & [p2<=0 | p5<=0]]]]]] & ~ [E [~ [[AX [[[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]]] | [[1<=p2 & [1<=p5 & 1<=p8]] | [[1<=p0 & [1<=p3 & 1<=p6]] | [1<=p1 & [1<=p4 & 1<=p7]]]]]]] U [EX [[[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]]]] | [[[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]]]]]]]]]]]]
normalized: [[[~ [E [~ [[[[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] | [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]] & ~ [EX [~ [[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]] U [[[[[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]] & [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]] | [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] & [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]] & EX [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]] & ~ [EG [~ [[[[[[p2<=0 | p5<=0] & [p1<=0 | p4<=0]] & [[p0<=0 | p3<=0] & [p1<=0 | [p4<=0 | p7<=0]]]] & [[[p0<=0 | [p3<=0 | p6<=0]] & [p2<=0 | [p5<=0 | p8<=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]]]]] | [[[[3<=p2 & 1<=p8] | [3<=p1 & 1<=p7]] | [3<=p0 & 1<=p6]] & [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]]] | ~ [E [true U EG [~ [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]] & E [~ [EG [~ [EX [E [true U [[[1<=p1 & [1<=p4 & 1<=p7]] | [1<=p0 & [1<=p3 & 1<=p6]]] | [1<=p2 & [1<=p5 & 1<=p8]]]]]]]] U [[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [[1<=p0 & 1<=p3] | EG [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [[1<=p0 & 1<=p3] | E [true U ~ [[[[1<=p2 & 1<=p5] | [1<=p1 & 1<=p4]] | [1<=p0 & 1<=p3]]]]]]]]]]]
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
EG iterations: 0
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
..
EG iterations: 1
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
..
EG iterations: 2
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p0<=2)
states: 268,008,838 (8)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p1<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p2<=2)
states: 268,008,838 (8)
abstracting: (p8<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
abstracting: (p6<=0)
states: 90,097,171 (7)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p7<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p3<=0)
states: 90,131,893 (7)
abstracting: (p0<=0)
states: 90,097,171 (7)
abstracting: (p4<=0)
states: 90,131,893 (7)
abstracting: (p1<=0)
states: 90,097,171 (7)
abstracting: (p5<=0)
states: 90,131,893 (7)
abstracting: (p2<=0)
states: 90,097,171 (7)
..
EG iterations: 2
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
.abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (3<=p0)
states: 5,320,158,688 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (3<=p1)
states: 5,320,158,688 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (3<=p2)
states: 5,320,158,688 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
.abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p8)
states: 5,498,070,355 (9)
abstracting: (1<=p5)
states: 5,498,035,633 (9)
abstracting: (1<=p2)
states: 5,498,070,355 (9)
abstracting: (1<=p6)
states: 5,498,070,355 (9)
abstracting: (1<=p3)
states: 5,498,035,633 (9)
abstracting: (1<=p0)
states: 5,498,070,355 (9)
abstracting: (1<=p7)
states: 5,498,070,355 (9)
abstracting: (1<=p4)
states: 5,498,035,633 (9)
abstracting: (1<=p1)
states: 5,498,070,355 (9)
-> the formula is TRUE
FORMULA PGCD-COL-D02N100-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.355sec
totally nodes used: 5217978 (5.2e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 177495349 13956106 191451455
used/not used/entry size/cache size: 15411899 51696965 16 1024MB
basic ops cache: hits/miss/sum: 68660082 6208865 74868947
used/not used/entry size/cache size: 6377291 10399925 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: 1542686 232545 1775231
used/not used/entry size/cache size: 228635 8159973 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 62487266
1 4144991
2 450666
3 22363
4 1716
5 888
6 94
7 12
8 11
9 5
>= 10 852
Total processing time: 2m19.395sec
BK_STOP 1680811082622
--------------------
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:9204 (1022), effective:3130 (347)
initing FirstDep: 0m 0.000sec
iterations count:1508 (167), effective:599 (66)
iterations count:2849 (316), effective:897 (99)
iterations count:1508 (167), effective:599 (66)
iterations count:1508 (167), effective:599 (66)
iterations count:18 (2), effective:3 (0)
iterations count:18 (2), effective:3 (0)
iterations count:9 (1), effective:0 (0)
iterations count:19 (2), effective:4 (0)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:19 (2), effective:4 (0)
iterations count:9 (1), effective:0 (0)
iterations count:5879 (653), effective:2102 (233)
iterations count:9 (1), effective:0 (0)
iterations count:2849 (316), effective:897 (99)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:2849 (316), effective:897 (99)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:9 (1), effective:0 (0)
iterations count:2840 (315), effective:894 (99)
iterations count:18 (2), effective:3 (0)
iterations count:18 (2), effective:3 (0)
iterations count:1508 (167), effective:599 (66)
iterations count:18 (2), effective:3 (0)
iterations count:9 (1), effective:0 (0)
iterations count:18 (2), effective:3 (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-D02N100"
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-D02N100, 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-167987247300394"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PGCD-COL-D02N100.tgz
mv PGCD-COL-D02N100 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 '
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 ;