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.r394-oct2-167903717400002.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldIIPs-PT-001A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717400002
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 16:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 9.0K 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 ShieldIIPs-PT-001A-CTLFireability-00
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-01
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-02
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-03
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-04
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-05
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-06
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-07
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-08
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-09
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-10
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-11
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-12
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-13
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-14
FORMULA_NAME ShieldIIPs-PT-001A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679484457987

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=ShieldIIPs-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 11:27:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 11:27:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 11:27:40] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-22 11:27:40] [INFO ] Transformed 28 places.
[2023-03-22 11:27:40] [INFO ] Transformed 27 transitions.
[2023-03-22 11:27:40] [INFO ] Found NUPN structural information;
[2023-03-22 11:27:40] [INFO ] Parsed PT model containing 28 places and 27 transitions and 114 arcs in 150 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Support contains 27 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 10 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
// Phase 1: matrix 27 rows 28 cols
[2023-03-22 11:27:40] [INFO ] Computed 10 place invariants in 19 ms
[2023-03-22 11:27:40] [INFO ] Implicit Places using invariants in 308 ms returned []
[2023-03-22 11:27:40] [INFO ] Invariant cache hit.
[2023-03-22 11:27:41] [INFO ] Implicit Places using invariants and state equation in 241 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2023-03-22 11:27:41] [INFO ] Invariant cache hit.
[2023-03-22 11:27:41] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 928 ms. Remains : 28/28 places, 27/27 transitions.
Support contains 27 out of 28 places after structural reductions.
[2023-03-22 11:27:41] [INFO ] Flatten gal took : 25 ms
[2023-03-22 11:27:41] [INFO ] Flatten gal took : 7 ms
[2023-03-22 11:27:41] [INFO ] Input system was already deterministic with 27 transitions.
Incomplete random walk after 10000 steps, including 30 resets, run finished after 294 ms. (steps per millisecond=34 ) properties (out of 44) seen :41
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-22 11:27:42] [INFO ] Invariant cache hit.
[2023-03-22 11:27:42] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-22 11:27:42] [INFO ] [Nat]Absence check using 10 positive place invariants in 16 ms returned sat
[2023-03-22 11:27:42] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 3 atomic propositions for a total of 16 simplifications.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 8 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 5 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 3 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 7 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 2 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 1 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 0 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 27/27 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 27/27 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 28/28 places, 27/27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Input system was already deterministic with 27 transitions.
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 11:27:42] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 11:27:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 28 places, 27 transitions and 114 arcs took 0 ms.
Total runtime 2466 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: 28 NrTr: 27 NrArc: 114)

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

net check time: 0m 0.000sec

init dd package: 0m 3.048sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 505 (5.0e+02) #states 9,143 (3)



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

checking: EX [AG [EF [AX [[[p8<=1 & 1<=p8] & [p23<=1 & 1<=p23]]]]]]
normalized: EX [~ [E [true U ~ [E [true U ~ [EX [~ [[[p8<=1 & 1<=p8] & [p23<=1 & 1<=p23]]]]]]]]]]

