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-167905978600177.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-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600177
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.2K Feb 25 23:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 23:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 23:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K 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.1K 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 15K Feb 25 23:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 179K Feb 25 23:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 23:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 23:01 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 3.7K 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-001A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-001A-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679346036034

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-001A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:00:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:00:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:00:37] [INFO ] Load time of PNML (sax parser for PT used): 21 ms
[2023-03-20 21:00:37] [INFO ] Transformed 11 places.
[2023-03-20 21:00:37] [INFO ] Transformed 11 transitions.
[2023-03-20 21:00:37] [INFO ] Found NUPN structural information;
[2023-03-20 21:00:37] [INFO ] Parsed PT model containing 11 places and 11 transitions and 40 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
FORMULA ShieldRVt-PT-001A-CTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-001A-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 11 out of 11 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 9 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 11 cols
[2023-03-20 21:00:38] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-20 21:00:38] [INFO ] Implicit Places using invariants in 155 ms returned []
[2023-03-20 21:00:38] [INFO ] Invariant cache hit.
[2023-03-20 21:00:38] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2023-03-20 21:00:38] [INFO ] Invariant cache hit.
[2023-03-20 21:00:38] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 11/11 places, 10/10 transitions.
Support contains 11 out of 11 places after structural reductions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 14 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
FORMULA ShieldRVt-PT-001A-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Finished random walk after 12 steps, including 0 resets, run visited all 45 properties in 19 ms. (steps per millisecond=0 )
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 2 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 3 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 10/11 places, 9/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 0 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 9
Applied a total of 2 rules in 2 ms. Remains 10 /11 variables (removed 1) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 10/11 places, 9/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 0 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 9 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 0 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in LTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Applied a total of 0 rules in 1 ms. Remains 11 /11 variables (removed 0) and now considering 10/10 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 11/11 places, 10/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 0 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 10 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 11/11 places, 10/10 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 9
Applied a total of 2 rules in 1 ms. Remains 10 /11 variables (removed 1) and now considering 9/10 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 10/11 places, 9/10 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 0 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 0 ms
[2023-03-20 21:00:38] [INFO ] Input system was already deterministic with 9 transitions.
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:00:38] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:00:38] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 21:00:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 11 places, 10 transitions and 38 arcs took 1 ms.
Total runtime 791 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 11 NrTr: 10 NrArc: 38)

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

net check time: 0m 0.000sec

init dd package: 0m 3.380sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 25 (2.5e+01) #states 33



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

checking: EF [EX [0<=0]]
normalized: E [true U EX [0<=0]]

abstracting: (0<=0)
states: 33
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AG [[p3<=1 & 1<=p3]]]
normalized: ~ [EG [E [true U ~ [[p3<=1 & 1<=p3]]]]]

abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=0)
states: 0
.abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.033sec

checking: EX [EF [[p2<=1 & 1<=p2]]]
normalized: EX [E [true U [p2<=1 & 1<=p2]]]

abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
.-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [[EG [EF [[[p9<=0 & 0<=p9] & [p3<=1 & 1<=p3]]]] | [p10<=1 & 1<=p10]]]
normalized: ~ [EG [~ [[[p10<=1 & 1<=p10] | EG [E [true U [[p3<=1 & 1<=p3] & [p9<=0 & 0<=p9]]]]]]]]

abstracting: (0<=p9)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33

EG iterations: 0
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [~ [E [A [[p10<=1 & 1<=p10] U [p1<=0 & 0<=p1]] U [p2<=0 & 0<=p2]]]]
normalized: ~ [EG [E [[~ [EG [~ [[p1<=0 & 0<=p1]]]] & ~ [E [~ [[p1<=0 & 0<=p1]] U [~ [[p10<=1 & 1<=p10]] & ~ [[p1<=0 & 0<=p1]]]]]] U [p2<=0 & 0<=p2]]]]

abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p1)
states: 33
abstracting: (p1<=0)
states: 17
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (0<=p1)
states: 33
abstracting: (p1<=0)
states: 17
abstracting: (0<=p1)
states: 33
abstracting: (p1<=0)
states: 17
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EX [~ [E [~ [A [AX [[[p8<=0 & 0<=p8] | [p10<=1 & 1<=p10]]] U [p4<=0 & 0<=p4]]] U ~ [[p2<=1 & 1<=p2]]]]]
normalized: EX [~ [E [~ [[~ [EG [~ [[p4<=0 & 0<=p4]]]] & ~ [E [~ [[p4<=0 & 0<=p4]] U [EX [~ [[[p10<=1 & 1<=p10] | [p8<=0 & 0<=p8]]]] & ~ [[p4<=0 & 0<=p4]]]]]]] U ~ [[p2<=1 & 1<=p2]]]]]

abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (0<=p8)
states: 33
abstracting: (p8<=0)
states: 17
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
.abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
.
EG iterations: 1
.-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (0<=p8)
states: 33
abstracting: (p8<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p7)
states: 33
abstracting: (p7<=0)
states: 17
..........
EG iterations: 10
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (0<=p8)
states: 33
abstracting: (p8<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p7)
states: 33
abstracting: (p7<=0)
states: 17
..........
EG iterations: 10
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (0<=p8)
states: 33
abstracting: (p8<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p7)
states: 33
abstracting: (p7<=0)
states: 17
..........
EG iterations: 10
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: E [[[p9<=0 & 0<=p9] | [p10<=1 & 1<=p10]] U AF [[E [~ [[p2<=1 & 1<=p2]] U E [[p6<=0 & 0<=p6] U [p7<=1 & 1<=p7]]] | A [[[p3<=0 & 0<=p3] | [p2<=1 & 1<=p2]] U [[[p6<=0 & 0<=p6] | [p1<=1 & 1<=p1]] & [p10<=1 & 1<=p10]]]]]]
normalized: E [[[p10<=1 & 1<=p10] | [p9<=0 & 0<=p9]] U ~ [EG [~ [[[~ [EG [~ [[[p10<=1 & 1<=p10] & [[p1<=1 & 1<=p1] | [p6<=0 & 0<=p6]]]]]] & ~ [E [~ [[[p10<=1 & 1<=p10] & [[p1<=1 & 1<=p1] | [p6<=0 & 0<=p6]]]] U [~ [[[p2<=1 & 1<=p2] | [p3<=0 & 0<=p3]]] & ~ [[[p10<=1 & 1<=p10] & [[p1<=1 & 1<=p1] | [p6<=0 & 0<=p6]]]]]]]] | E [~ [[p2<=1 & 1<=p2]] U E [[p6<=0 & 0<=p6] U [p7<=1 & 1<=p7]]]]]]]]

abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (0<=p3)
states: 33
abstracting: (p3<=0)
states: 17
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
...
EG iterations: 3
....
EG iterations: 4
abstracting: (0<=p9)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[[p10<=0 & 0<=p10] | [p5<=1 & 1<=p5]] U [~ [AG [[[p4<=0 & 0<=p4] | [p0<=1 & 1<=p0]]]] & ~ [[[[p0<=0 & 0<=p0] | [p3<=1 & 1<=p3]] & ~ [[E [[[p10<=0 & 0<=p10] | [p0<=1 & 1<=p0]] U [p2<=0 & 0<=p2]] & [[p0<=1 & 1<=p0] | [p4<=1 & 1<=p4]]]]]]]]
normalized: [~ [EG [~ [[~ [[~ [[[[p4<=1 & 1<=p4] | [p0<=1 & 1<=p0]] & E [[[p0<=1 & 1<=p0] | [p10<=0 & 0<=p10]] U [p2<=0 & 0<=p2]]]] & [[p3<=1 & 1<=p3] | [p0<=0 & 0<=p0]]]] & E [true U ~ [[[p0<=1 & 1<=p0] | [p4<=0 & 0<=p4]]]]]]]] & ~ [E [~ [[~ [[~ [[[[p4<=1 & 1<=p4] | [p0<=1 & 1<=p0]] & E [[[p0<=1 & 1<=p0] | [p10<=0 & 0<=p10]] U [p2<=0 & 0<=p2]]]] & [[p3<=1 & 1<=p3] | [p0<=0 & 0<=p0]]]] & E [true U ~ [[[p0<=1 & 1<=p0] | [p4<=0 & 0<=p4]]]]]] U [~ [[[p5<=1 & 1<=p5] | [p10<=0 & 0<=p10]]] & ~ [[~ [[~ [[[[p4<=1 & 1<=p4] | [p0<=1 & 1<=p0]] & E [[[p0<=1 & 1<=p0] | [p10<=0 & 0<=p10]] U [p2<=0 & 0<=p2]]]] & [[p3<=1 & 1<=p3] | [p0<=0 & 0<=p0]]]] & E [true U ~ [[[p0<=1 & 1<=p0] | [p4<=0 & 0<=p4]]]]]]]]]]

abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (0<=p0)
states: 33
abstracting: (p0<=0)
states: 32
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (0<=p0)
states: 33
abstracting: (p0<=0)
states: 32
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (0<=p0)
states: 33
abstracting: (p0<=0)
states: 32
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
.
EG iterations: 1
-> the formula is TRUE

