About the Execution of Marcie+red for ShieldRVt-PT-003A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5450.403 | 8352.00 | 12362.00 | 67.70 | TFFFTFTFTTTFTTTT | normal |
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-167905978600209.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-003A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978600209
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 7.3K Feb 25 23:03 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 25 23:03 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 23:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Feb 25 23:03 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 16K Feb 25 17:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:05 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 23:05 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Feb 25 23:04 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 23:04 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 8.8K 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-003A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-003A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679346324276
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-003A
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 21:05:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 21:05:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:05:26] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-20 21:05:26] [INFO ] Transformed 27 places.
[2023-03-20 21:05:26] [INFO ] Transformed 27 transitions.
[2023-03-20 21:05:26] [INFO ] Found NUPN structural information;
[2023-03-20 21:05:26] [INFO ] Parsed PT model containing 27 places and 27 transitions and 108 arcs in 89 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 1 transitions
Reduce redundant transitions removed 1 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldRVt-PT-003A-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003A-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 27 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 9 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
// Phase 1: matrix 26 rows 27 cols
[2023-03-20 21:05:26] [INFO ] Computed 13 place invariants in 6 ms
[2023-03-20 21:05:26] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-20 21:05:26] [INFO ] Invariant cache hit.
[2023-03-20 21:05:26] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 217 ms to find 0 implicit places.
[2023-03-20 21:05:26] [INFO ] Invariant cache hit.
[2023-03-20 21:05:26] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 269 ms. Remains : 27/27 places, 26/26 transitions.
Support contains 27 out of 27 places after structural reductions.
[2023-03-20 21:05:26] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 20 ms
[2023-03-20 21:05:26] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA ShieldRVt-PT-003A-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003A-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-003A-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 5 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 26 transitions.
Support contains 26 out of 27 places (down from 27) after GAL structural reductions.
Finished random walk after 250 steps, including 0 resets, run visited all 39 properties in 37 ms. (steps per millisecond=6 )
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 4 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 26 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 26/26 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 26 transition count 25
Applied a total of 2 rules in 8 ms. Remains 26 /27 variables (removed 1) and now considering 25/26 (removed 1) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 8 ms. Remains : 26/27 places, 25/26 transitions.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 3 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 2 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:26] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:26] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:27] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 8 ms
[2023-03-20 21:05:27] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:27] [INFO ] Input system was already deterministic with 26 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Reduce places removed 1 places and 1 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 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 24 transition count 24
Applied a total of 3 rules in 4 ms. Remains 24 /27 variables (removed 3) and now considering 24/26 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 24/27 places, 24/26 transitions.
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:27] [INFO ] Input system was already deterministic with 24 transitions.
Starting structural reductions in LTL mode, iteration 0 : 27/27 places, 26/26 transitions.
Applied a total of 0 rules in 0 ms. Remains 27 /27 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 27/27 places, 26/26 transitions.
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:27] [INFO ] Input system was already deterministic with 26 transitions.
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 2 ms
[2023-03-20 21:05:27] [INFO ] Flatten gal took : 1 ms
[2023-03-20 21:05:27] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-20 21:05:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 27 places, 26 transitions and 106 arcs took 0 ms.
Total runtime 893 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: 27 NrTr: 26 NrArc: 106)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.223sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 65 (6.5e+01) #states 8,193 (3)
starting MCC model checker
--------------------------
checking: EG [AF [[p20<=1 & 1<=p20]]]
normalized: EG [~ [EG [~ [[p20<=1 & 1<=p20]]]]]
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p20<=1)
states: 8,193 (3)
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [AG [[~ [[p4<=0 & 0<=p4]] & ~ [[p9<=1 & 1<=p9]]]]]
normalized: E [true U ~ [E [true U ~ [[~ [[p4<=0 & 0<=p4]] & ~ [[p9<=1 & 1<=p9]]]]]]]
abstracting: (1<=p9)
states: 4,096 (3)
abstracting: (p9<=1)
states: 8,193 (3)
abstracting: (0<=p4)
states: 8,193 (3)
abstracting: (p4<=0)
states: 4,097 (3)
-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [EF [EX [AX [[[p9<=0 & 0<=p9] | [p24<=1 & 1<=p24]]]]]]
normalized: ~ [E [true U ~ [E [true U EX [~ [EX [~ [[[p24<=1 & 1<=p24] | [p9<=0 & 0<=p9]]]]]]]]]]
abstracting: (0<=p9)
states: 8,193 (3)
abstracting: (p9<=0)
states: 4,097 (3)
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (p24<=1)
states: 8,193 (3)
..-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[~ [A [EF [[p7<=0 & 0<=p7]] U AG [[p7<=0 & 0<=p7]]]] | AF [[p5<=1 & 1<=p5]]]]
normalized: ~ [E [true U ~ [[~ [[~ [EG [E [true U ~ [[p7<=0 & 0<=p7]]]]] & ~ [E [E [true U ~ [[p7<=0 & 0<=p7]]] U [~ [E [true U [p7<=0 & 0<=p7]]] & E [true U ~ [[p7<=0 & 0<=p7]]]]]]]] | ~ [EG [~ [[p5<=1 & 1<=p5]]]]]]]]
abstracting: (1<=p5)
states: 4,096 (3)
abstracting: (p5<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (0<=p7)
states: 8,193 (3)
abstracting: (p7<=0)
states: 4,097 (3)
abstracting: (0<=p7)
states: 8,193 (3)
abstracting: (p7<=0)
states: 4,097 (3)
abstracting: (0<=p7)
states: 8,193 (3)
abstracting: (p7<=0)
states: 4,097 (3)
abstracting: (0<=p7)
states: 8,193 (3)
abstracting: (p7<=0)
states: 4,097 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: E [~ [[E [~ [A [[p5<=1 & 1<=p5] U [p13<=1 & 1<=p13]]] U [p3<=1 & 1<=p3]] & AF [~ [EF [[p2<=1 & 1<=p2]]]]]] U AX [1<=0]]
normalized: E [~ [[~ [EG [E [true U [p2<=1 & 1<=p2]]]] & E [~ [[~ [EG [~ [[p13<=1 & 1<=p13]]]] & ~ [E [~ [[p13<=1 & 1<=p13]] U [~ [[p5<=1 & 1<=p5]] & ~ [[p13<=1 & 1<=p13]]]]]]] U [p3<=1 & 1<=p3]]]] U ~ [EX [~ [1<=0]]]]
abstracting: (1<=0)
states: 0
.abstracting: (1<=p3)
states: 4,096 (3)
abstracting: (p3<=1)
states: 8,193 (3)
abstracting: (1<=p13)
states: 4,096 (3)
abstracting: (p13<=1)
states: 8,193 (3)
abstracting: (1<=p5)
states: 4,096 (3)
abstracting: (p5<=1)
states: 8,193 (3)
abstracting: (1<=p13)
states: 4,096 (3)
abstracting: (p13<=1)
states: 8,193 (3)
abstracting: (1<=p13)
states: 4,096 (3)
abstracting: (p13<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (1<=p2)
states: 4,096 (3)
abstracting: (p2<=1)
states: 8,193 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: ~ [E [[p10<=1 & 1<=p10] U ~ [EX [[[[p23<=0 & 0<=p23] | [p20<=1 & 1<=p20]] | [[p17<=0 & 0<=p17] | EF [[p23<=1 & 1<=p23]]]]]]]]
normalized: ~ [E [[p10<=1 & 1<=p10] U ~ [EX [[[[p23<=0 & 0<=p23] | [p20<=1 & 1<=p20]] | [E [true U [p23<=1 & 1<=p23]] | [p17<=0 & 0<=p17]]]]]]]
abstracting: (0<=p17)
states: 8,193 (3)
abstracting: (p17<=0)
states: 4,097 (3)
abstracting: (1<=p23)
states: 4,096 (3)
abstracting: (p23<=1)
states: 8,193 (3)
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (0<=p23)
states: 8,193 (3)
abstracting: (p23<=0)
states: 4,097 (3)
.abstracting: (1<=p10)
states: 4,096 (3)
abstracting: (p10<=1)
states: 8,193 (3)
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [[[p11<=0 & 0<=p11] & [[p6<=1 & 1<=p6] & E [[p18<=1 & 1<=p18] U A [[p25<=0 & 0<=p25] U EG [[[p4<=0 & 0<=p4] | [p3<=1 & 1<=p3]]]]]]]]
normalized: EX [[[E [[p18<=1 & 1<=p18] U [~ [E [~ [EG [[[p3<=1 & 1<=p3] | [p4<=0 & 0<=p4]]]] U [~ [[p25<=0 & 0<=p25]] & ~ [EG [[[p3<=1 & 1<=p3] | [p4<=0 & 0<=p4]]]]]]] & ~ [EG [~ [EG [[[p3<=1 & 1<=p3] | [p4<=0 & 0<=p4]]]]]]]] & [p6<=1 & 1<=p6]] & [p11<=0 & 0<=p11]]]
abstracting: (0<=p11)
states: 8,193 (3)
abstracting: (p11<=0)
states: 4,097 (3)
abstracting: (1<=p6)
states: 4,096 (3)
abstracting: (p6<=1)
states: 8,193 (3)
abstracting: (0<=p4)
states: 8,193 (3)
abstracting: (p4<=0)
states: 4,097 (3)
abstracting: (1<=p3)
states: 4,096 (3)
abstracting: (p3<=1)
states: 8,193 (3)
..
EG iterations: 2
.
EG iterations: 1
abstracting: (0<=p4)
states: 8,193 (3)
abstracting: (p4<=0)
states: 4,097 (3)
abstracting: (1<=p3)
states: 4,096 (3)
abstracting: (p3<=1)
states: 8,193 (3)
..
EG iterations: 2
abstracting: (0<=p25)
states: 8,193 (3)
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (0<=p4)
states: 8,193 (3)
abstracting: (p4<=0)
states: 4,097 (3)
abstracting: (1<=p3)
states: 4,096 (3)
abstracting: (p3<=1)
states: 8,193 (3)
..
EG iterations: 2
abstracting: (1<=p18)
states: 4,096 (3)
abstracting: (p18<=1)
states: 8,193 (3)
.-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EX [A [[[p17<=1 & 1<=p17] & E [[[~ [[[p16<=0 & 0<=p16] | [p5<=1 & 1<=p5]]] | [p2<=0 & 0<=p2]] | [[p0<=1 & 1<=p0] | [[p9<=0 & 0<=p9] | [p0<=1 & 1<=p0]]]] U [EG [[[p16<=0 & 0<=p16] | [p24<=1 & 1<=p24]]] & EF [[p2<=0 & 0<=p2]]]]] U EG [[p11<=1 & 1<=p11]]]]
normalized: EX [[~ [EG [~ [EG [[p11<=1 & 1<=p11]]]]] & ~ [E [~ [EG [[p11<=1 & 1<=p11]]] U [~ [EG [[p11<=1 & 1<=p11]]] & ~ [[E [[[~ [[[p16<=0 & 0<=p16] | [p5<=1 & 1<=p5]]] | [p2<=0 & 0<=p2]] | [[[p0<=1 & 1<=p0] | [p9<=0 & 0<=p9]] | [p0<=1 & 1<=p0]]] U [E [true U [p2<=0 & 0<=p2]] & EG [[[p24<=1 & 1<=p24] | [p16<=0 & 0<=p16]]]]] & [p17<=1 & 1<=p17]]]]]]]]
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (p17<=1)
states: 8,193 (3)
abstracting: (0<=p16)
states: 8,193 (3)
abstracting: (p16<=0)
states: 4,097 (3)
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (p24<=1)
states: 8,193 (3)
..........
EG iterations: 10
abstracting: (0<=p2)
states: 8,193 (3)
abstracting: (p2<=0)
states: 4,097 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,193 (3)
abstracting: (0<=p9)
states: 8,193 (3)
abstracting: (p9<=0)
states: 4,097 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,193 (3)
abstracting: (0<=p2)
states: 8,193 (3)
abstracting: (p2<=0)
states: 4,097 (3)
abstracting: (1<=p5)
states: 4,096 (3)
abstracting: (p5<=1)
states: 8,193 (3)
abstracting: (0<=p16)
states: 8,193 (3)
abstracting: (p16<=0)
states: 4,097 (3)
abstracting: (1<=p11)
states: 4,096 (3)
abstracting: (p11<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 4,096 (3)
abstracting: (p11<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (1<=p11)
states: 4,096 (3)
abstracting: (p11<=1)
states: 8,193 (3)
.
EG iterations: 1
.
EG iterations: 1
.-> the formula is FALSE
FORMULA ShieldRVt-PT-003A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EX [A [[EG [[EG [[p1<=1 & 1<=p1]] | [p25<=1 & 1<=p25]]] & ~ [[[p23<=1 & 1<=p23] | [[[p4<=0 & 0<=p4] | [p1<=1 & 1<=p1]] & [[[p8<=0 & 0<=p8] | [p14<=1 & 1<=p14]] & [[p8<=0 & 0<=p8] | [p3<=1 & 1<=p3]]]]]]] U [E [[[p19<=0 & 0<=p19] | [p1<=1 & 1<=p1]] U A [[p26<=1 & 1<=p26] U [p26<=1 & 1<=p26]]] & AX [EF [[p20<=0 & 0<=p20]]]]]]
normalized: EX [[~ [EG [~ [[~ [EX [~ [E [true U [p20<=0 & 0<=p20]]]]] & E [[[p1<=1 & 1<=p1] | [p19<=0 & 0<=p19]] U [~ [EG [~ [[p26<=1 & 1<=p26]]]] & ~ [E [~ [[p26<=1 & 1<=p26]] U [~ [[p26<=1 & 1<=p26]] & ~ [[p26<=1 & 1<=p26]]]]]]]]]]] & ~ [E [~ [[~ [EX [~ [E [true U [p20<=0 & 0<=p20]]]]] & E [[[p1<=1 & 1<=p1] | [p19<=0 & 0<=p19]] U [~ [EG [~ [[p26<=1 & 1<=p26]]]] & ~ [E [~ [[p26<=1 & 1<=p26]] U [~ [[p26<=1 & 1<=p26]] & ~ [[p26<=1 & 1<=p26]]]]]]]]] U [~ [[~ [[[[[[p14<=1 & 1<=p14] | [p8<=0 & 0<=p8]] & [[p3<=1 & 1<=p3] | [p8<=0 & 0<=p8]]] & [[p1<=1 & 1<=p1] | [p4<=0 & 0<=p4]]] | [p23<=1 & 1<=p23]]] & EG [[[p25<=1 & 1<=p25] | EG [[p1<=1 & 1<=p1]]]]]] & ~ [[~ [EX [~ [E [true U [p20<=0 & 0<=p20]]]]] & E [[[p1<=1 & 1<=p1] | [p19<=0 & 0<=p19]] U [~ [EG [~ [[p26<=1 & 1<=p26]]]] & ~ [E [~ [[p26<=1 & 1<=p26]] U [~ [[p26<=1 & 1<=p26]] & ~ [[p26<=1 & 1<=p26]]]]]]]]]]]]]]
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
....
EG iterations: 4
abstracting: (0<=p19)
states: 8,193 (3)
abstracting: (p19<=0)
states: 4,097 (3)
abstracting: (1<=p1)
states: 4,096 (3)
abstracting: (p1<=1)
states: 8,193 (3)
abstracting: (0<=p20)
states: 8,193 (3)
abstracting: (p20<=0)
states: 4,097 (3)
.abstracting: (1<=p1)
states: 4,096 (3)
abstracting: (p1<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (1<=p25)
states: 4,096 (3)
abstracting: (p25<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (1<=p23)
states: 4,096 (3)
abstracting: (p23<=1)
states: 8,193 (3)
abstracting: (0<=p4)
states: 8,193 (3)
abstracting: (p4<=0)
states: 4,097 (3)
abstracting: (1<=p1)
states: 4,096 (3)
abstracting: (p1<=1)
states: 8,193 (3)
abstracting: (0<=p8)
states: 8,193 (3)
abstracting: (p8<=0)
states: 4,097 (3)
abstracting: (1<=p3)
states: 4,096 (3)
abstracting: (p3<=1)
states: 8,193 (3)
abstracting: (0<=p8)
states: 8,193 (3)
abstracting: (p8<=0)
states: 4,097 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p14<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
....
EG iterations: 4
abstracting: (0<=p19)
states: 8,193 (3)
abstracting: (p19<=0)
states: 4,097 (3)
abstracting: (1<=p1)
states: 4,096 (3)
abstracting: (p1<=1)
states: 8,193 (3)
abstracting: (0<=p20)
states: 8,193 (3)
abstracting: (p20<=0)
states: 4,097 (3)
.abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
abstracting: (1<=p26)
states: 4,096 (3)
abstracting: (p26<=1)
states: 8,193 (3)
....
EG iterations: 4
abstracting: (0<=p19)
states: 8,193 (3)
abstracting: (p19<=0)
states: 4,097 (3)
abstracting: (1<=p1)
states: 4,096 (3)
abstracting: (p1<=1)
states: 8,193 (3)
abstracting: (0<=p20)
states: 8,193 (3)
abstracting: (p20<=0)
states: 4,097 (3)
......
EG iterations: 5
.-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: [AX [EG [AG [[p2<=1 & 1<=p2]]]] | [E [E [~ [[p6<=1 & 1<=p6]] U [~ [[[p24<=1 & 1<=p24] | [p9<=1 & 1<=p9]]] | ~ [A [[p11<=1 & 1<=p11] U [[p3<=0 & 0<=p3] | [p12<=1 & 1<=p12]]]]]] U ~ [EF [[p20<=1 & 1<=p20]]]] | AF [AX [[[[[[p7<=0 & 0<=p7] & [p14<=0 & 0<=p14]] & [[p15<=1 & 1<=p15] & [p20<=0 & 0<=p20]]] | [p0<=1 & 1<=p0]] | [EF [[p26<=0 & 0<=p26]] | [p24<=1 & 1<=p24]]]]]]]
normalized: [[E [E [~ [[p6<=1 & 1<=p6]] U [~ [[~ [EG [~ [[[p12<=1 & 1<=p12] | [p3<=0 & 0<=p3]]]]] & ~ [E [~ [[[p12<=1 & 1<=p12] | [p3<=0 & 0<=p3]]] U [~ [[p11<=1 & 1<=p11]] & ~ [[[p12<=1 & 1<=p12] | [p3<=0 & 0<=p3]]]]]]]] | ~ [[[p9<=1 & 1<=p9] | [p24<=1 & 1<=p24]]]]] U ~ [E [true U [p20<=1 & 1<=p20]]]] | ~ [EG [EX [~ [[[[p24<=1 & 1<=p24] | E [true U [p26<=0 & 0<=p26]]] | [[p0<=1 & 1<=p0] | [[[p20<=0 & 0<=p20] & [p15<=1 & 1<=p15]] & [[p14<=0 & 0<=p14] & [p7<=0 & 0<=p7]]]]]]]]]] | ~ [EX [~ [EG [~ [E [true U ~ [[p2<=1 & 1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 4,096 (3)
abstracting: (p2<=1)
states: 8,193 (3)
.
EG iterations: 1
.abstracting: (0<=p7)
states: 8,193 (3)
abstracting: (p7<=0)
states: 4,097 (3)
abstracting: (0<=p14)
states: 8,193 (3)
abstracting: (p14<=0)
states: 4,097 (3)
abstracting: (1<=p15)
states: 4,096 (3)
abstracting: (p15<=1)
states: 8,193 (3)
abstracting: (0<=p20)
states: 8,193 (3)
abstracting: (p20<=0)
states: 4,097 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p0<=1)
states: 8,193 (3)
abstracting: (0<=p26)
states: 8,193 (3)
abstracting: (p26<=0)
states: 4,097 (3)
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (p24<=1)
states: 8,193 (3)
..
EG iterations: 1
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (1<=p24)
states: 4,096 (3)
abstracting: (p24<=1)
states: 8,193 (3)
abstracting: (1<=p9)
states: 4,096 (3)
abstracting: (p9<=1)
states: 8,193 (3)
abstracting: (0<=p3)
states: 8,193 (3)
abstracting: (p3<=0)
states: 4,097 (3)
abstracting: (1<=p12)
states: 4,096 (3)
abstracting: (p12<=1)
states: 8,193 (3)
abstracting: (1<=p11)
states: 4,096 (3)
abstracting: (p11<=1)
states: 8,193 (3)
abstracting: (0<=p3)
states: 8,193 (3)
abstracting: (p3<=0)
states: 4,097 (3)
abstracting: (1<=p12)
states: 4,096 (3)
abstracting: (p12<=1)
states: 8,193 (3)
abstracting: (0<=p3)
states: 8,193 (3)
abstracting: (p3<=0)
states: 4,097 (3)
abstracting: (1<=p12)
states: 4,096 (3)
abstracting: (p12<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (1<=p6)
states: 4,096 (3)
abstracting: (p6<=1)
states: 8,193 (3)
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: A [E [AF [[p9<=1 & 1<=p9]] U [p25<=1 & 1<=p25]] U [AX [AF [[[p25<=0 & 0<=p25] | [p22<=0 & 0<=p22]]]] | [[[p6<=0 & 0<=p6] | [p14<=1 & 1<=p14]] & [E [[[[p1<=0 & 0<=p1] | [p22<=1 & 1<=p22]] & ~ [[p20<=1 & 1<=p20]]] U [AX [[p15<=0 & 0<=p15]] & EX [[p9<=0 & 0<=p9]]]] | [EF [~ [[[p1<=0 & 0<=p1] | [p14<=1 & 1<=p14]]]] & E [[p15<=1 & 1<=p15] U [p17<=1 & 1<=p17]]]]]]]
normalized: [~ [EG [~ [[[[[E [[p15<=1 & 1<=p15] U [p17<=1 & 1<=p17]] & E [true U ~ [[[p14<=1 & 1<=p14] | [p1<=0 & 0<=p1]]]]] | E [[~ [[p20<=1 & 1<=p20]] & [[p22<=1 & 1<=p22] | [p1<=0 & 0<=p1]]] U [EX [[p9<=0 & 0<=p9]] & ~ [EX [~ [[p15<=0 & 0<=p15]]]]]]] & [[p14<=1 & 1<=p14] | [p6<=0 & 0<=p6]]] | ~ [EX [EG [~ [[[p22<=0 & 0<=p22] | [p25<=0 & 0<=p25]]]]]]]]]] & ~ [E [~ [[[[[E [[p15<=1 & 1<=p15] U [p17<=1 & 1<=p17]] & E [true U ~ [[[p14<=1 & 1<=p14] | [p1<=0 & 0<=p1]]]]] | E [[~ [[p20<=1 & 1<=p20]] & [[p22<=1 & 1<=p22] | [p1<=0 & 0<=p1]]] U [EX [[p9<=0 & 0<=p9]] & ~ [EX [~ [[p15<=0 & 0<=p15]]]]]]] & [[p14<=1 & 1<=p14] | [p6<=0 & 0<=p6]]] | ~ [EX [EG [~ [[[p22<=0 & 0<=p22] | [p25<=0 & 0<=p25]]]]]]]] U [~ [E [~ [EG [~ [[p9<=1 & 1<=p9]]]] U [p25<=1 & 1<=p25]]] & ~ [[[[[E [[p15<=1 & 1<=p15] U [p17<=1 & 1<=p17]] & E [true U ~ [[[p14<=1 & 1<=p14] | [p1<=0 & 0<=p1]]]]] | E [[~ [[p20<=1 & 1<=p20]] & [[p22<=1 & 1<=p22] | [p1<=0 & 0<=p1]]] U [EX [[p9<=0 & 0<=p9]] & ~ [EX [~ [[p15<=0 & 0<=p15]]]]]]] & [[p14<=1 & 1<=p14] | [p6<=0 & 0<=p6]]] | ~ [EX [EG [~ [[[p22<=0 & 0<=p22] | [p25<=0 & 0<=p25]]]]]]]]]]]]
abstracting: (0<=p25)
states: 8,193 (3)
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (0<=p22)
states: 8,193 (3)
abstracting: (p22<=0)
states: 4,097 (3)
....
EG iterations: 4
.abstracting: (0<=p6)
states: 8,193 (3)
abstracting: (p6<=0)
states: 4,097 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p14<=1)
states: 8,193 (3)
abstracting: (0<=p15)
states: 8,193 (3)
abstracting: (p15<=0)
states: 4,097 (3)
.abstracting: (0<=p9)
states: 8,193 (3)
abstracting: (p9<=0)
states: 4,097 (3)
.abstracting: (0<=p1)
states: 8,193 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p22)
states: 4,096 (3)
abstracting: (p22<=1)
states: 8,193 (3)
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (0<=p1)
states: 8,193 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p14<=1)
states: 8,193 (3)
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (p17<=1)
states: 8,193 (3)
abstracting: (1<=p15)
states: 4,096 (3)
abstracting: (p15<=1)
states: 8,193 (3)
abstracting: (1<=p25)
states: 4,096 (3)
abstracting: (p25<=1)
states: 8,193 (3)
abstracting: (1<=p9)
states: 4,096 (3)
abstracting: (p9<=1)
states: 8,193 (3)
.
EG iterations: 1
abstracting: (0<=p25)
states: 8,193 (3)
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (0<=p22)
states: 8,193 (3)
abstracting: (p22<=0)
states: 4,097 (3)
....
EG iterations: 4
.abstracting: (0<=p6)
states: 8,193 (3)
abstracting: (p6<=0)
states: 4,097 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p14<=1)
states: 8,193 (3)
abstracting: (0<=p15)
states: 8,193 (3)
abstracting: (p15<=0)
states: 4,097 (3)
.abstracting: (0<=p9)
states: 8,193 (3)
abstracting: (p9<=0)
states: 4,097 (3)
.abstracting: (0<=p1)
states: 8,193 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p22)
states: 4,096 (3)
abstracting: (p22<=1)
states: 8,193 (3)
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (0<=p1)
states: 8,193 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p14<=1)
states: 8,193 (3)
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (p17<=1)
states: 8,193 (3)
abstracting: (1<=p15)
states: 4,096 (3)
abstracting: (p15<=1)
states: 8,193 (3)
abstracting: (0<=p25)
states: 8,193 (3)
abstracting: (p25<=0)
states: 4,097 (3)
abstracting: (0<=p22)
states: 8,193 (3)
abstracting: (p22<=0)
states: 4,097 (3)
....
EG iterations: 4
.abstracting: (0<=p6)
states: 8,193 (3)
abstracting: (p6<=0)
states: 4,097 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p14<=1)
states: 8,193 (3)
abstracting: (0<=p15)
states: 8,193 (3)
abstracting: (p15<=0)
states: 4,097 (3)
.abstracting: (0<=p9)
states: 8,193 (3)
abstracting: (p9<=0)
states: 4,097 (3)
.abstracting: (0<=p1)
states: 8,193 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p22)
states: 4,096 (3)
abstracting: (p22<=1)
states: 8,193 (3)
abstracting: (1<=p20)
states: 4,096 (3)
abstracting: (p20<=1)
states: 8,193 (3)
abstracting: (0<=p1)
states: 8,193 (3)
abstracting: (p1<=0)
states: 4,097 (3)
abstracting: (1<=p14)
states: 4,096 (3)
abstracting: (p14<=1)
states: 8,193 (3)
abstracting: (1<=p17)
states: 4,096 (3)
abstracting: (p17<=1)
states: 8,193 (3)
abstracting: (1<=p15)
states: 4,096 (3)
abstracting: (p15<=1)
states: 8,193 (3)
......
EG iterations: 6
-> the formula is TRUE
FORMULA ShieldRVt-PT-003A-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
totally nodes used: 17118 (1.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 20734 51274 72008
used/not used/entry size/cache size: 67099 67041765 16 1024MB
basic ops cache: hits/miss/sum: 8180 15221 23401
used/not used/entry size/cache size: 28195 16749021 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: 466 586 1052
used/not used/entry size/cache size: 586 8388022 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 67091805
1 17000
2 59
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.350sec
BK_STOP 1679346332628
--------------------
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:522 (20), effective:110 (4)
initing FirstDep: 0m 0.000sec
iterations count:89 (3), effective:12 (0)
iterations count:35 (1), effective:3 (0)
iterations count:130 (5), effective:17 (0)
iterations count:29 (1), effective:2 (0)
iterations count:130 (5), effective:17 (0)
iterations count:130 (5), effective:17 (0)
iterations count:28 (1), effective:1 (0)
iterations count:104 (4), effective:13 (0)
iterations count:122 (4), effective:16 (0)
iterations count:67 (2), effective:5 (0)
iterations count:116 (4), effective:17 (0)
iterations count:62 (2), effective:8 (0)
iterations count:36 (1), effective:3 (0)
iterations count:117 (4), effective:16 (0)
iterations count:56 (2), effective:11 (0)
iterations count:26 (1), effective:0 (0)
iterations count:93 (3), effective:13 (0)
iterations count:135 (5), effective:23 (0)
iterations count:26 (1), effective:0 (0)
iterations count:93 (3), effective:13 (0)
iterations count:135 (5), effective:23 (0)
iterations count:64 (2), effective:10 (0)
iterations count:26 (1), effective:0 (0)
iterations count:93 (3), effective:13 (0)
iterations count:135 (5), effective:23 (0)
iterations count:36 (1), effective:3 (0)
iterations count:106 (4), effective:17 (0)
iterations count:49 (1), effective:2 (0)
iterations count:100 (3), effective:19 (0)
iterations count:101 (3), effective:18 (0)
iterations count:126 (4), effective:18 (0)
iterations count:55 (2), effective:7 (0)
iterations count:94 (3), effective:16 (0)
iterations count:101 (3), effective:18 (0)
iterations count:126 (4), effective:18 (0)
iterations count:55 (2), effective:7 (0)
iterations count:32 (1), effective:2 (0)
iterations count:101 (3), effective:18 (0)
iterations count:126 (4), effective:18 (0)
iterations count:55 (2), effective:7 (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-003A"
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-003A, 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-167905978600209"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-003A.tgz
mv ShieldRVt-PT-003A 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 '
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 ;