abstracting: (1<=p23)
states: 2,302 (3)
abstracting: (p23<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
..-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EX [AG [EF [EG [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]]]]]
normalized: EX [~ [E [true U ~ [E [true U EG [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 3,640 (3)
abstracting: (p7<=1)
states: 9,143 (3)
abstracting: (1<=p9)
states: 3,628 (3)
abstracting: (p9<=1)
states: 9,143 (3)
...................................
EG iterations: 35
.-> the formula is FALSE

FORMULA ShieldIIPs-PT-001A-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: E [~ [[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]]] U AX [[p16<=1 & 1<=p16]]]
normalized: E [~ [[[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]] U ~ [EX [~ [[p16<=1 & 1<=p16]]]]]

abstracting: (1<=p16)
states: 2,170 (3)
abstracting: (p16<=1)
states: 9,143 (3)
.abstracting: (1<=p7)
states: 3,640 (3)
abstracting: (p7<=1)
states: 9,143 (3)
abstracting: (1<=p9)
states: 3,628 (3)
abstracting: (p9<=1)
states: 9,143 (3)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [EG [[EX [AX [[[p6<=1 & 1<=p6] & [p17<=1 & 1<=p17]]]] & AX [AF [[[p5<=1 & 1<=p5] & [p18<=1 & 1<=p18]]]]]]]
normalized: E [true U EG [[~ [EX [EG [~ [[[p18<=1 & 1<=p18] & [p5<=1 & 1<=p5]]]]]] & EX [~ [EX [~ [[[p17<=1 & 1<=p17] & [p6<=1 & 1<=p6]]]]]]]]]

abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (p17<=1)
states: 9,143 (3)
..abstracting: (1<=p5)
states: 1,836 (3)
abstracting: (p5<=1)
states: 9,143 (3)
abstracting: (1<=p18)
states: 4,674 (3)
abstracting: (p18<=1)
states: 9,143 (3)
......................................
EG iterations: 38
....
EG iterations: 3
-> the formula is FALSE

FORMULA ShieldIIPs-PT-001A-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.055sec

checking: A [[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] U ~ [AX [EF [AG [[[p6<=1 & 1<=p6] & [p17<=1 & 1<=p17]]]]]]]
normalized: [~ [EG [~ [EX [~ [E [true U ~ [E [true U ~ [[[p17<=1 & 1<=p17] & [p6<=1 & 1<=p6]]]]]]]]]]] & ~ [E [~ [EX [~ [E [true U ~ [E [true U ~ [[[p17<=1 & 1<=p17] & [p6<=1 & 1<=p6]]]]]]]]] U [~ [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]] & ~ [EX [~ [E [true U ~ [E [true U ~ [[[p17<=1 & 1<=p17] & [p6<=1 & 1<=p6]]]]]]]]]]]]]

abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (p17<=1)
states: 9,143 (3)
.abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p2<=1)
states: 9,143 (3)
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (p10<=1)
states: 9,143 (3)
abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (p17<=1)
states: 9,143 (3)
.abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (p17<=1)
states: 9,143 (3)
..
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [EG [[EX [[[p13<=1 & 1<=p13] & [[p21<=1 & 1<=p21] & [p27<=1 & 1<=p27]]]] & AG [[[p8<=0 & 0<=p8] | [p23<=0 & 0<=p23]]]]]]
normalized: E [true U EG [[~ [E [true U ~ [[[p23<=0 & 0<=p23] | [p8<=0 & 0<=p8]]]]] & EX [[[[p27<=1 & 1<=p27] & [p21<=1 & 1<=p21]] & [p13<=1 & 1<=p13]]]]]]

abstracting: (1<=p13)
states: 4,571 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p21<=1)
states: 9,143 (3)
abstracting: (1<=p27)
states: 2,348 (3)
abstracting: (p27<=1)
states: 9,143 (3)
.abstracting: (0<=p8)
states: 9,143 (3)
abstracting: (p8<=0)
states: 5,465 (3)
abstracting: (0<=p23)
states: 9,143 (3)
abstracting: (p23<=0)
states: 6,841 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPs-PT-001A-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: ~ [E [AG [~ [AX [[[[p13<=1 & 1<=p13] & [p21<=1 & 1<=p21]] & [[p27<=1 & 1<=p27] & [[p5<=1 & 1<=p5] & [p18<=1 & 1<=p18]]]]]]] U [p21<=1 & 1<=p21]]]
normalized: ~ [E [~ [E [true U ~ [EX [~ [[[[[p18<=1 & 1<=p18] & [p5<=1 & 1<=p5]] & [p27<=1 & 1<=p27]] & [[p21<=1 & 1<=p21] & [p13<=1 & 1<=p13]]]]]]]] U [p21<=1 & 1<=p21]]]

abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p21<=1)
states: 9,143 (3)
abstracting: (1<=p13)
states: 4,571 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p21<=1)
states: 9,143 (3)
abstracting: (1<=p27)
states: 2,348 (3)
abstracting: (p27<=1)
states: 9,143 (3)
abstracting: (1<=p5)
states: 1,836 (3)
abstracting: (p5<=1)
states: 9,143 (3)
abstracting: (1<=p18)
states: 4,674 (3)
abstracting: (p18<=1)
states: 9,143 (3)
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EX [[EG [[EG [[[p13<=0 & 0<=p13] | [[p21<=0 & 0<=p21] | [p27<=0 & 0<=p27]]]] & [[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]]] | [p22<=0 & 0<=p22]]]
normalized: EX [[[p22<=0 & 0<=p22] | EG [[[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] & EG [[[[p27<=0 & 0<=p27] | [p21<=0 & 0<=p21]] | [p13<=0 & 0<=p13]]]]]]]

abstracting: (0<=p13)
states: 9,143 (3)
abstracting: (p13<=0)
states: 4,572 (3)
abstracting: (0<=p21)
states: 9,143 (3)
abstracting: (p21<=0)
states: 6,917 (3)
abstracting: (0<=p27)
states: 9,143 (3)
abstracting: (p27<=0)
states: 6,795 (3)
.
EG iterations: 1
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p2<=1)
states: 9,143 (3)
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (p10<=1)
states: 9,143 (3)
............................
EG iterations: 28
abstracting: (0<=p22)
states: 9,143 (3)
abstracting: (p22<=0)
states: 7,005 (3)
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [EX [EF [[[EX [[p16<=1 & 1<=p16]] & [p4<=1 & 1<=p4]] & [[p19<=1 & 1<=p19] & [[[p3<=1 & 1<=p3] & [p24<=1 & 1<=p24]] | [[p13<=1 & 1<=p13] & [[p21<=1 & 1<=p21] & [p25<=1 & 1<=p25]]]]]]]]]
normalized: E [true U EX [E [true U [[[[[[p25<=1 & 1<=p25] & [p21<=1 & 1<=p21]] & [p13<=1 & 1<=p13]] | [[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]]] & [p19<=1 & 1<=p19]] & [[p4<=1 & 1<=p4] & EX [[p16<=1 & 1<=p16]]]]]]]

abstracting: (1<=p16)
states: 2,170 (3)
abstracting: (p16<=1)
states: 9,143 (3)
.abstracting: (1<=p4)
states: 4,674 (3)
abstracting: (p4<=1)
states: 9,143 (3)
abstracting: (1<=p19)
states: 4,468 (3)
abstracting: (p19<=1)
states: 9,143 (3)
abstracting: (1<=p3)
states: 4,468 (3)
abstracting: (p3<=1)
states: 9,143 (3)
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p24<=1)
states: 9,143 (3)
abstracting: (1<=p13)
states: 4,571 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p21<=1)
states: 9,143 (3)
abstracting: (1<=p25)
states: 2,210 (3)
abstracting: (p25<=1)
states: 9,143 (3)
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: [EG [[~ [A [[[p6<=1 & 1<=p6] & [p16<=1 & 1<=p16]] U EG [[p0<=1 & 1<=p0]]]] | EX [AX [[p21<=0 & 0<=p21]]]]] & EF [[[p25<=0 & 0<=p25] & AF [[[p13<=1 & 1<=p13] & [[p21<=1 & 1<=p21] & [p25<=1 & 1<=p25]]]]]]]
normalized: [E [true U [~ [EG [~ [[[[p25<=1 & 1<=p25] & [p21<=1 & 1<=p21]] & [p13<=1 & 1<=p13]]]]] & [p25<=0 & 0<=p25]]] & EG [[EX [~ [EX [~ [[p21<=0 & 0<=p21]]]]] | ~ [[~ [EG [~ [EG [[p0<=1 & 1<=p0]]]]] & ~ [E [~ [EG [[p0<=1 & 1<=p0]]] U [~ [[[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]]] & ~ [EG [[p0<=1 & 1<=p0]]]]]]]]]]]

abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 9,143 (3)
..
EG iterations: 2
abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p16)
states: 2,170 (3)
abstracting: (p16<=1)
states: 9,143 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 9,143 (3)
..
EG iterations: 2
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 9,143 (3)
..
EG iterations: 2

EG iterations: 0
abstracting: (0<=p21)
states: 9,143 (3)
abstracting: (p21<=0)
states: 6,917 (3)
..
EG iterations: 0
abstracting: (0<=p25)
states: 9,143 (3)
abstracting: (p25<=0)
states: 6,933 (3)
abstracting: (1<=p13)
states: 4,571 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p21<=1)
states: 9,143 (3)
abstracting: (1<=p25)
states: 2,210 (3)
abstracting: (p25<=1)
states: 9,143 (3)
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldIIPs-PT-001A-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AF [[[0<=p11 & p11<=0] | [[p15<=0 & 0<=p15] | [p27<=0 & 0<=p27]]]] & AG [EF [[EX [[[p6<=1 & 1<=p6] & [p16<=1 & 1<=p16]]] | [[[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]] | [[p4<=1 & 1<=p4] & [p19<=1 & 1<=p19]]]]]]]
normalized: [~ [E [true U ~ [E [true U [[[[p19<=1 & 1<=p19] & [p4<=1 & 1<=p4]] | [[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]]] | EX [[[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]]]]]]]] & ~ [EG [~ [[[[p27<=0 & 0<=p27] | [p15<=0 & 0<=p15]] | [0<=p11 & p11<=0]]]]]]

