Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978600194.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is ShieldRVt-PT-002A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600194
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 25 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 23:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 23:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 25 23:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 25 23:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 23:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:03 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 6.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 ShieldRVt-PT-002A-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-002A-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679346181914

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=ShieldRVt-PT-002A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:03:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:03:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:03:03] [INFO ] Load time of PNML (sax parser for PT used): 22 ms
[2023-03-20 21:03:03] [INFO ] Transformed 19 places.
[2023-03-20 21:03:03] [INFO ] Transformed 19 transitions.
[2023-03-20 21:03:03] [INFO ] Found NUPN structural information;
[2023-03-20 21:03:03] [INFO ] Parsed PT model containing 19 places and 19 transitions and 74 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-002A-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-002A-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 out of 19 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 8 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 19 cols
[2023-03-20 21:03:03] [INFO ] Computed 9 place invariants in 3 ms
[2023-03-20 21:03:03] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-20 21:03:03] [INFO ] Invariant cache hit.
[2023-03-20 21:03:03] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2023-03-20 21:03:03] [INFO ] Invariant cache hit.
[2023-03-20 21:03:03] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 265 ms. Remains : 19/19 places, 18/18 transitions.
Support contains 19 out of 19 places after structural reductions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 13 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 35) seen :34
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 21:03:04] [INFO ] Invariant cache hit.
[2023-03-20 21:03:04] [INFO ] [Real]Absence check using 9 positive place invariants in 8 ms returned sat
[2023-03-20 21:03:04] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 10 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 4 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 19/19 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 19 /19 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 19/19 places, 18/18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:03:04] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:03:04] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-20 21:03:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 19 places, 18 transitions and 72 arcs took 0 ms.
Total runtime 1065 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: 19 NrTr: 18 NrArc: 72)

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

net check time: 0m 0.000sec

init dd package: 0m 3.074sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 45 (4.5e+01) #states 513



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

checking: AX [[p9<=0 & 0<=p9]]
normalized: ~ [EX [~ [[p9<=0 & 0<=p9]]]]

abstracting: (0<=p9)
states: 513
abstracting: (p9<=0)
states: 257
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [[[p16<=1 & 1<=p16] & [p18<=1 & 1<=p18]]]
normalized: EX [[[p18<=1 & 1<=p18] & [p16<=1 & 1<=p16]]]

abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [AG [[[p4<=1 & 1<=p4] & [[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]]]]]
normalized: EX [~ [E [true U ~ [[[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [p4<=1 & 1<=p4]]]]]]

abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [AX [[AX [1<=0] | EG [[AF [[p7<=1 & 1<=p7]] & A [[p11<=1 & 1<=p11] U [[p16<=1 & 1<=p16] & [p18<=1 & 1<=p18]]]]]]]]
normalized: EG [~ [EX [~ [[EG [[~ [EG [~ [[p7<=1 & 1<=p7]]]] & [~ [EG [~ [[[p18<=1 & 1<=p18] & [p16<=1 & 1<=p16]]]]] & ~ [E [~ [[[p18<=1 & 1<=p18] & [p16<=1 & 1<=p16]]] U [~ [[p11<=1 & 1<=p11]] & ~ [[[p18<=1 & 1<=p18] & [p16<=1 & 1<=p16]]]]]]]]] | ~ [EX [~ [1<=0]]]]]]]]

abstracting: (1<=0)
states: 0
.abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
....
EG iterations: 4
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.
EG iterations: 1
............
EG iterations: 12
..
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLFireability-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.035sec

checking: AX [[[EF [AX [EF [[[p14<=0 & 0<=p14] | [p17<=0 & 0<=p17]]]]] & [p8<=1 & 1<=p8]] & [[p10<=1 & 1<=p10] & [p15<=1 & 1<=p15]]]]
normalized: ~ [EX [~ [[[[p15<=1 & 1<=p15] & [p10<=1 & 1<=p10]] & [[p8<=1 & 1<=p8] & E [true U ~ [EX [~ [E [true U [[p17<=0 & 0<=p17] | [p14<=0 & 0<=p14]]]]]]]]]]]]

abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
.abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p10)
states: 256
abstracting: (p10<=1)
states: 513
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
.-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [A [[[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]] U [p11<=1 & 1<=p11]]] & [EF [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]] | [[p5<=1 & 1<=p5] & [p9<=1 & 1<=p9]]]]]
normalized: ~ [E [true U ~ [[[[[p9<=1 & 1<=p9] & [p5<=1 & 1<=p5]] | E [true U [[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]] & ~ [[~ [EG [~ [[p11<=1 & 1<=p11]]]] & ~ [E [~ [[p11<=1 & 1<=p11]] U [~ [[[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]] & ~ [[p11<=1 & 1<=p11]]]]]]]]]]]

abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [E [~ [[[1<=p6 & p6<=1] & [p9<=1 & 1<=p9]]] U [[p12<=1 & 1<=p12] & [[p13<=1 & 1<=p13] & [p16<=1 & 1<=p16]]]] U ~ [AG [[EG [[p11<=1 & 1<=p11]] | [[p17<=1 & 1<=p17] | ~ [[p7<=1 & 1<=p7]]]]]]]
normalized: [~ [EG [~ [E [true U ~ [[[~ [[p7<=1 & 1<=p7]] | [p17<=1 & 1<=p17]] | EG [[p11<=1 & 1<=p11]]]]]]]] & ~ [E [~ [E [true U ~ [[[~ [[p7<=1 & 1<=p7]] | [p17<=1 & 1<=p17]] | EG [[p11<=1 & 1<=p11]]]]]] U [~ [E [true U ~ [[[~ [[p7<=1 & 1<=p7]] | [p17<=1 & 1<=p17]] | EG [[p11<=1 & 1<=p11]]]]]] & ~ [E [~ [[[p9<=1 & 1<=p9] & [1<=p6 & p6<=1]]] U [[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]] & [p12<=1 & 1<=p12]]]]]]]]

abstracting: (1<=p12)
states: 256
abstracting: (p12<=1)
states: 513
abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (p6<=1)
states: 513
abstracting: (1<=p6)
states: 256
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EX [EX [[EX [[p15<=0 & 0<=p15]] & [[p17<=1 & 1<=p17] & [[[p15<=0 & 0<=p15] | [[p2<=0 & 0<=p2] | [p4<=0 & 0<=p4]]] | [[p10<=0 & 0<=p10] | [[p3<=0 & 0<=p3] | [[p13<=0 & 0<=p13] & [[p8<=0 & 0<=p8] | [[p10<=0 & 0<=p10] | [p15<=0 & 0<=p15]]]]]]]]]]]
normalized: EX [EX [[[[[[[[[[p15<=0 & 0<=p15] | [p10<=0 & 0<=p10]] | [p8<=0 & 0<=p8]] & [p13<=0 & 0<=p13]] | [p3<=0 & 0<=p3]] | [p10<=0 & 0<=p10]] | [[[p4<=0 & 0<=p4] | [p2<=0 & 0<=p2]] | [p15<=0 & 0<=p15]]] & [p17<=1 & 1<=p17]] & EX [[p15<=0 & 0<=p15]]]]]

abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
.abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (0<=p2)
states: 513
abstracting: (p2<=0)
states: 257
abstracting: (0<=p4)
states: 513
abstracting: (p4<=0)
states: 257
abstracting: (0<=p10)
states: 513
abstracting: (p10<=0)
states: 257
abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
abstracting: (0<=p13)
states: 513
abstracting: (p13<=0)
states: 257
abstracting: (0<=p8)
states: 513
abstracting: (p8<=0)
states: 257
abstracting: (0<=p10)
states: 513
abstracting: (p10<=0)
states: 257
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
..-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [EX [[EF [[[p14<=0 & 0<=p14] | [p17<=0 & 0<=p17]]] & [[EF [[p13<=0 & 0<=p13]] | [[p12<=1 & 1<=p12] & [[p13<=1 & 1<=p13] & [p16<=1 & 1<=p16]]]] & [[[p3<=0 & 0<=p3] | [p12<=0 & 0<=p12]] | [[p18<=0 & 0<=p18] | [[p13<=0 & 0<=p13] | [p16<=0 & 0<=p16]]]]]]]]
normalized: ~ [EG [~ [EX [[[[[[p3<=0 & 0<=p3] | [p12<=0 & 0<=p12]] | [[[p16<=0 & 0<=p16] | [p13<=0 & 0<=p13]] | [p18<=0 & 0<=p18]]] & [[[[p16<=1 & 1<=p16] & [p13<=1 & 1<=p13]] & [p12<=1 & 1<=p12]] | E [true U [p13<=0 & 0<=p13]]]] & E [true U [[p17<=0 & 0<=p17] | [p14<=0 & 0<=p14]]]]]]]]

abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
abstracting: (0<=p13)
states: 513
abstracting: (p13<=0)
states: 257
abstracting: (1<=p12)
states: 256
abstracting: (p12<=1)
states: 513
abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (0<=p18)
states: 513
abstracting: (p18<=0)
states: 257
abstracting: (0<=p13)
states: 513
abstracting: (p13<=0)
states: 257
abstracting: (0<=p16)
states: 513
abstracting: (p16<=0)
states: 257
abstracting: (0<=p12)
states: 513
abstracting: (p12<=0)
states: 257
abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
..
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: E [~ [[1<=p13 & p13<=1]] U EF [[[EF [[p11<=1 & 1<=p11]] | [p9<=1 & 1<=p9]] | [~ [[[p17<=1 & 1<=p17] | [[p0<=1 & 1<=p0] | [p13<=1 & 1<=p13]]]] | [~ [E [[p7<=1 & 1<=p7] U [[p4<=1 & 1<=p4] & [[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]]]]] & EF [[p5<=1 & 1<=p5]]]]]]]
normalized: E [~ [[1<=p13 & p13<=1]] U E [true U [[[E [true U [p5<=1 & 1<=p5]] & ~ [E [[p7<=1 & 1<=p7] U [[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [p4<=1 & 1<=p4]]]]] | ~ [[[[p13<=1 & 1<=p13] | [p0<=1 & 1<=p0]] | [p17<=1 & 1<=p17]]]] | [[p9<=1 & 1<=p9] | E [true U [p11<=1 & 1<=p11]]]]]]

abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (p13<=1)
states: 513
abstracting: (1<=p13)
states: 256
-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [EF [[[[EF [[[p8<=1 & 1<=p8] & [[p10<=1 & 1<=p10] & [p15<=1 & 1<=p15]]]] & [p8<=1 & 1<=p8]] & [[p10<=1 & 1<=p10] & [p15<=1 & 1<=p15]]] | [[AX [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]] & [p4<=1 & 1<=p4]] & [[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]]]]] U [AX [AG [[E [[p7<=1 & 1<=p7] U [[p4<=1 & 1<=p4] & [[p5<=1 & 1<=p5] & [p8<=1 & 1<=p8]]]] | ~ [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]]]]] & [p13<=1 & 1<=p13]]]
normalized: [~ [EG [~ [[[p13<=1 & 1<=p13] & ~ [EX [E [true U ~ [[~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | E [[p7<=1 & 1<=p7] U [[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [p4<=1 & 1<=p4]]]]]]]]]]]] & ~ [E [~ [[[p13<=1 & 1<=p13] & ~ [EX [E [true U ~ [[~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | E [[p7<=1 & 1<=p7] U [[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [p4<=1 & 1<=p4]]]]]]]]]] U [~ [E [true U [[[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [[p4<=1 & 1<=p4] & ~ [EX [~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]]]] | [[[p15<=1 & 1<=p15] & [p10<=1 & 1<=p10]] & [[p8<=1 & 1<=p8] & E [true U [[[p15<=1 & 1<=p15] & [p10<=1 & 1<=p10]] & [p8<=1 & 1<=p8]]]]]]]] & ~ [[[p13<=1 & 1<=p13] & ~ [EX [E [true U ~ [[~ [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]] | E [[p7<=1 & 1<=p7] U [[[p8<=1 & 1<=p8] & [p5<=1 & 1<=p5]] & [p4<=1 & 1<=p4]]]]]]]]]]]]]]

abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p10)
states: 256
abstracting: (p10<=1)
states: 513
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p10)
states: 256
abstracting: (p10<=1)
states: 513
abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513
abstracting: (1<=p4)
states: 256
abstracting: (p4<=1)
states: 513
abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p8)
states: 256
abstracting: (p8<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p13)
states: 256
abstracting: (p13<=1)
states: 513

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [EG [[[[[p1<=0 & 0<=p1] | [p7<=0 & 0<=p7]] & [[[p11<=0 & 0<=p11] | [p0<=0 & 0<=p0]] & [[[p11<=0 & 0<=p11] & [[p14<=0 & 0<=p14] | [p17<=0 & 0<=p17]]] | [[[p14<=0 & 0<=p14] | [p17<=0 & 0<=p17]] & [[p2<=0 & 0<=p2] | [[p4<=0 & 0<=p4] | [p10<=0 & 0<=p10]]]]]]] | [[EF [[[p14<=0 & 0<=p14] | [p17<=0 & 0<=p17]]] & ~ [A [[p0<=1 & 1<=p0] U [[p6<=1 & 1<=p6] & [p9<=1 & 1<=p9]]]]] & [[p9<=1 & 1<=p9] & [[p15<=0 & 0<=p15] & [p7<=0 & 0<=p7]]]]]]]
normalized: ~ [EG [~ [EG [[[[[[p7<=0 & 0<=p7] & [p15<=0 & 0<=p15]] & [p9<=1 & 1<=p9]] & [~ [[~ [EG [~ [[[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]]] & ~ [E [~ [[[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]] U [~ [[p0<=1 & 1<=p0]] & ~ [[[p9<=1 & 1<=p9] & [p6<=1 & 1<=p6]]]]]]]] & E [true U [[p17<=0 & 0<=p17] | [p14<=0 & 0<=p14]]]]] | [[[[[[[p10<=0 & 0<=p10] | [p4<=0 & 0<=p4]] | [p2<=0 & 0<=p2]] & [[p17<=0 & 0<=p17] | [p14<=0 & 0<=p14]]] | [[[p17<=0 & 0<=p17] | [p14<=0 & 0<=p14]] & [p11<=0 & 0<=p11]]] & [[p0<=0 & 0<=p0] | [p11<=0 & 0<=p11]]] & [[p7<=0 & 0<=p7] | [p1<=0 & 0<=p1]]]]]]]]

abstracting: (0<=p1)
states: 513
abstracting: (p1<=0)
states: 257
abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
abstracting: (0<=p11)
states: 513
abstracting: (p11<=0)
states: 257
abstracting: (0<=p0)
states: 513
abstracting: (p0<=0)
states: 512
abstracting: (0<=p11)
states: 513
abstracting: (p11<=0)
states: 257
abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
abstracting: (0<=p2)
states: 513
abstracting: (p2<=0)
states: 257
abstracting: (0<=p4)
states: 513
abstracting: (p4<=0)
states: 257
abstracting: (0<=p10)
states: 513
abstracting: (p10<=0)
states: 257
abstracting: (0<=p14)
states: 513
abstracting: (p14<=0)
states: 257
abstracting: (0<=p17)
states: 513
abstracting: (p17<=0)
states: 257
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (1<=p6)
states: 256
abstracting: (p6<=1)
states: 513
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p9)
states: 256
abstracting: (p9<=1)
states: 513
abstracting: (0<=p15)
states: 513
abstracting: (p15<=0)
states: 257
abstracting: (0<=p7)
states: 513
abstracting: (p7<=0)
states: 257
.........
EG iterations: 9
.
EG iterations: 1
-> the formula is FALSE

FORMULA ShieldRVt-PT-002A-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [EX [[[EF [[p3<=0 & 0<=p3]] & [A [AF [[p0<=1 & 1<=p0]] U [[p3<=1 & 1<=p3] & [[p12<=1 & 1<=p12] & [p18<=1 & 1<=p18]]]] | AX [[[p16<=0 & 0<=p16] | [p18<=0 & 0<=p18]]]]] | [AX [[p11<=0 & 0<=p11]] & [[p11<=0 & 0<=p11] & E [AF [[p3<=1 & 1<=p3]] U [EX [[[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]] | [p15<=1 & 1<=p15]]]]]]] | EX [E [[EG [[[p11<=1 & 1<=p11] & [p17<=1 & 1<=p17]]] | [[p14<=1 & 1<=p14] & [p17<=1 & 1<=p17]]] U [[[[p5<=1 & 1<=p5] | [p11<=1 & 1<=p11]] | [[p0<=1 & 1<=p0] | [[p16<=1 & 1<=p16] & [p18<=1 & 1<=p18]]]] & [[p1<=1 & 1<=p1] & [p7<=1 & 1<=p7]]]]]]
normalized: [EX [E [[[[p17<=1 & 1<=p17] & [p14<=1 & 1<=p14]] | EG [[[p17<=1 & 1<=p17] & [p11<=1 & 1<=p11]]]] U [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]] & [[[[p18<=1 & 1<=p18] & [p16<=1 & 1<=p16]] | [p0<=1 & 1<=p0]] | [[p11<=1 & 1<=p11] | [p5<=1 & 1<=p5]]]]]] | EX [[[[E [~ [EG [~ [[p3<=1 & 1<=p3]]]] U [[p15<=1 & 1<=p15] | EX [[[p7<=1 & 1<=p7] & [p1<=1 & 1<=p1]]]]] & [p11<=0 & 0<=p11]] & ~ [EX [~ [[p11<=0 & 0<=p11]]]]] | [[~ [EX [~ [[[p18<=0 & 0<=p18] | [p16<=0 & 0<=p16]]]]] | [~ [EG [~ [[[[p18<=1 & 1<=p18] & [p12<=1 & 1<=p12]] & [p3<=1 & 1<=p3]]]]] & ~ [E [~ [[[[p18<=1 & 1<=p18] & [p12<=1 & 1<=p12]] & [p3<=1 & 1<=p3]]] U [EG [~ [[p0<=1 & 1<=p0]]] & ~ [[[[p18<=1 & 1<=p18] & [p12<=1 & 1<=p12]] & [p3<=1 & 1<=p3]]]]]]]] & E [true U [p3<=0 & 0<=p3]]]]]]

abstracting: (0<=p3)
states: 513
abstracting: (p3<=0)
states: 257
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
abstracting: (1<=p12)
states: 256
abstracting: (p12<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
.
EG iterations: 1
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
abstracting: (1<=p12)
states: 256
abstracting: (p12<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
abstracting: (1<=p12)
states: 256
abstracting: (p12<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
.
EG iterations: 1
abstracting: (0<=p16)
states: 513
abstracting: (p16<=0)
states: 257
abstracting: (0<=p18)
states: 513
abstracting: (p18<=0)
states: 257
.abstracting: (0<=p11)
states: 513
abstracting: (p11<=0)
states: 257
.abstracting: (0<=p11)
states: 513
abstracting: (p11<=0)
states: 257
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
.abstracting: (1<=p15)
states: 256
abstracting: (p15<=1)
states: 513
abstracting: (1<=p3)
states: 256
abstracting: (p3<=1)
states: 513
.
EG iterations: 1
.abstracting: (1<=p5)
states: 256
abstracting: (p5<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 513
abstracting: (1<=p16)
states: 256
abstracting: (p16<=1)
states: 513
abstracting: (1<=p18)
states: 256
abstracting: (p18<=1)
states: 513
abstracting: (1<=p1)
states: 256
abstracting: (p1<=1)
states: 513
abstracting: (1<=p7)
states: 256
abstracting: (p7<=1)
states: 513
abstracting: (1<=p11)
states: 256
abstracting: (p11<=1)
states: 513
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
....
EG iterations: 4
abstracting: (1<=p14)
states: 256
abstracting: (p14<=1)
states: 513
abstracting: (1<=p17)
states: 256
abstracting: (p17<=1)
states: 513
.-> the formula is TRUE

FORMULA ShieldRVt-PT-002A-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 7179 (7.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7611 19531 27142
used/not used/entry size/cache size: 25712 67083152 16 1024MB
basic ops cache: hits/miss/sum: 4349 7415 11764
used/not used/entry size/cache size: 13757 16763459 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: 434 311 745
used/not used/entry size/cache size: 311 8388297 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 67101704
1 7141
2 19
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.272sec


BK_STOP 1679346190104

--------------------
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:220 (12), effective:47 (2)

initing FirstDep: 0m 0.000sec


iterations count:36 (2), effective:6 (0)

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

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

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

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

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

iterations count:89 (4), effective:14 (0)

iterations count:99 (5), effective:15 (0)

iterations count:89 (4), effective:16 (0)

iterations count:111 (6), effective:20 (1)

iterations count:111 (6), effective:20 (1)

iterations count:111 (6), effective:20 (1)

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

iterations count:36 (2), effective:6 (0)

iterations count:99 (5), effective:15 (0)

iterations count:35 (1), effective:6 (0)

iterations count:72 (4), effective:10 (0)

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

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

iterations count:35 (1), effective:6 (0)

iterations count:92 (5), effective:16 (0)

iterations count:55 (3), effective:8 (0)

iterations count:55 (3), effective:8 (0)

iterations count:35 (1), effective:6 (0)

iterations count:92 (5), effective:16 (0)

iterations count:35 (1), effective:6 (0)

iterations count:92 (5), effective:16 (0)

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

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

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

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

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

iterations count:68 (3), effective:14 (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="ShieldRVt-PT-002A"
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 ShieldRVt-PT-002A, 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 r426-tajo-167905978600194"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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