FORMULA ShieldRVt-PT-001A-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (0<=p9)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
....
EG iterations: 4
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (0<=0)
states: 33
.abstracting: (0<=p9)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
....
EG iterations: 4
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (0<=p9)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
....
EG iterations: 4
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
....
EG iterations: 4
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (0<=p9)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
.
EG iterations: 1
.
EG iterations: 1
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (0<=0)
states: 33
.abstracting: (0<=p8)
states: 33
abstracting: (p8<=0)
states: 17
abstracting: (0<=p3)
states: 33
abstracting: (p3<=0)
states: 17
.abstracting: (0<=p0)
states: 33
abstracting: (p0<=0)
states: 32
abstracting: (0<=p1)
states: 33
abstracting: (p1<=0)
states: 17
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AF [[E [[[p1<=0 & 0<=p1] | [p8<=1 & 1<=p8]] U [[p7<=0 & 0<=p7] | [p5<=1 & 1<=p5]]] & [[[~ [[p2<=1 & 1<=p2]] & ~ [[p0<=1 & 1<=p0]]] | [AG [[p10<=0 & 0<=p10]] & [[p1<=0 & 0<=p1] | [p9<=1 & 1<=p9]]]] & [~ [[p2<=0 & 0<=p2]] | [AG [[p8<=0 & 0<=p8]] & [[p2<=0 & 0<=p2] & [[p0<=0 & 0<=p0] | [p10<=1 & 1<=p10]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[p10<=1 & 1<=p10] | [p0<=0 & 0<=p0]] & [p2<=0 & 0<=p2]] & ~ [E [true U ~ [[p8<=0 & 0<=p8]]]]] | ~ [[p2<=0 & 0<=p2]]] & [[[[p9<=1 & 1<=p9] | [p1<=0 & 0<=p1]] & ~ [E [true U ~ [[p10<=0 & 0<=p10]]]]] | [~ [[p0<=1 & 1<=p0]] & ~ [[p2<=1 & 1<=p2]]]]] & E [[[p8<=1 & 1<=p8] | [p1<=0 & 0<=p1]] U [[p5<=1 & 1<=p5] | [p7<=0 & 0<=p7]]]]]]]

abstracting: (0<=p7)
states: 33
abstracting: (p7<=0)
states: 17
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (0<=p1)
states: 33
abstracting: (p1<=0)
states: 17
abstracting: (1<=p8)
states: 16
abstracting: (p8<=1)
states: 33
abstracting: (1<=p2)
states: 16
abstracting: (p2<=1)
states: 33
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 33
abstracting: (0<=p10)
states: 33
abstracting: (p10<=0)
states: 17
abstracting: (0<=p1)
states: 33
abstracting: (p1<=0)
states: 17
abstracting: (1<=p9)
states: 16
abstracting: (p9<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p8)
states: 33
abstracting: (p8<=0)
states: 17
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (0<=p0)
states: 33
abstracting: (p0<=0)
states: 32
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (0<=p6)
states: 33
abstracting: (p6<=0)
states: 17
abstracting: (1<=p10)
states: 16
abstracting: (p10<=1)
states: 33
abstracting: (0<=p1)
states: 33
abstracting: (p1<=0)
states: 17
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
abstracting: (1<=p6)
states: 16
abstracting: (p6<=1)
states: 33
..
EG iterations: 2
abstracting: (0<=p7)
states: 33
abstracting: (p7<=0)
states: 17
abstracting: (1<=p5)
states: 16
abstracting: (p5<=1)
states: 33
abstracting: (0<=p3)
states: 33
abstracting: (p3<=0)
states: 17
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
.
EG iterations: 1
abstracting: (1<=p3)
states: 16
abstracting: (p3<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (0<=p2)
states: 33
abstracting: (p2<=0)
states: 17
abstracting: (1<=p4)
states: 16
abstracting: (p4<=1)
states: 33
abstracting: (1<=p1)
states: 16
abstracting: (p1<=1)
states: 33
.
EG iterations: 1
abstracting: (0<=p9)
states: 33
abstracting: (p9<=0)
states: 17
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (0<=p4)
states: 33
abstracting: (p4<=0)
states: 17
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33
abstracting: (1<=p7)
states: 16
abstracting: (p7<=1)
states: 33

EG iterations: 0
-> the formula is FALSE

FORMULA ShieldRVt-PT-001A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 1141 (1.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 2454 4098 6552
used/not used/entry size/cache size: 5030 67103834 16 1024MB
basic ops cache: hits/miss/sum: 1713 1871 3584
used/not used/entry size/cache size: 3327 16773889 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: 342 115 457
used/not used/entry size/cache size: 115 8388493 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 67107734
1 1119
2 11
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.725sec


BK_STOP 1679346044619

--------------------
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 CTLCardinality -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:81 (8), effective:18 (1)

initing FirstDep: 0m 0.000sec


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

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

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

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

iterations count:53 (5), effective:12 (1)

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

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

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

iterations count:25 (2), effective:3 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:30 (3), effective:3 (0)

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

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

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

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

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

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

iterations count:34 (3), effective:9 (0)

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

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

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

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

iterations count:53 (5), effective:10 (1)

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

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

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

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

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

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

iterations count:42 (4), effective:8 (0)

iterations count:35 (3), effective:5 (0)

iterations count:21 (2), effective:3 (0)

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

iterations count:13 (1), 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="ShieldRVt-PT-001A"
export BK_EXAMINATION="CTLCardinality"
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-001A, examination is CTLCardinality"
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-167905978600177"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-001A.tgz
mv ShieldRVt-PT-001A execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;