abstracting: (p11<=0)
states: 4,485 (3)
abstracting: (0<=p11)
states: 9,143 (3)
abstracting: (0<=p15)
states: 9,143 (3)
abstracting: (p15<=0)
states: 6,899 (3)
abstracting: (0<=p27)
states: 9,143 (3)
abstracting: (p27<=0)
states: 6,795 (3)
...........
EG iterations: 11
abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p16)
states: 2,170 (3)
abstracting: (p16<=1)
states: 9,143 (3)
.abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (p10<=1)
states: 9,143 (3)
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p2<=1)
states: 9,143 (3)
abstracting: (1<=p4)
states: 4,674 (3)
abstracting: (p4<=1)
states: 9,143 (3)
abstracting: (1<=p19)
states: 4,468 (3)
abstracting: (p19<=1)
states: 9,143 (3)
-> the formula is FALSE

FORMULA ShieldIIPs-PT-001A-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EX [[EG [EF [[p15<=0 & 0<=p15]]] & [AG [[[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] | AX [[[p8<=0 & 0<=p8] | [p22<=0 & 0<=p22]]]]] | EG [[[[p12<=0 & 0<=p12] & [p25<=0 & 0<=p25]] & [[p25<=0 & 0<=p25] & [[p11<=0 & 0<=p11] | [[p15<=0 & 0<=p15] | [p27<=0 & 0<=p27]]]]]]]]]
normalized: EX [[[EG [[[[[[p27<=0 & 0<=p27] | [p15<=0 & 0<=p15]] | [p11<=0 & 0<=p11]] & [p25<=0 & 0<=p25]] & [[p25<=0 & 0<=p25] & [p12<=0 & 0<=p12]]]] | ~ [E [true U ~ [[~ [EX [~ [[[p22<=0 & 0<=p22] | [p8<=0 & 0<=p8]]]]] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]] & EG [E [true U [p15<=0 & 0<=p15]]]]]

abstracting: (0<=p15)
states: 9,143 (3)
abstracting: (p15<=0)
states: 6,899 (3)

EG iterations: 0
abstracting: (1<=p7)
states: 3,640 (3)
abstracting: (p7<=1)
states: 9,143 (3)
abstracting: (1<=p9)
states: 3,628 (3)
abstracting: (p9<=1)
states: 9,143 (3)
abstracting: (0<=p8)
states: 9,143 (3)
abstracting: (p8<=0)
states: 5,465 (3)
abstracting: (0<=p22)
states: 9,143 (3)
abstracting: (p22<=0)
states: 7,005 (3)
.abstracting: (0<=p12)
states: 9,143 (3)
abstracting: (p12<=0)
states: 4,572 (3)
abstracting: (0<=p25)
states: 9,143 (3)
abstracting: (p25<=0)
states: 6,933 (3)
abstracting: (0<=p25)
states: 9,143 (3)
abstracting: (p25<=0)
states: 6,933 (3)
abstracting: (0<=p11)
states: 9,143 (3)
abstracting: (p11<=0)
states: 4,485 (3)
abstracting: (0<=p15)
states: 9,143 (3)
abstracting: (p15<=0)
states: 6,899 (3)
abstracting: (0<=p27)
states: 9,143 (3)
abstracting: (p27<=0)
states: 6,795 (3)
.........................................
EG iterations: 41
.-> the formula is FALSE

FORMULA ShieldIIPs-PT-001A-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.040sec

checking: A [[~ [EX [EX [[[p11<=1 & 1<=p11] & [[p15<=1 & 1<=p15] & [p26<=1 & 1<=p26]]]]]] | [~ [AX [A [[[p11<=1 & 1<=p11] & [[p17<=1 & 1<=p17] & [p27<=1 & 1<=p27]]] U [[p3<=1 & 1<=p3] & [p24<=1 & 1<=p24]]]]] | [[p1<=1 & 1<=p1] & [p20<=1 & 1<=p20]]]] U AG [[AG [EF [[[p8<=1 & 1<=p8] & [p22<=1 & 1<=p22]]]] | [[p8<=1 & 1<=p8] & [p22<=1 & 1<=p22]]]]]
normalized: [~ [EG [E [true U ~ [[[[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]] | ~ [E [true U ~ [E [true U [[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]]]]]]]]]]] & ~ [E [E [true U ~ [[[[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]] | ~ [E [true U ~ [E [true U [[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]]]]]]]]] U [~ [[[[[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]] | EX [~ [[~ [EG [~ [[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]]] U [~ [[[[p27<=1 & 1<=p27] & [p17<=1 & 1<=p17]] & [p11<=1 & 1<=p11]]] & ~ [[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]]]]]]]]]] | ~ [EX [EX [[[[p26<=1 & 1<=p26] & [p15<=1 & 1<=p15]] & [p11<=1 & 1<=p11]]]]]]] & E [true U ~ [[[[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]] | ~ [E [true U ~ [E [true U [[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]]]]]]]]]]]]]

abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
abstracting: (1<=p11)
states: 4,658 (3)
abstracting: (p11<=1)
states: 9,143 (3)
abstracting: (1<=p15)
states: 2,244 (3)
abstracting: (p15<=1)
states: 9,143 (3)
abstracting: (1<=p26)
states: 2,072 (3)
abstracting: (p26<=1)
states: 9,143 (3)
..abstracting: (1<=p3)
states: 4,468 (3)
abstracting: (p3<=1)
states: 9,143 (3)
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p24<=1)
states: 9,143 (3)
abstracting: (1<=p11)
states: 4,658 (3)
abstracting: (p11<=1)
states: 9,143 (3)
abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (p17<=1)
states: 9,143 (3)
abstracting: (1<=p27)
states: 2,348 (3)
abstracting: (p27<=1)
states: 9,143 (3)
abstracting: (1<=p3)
states: 4,468 (3)
abstracting: (p3<=1)
states: 9,143 (3)
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p24<=1)
states: 9,143 (3)
abstracting: (1<=p3)
states: 4,468 (3)
abstracting: (p3<=1)
states: 9,143 (3)
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p24<=1)
states: 9,143 (3)
...................................
EG iterations: 35
.abstracting: (1<=p1)
states: 4,484 (3)
abstracting: (p1<=1)
states: 9,143 (3)
abstracting: (1<=p20)
states: 2,476 (3)
abstracting: (p20<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldIIPs-PT-001A-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.057sec

checking: AX [AG [[EF [[[[p11<=0 & 0<=p11] | [p15<=0 & 0<=p15]] | [[p26<=0 & 0<=p26] | [p12<=0 & 0<=p12]]]] | [EG [[[p8<=1 & 1<=p8] & [p22<=1 & 1<=p22]]] & [EX [[[[p2<=1 & 1<=p2] & [p10<=1 & 1<=p10]] | [[p11<=1 & 1<=p11] & [[p17<=1 & 1<=p17] & [p26<=1 & 1<=p26]]]]] & [E [[p16<=1 & 1<=p16] U [p15<=1 & 1<=p15]] | [[p8<=1 & 1<=p8] & [p22<=1 & 1<=p22]]]]]]]]
normalized: ~ [EX [E [true U ~ [[[[[[[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]] | E [[p16<=1 & 1<=p16] U [p15<=1 & 1<=p15]]] & EX [[[[[p26<=1 & 1<=p26] & [p17<=1 & 1<=p17]] & [p11<=1 & 1<=p11]] | [[p10<=1 & 1<=p10] & [p2<=1 & 1<=p2]]]]] & EG [[[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]]]] | E [true U [[[p12<=0 & 0<=p12] | [p26<=0 & 0<=p26]] | [[p15<=0 & 0<=p15] | [p11<=0 & 0<=p11]]]]]]]]]

abstracting: (0<=p11)
states: 9,143 (3)
abstracting: (p11<=0)
states: 4,485 (3)
abstracting: (0<=p15)
states: 9,143 (3)
abstracting: (p15<=0)
states: 6,899 (3)
abstracting: (0<=p26)
states: 9,143 (3)
abstracting: (p26<=0)
states: 7,071 (3)
abstracting: (0<=p12)
states: 9,143 (3)
abstracting: (p12<=0)
states: 4,572 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
.....................
EG iterations: 21
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p2<=1)
states: 9,143 (3)
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (p10<=1)
states: 9,143 (3)
abstracting: (1<=p11)
states: 4,658 (3)
abstracting: (p11<=1)
states: 9,143 (3)
abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (p17<=1)
states: 9,143 (3)
abstracting: (1<=p26)
states: 2,072 (3)
abstracting: (p26<=1)
states: 9,143 (3)
.abstracting: (1<=p15)
states: 2,244 (3)
abstracting: (p15<=1)
states: 9,143 (3)
abstracting: (1<=p16)
states: 2,170 (3)
abstracting: (p16<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EF [AX [[AF [[E [[[p13<=1 & 1<=p13] & [[p23<=1 & 1<=p23] & [p27<=1 & 1<=p27]]] U [[p8<=1 & 1<=p8] & [p22<=1 & 1<=p22]]] & [p21<=1 & 1<=p21]]] & [[EG [[[[p1<=1 & 1<=p1] & [p20<=1 & 1<=p20]] | [p0<=1 & 1<=p0]]] | [p5<=0 & 0<=p5]] | [[p18<=0 & 0<=p18] | [[[p1<=1 & 1<=p1] & [p20<=1 & 1<=p20]] & [[p13<=1 & 1<=p13] & [[p23<=1 & 1<=p23] & [p25<=1 & 1<=p25]]]]]]]]]
normalized: E [true U ~ [EX [~ [[[[[[[[p25<=1 & 1<=p25] & [p23<=1 & 1<=p23]] & [p13<=1 & 1<=p13]] & [[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]]] | [p18<=0 & 0<=p18]] | [[p5<=0 & 0<=p5] | EG [[[p0<=1 & 1<=p0] | [[p20<=1 & 1<=p20] & [p1<=1 & 1<=p1]]]]]] & ~ [EG [~ [[[p21<=1 & 1<=p21] & E [[[[p27<=1 & 1<=p27] & [p23<=1 & 1<=p23]] & [p13<=1 & 1<=p13]] U [[p22<=1 & 1<=p22] & [p8<=1 & 1<=p8]]]]]]]]]]]]

abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p22)
states: 2,138 (3)
abstracting: (p22<=1)
states: 9,143 (3)
abstracting: (1<=p13)
states: 4,571 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p23)
states: 2,302 (3)
abstracting: (p23<=1)
states: 9,143 (3)
abstracting: (1<=p27)
states: 2,348 (3)
abstracting: (p27<=1)
states: 9,143 (3)
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p21<=1)
states: 9,143 (3)

