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.r458-smll-167912649700050.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 SmallOperatingSystem-PT-MT0128DC0064, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r458-smll-167912649700050
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 8.0K Feb 25 12:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 12:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 12:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 12:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 25 12:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 12:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 12:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 8.2K 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 SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-00
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-01
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-02
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-03
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-04
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-05
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-06
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-07
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-08
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-09
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-10
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-11
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-12
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-13
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-14
FORMULA_NAME SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679231650344

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=SmallOperatingSystem-PT-MT0128DC0064
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 13:14:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 13:14:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 13:14:13] [INFO ] Load time of PNML (sax parser for PT used): 38 ms
[2023-03-19 13:14:13] [INFO ] Transformed 9 places.
[2023-03-19 13:14:13] [INFO ] Transformed 8 transitions.
[2023-03-19 13:14:13] [INFO ] Parsed PT model containing 9 places and 8 transitions and 27 arcs in 180 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 17 ms.
Initial state reduction rules removed 1 formulas.
FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 9 out of 9 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 12 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 9 cols
[2023-03-19 13:14:13] [INFO ] Computed 4 place invariants in 6 ms
[2023-03-19 13:14:15] [INFO ] Implicit Places using invariants in 1854 ms returned []
[2023-03-19 13:14:15] [INFO ] Invariant cache hit.
[2023-03-19 13:14:15] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 1945 ms to find 0 implicit places.
[2023-03-19 13:14:15] [INFO ] Invariant cache hit.
[2023-03-19 13:14:15] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2006 ms. Remains : 9/9 places, 8/8 transitions.
Support contains 9 out of 9 places after structural reductions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 29 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 10 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 222 ms. (steps per millisecond=45 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-19 13:14:17] [INFO ] Invariant cache hit.
[2023-03-19 13:14:17] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 2 atomic propositions for a total of 15 simplifications.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 5 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 5 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 6 transition count 7
Applied a total of 3 rules in 12 ms. Remains 6 /9 variables (removed 3) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 6/9 places, 7/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Applied a total of 1 rules in 1 ms. Remains 8 /9 variables (removed 1) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 8/9 places, 8/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 2 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:17] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:18] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 8 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 8 transition count 7
Applied a total of 2 rules in 3 ms. Remains 8 /9 variables (removed 1) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 8/9 places, 7/8 transitions.
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:18] [INFO ] Input system was already deterministic with 7 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 9 /9 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 9/9 places, 8/8 transitions.
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 2 ms
[2023-03-19 13:14:18] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 9/9 places, 8/8 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8 transition count 8
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 7 transition count 7
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 7 transition count 7
Applied a total of 3 rules in 3 ms. Remains 7 /9 variables (removed 2) and now considering 7/8 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 7/9 places, 7/8 transitions.
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 1 ms
[2023-03-19 13:14:18] [INFO ] Input system was already deterministic with 7 transitions.
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 4 ms
[2023-03-19 13:14:18] [INFO ] Flatten gal took : 3 ms
[2023-03-19 13:14:18] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-19 13:14:18] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9 places, 8 transitions and 27 arcs took 0 ms.
Total runtime 4958 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: 8 NrArc: 27)

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

net check time: 0m 0.000sec

init dd package: 0m 3.501sec


RS generation: 0m 0.917sec


-> reachability set: #nodes 4937 (4.9e+03) #states 261,156,753 (8)



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

checking: EG [~ [A [1<=p8 U 1<=p4]]]
normalized: EG [~ [[~ [EG [~ [1<=p4]]] & ~ [E [~ [1<=p4] U [~ [1<=p8] & ~ [1<=p4]]]]]]]

abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
..
EG iterations: 2
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.225sec

checking: A [AX [1<=p4] U EF [~ [EX [1<=p4]]]]
normalized: [~ [EG [~ [E [true U ~ [EX [1<=p4]]]]]] & ~ [E [~ [E [true U ~ [EX [1<=p4]]]] U [EX [~ [1<=p4]] & ~ [E [true U ~ [EX [1<=p4]]]]]]]]

abstracting: (1<=p4)
states: 252,814,848 (8)
.abstracting: (1<=p4)
states: 252,814,848 (8)
.abstracting: (1<=p4)
states: 252,814,848 (8)
.abstracting: (1<=p4)
states: 252,814,848 (8)
..
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.759sec

