About the Execution of Marcie+red for TCPcondis-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 6080.487 | 23032.00 | 26240.00 | 327.90 | FFFTFTTTFTTTFTFT | 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.r490-tall-167912708700498.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 TCPcondis-PT-05, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708700498
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 7.2K Feb 26 16:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 26 16:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Feb 26 16:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 16:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Feb 26 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rwxr-xr-x 1 mcc users 24K Mar 5 18:23 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 TCPcondis-PT-05-CTLFireability-00
FORMULA_NAME TCPcondis-PT-05-CTLFireability-01
FORMULA_NAME TCPcondis-PT-05-CTLFireability-02
FORMULA_NAME TCPcondis-PT-05-CTLFireability-03
FORMULA_NAME TCPcondis-PT-05-CTLFireability-04
FORMULA_NAME TCPcondis-PT-05-CTLFireability-05
FORMULA_NAME TCPcondis-PT-05-CTLFireability-06
FORMULA_NAME TCPcondis-PT-05-CTLFireability-07
FORMULA_NAME TCPcondis-PT-05-CTLFireability-08
FORMULA_NAME TCPcondis-PT-05-CTLFireability-09
FORMULA_NAME TCPcondis-PT-05-CTLFireability-10
FORMULA_NAME TCPcondis-PT-05-CTLFireability-11
FORMULA_NAME TCPcondis-PT-05-CTLFireability-12
FORMULA_NAME TCPcondis-PT-05-CTLFireability-13
FORMULA_NAME TCPcondis-PT-05-CTLFireability-14
FORMULA_NAME TCPcondis-PT-05-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679272944884
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=TCPcondis-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 00:42:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 00:42:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 00:42:26] [WARNING] Skipping unknown tool specific annotation : Tina
[2023-03-20 00:42:26] [WARNING] Unknown XML tag in source file: size
[2023-03-20 00:42:26] [WARNING] Unknown XML tag in source file: color
[2023-03-20 00:42:26] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-20 00:42:26] [INFO ] Transformed 30 places.
[2023-03-20 00:42:26] [INFO ] Transformed 32 transitions.
[2023-03-20 00:42:26] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 30 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2023-03-20 00:42:26] [INFO ] Computed 9 place invariants in 11 ms
[2023-03-20 00:42:26] [INFO ] Implicit Places using invariants in 133 ms returned []
[2023-03-20 00:42:26] [INFO ] Invariant cache hit.
[2023-03-20 00:42:26] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2023-03-20 00:42:26] [INFO ] Invariant cache hit.
[2023-03-20 00:42:26] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 279 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 30 out of 30 places after structural reductions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 18 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 6 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 52) seen :51
Finished Best-First random walk after 204 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=102 )
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 4 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 5 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Applied a total of 7 rules in 8 ms. Remains 27 /30 variables (removed 3) and now considering 28/32 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 27/30 places, 28/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 28 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 31
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 29 transition count 29
Applied a total of 4 rules in 3 ms. Remains 29 /30 variables (removed 1) and now considering 29/32 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 29/30 places, 29/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 29 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 27 transition count 28
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 7 place count 27 transition count 27
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 26 transition count 27
Applied a total of 9 rules in 4 ms. Remains 26 /30 variables (removed 4) and now considering 27/32 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 26/30 places, 27/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 31
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 28 transition count 30
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 28 transition count 30
Applied a total of 4 rules in 2 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 28/30 places, 30/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 30 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 30/30 places, 32/32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 00:42:27] [INFO ] Input system was already deterministic with 32 transitions.
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:42:27] [INFO ] Flatten gal took : 3 ms
[2023-03-20 00:42:27] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 00:42:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 30 places, 32 transitions and 108 arcs took 1 ms.
Total runtime 1195 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: 30 NrTr: 32 NrArc: 108)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.746sec
RS generation: 0m 0.291sec
-> reachability set: #nodes 10669 (1.1e+04) #states 2,985,834 (6)
starting MCC model checker
--------------------------
checking: EX [EF [AG [~ [E [1<=p29 U 1<=p16]]]]]
normalized: EX [E [true U ~ [E [true U E [1<=p29 U 1<=p16]]]]]
abstracting: (1<=p16)
states: 730,255 (5)
abstracting: (1<=p29)
states: 952,817 (5)
.-> the formula is FALSE
FORMULA TCPcondis-PT-05-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.261sec
checking: A [AX [~ [EG [~ [[1<=p5 & 1<=p21]]]]] U [1<=p6 & 1<=p19]]
normalized: [~ [EG [~ [[1<=p6 & 1<=p19]]]] & ~ [E [~ [[1<=p6 & 1<=p19]] U [EX [EG [~ [[1<=p5 & 1<=p21]]]] & ~ [[1<=p6 & 1<=p19]]]]]]
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
.
EG iterations: 1
.abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
.
EG iterations: 1
-> the formula is FALSE
FORMULA TCPcondis-PT-05-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.256sec
checking: [EG [[1<=p15 | p9<=0]] | EF [[EG [[1<=p4 & 1<=p21]] & 1<=p15]]]
normalized: [E [true U [1<=p15 & EG [[1<=p4 & 1<=p21]]]] | EG [[1<=p15 | p9<=0]]]
abstracting: (p9<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
.
EG iterations: 1
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p4)
states: 1,515,785 (6)
.
EG iterations: 1
abstracting: (1<=p15)
states: 952,817 (5)
-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.207sec
checking: EF [[[EX [[1<=p5 & 1<=p17]] & 1<=p12] & [1<=p26 & [p11<=0 | p27<=0]]]]
normalized: E [true U [[1<=p26 & [p11<=0 | p27<=0]] & [1<=p12 & EX [[1<=p5 & 1<=p17]]]]]
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
.abstracting: (1<=p12)
states: 1,089,212 (6)
abstracting: (p27<=0)
states: 1,896,622 (6)
abstracting: (p11<=0)
states: 1,896,622 (6)
abstracting: (1<=p26)
states: 1,089,212 (6)
-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.121sec
checking: AX [EG [E [[E [1<=p1 U [1<=p7 & 1<=p19]] & AG [[1<=p4 & 1<=p21]]] U EF [[1<=p15 | [1<=p6 & 1<=p19]]]]]]
normalized: ~ [EX [~ [EG [E [[~ [E [true U ~ [[1<=p4 & 1<=p21]]]] & E [1<=p1 U [1<=p7 & 1<=p19]]] U E [true U [1<=p15 | [1<=p6 & 1<=p19]]]]]]]]
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p7)
states: 970,162 (5)
abstracting: (1<=p1)
states: 730,255 (5)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p4)
states: 1,515,785 (6)
EG iterations: 0
.-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.301sec
checking: A [[~ [[1<=p5 & 1<=p17]] & 1<=p0] U [1<=p15 & AF [[1<=p29 | [1<=p18 | [1<=p4 & [1<=p18 & 1<=p18]]]]]]]
normalized: [~ [EG [~ [[1<=p15 & ~ [EG [~ [[1<=p29 | [1<=p18 | [1<=p4 & [1<=p18 & 1<=p18]]]]]]]]]]] & ~ [E [~ [[1<=p15 & ~ [EG [~ [[1<=p29 | [1<=p18 | [1<=p4 & [1<=p18 & 1<=p18]]]]]]]]] U [~ [[1<=p0 & ~ [[1<=p5 & 1<=p17]]]] & ~ [[1<=p15 & ~ [EG [~ [[1<=p29 | [1<=p18 | [1<=p4 & [1<=p18 & 1<=p18]]]]]]]]]]]]]
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p29)
states: 952,817 (5)
...................................................................
EG iterations: 67
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p29)
states: 952,817 (5)
...................................................................
EG iterations: 67
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p29)
states: 952,817 (5)
...................................................................
EG iterations: 67
abstracting: (1<=p15)
states: 952,817 (5)
............................................................................................
EG iterations: 92
-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.069sec
checking: A [[AG [E [AX [1<=p9] U AX [1<=p0]]] | EX [~ [A [p15<=0 U [1<=p12 & [1<=p26 & 1<=p14]]]]]] U EG [~ [[[~ [[1<=p5 & 1<=p17]] & AG [1<=p29]] | EF [p29<=0]]]]]
normalized: [~ [EG [~ [EG [~ [[E [true U p29<=0] | [~ [E [true U ~ [1<=p29]]] & ~ [[1<=p5 & 1<=p17]]]]]]]]] & ~ [E [~ [EG [~ [[E [true U p29<=0] | [~ [E [true U ~ [1<=p29]]] & ~ [[1<=p5 & 1<=p17]]]]]]] U [~ [[EX [~ [[~ [EG [~ [[1<=p12 & [1<=p26 & 1<=p14]]]]] & ~ [E [~ [[1<=p12 & [1<=p26 & 1<=p14]]] U [~ [p15<=0] & ~ [[1<=p12 & [1<=p26 & 1<=p14]]]]]]]]] | ~ [E [true U ~ [E [~ [EX [~ [1<=p9]]] U ~ [EX [~ [1<=p0]]]]]]]]] & ~ [EG [~ [[E [true U p29<=0] | [~ [E [true U ~ [1<=p29]]] & ~ [[1<=p5 & 1<=p17]]]]]]]]]]]
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p29)
states: 952,817 (5)
abstracting: (p29<=0)
states: 2,033,017 (6)
.
EG iterations: 1
abstracting: (1<=p0)
states: 952,817 (5)
.abstracting: (1<=p9)
states: 952,817 (5)
.abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
abstracting: (p15<=0)
states: 2,033,017 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
.
EG iterations: 1
.abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p29)
states: 952,817 (5)
abstracting: (p29<=0)
states: 2,033,017 (6)
.
EG iterations: 1
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p29)
states: 952,817 (5)
abstracting: (p29<=0)
states: 2,033,017 (6)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA TCPcondis-PT-05-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.666sec
checking: AF [[~ [A [[[p15<=0 & [1<=p0 & 1<=p0]] | A [[1<=p10 & 1<=p28] U 1<=p0]] U ~ [[1<=p4 & 1<=p22]]]] & [EG [[[p4<=0 | p22<=0] & EX [p9<=0]]] | [1<=p10 & 1<=p24]]]]
normalized: ~ [EG [~ [[~ [[~ [EG [[1<=p4 & 1<=p22]]] & ~ [E [[1<=p4 & 1<=p22] U [~ [[[~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [[1<=p10 & 1<=p28]] & ~ [1<=p0]]]]] | [p15<=0 & [1<=p0 & 1<=p0]]]] & [1<=p4 & 1<=p22]]]]]] & [[1<=p10 & 1<=p24] | EG [[EX [p9<=0] & [p4<=0 | p22<=0]]]]]]]]
abstracting: (p22<=0)
states: 2,015,672 (6)
abstracting: (p4<=0)
states: 1,470,049 (6)
abstracting: (p9<=0)
states: 2,033,017 (6)
....................................................................
EG iterations: 67
abstracting: (1<=p24)
states: 952,817 (5)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (p15<=0)
states: 2,033,017 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p28)
states: 1,171,479 (6)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p0)
states: 952,817 (5)
............................................................................................
EG iterations: 92
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA TCPcondis-PT-05-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.668sec
checking: [EG [AX [[EF [[1<=p14 | [1<=p5 & 1<=p21]]] | AG [[[p5<=0 | p21<=0] & [p7<=0 | p19<=0]]]]]] | [EX [EX [EX [AX [[1<=p8 & 1<=p20]]]]] | AX [AF [[~ [E [1<=p1 U [1<=p4 & 1<=p22]]] & EG [[p13<=0 | p25<=0]]]]]]]
normalized: [[~ [EX [EG [~ [[EG [[p13<=0 | p25<=0]] & ~ [E [1<=p1 U [1<=p4 & 1<=p22]]]]]]]] | EX [EX [EX [~ [EX [~ [[1<=p8 & 1<=p20]]]]]]]] | EG [~ [EX [~ [[~ [E [true U ~ [[[p7<=0 | p19<=0] & [p5<=0 | p21<=0]]]]] | E [true U [1<=p14 | [1<=p5 & 1<=p21]]]]]]]]]
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (p21<=0)
states: 1,669,123 (6)
abstracting: (p5<=0)
states: 1,114,864 (6)
abstracting: (p19<=0)
states: 1,470,049 (6)
abstracting: (p7<=0)
states: 2,015,672 (6)
.
EG iterations: 0
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p8)
states: 1,228,476 (6)
....abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p1)
states: 730,255 (5)
abstracting: (p25<=0)
states: 1,814,355 (6)
abstracting: (p13<=0)
states: 1,814,355 (6)
.............................................................
EG iterations: 61
.
EG iterations: 1
.-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.839sec
checking: EG [[[EF [[1<=p9 & 1<=p25]] | [AG [1<=p3] | EX [[p13<=0 | [p25<=0 | p26<=0]]]]] | [[1<=p29 | p4<=0] | [p22<=0 | EX [[[1<=p14 & [1<=p2 & 1<=p20]] | AG [[1<=p4 & 1<=p21]]]]]]]]
normalized: EG [[[[p22<=0 | EX [[~ [E [true U ~ [[1<=p4 & 1<=p21]]]] | [1<=p14 & [1<=p2 & 1<=p20]]]]] | [1<=p29 | p4<=0]] | [[EX [[p13<=0 | [p25<=0 | p26<=0]]] | ~ [E [true U ~ [1<=p3]]]] | E [true U [1<=p9 & 1<=p25]]]]]
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p3)
states: 859,615 (5)
abstracting: (p26<=0)
states: 1,896,622 (6)
abstracting: (p25<=0)
states: 1,814,355 (6)
abstracting: (p13<=0)
states: 1,814,355 (6)
.abstracting: (p4<=0)
states: 1,470,049 (6)
abstracting: (1<=p29)
states: 952,817 (5)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p2)
states: 1,228,477 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p4)
states: 1,515,785 (6)
.abstracting: (p22<=0)
states: 2,015,672 (6)
EG iterations: 0
-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.151sec
checking: E [EX [~ [[~ [[1<=p7 & 1<=p19]] & [E [[1<=p5 & 1<=p21] U [1<=p11 & 1<=p27]] | [[[1<=p3 & 1<=p19] | [1<=p10 & 1<=p24]] & ~ [[1<=p4 & 1<=p21]]]]]]] U E [EG [[1<=p13 & [1<=p25 & 1<=p26]]] U AX [1<=p1]]]
normalized: E [EX [~ [[[[~ [[1<=p4 & 1<=p21]] & [[1<=p10 & 1<=p24] | [1<=p3 & 1<=p19]]] | E [[1<=p5 & 1<=p21] U [1<=p11 & 1<=p27]]] & ~ [[1<=p7 & 1<=p19]]]]] U E [EG [[1<=p13 & [1<=p25 & 1<=p26]]] U ~ [EX [~ [1<=p1]]]]]
abstracting: (1<=p1)
states: 730,255 (5)
.abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p13)
states: 1,171,479 (6)
.
EG iterations: 1
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p7)
states: 970,162 (5)
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p3)
states: 859,615 (5)
abstracting: (1<=p24)
states: 952,817 (5)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p4)
states: 1,515,785 (6)
.-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.006sec
checking: A [EF [[[1<=p6 & [1<=p19 & 1<=p13]] & [1<=p25 & [EF [[1<=p7 & 1<=p19]] & [AG [[1<=p9 & 1<=p25]] | [[1<=p14 & 1<=p10] & [1<=p11 & 1<=p28]]]]]]] U A [[1<=p13 & [1<=p25 & 1<=p26]] U [1<=p9 & 1<=p25]]]
normalized: [~ [EG [~ [[~ [EG [~ [[1<=p9 & 1<=p25]]]] & ~ [E [~ [[1<=p9 & 1<=p25]] U [~ [[1<=p13 & [1<=p25 & 1<=p26]]] & ~ [[1<=p9 & 1<=p25]]]]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p9 & 1<=p25]]]] & ~ [E [~ [[1<=p9 & 1<=p25]] U [~ [[1<=p13 & [1<=p25 & 1<=p26]]] & ~ [[1<=p9 & 1<=p25]]]]]]] U [~ [E [true U [[1<=p25 & [[[[1<=p11 & 1<=p28] & [1<=p14 & 1<=p10]] | ~ [E [true U ~ [[1<=p9 & 1<=p25]]]]] & E [true U [1<=p7 & 1<=p19]]]] & [1<=p6 & [1<=p19 & 1<=p13]]]]] & ~ [[~ [EG [~ [[1<=p9 & 1<=p25]]]] & ~ [E [~ [[1<=p9 & 1<=p25]] U [~ [[1<=p13 & [1<=p25 & 1<=p26]]] & ~ [[1<=p9 & 1<=p25]]]]]]]]]]]
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p13)
states: 1,171,479 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
.
EG iterations: 1
abstracting: (1<=p13)
states: 1,171,479 (6)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p7)
states: 970,162 (5)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p28)
states: 1,171,479 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p13)
states: 1,171,479 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
.
EG iterations: 1
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p13)
states: 1,171,479 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA TCPcondis-PT-05-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.247sec
checking: AG [[[p5<=0 | p21<=0] | [AF [[p9<=0 | ~ [E [[1<=p13 & [1<=p25 & 1<=p26]] U 1<=p1]]]] | [[[1<=p9 & 1<=p25] & [AF [1<=p14] & [[p10<=0 | p24<=0] & [p10<=0 | p28<=0]]]] | [~ [E [1<=p16 U [1<=p13 & [1<=p25 & 1<=p26]]]] & EG [p14<=0]]]]]]
normalized: ~ [E [true U ~ [[[[[EG [p14<=0] & ~ [E [1<=p16 U [1<=p13 & [1<=p25 & 1<=p26]]]]] | [[[[p10<=0 | p28<=0] & [p10<=0 | p24<=0]] & ~ [EG [~ [1<=p14]]]] & [1<=p9 & 1<=p25]]] | ~ [EG [~ [[p9<=0 | ~ [E [[1<=p13 & [1<=p25 & 1<=p26]] U 1<=p1]]]]]]] | [p5<=0 | p21<=0]]]]]
abstracting: (p21<=0)
states: 1,669,123 (6)
abstracting: (p5<=0)
states: 1,114,864 (6)
abstracting: (1<=p1)
states: 730,255 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p13)
states: 1,171,479 (6)
abstracting: (p9<=0)
states: 2,033,017 (6)
.
EG iterations: 1
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (p10<=0)
states: 1,814,355 (6)
abstracting: (p28<=0)
states: 1,814,355 (6)
abstracting: (p10<=0)
states: 1,814,355 (6)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p13)
states: 1,171,479 (6)
abstracting: (1<=p16)
states: 730,255 (5)
abstracting: (p14<=0)
states: 2,033,017 (6)
..........................................
EG iterations: 42
-> the formula is FALSE
FORMULA TCPcondis-PT-05-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.837sec
checking: [A [~ [[[[~ [[1<=p16 & AG [1<=p3]]] & AG [[1<=p4 & 1<=p21]]] & [1<=p7 & [1<=p19 & AF [[1<=p4 & 1<=p22]]]]] & [[1<=p0 & 1<=p13] & [1<=p25 & [1<=p26 & ~ [EF [[1<=p8 & 1<=p20]]]]]]]] U [A [~ [[~ [[1<=p6 & 1<=p20]] | [1<=p29 & 1<=p0]]] U ~ [A [[1<=p4 & 1<=p18] U 1<=p14]]] | AF [~ [[1<=p5 & [1<=p21 & 1<=p3]]]]]] & EX [EF [AX [E [[1<=p4 & 1<=p22] U [1<=p2 & 1<=p20]]]]]]
normalized: [EX [E [true U ~ [EX [~ [E [[1<=p4 & 1<=p22] U [1<=p2 & 1<=p20]]]]]]] & [~ [EG [~ [[~ [EG [[1<=p5 & [1<=p21 & 1<=p3]]]] | [~ [EG [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]]]] & ~ [E [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]] U [[[1<=p29 & 1<=p0] | ~ [[1<=p6 & 1<=p20]]] & [~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]]]]]]]]]] & ~ [E [~ [[~ [EG [[1<=p5 & [1<=p21 & 1<=p3]]]] | [~ [EG [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]]]] & ~ [E [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]] U [[[1<=p29 & 1<=p0] | ~ [[1<=p6 & 1<=p20]]] & [~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]]]]]]]] U [[[[1<=p25 & [1<=p26 & ~ [E [true U [1<=p8 & 1<=p20]]]]] & [1<=p0 & 1<=p13]] & [[1<=p7 & [1<=p19 & ~ [EG [~ [[1<=p4 & 1<=p22]]]]]] & [~ [E [true U ~ [[1<=p4 & 1<=p21]]]] & ~ [[1<=p16 & ~ [E [true U ~ [1<=p3]]]]]]]] & ~ [[~ [EG [[1<=p5 & [1<=p21 & 1<=p3]]]] | [~ [EG [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]]]] & ~ [E [[~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]] U [[[1<=p29 & 1<=p0] | ~ [[1<=p6 & 1<=p20]]] & [~ [EG [~ [1<=p14]]] & ~ [E [~ [1<=p14] U [~ [[1<=p4 & 1<=p18]] & ~ [1<=p14]]]]]]]]]]]]]]]]
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p29)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
.
EG iterations: 1
abstracting: (1<=p3)
states: 859,615 (5)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
.
EG iterations: 1
abstracting: (1<=p3)
states: 859,615 (5)
abstracting: (1<=p16)
states: 730,255 (5)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
...................................................................
EG iterations: 67
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p7)
states: 970,162 (5)
abstracting: (1<=p13)
states: 1,171,479 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p8)
states: 1,228,476 (6)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p29)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
.
EG iterations: 1
abstracting: (1<=p3)
states: 859,615 (5)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
.
EG iterations: 1
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p29)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p14)
states: 952,817 (5)
abstracting: (1<=p14)
states: 952,817 (5)
..........................................
EG iterations: 42
.
EG iterations: 1
abstracting: (1<=p3)
states: 859,615 (5)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p2)
states: 1,228,477 (6)
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
..-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.343sec
checking: [EF [[EG [[1<=p9 & 1<=p25]] & [[1<=p10 & 1<=p24] | [[[[p4<=0 | p18<=0] & [p10<=0 | p28<=0]] | 1<=p15] & [~ [A [[1<=p6 & 1<=p19] U [1<=p10 & 1<=p24]]] | ~ [E [1<=p0 U [1<=p4 & 1<=p22]]]]]]]] & EF [[[[1<=p3 & 1<=p19] | [EF [EG [1<=p3]] & EF [p16<=0]]] | [p11<=0 | [p27<=0 | [[p9<=0 | p25<=0] & [[p5<=0 | p21<=0] | [p4<=0 | p18<=0]]]]]]]]
normalized: [E [true U [[p11<=0 | [p27<=0 | [[[p4<=0 | p18<=0] | [p5<=0 | p21<=0]] & [p9<=0 | p25<=0]]]] | [[E [true U p16<=0] & E [true U EG [1<=p3]]] | [1<=p3 & 1<=p19]]]] & E [true U [[[[~ [E [1<=p0 U [1<=p4 & 1<=p22]]] | ~ [[~ [EG [~ [[1<=p10 & 1<=p24]]]] & ~ [E [~ [[1<=p10 & 1<=p24]] U [~ [[1<=p6 & 1<=p19]] & ~ [[1<=p10 & 1<=p24]]]]]]]] & [1<=p15 | [[p10<=0 | p28<=0] & [p4<=0 | p18<=0]]]] | [1<=p10 & 1<=p24]] & EG [[1<=p9 & 1<=p25]]]]]
abstracting: (1<=p25)
states: 1,171,479 (6)
abstracting: (1<=p9)
states: 952,817 (5)
.
EG iterations: 1
abstracting: (1<=p24)
states: 952,817 (5)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (p18<=0)
states: 2,126,219 (6)
abstracting: (p4<=0)
states: 1,470,049 (6)
abstracting: (p28<=0)
states: 1,814,355 (6)
abstracting: (p10<=0)
states: 1,814,355 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p24)
states: 952,817 (5)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p24)
states: 952,817 (5)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (1<=p24)
states: 952,817 (5)
abstracting: (1<=p10)
states: 1,171,479 (6)
.
EG iterations: 1
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p3)
states: 859,615 (5)
abstracting: (1<=p3)
states: 859,615 (5)
.
EG iterations: 1
abstracting: (p16<=0)
states: 2,255,579 (6)
abstracting: (p25<=0)
states: 1,814,355 (6)
abstracting: (p9<=0)
states: 2,033,017 (6)
abstracting: (p21<=0)
states: 1,669,123 (6)
abstracting: (p5<=0)
states: 1,114,864 (6)
abstracting: (p18<=0)
states: 2,126,219 (6)
abstracting: (p4<=0)
states: 1,470,049 (6)
abstracting: (p27<=0)
states: 1,896,622 (6)
abstracting: (p11<=0)
states: 1,896,622 (6)
-> the formula is TRUE
FORMULA TCPcondis-PT-05-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.391sec
checking: A [AF [[AF [[[1<=p10 & [1<=p11 & 1<=p28]] | [1<=p3 & 1<=p19]]] | [1<=p24 | [1<=p0 & AF [[1<=p11 & 1<=p27]]]]]] U [A [E [[1<=p5 & 1<=p23] U [[1<=p11 & 1<=p27] & [1<=p2 & 1<=p20]]] U [[p24<=0 | ~ [[1<=p5 & 1<=p17]]] & [p16<=0 & [1<=p18 | 1<=p15]]]] & [A [A [[1<=p4 & 1<=p22] U [[1<=p6 & 1<=p20] | [1<=p5 & 1<=p21]]] U [~ [EF [1<=p0]] & AF [[1<=p12 & 1<=p26]]]] & ~ [AF [~ [[1<=p1 | [[1<=p11 & 1<=p27] | ~ [[1<=p5 & 1<=p23]]]]]]]]]]
normalized: [~ [EG [~ [[[EG [[1<=p1 | [~ [[1<=p5 & 1<=p23]] | [1<=p11 & 1<=p27]]]] & [~ [EG [~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]] U [~ [[~ [EG [~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]]]] & ~ [E [~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]] U [~ [[1<=p4 & 1<=p22]] & ~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]]]]]]] & ~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]]]]]]] & [~ [EG [~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]]]] & ~ [E [~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]] U [~ [E [[1<=p5 & 1<=p23] U [[1<=p2 & 1<=p20] & [1<=p11 & 1<=p27]]]] & ~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]]]]]]]]]] & ~ [E [~ [[[EG [[1<=p1 | [~ [[1<=p5 & 1<=p23]] | [1<=p11 & 1<=p27]]]] & [~ [EG [~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]] U [~ [[~ [EG [~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]]]] & ~ [E [~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]] U [~ [[1<=p4 & 1<=p22]] & ~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]]]]]]] & ~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]]]]]]] & [~ [EG [~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]]]] & ~ [E [~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]] U [~ [E [[1<=p5 & 1<=p23] U [[1<=p2 & 1<=p20] & [1<=p11 & 1<=p27]]]] & ~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]]]]]]]] U [EG [~ [[[1<=p24 | [1<=p0 & ~ [EG [~ [[1<=p11 & 1<=p27]]]]]] | ~ [EG [~ [[[1<=p3 & 1<=p19] | [1<=p10 & [1<=p11 & 1<=p28]]]]]]]]] & ~ [[[EG [[1<=p1 | [~ [[1<=p5 & 1<=p23]] | [1<=p11 & 1<=p27]]]] & [~ [EG [~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]]]] & ~ [E [~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]] U [~ [[~ [EG [~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]]]] & ~ [E [~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]] U [~ [[1<=p4 & 1<=p22]] & ~ [[[1<=p5 & 1<=p21] | [1<=p6 & 1<=p20]]]]]]]] & ~ [[~ [EG [~ [[1<=p12 & 1<=p26]]]] & ~ [E [true U 1<=p0]]]]]]]]] & [~ [EG [~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]]]] & ~ [E [~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]] U [~ [E [[1<=p5 & 1<=p23] U [[1<=p2 & 1<=p20] & [1<=p11 & 1<=p27]]]] & ~ [[[p16<=0 & [1<=p18 | 1<=p15]] & [p24<=0 | ~ [[1<=p5 & 1<=p17]]]]]]]]]]]]]]]
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p2)
states: 1,228,477 (6)
abstracting: (1<=p23)
states: 1,228,476 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
...............................................
EG iterations: 47
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
........................................................................
EG iterations: 72
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
EG iterations: 0
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p23)
states: 1,228,476 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p1)
states: 730,255 (5)
...............
EG iterations: 15
abstracting: (1<=p28)
states: 1,171,479 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p10)
states: 1,171,479 (6)
abstracting: (1<=p19)
states: 1,515,785 (6)
abstracting: (1<=p3)
states: 859,615 (5)
..........................................................
EG iterations: 58
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p24)
states: 952,817 (5)
.
EG iterations: 1
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p2)
states: 1,228,477 (6)
abstracting: (1<=p23)
states: 1,228,476 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
...............................................
EG iterations: 47
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
........................................................................
EG iterations: 72
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
EG iterations: 0
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p23)
states: 1,228,476 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p1)
states: 730,255 (5)
...............
EG iterations: 15
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p2)
states: 1,228,477 (6)
abstracting: (1<=p23)
states: 1,228,476 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
abstracting: (1<=p17)
states: 1,228,477 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (p24<=0)
states: 2,033,017 (6)
abstracting: (1<=p15)
states: 952,817 (5)
abstracting: (1<=p18)
states: 859,615 (5)
abstracting: (p16<=0)
states: 2,255,579 (6)
...............................................
EG iterations: 47
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p22)
states: 970,162 (5)
abstracting: (1<=p4)
states: 1,515,785 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p20)
states: 1,870,970 (6)
abstracting: (1<=p6)
states: 1,316,711 (6)
abstracting: (1<=p21)
states: 1,316,711 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
........................................................................
EG iterations: 72
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
abstracting: (1<=p0)
states: 952,817 (5)
abstracting: (1<=p26)
states: 1,089,212 (6)
abstracting: (1<=p12)
states: 1,089,212 (6)
..........................................................
EG iterations: 58
EG iterations: 0
abstracting: (1<=p27)
states: 1,089,212 (6)
abstracting: (1<=p11)
states: 1,089,212 (6)
abstracting: (1<=p23)
states: 1,228,476 (6)
abstracting: (1<=p5)
states: 1,870,970 (6)
abstracting: (1<=p1)
states: 730,255 (5)
...............
EG iterations: 15
EG iterations: 0
-> the formula is FALSE
FORMULA TCPcondis-PT-05-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 3.693sec
totally nodes used: 6339662 (6.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 24066451 22283126 46349577
used/not used/entry size/cache size: 22851796 44257068 16 1024MB
basic ops cache: hits/miss/sum: 4220901 4234568 8455469
used/not used/entry size/cache size: 5576310 11200906 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: 122238 132958 255196
used/not used/entry size/cache size: 131932 8256676 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 61566537
1 5034288
2 410177
3 54338
4 16797
5 7366
6 4955
7 2968
8 2386
9 1608
>= 10 7444
Total processing time: 0m19.464sec
BK_STOP 1679272967916
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok
initing FirstDep: 0m 0.000sec
iterations count:3028 (94), effective:408 (12)
initing FirstDep: 0m 0.000sec
iterations count:555 (17), effective:71 (2)
iterations count:321 (10), effective:38 (1)
iterations count:117 (3), effective:13 (0)
iterations count:967 (30), effective:134 (4)
iterations count:1209 (37), effective:170 (5)
iterations count:482 (15), effective:63 (1)
iterations count:383 (11), effective:44 (1)
iterations count:82 (2), effective:5 (0)
iterations count:32 (1), effective:0 (0)
iterations count:170 (5), effective:13 (0)
iterations count:112 (3), effective:5 (0)
iterations count:112 (3), effective:5 (0)
iterations count:640 (20), effective:79 (2)
iterations count:118 (3), effective:10 (0)
iterations count:608 (19), effective:82 (2)
iterations count:112 (3), effective:5 (0)
iterations count:112 (3), effective:5 (0)
iterations count:3072 (96), effective:419 (13)
iterations count:112 (3), effective:5 (0)
iterations count:112 (3), effective:5 (0)
iterations count:216 (6), effective:18 (0)
iterations count:100 (3), effective:4 (0)
iterations count:350 (10), effective:36 (1)
iterations count:338 (10), effective:37 (1)
iterations count:72 (2), effective:6 (0)
iterations count:636 (19), effective:78 (2)
iterations count:62 (1), effective:5 (0)
iterations count:82 (2), effective:5 (0)
iterations count:1410 (44), effective:178 (5)
iterations count:475 (14), effective:65 (2)
iterations count:1703 (53), effective:229 (7)
iterations count:150 (4), effective:9 (0)
iterations count:373 (11), effective:43 (1)
iterations count:47 (1), effective:5 (0)
iterations count:2504 (78), effective:342 (10)
iterations count:150 (4), effective:9 (0)
iterations count:150 (4), effective:9 (0)
iterations count:544 (17), effective:66 (2)
iterations count:847 (26), effective:123 (3)
iterations count:1718 (53), effective:220 (6)
iterations count:132 (4), effective:9 (0)
iterations count:132 (4), effective:9 (0)
iterations count:74 (2), effective:13 (0)
iterations count:132 (4), effective:9 (0)
iterations count:62 (1), effective:5 (0)
iterations count:82 (2), effective:5 (0)
iterations count:601 (18), effective:76 (2)
iterations count:132 (4), effective:9 (0)
iterations count:132 (4), effective:9 (0)
iterations count:74 (2), effective:13 (0)
iterations count:132 (4), effective:9 (0)
iterations count:132 (4), effective:9 (0)
iterations count:132 (4), effective:9 (0)
iterations count:74 (2), effective:13 (0)
iterations count:132 (4), effective:9 (0)
iterations count:570 (17), effective:76 (2)
iterations count:652 (20), effective:92 (2)
iterations count:135 (4), effective:18 (0)
iterations count:304 (9), effective:38 (1)
iterations count:839 (26), effective:96 (3)
iterations count:532 (16), effective:73 (2)
iterations count:37 (1), effective:5 (0)
iterations count:32 (1), effective:0 (0)
iterations count:1037 (32), effective:139 (4)
iterations count:996 (31), effective:125 (3)
iterations count:253 (7), effective:28 (0)
iterations count:216 (6), effective:29 (0)
iterations count:253 (7), effective:28 (0)
iterations count:236 (7), effective:35 (1)
iterations count:253 (7), effective:28 (0)
iterations count:1037 (32), effective:139 (4)
iterations count:996 (31), effective:125 (3)
iterations count:253 (7), effective:28 (0)
iterations count:216 (6), effective:29 (0)
iterations count:253 (7), effective:28 (0)
iterations count:236 (7), effective:35 (1)
iterations count:253 (7), effective:28 (0)
iterations count:876 (27), effective:118 (3)
iterations count:1037 (32), effective:139 (4)
iterations count:996 (31), effective:125 (3)
iterations count:253 (7), effective:28 (0)
iterations count:216 (6), effective:29 (0)
iterations count:253 (7), effective:28 (0)
iterations count:236 (7), effective:35 (1)
iterations count:253 (7), effective:28 (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="TCPcondis-PT-05"
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 TCPcondis-PT-05, 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 r490-tall-167912708700498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/TCPcondis-PT-05.tgz
mv TCPcondis-PT-05 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 ;