EG iterations: 0
abstracting: (1<=p1)
states: 4,484 (3)
abstracting: (p1<=1)
states: 9,143 (3)
abstracting: (1<=p20)
states: 2,476 (3)
abstracting: (p20<=1)
states: 9,143 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 9,143 (3)
......................
EG iterations: 22
abstracting: (0<=p5)
states: 9,143 (3)
abstracting: (p5<=0)
states: 7,307 (3)
abstracting: (0<=p18)
states: 9,143 (3)
abstracting: (p18<=0)
states: 4,469 (3)
abstracting: (1<=p1)
states: 4,484 (3)
abstracting: (p1<=1)
states: 9,143 (3)
abstracting: (1<=p20)
states: 2,476 (3)
abstracting: (p20<=1)
states: 9,143 (3)
abstracting: (1<=p13)
states: 4,571 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p23)
states: 2,302 (3)
abstracting: (p23<=1)
states: 9,143 (3)
abstracting: (1<=p25)
states: 2,210 (3)
abstracting: (p25<=1)
states: 9,143 (3)
.-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [E [EF [AX [[[[p6<=1 & 1<=p6] & [p16<=1 & 1<=p16]] & [[p3<=1 & 1<=p3] & [p24<=1 & 1<=p24]]]]] U AX [[AG [[[[p7<=1 & 1<=p7] & [p9<=1 & 1<=p9]] | [p0<=1 & 1<=p0]]] & EF [[[[p8<=1 & 1<=p8] & [p23<=1 & 1<=p23]] | [[p11<=1 & 1<=p11] & [[p17<=1 & 1<=p17] & [p27<=1 & 1<=p27]]]]]]]] & EF [AG [[[p15<=0 & 0<=p15] | [[[p7<=0 & 0<=p7] | [p9<=0 & 0<=p9]] & [[p11<=0 & 0<=p11] | [[p17<=0 & 0<=p17] | [p27<=0 & 0<=p27]]]]]]]]
normalized: [E [true U ~ [E [true U ~ [[[[[[p27<=0 & 0<=p27] | [p17<=0 & 0<=p17]] | [p11<=0 & 0<=p11]] & [[p9<=0 & 0<=p9] | [p7<=0 & 0<=p7]]] | [p15<=0 & 0<=p15]]]]]] & E [E [true U ~ [EX [~ [[[[p24<=1 & 1<=p24] & [p3<=1 & 1<=p3]] & [[p16<=1 & 1<=p16] & [p6<=1 & 1<=p6]]]]]]] U ~ [EX [~ [[E [true U [[[[p27<=1 & 1<=p27] & [p17<=1 & 1<=p17]] & [p11<=1 & 1<=p11]] | [[p23<=1 & 1<=p23] & [p8<=1 & 1<=p8]]]] & ~ [E [true U ~ [[[p0<=1 & 1<=p0] | [[p9<=1 & 1<=p9] & [p7<=1 & 1<=p7]]]]]]]]]]]]