checking: AX [EG [AF [[p0<=0 | [p1<=0 | p2<=0]]]]]
normalized: ~ [EX [~ [EG [~ [EG [~ [[[p1<=0 | p2<=0] | p0<=0]]]]]]]]

abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
.
EG iterations: 1
..
EG iterations: 2
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.296sec

checking: AG [EF [~ [A [[1<=p0 & [1<=p2 & 1<=p5]] U 1<=p7]]]]
normalized: ~ [E [true U ~ [E [true U ~ [[~ [E [~ [1<=p7] U [~ [[[1<=p2 & 1<=p5] & 1<=p0]] & ~ [1<=p7]]]] & ~ [EG [~ [1<=p7]]]]]]]]]

abstracting: (1<=p7)
states: 252,814,848 (8)
.
EG iterations: 1
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.421sec

checking: [EF [EG [p8<=0]] & [AF [AX [EX [p7<=0]]] & EF [EG [[p5<=0 | p6<=0]]]]]
normalized: [[E [true U EG [[p5<=0 | p6<=0]]] & ~ [EG [EX [~ [EX [p7<=0]]]]]] & E [true U EG [p8<=0]]]

abstracting: (p8<=0)
states: 11,316,305 (7)
..
EG iterations: 2
abstracting: (p7<=0)
states: 8,341,905 (6)
...
EG iterations: 1
abstracting: (p6<=0)
states: 1
abstracting: (p5<=0)
states: 8,341,905 (6)
..
EG iterations: 2
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.696sec

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

abstracting: (p5<=0)
states: 8,341,905 (6)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p0<=0)
states: 0
.
EG iterations: 1
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: EX [E [[1<=p6 & 1<=p5] U A [AF [~ [[1<=p0 & [1<=p2 & 1<=p5]]]] U AF [1<=p4]]]]
normalized: EX [E [[1<=p6 & 1<=p5] U [~ [EG [EG [~ [1<=p4]]]] & ~ [E [EG [~ [1<=p4]] U [EG [[1<=p0 & [1<=p2 & 1<=p5]]] & EG [~ [1<=p4]]]]]]]]

abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
.
EG iterations: 1
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
.
EG iterations: 1
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.061sec

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

abstracting: (p5<=0)
states: 8,341,905 (6)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p0<=0)
states: 0
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 8,341,905 (6)
abstracting: (1<=p7)
states: 252,814,848 (8)
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

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

abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p1)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
..
EG iterations: 2
.-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.863sec

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

abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p4)
states: 252,814,848 (8)
..
EG iterations: 1
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
.abstracting: (1<=p8)
states: 249,840,448 (8)
.abstracting: (1<=p8)
states: 249,840,448 (8)
.
EG iterations: 1
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p1)
states: 252,814,848 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
..
EG iterations: 2
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p4)
states: 252,814,848 (8)
..
EG iterations: 1
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p4)
states: 252,814,848 (8)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.900sec

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

abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..
EG iterations: 2
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p3)
states: 249,840,448 (8)
.abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
.
EG iterations: 1
abstracting: (1<=p3)
states: 249,840,448 (8)
.
EG iterations: 1
abstracting: (1<=p8)
states: 249,840,448 (8)
..
EG iterations: 2
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.365sec

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

abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
.abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
.abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
..
EG iterations: 2
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
.abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
.abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
.abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
..
EG iterations: 2
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
.abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
.abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
..
EG iterations: 2

EG iterations: 0
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
.
EG iterations: 1
abstracting: (1<=p7)
states: 252,814,848 (8)
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.066sec

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

abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
.abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p3)
states: 249,840,448 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
..
EG iterations: 2
abstracting: (p6<=0)
states: 1
abstracting: (p4<=0)
states: 8,341,905 (6)
abstracting: (p8<=0)
states: 11,316,305 (7)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p3)
states: 249,840,448 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
..
EG iterations: 2
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
.abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
..
EG iterations: 2
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.431sec

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

abstracting: (p4<=0)
states: 8,341,905 (6)