abstracting: (1<=p7)
states: 3,640 (3)
abstracting: (p7<=1)
states: 9,143 (3)
abstracting: (1<=p9)
states: 3,628 (3)
abstracting: (p9<=1)
states: 9,143 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 9,143 (3)
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (1<=p23)
states: 2,302 (3)
abstracting: (p23<=1)
states: 9,143 (3)
abstracting: (1<=p11)
states: 4,658 (3)
abstracting: (p11<=1)
states: 9,143 (3)
abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (p17<=1)
states: 9,143 (3)
abstracting: (1<=p27)
states: 2,348 (3)
abstracting: (p27<=1)
states: 9,143 (3)
.abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p16)
states: 2,170 (3)
abstracting: (p16<=1)
states: 9,143 (3)
abstracting: (1<=p3)
states: 4,468 (3)
abstracting: (p3<=1)
states: 9,143 (3)
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p24<=1)
states: 9,143 (3)
.abstracting: (0<=p15)
states: 9,143 (3)
abstracting: (p15<=0)
states: 6,899 (3)
abstracting: (0<=p7)
states: 9,143 (3)
abstracting: (p7<=0)
states: 5,503 (3)
abstracting: (0<=p9)
states: 9,143 (3)
abstracting: (p9<=0)
states: 5,515 (3)
abstracting: (0<=p11)
states: 9,143 (3)
abstracting: (p11<=0)
states: 4,485 (3)
abstracting: (0<=p17)
states: 9,143 (3)
abstracting: (p17<=0)
states: 6,777 (3)
abstracting: (0<=p27)
states: 9,143 (3)
abstracting: (p27<=0)
states: 6,795 (3)
-> the formula is TRUE