EG iterations: 0
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
.
EG iterations: 1
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p1)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p3)
states: 249,840,448 (8)
.
EG iterations: 1
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p3)
states: 249,840,448 (8)
.
EG iterations: 1
abstracting: (1<=p3)
states: 249,840,448 (8)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (p2<=0)
states: 3,113,825 (6)
abstracting: (p1<=0)
states: 8,341,905 (6)
abstracting: (p0<=0)
states: 0
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p1)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
.-> the formula is TRUE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.555sec

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

abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
..................................................................
EG iterations: 66
....
EG iterations: 2
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p1)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p7)
states: 252,814,848 (8)
.abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p1)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p2)
states: 258,042,928 (8)
abstracting: (1<=p1)
states: 252,814,848 (8)
abstracting: (1<=p0)
states: 261,156,753 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
.
EG iterations: 1
abstracting: (1<=p3)
states: 249,840,448 (8)
abstracting: (p4<=0)
states: 8,341,905 (6)
.
EG iterations: 1
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
abstracting: (1<=p8)
states: 249,840,448 (8)
abstracting: (1<=p6)
states: 261,156,752 (8)
abstracting: (1<=p5)
states: 252,814,848 (8)
.abstracting: (1<=p3)
states: 249,840,448 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
abstracting: (1<=p4)
states: 252,814,848 (8)
.abstracting: (1<=p7)
states: 252,814,848 (8)
..abstracting: (1<=p3)
states: 249,840,448 (8)
abstracting: (p4<=0)
states: 8,341,905 (6)
.
EG iterations: 1
abstracting: (1<=p3)
states: 249,840,448 (8)
abstracting: (p4<=0)
states: 8,341,905 (6)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA SmallOperatingSystem-PT-MT0128DC0064-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.719sec

totally nodes used: 796876 (8.0e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 70305873 6017031 76322904
used/not used/entry size/cache size: 2859931 64248933 16 1024MB
basic ops cache: hits/miss/sum: 19365134 792704 20157838
used/not used/entry size/cache size: 1336581 15440635 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: 184037 9373 193410
used/not used/entry size/cache size: 9372 8379236 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 66406774
1 670215
2 25236
3 2884
4 428
5 201
6 212
7 133
8 328
9 134
>= 10 2319

Total processing time: 0m18.521sec


BK_STOP 1679231679869

--------------------
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:2248 (281), effective:576 (72)

initing FirstDep: 0m 0.000sec


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

iterations count:712 (89), effective:256 (32)

iterations count:712 (89), effective:256 (32)

iterations count:712 (89), effective:256 (32)

iterations count:776 (97), effective:192 (24)

iterations count:520 (65), effective:128 (16)

iterations count:139 (17), effective:65 (8)

iterations count:844 (105), effective:257 (32)

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

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

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

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

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

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

iterations count:712 (89), effective:192 (24)

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

iterations count:1037 (129), effective:258 (32)

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

iterations count:1032 (129), effective:320 (40)

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

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

iterations count:398 (49), effective:129 (16)

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

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

iterations count:69 (8), effective:61 (7)

iterations count:24 (3), effective:4 (0)

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

iterations count:968 (121), effective:192 (24)

iterations count:968 (121), effective:192 (24)

iterations count:719 (89), effective:321 (40)

iterations count:968 (121), effective:192 (24)

iterations count:520 (65), effective:128 (16)

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

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

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

iterations count:328 (41), effective:64 (8)

iterations count:72 (9), effective:64 (8)

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

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

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

iterations count:1096 (137), effective:320 (40)

iterations count:197 (24), effective:63 (7)

iterations count:200 (25), effective:64 (8)

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

iterations count:520 (65), effective:128 (16)

iterations count:776 (97), effective:192 (24)

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

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

iterations count:30 (3), effective:8 (1)

iterations count:776 (97), effective:192 (24)

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

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

iterations count:776 (97), effective:192 (24)

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

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

iterations count:17 (2), effective:2 (0)

iterations count:26 (3), effective:6 (0)

iterations count:72 (9), effective:64 (8)

iterations count:17 (2), effective:2 (0)

iterations count:648 (81), effective:192 (24)

iterations count:17 (2), effective:2 (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="SmallOperatingSystem-PT-MT0128DC0064"
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 SmallOperatingSystem-PT-MT0128DC0064, 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 r458-smll-167912649700050"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SmallOperatingSystem-PT-MT0128DC0064.tgz
mv SmallOperatingSystem-PT-MT0128DC0064 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;