FORMULA ShieldIIPs-PT-001A-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

totally nodes used: 232200 (2.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 182505 544594 727099
used/not used/entry size/cache size: 725857 66383007 16 1024MB
basic ops cache: hits/miss/sum: 105794 230703 336497
used/not used/entry size/cache size: 453684 16323532 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: 2426 5882 8308
used/not used/entry size/cache size: 5882 8382726 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 66885313
1 215481
2 7521
3 521
4 26
5 2
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.177sec


BK_STOP 1679484468292

--------------------
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:1365 (50), effective:261 (9)

initing FirstDep: 0m 0.012sec


iterations count:705 (26), effective:143 (5)

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

iterations count:378 (14), effective:62 (2)

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

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

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

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

iterations count:447 (16), effective:86 (3)

iterations count:1220 (45), effective:206 (7)

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

iterations count:835 (30), effective:147 (5)

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

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

iterations count:424 (15), effective:56 (2)

iterations count:1194 (44), effective:199 (7)

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

iterations count:476 (17), effective:89 (3)

iterations count:538 (19), effective:104 (3)

iterations count:1190 (44), effective:198 (7)

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

iterations count:46 (1), effective:5 (0)

iterations count:538 (19), effective:104 (3)

iterations count:1190 (44), effective:198 (7)

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

iterations count:538 (19), effective:104 (3)

iterations count:1190 (44), effective:198 (7)

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

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

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

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

iterations count:1220 (45), effective:206 (7)

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

iterations count:368 (13), effective:66 (2)

iterations count:1220 (45), effective:206 (7)

iterations count:1220 (45), effective:206 (7)

iterations count:772 (28), effective:126 (4)

iterations count:1190 (44), effective:198 (7)

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="ShieldIIPs-PT-001A"
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 ShieldIIPs-PT-001A, 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 r394-oct2-167903717400002"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-001A.tgz
mv ShieldIIPs-PT-001A 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 ;