About the Execution of Marcie for ShieldRVt-PT-004A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5446.968 | 5632.00 | 5061.00 | 0.00 | FTTTFFFTFTTFFFTF | 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.r417-tajo-167905972000225.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 marcie
Input is ShieldRVt-PT-004A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r417-tajo-167905972000225
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.7K Feb 25 23:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 23:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 23:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Feb 25 23:15 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.5K Feb 25 17:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 14K Feb 25 23:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Feb 25 23:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 25 23:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 23:17 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 12K 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-004A-CTLCardinality-00
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-01
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-02
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-03
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-04
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-05
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-06
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-07
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-08
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-09
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-10
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-11
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-12
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-13
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-14
FORMULA_NAME ShieldRVt-PT-004A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679069059132
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=marcie
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-004A
Not applying reductions.
Model is PT
CTLCardinality PT
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//../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: ShieldRVt_PT_004A
(NrP: 35 NrTr: 35 NrArc: 142)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.298sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 85 (8.5e+01) #states 131,073 (5)
starting MCC model checker
--------------------------
checking: ~ [AF [AG [AF [EX [p19<=1]]]]]
normalized: EG [E [true U EG [~ [EX [p19<=1]]]]]
abstracting: (p19<=1)
states: 131,073 (5)
..
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: [EG [EX [~ [p29<=p25]]] | AG [AG [[EF [AF [p31<=0]] | 1<=p19]]]]
normalized: [~ [E [true U E [true U ~ [[E [true U ~ [EG [~ [p31<=0]]]] | 1<=p19]]]]] | EG [EX [~ [p29<=p25]]]]
abstracting: (p29<=p25)
states: 98,305 (4)
..
EG iterations: 1
abstracting: (1<=p19)
states: 65,536 (4)
abstracting: (p31<=0)
states: 65,537 (4)
..........
EG iterations: 10
-> the formula is TRUE
FORMULA ShieldRVt-PT-004A-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EG [AG [~ [E [p17<=p34 U EF [p29<=p5]]]]]
normalized: EG [~ [E [true U E [p17<=p34 U E [true U p29<=p5]]]]]
abstracting: (p29<=p5)
states: 98,305 (4)
abstracting: (p17<=p34)
states: 98,305 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [AG [[EX [[AF [p9<=p23] | EF [p4<=p24]]] & p10<=1]]]
normalized: E [true U ~ [[EX [[E [true U p4<=p24] | ~ [EG [~ [p9<=p23]]]]] & p10<=1]]]
abstracting: (p10<=1)
states: 131,073 (5)
abstracting: (p9<=p23)
states: 98,305 (4)
.
EG iterations: 1
abstracting: (p4<=p24)
states: 98,305 (4)
.-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EG [~ [E [[EG [p34<=p1] & ~ [p22<=p13]] U p7<=p11]]]
normalized: EG [~ [E [[~ [p22<=p13] & EG [p34<=p1]] U p7<=p11]]]
abstracting: (p7<=p11)
states: 98,305 (4)
abstracting: (p34<=p1)
states: 98,305 (4)
.
EG iterations: 1
abstracting: (p22<=p13)
states: 98,305 (4)
.........
EG iterations: 9
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: AG [[[~ [[p15<=p31 & ~ [1<=p29]]] & [AF [AG [p32<=p12]] | 1<=p31]] | ~ [AG [~ [AX [p34<=p30]]]]]]
normalized: ~ [E [true U ~ [[E [true U ~ [EX [~ [p34<=p30]]]] | [[~ [EG [E [true U ~ [p32<=p12]]]] | 1<=p31] & ~ [[~ [1<=p29] & p15<=p31]]]]]]]
abstracting: (p15<=p31)
states: 98,305 (4)
abstracting: (1<=p29)
states: 65,536 (4)
abstracting: (1<=p31)
states: 65,536 (4)
abstracting: (p32<=p12)
states: 98,305 (4)
EG iterations: 0
abstracting: (p34<=p30)
states: 98,305 (4)
.-> the formula is TRUE
FORMULA ShieldRVt-PT-004A-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [~ [EX [AF [[p15<=p20 | [1<=p15 | [p10<=1 & p20<=p34]]]]]] & EG [[p0<=1 & ~ [p30<=p9]]]]
normalized: [EG [[~ [p30<=p9] & p0<=1]] & ~ [EX [~ [EG [~ [[[[p10<=1 & p20<=p34] | 1<=p15] | p15<=p20]]]]]]]
abstracting: (p15<=p20)
states: 98,305 (4)
abstracting: (1<=p15)
states: 65,536 (4)
abstracting: (p20<=p34)
states: 98,305 (4)
abstracting: (p10<=1)
states: 131,073 (5)
.
EG iterations: 1
.abstracting: (p0<=1)
states: 131,073 (5)
abstracting: (p30<=p9)
states: 98,305 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [AG [~ [[[[[p27<=1 & 1<=p26] & ~ [p17<=1]] | [[p26<=p30 | 1<=p23] & A [p34<=p2 U p30<=p27]]] & ~ [AG [1<=p27]]]]]]
normalized: E [true U ~ [E [true U [E [true U ~ [1<=p27]] & [[[~ [EG [~ [p30<=p27]]] & ~ [E [~ [p30<=p27] U [~ [p34<=p2] & ~ [p30<=p27]]]]] & [p26<=p30 | 1<=p23]] | [~ [p17<=1] & [p27<=1 & 1<=p26]]]]]]]
abstracting: (1<=p26)
states: 65,536 (4)
abstracting: (p27<=1)
states: 131,073 (5)
abstracting: (p17<=1)
states: 131,073 (5)
abstracting: (1<=p23)
states: 65,536 (4)
abstracting: (p26<=p30)
states: 98,305 (4)
abstracting: (p30<=p27)
states: 98,305 (4)
abstracting: (p34<=p2)
states: 98,305 (4)
abstracting: (p30<=p27)
states: 98,305 (4)
abstracting: (p30<=p27)
states: 98,305 (4)
.
EG iterations: 1
abstracting: (1<=p27)
states: 65,536 (4)
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [A [AF [AX [~ [1<=p17]]] U [AG [[p9<=p4 | EX [1<=p27]]] & [~ [EF [p12<=p25]] | [[A [p10<=0 U p18<=0] | [1<=p15 & 1<=p10]] & AF [1<=p31]]]]]]
normalized: E [true U [~ [EG [~ [[[[~ [EG [~ [1<=p31]]] & [[1<=p15 & 1<=p10] | [~ [EG [~ [p18<=0]]] & ~ [E [~ [p18<=0] U [~ [p10<=0] & ~ [p18<=0]]]]]]] | ~ [E [true U p12<=p25]]] & ~ [E [true U ~ [[EX [1<=p27] | p9<=p4]]]]]]]] & ~ [E [~ [[[[~ [EG [~ [1<=p31]]] & [[1<=p15 & 1<=p10] | [~ [EG [~ [p18<=0]]] & ~ [E [~ [p18<=0] U [~ [p10<=0] & ~ [p18<=0]]]]]]] | ~ [E [true U p12<=p25]]] & ~ [E [true U ~ [[EX [1<=p27] | p9<=p4]]]]]] U [EG [EX [1<=p17]] & ~ [[[[~ [EG [~ [1<=p31]]] & [[1<=p15 & 1<=p10] | [~ [EG [~ [p18<=0]]] & ~ [E [~ [p18<=0] U [~ [p10<=0] & ~ [p18<=0]]]]]]] | ~ [E [true U p12<=p25]]] & ~ [E [true U ~ [[EX [1<=p27] | p9<=p4]]]]]]]]]]]
abstracting: (p9<=p4)
states: 98,305 (4)
abstracting: (1<=p27)
states: 65,536 (4)
.abstracting: (p12<=p25)
states: 98,305 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (p10<=0)
states: 65,537 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (p18<=0)
states: 65,537 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 65,536 (4)
abstracting: (1<=p15)
states: 65,536 (4)
abstracting: (1<=p31)
states: 65,536 (4)
..........
EG iterations: 10
abstracting: (1<=p17)
states: 65,536 (4)
..
EG iterations: 1
abstracting: (p9<=p4)
states: 98,305 (4)
abstracting: (1<=p27)
states: 65,536 (4)
.abstracting: (p12<=p25)
states: 98,305 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (p10<=0)
states: 65,537 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (p18<=0)
states: 65,537 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 65,536 (4)
abstracting: (1<=p15)
states: 65,536 (4)
abstracting: (1<=p31)
states: 65,536 (4)
..........
EG iterations: 10
abstracting: (p9<=p4)
states: 98,305 (4)
abstracting: (1<=p27)
states: 65,536 (4)
.abstracting: (p12<=p25)
states: 98,305 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (p10<=0)
states: 65,537 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (p18<=0)
states: 65,537 (4)
.
EG iterations: 1
abstracting: (1<=p10)
states: 65,536 (4)
abstracting: (1<=p15)
states: 65,536 (4)
abstracting: (1<=p31)
states: 65,536 (4)
..........
EG iterations: 10
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: [E [EG [~ [1<=p33]] U AG [AX [EF [p34<=0]]]] | AG [[[[[AG [1<=p6] | AG [1<=p4]] & AX [p17<=p9]] & [p1<=1 & [p24<=1 & AF [1<=p21]]]] | AF [~ [[AF [1<=p27] | p12<=1]]]]]]
normalized: [~ [E [true U ~ [[[[[~ [E [true U ~ [1<=p6]]] | ~ [E [true U ~ [1<=p4]]]] & ~ [EX [~ [p17<=p9]]]] & [[~ [EG [~ [1<=p21]]] & p24<=1] & p1<=1]] | ~ [EG [[~ [EG [~ [1<=p27]]] | p12<=1]]]]]]] | E [EG [~ [1<=p33]] U ~ [E [true U EX [~ [E [true U p34<=0]]]]]]]
abstracting: (p34<=0)
states: 65,537 (4)
.abstracting: (1<=p33)
states: 65,536 (4)
....
EG iterations: 4
abstracting: (p12<=1)
states: 131,073 (5)
abstracting: (1<=p27)
states: 65,536 (4)
.
EG iterations: 1
EG iterations: 0
abstracting: (p1<=1)
states: 131,073 (5)
abstracting: (p24<=1)
states: 131,073 (5)
abstracting: (1<=p21)
states: 65,536 (4)
.
EG iterations: 1
abstracting: (p17<=p9)
states: 98,305 (4)
.abstracting: (1<=p4)
states: 65,536 (4)
abstracting: (1<=p6)
states: 65,536 (4)
-> the formula is TRUE
FORMULA ShieldRVt-PT-004A-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: [E [[[1<=p12 & ~ [[[[p11<=1 | p10<=0] | AG [1<=p23]] & ~ [p19<=1]]]] & A [~ [[EF [p16<=p5] | ~ [p1<=p7]]] U AF [~ [p13<=1]]]] U 1<=p26] | AG [p22<=1]]
normalized: [~ [E [true U ~ [p22<=1]]] | E [[[~ [EG [EG [p13<=1]]] & ~ [E [EG [p13<=1] U [[~ [p1<=p7] | E [true U p16<=p5]] & EG [p13<=1]]]]] & [~ [[~ [p19<=1] & [~ [E [true U ~ [1<=p23]]] | [p11<=1 | p10<=0]]]] & 1<=p12]] U 1<=p26]]
abstracting: (1<=p26)
states: 65,536 (4)
abstracting: (1<=p12)
states: 65,536 (4)
abstracting: (p10<=0)
states: 65,537 (4)
abstracting: (p11<=1)
states: 131,073 (5)
abstracting: (1<=p23)
states: 65,536 (4)
abstracting: (p19<=1)
states: 131,073 (5)
abstracting: (p13<=1)
states: 131,073 (5)
EG iterations: 0
abstracting: (p16<=p5)
states: 98,305 (4)
abstracting: (p1<=p7)
states: 98,305 (4)
abstracting: (p13<=1)
states: 131,073 (5)
EG iterations: 0
abstracting: (p13<=1)
states: 131,073 (5)
EG iterations: 0
EG iterations: 0
abstracting: (p22<=1)
states: 131,073 (5)
-> the formula is TRUE
FORMULA ShieldRVt-PT-004A-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [A [[[AG [~ [1<=p11]] | 1<=p20] | [p22<=p19 | p4<=p6]] U EX [[AG [p7<=p28] | [AG [p15<=1] | [p3<=p17 & 1<=p0]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [[[[p3<=p17 & 1<=p0] | ~ [E [true U ~ [p15<=1]]]] | ~ [E [true U ~ [p7<=p28]]]]]]]] & ~ [E [~ [EX [[[[p3<=p17 & 1<=p0] | ~ [E [true U ~ [p15<=1]]]] | ~ [E [true U ~ [p7<=p28]]]]]] U [~ [[[p22<=p19 | p4<=p6] | [~ [E [true U 1<=p11]] | 1<=p20]]] & ~ [EX [[[[p3<=p17 & 1<=p0] | ~ [E [true U ~ [p15<=1]]]] | ~ [E [true U ~ [p7<=p28]]]]]]]]]]]]]
abstracting: (p7<=p28)
states: 98,305 (4)
abstracting: (p15<=1)
states: 131,073 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p3<=p17)
states: 98,305 (4)
.abstracting: (1<=p20)
states: 65,536 (4)
abstracting: (1<=p11)
states: 65,536 (4)
abstracting: (p4<=p6)
states: 98,305 (4)
abstracting: (p22<=p19)
states: 98,305 (4)
abstracting: (p7<=p28)
states: 98,305 (4)
abstracting: (p15<=1)
states: 131,073 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p3<=p17)
states: 98,305 (4)
.abstracting: (p7<=p28)
states: 98,305 (4)
abstracting: (p15<=1)
states: 131,073 (5)
abstracting: (1<=p0)
states: 1
abstracting: (p3<=p17)
states: 98,305 (4)
..
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-004A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [[[AG [EF [EX [p1<=1]]] & p16<=p34] | [AG [[[EG [1<=p8] | ~ [p34<=0]] & ~ [[p26<=p7 & p7<=p7]]]] | A [[~ [EX [p2<=p6]] | ~ [p25<=0]] U EF [[p18<=0 & 1<=p14]]]]]]
normalized: ~ [E [true U ~ [[[[~ [EG [~ [E [true U [p18<=0 & 1<=p14]]]]] & ~ [E [~ [E [true U [p18<=0 & 1<=p14]]] U [~ [[~ [p25<=0] | ~ [EX [p2<=p6]]]] & ~ [E [true U [p18<=0 & 1<=p14]]]]]]] | ~ [E [true U ~ [[~ [[p26<=p7 & p7<=p7]] & [~ [p34<=0] | EG [1<=p8]]]]]]] | [p16<=p34 & ~ [E [true U ~ [E [true U EX [p1<=1]]]]]]]]]]
abstracting: (p1<=1)
states: 131,073 (5)
.abstracting: (p16<=p34)
states: 98,305 (4)
abstracting: (1<=p8)
states: 65,536 (4)
.
EG iterations: 1
abstracting: (p34<=0)
states: 65,537 (4)
abstracting: (p7<=p7)
states: 131,073 (5)
abstracting: (p26<=p7)
states: 98,305 (4)
abstracting: (1<=p14)
states: 65,536 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (p2<=p6)
states: 98,305 (4)
.abstracting: (p25<=0)
states: 65,537 (4)
abstracting: (1<=p14)
states: 65,536 (4)
abstracting: (p18<=0)
states: 65,537 (4)
abstracting: (1<=p14)
states: 65,536 (4)
abstracting: (p18<=0)
states: 65,537 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldRVt-PT-004A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: ~ [AG [[[AG [[~ [p2<=1] | E [1<=p12 U p10<=p12]]] | EF [[[p1<=0 & p2<=0] | EF [p28<=0]]]] | [[AG [EF [1<=p20]] & [AX [p1<=p6] & ~ [p23<=p32]]] & p31<=p23]]]]
normalized: E [true U ~ [[[[[~ [p23<=p32] & ~ [EX [~ [p1<=p6]]]] & ~ [E [true U ~ [E [true U 1<=p20]]]]] & p31<=p23] | [E [true U [E [true U p28<=0] | [p1<=0 & p2<=0]]] | ~ [E [true U ~ [[E [1<=p12 U p10<=p12] | ~ [p2<=1]]]]]]]]]
abstracting: (p2<=1)
states: 131,073 (5)
abstracting: (p10<=p12)
states: 98,305 (4)
abstracting: (1<=p12)
states: 65,536 (4)
abstracting: (p2<=0)
states: 65,537 (4)
abstracting: (p1<=0)
states: 65,537 (4)
abstracting: (p28<=0)
states: 65,537 (4)
abstracting: (p31<=p23)
states: 98,305 (4)
abstracting: (1<=p20)
states: 65,536 (4)
abstracting: (p1<=p6)
states: 98,305 (4)
.abstracting: (p23<=p32)
states: 98,305 (4)
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AF [[[AG [~ [[[p1<=p2 | p28<=1] & ~ [p20<=p26]]]] & ~ [AX [A [p28<=p32 U 1<=p25]]]] & A [[~ [EG [p18<=p27]] & [AG [p25<=1] & ~ [EX [p17<=p0]]]] U ~ [E [~ [p28<=1] U EX [1<=p21]]]]]]
normalized: ~ [EG [~ [[[~ [EG [E [~ [p28<=1] U EX [1<=p21]]]] & ~ [E [E [~ [p28<=1] U EX [1<=p21]] U [~ [[[~ [EX [p17<=p0]] & ~ [E [true U ~ [p25<=1]]]] & ~ [EG [p18<=p27]]]] & E [~ [p28<=1] U EX [1<=p21]]]]]] & [EX [~ [[~ [EG [~ [1<=p25]]] & ~ [E [~ [1<=p25] U [~ [p28<=p32] & ~ [1<=p25]]]]]]] & ~ [E [true U [~ [p20<=p26] & [p1<=p2 | p28<=1]]]]]]]]]
abstracting: (p28<=1)
states: 131,073 (5)
abstracting: (p1<=p2)
states: 65,537 (4)
abstracting: (p20<=p26)
states: 98,305 (4)
abstracting: (1<=p25)
states: 65,536 (4)
abstracting: (p28<=p32)
states: 98,305 (4)
abstracting: (1<=p25)
states: 65,536 (4)
abstracting: (1<=p25)
states: 65,536 (4)
.
EG iterations: 1
.abstracting: (1<=p21)
states: 65,536 (4)
.abstracting: (p28<=1)
states: 131,073 (5)
abstracting: (p18<=p27)
states: 98,305 (4)
..
EG iterations: 2
abstracting: (p25<=1)
states: 131,073 (5)
abstracting: (p17<=p0)
states: 65,537 (4)
.abstracting: (1<=p21)
states: 65,536 (4)
.abstracting: (p28<=1)
states: 131,073 (5)
abstracting: (1<=p21)
states: 65,536 (4)
.abstracting: (p28<=1)
states: 131,073 (5)
.
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldRVt-PT-004A-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: [AG [~ [1<=p34]] | [[~ [AG [~ [EG [p22<=1]]]] | AX [p7<=p14]] | E [[[[[~ [1<=p23] | AG [1<=p7]] | [[1<=p15 & p28<=p12] | E [p9<=1 U p8<=p8]]] & AF [AG [p20<=0]]] & EF [[AX [p23<=0] & AX [p16<=1]]]] U p30<=p0]]]
normalized: [[E [[E [true U [~ [EX [~ [p16<=1]]] & ~ [EX [~ [p23<=0]]]]] & [~ [EG [E [true U ~ [p20<=0]]]] & [[E [p9<=1 U p8<=p8] | [1<=p15 & p28<=p12]] | [~ [E [true U ~ [1<=p7]]] | ~ [1<=p23]]]]] U p30<=p0] | [~ [EX [~ [p7<=p14]]] | E [true U EG [p22<=1]]]] | ~ [E [true U 1<=p34]]]
abstracting: (1<=p34)
states: 65,536 (4)
abstracting: (p22<=1)
states: 131,073 (5)
EG iterations: 0
abstracting: (p7<=p14)
states: 98,305 (4)
.abstracting: (p30<=p0)
states: 65,537 (4)
abstracting: (1<=p23)
states: 65,536 (4)
abstracting: (1<=p7)
states: 65,536 (4)
abstracting: (p28<=p12)
states: 98,305 (4)
abstracting: (1<=p15)
states: 65,536 (4)
abstracting: (p8<=p8)
states: 131,073 (5)
abstracting: (p9<=1)
states: 131,073 (5)
abstracting: (p20<=0)
states: 65,537 (4)
EG iterations: 0
abstracting: (p23<=0)
states: 65,537 (4)
.abstracting: (p16<=1)
states: 131,073 (5)
.-> the formula is TRUE
FORMULA ShieldRVt-PT-004A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
totally nodes used: 24169 (2.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 34794 81614 116408
used/not used/entry size/cache size: 104031 67004833 16 1024MB
basic ops cache: hits/miss/sum: 10448 18981 29429
used/not used/entry size/cache size: 34701 16742515 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: 691 1467 2158
used/not used/entry size/cache size: 1467 8387141 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 67084837
1 23885
2 142
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.567sec
BK_STOP 1679069064764
--------------------
content from stderr:
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:767 (21), effective:163 (4)
initing FirstDep: 0m 0.000sec
iterations count:102 (2), effective:25 (0)
iterations count:127 (3), effective:19 (0)
iterations count:35 (1), effective:0 (0)
iterations count:35 (1), effective:0 (0)
iterations count:82 (2), effective:10 (0)
iterations count:38 (1), effective:2 (0)
iterations count:176 (5), effective:28 (0)
iterations count:146 (4), effective:38 (1)
iterations count:47 (1), effective:4 (0)
iterations count:39 (1), effective:1 (0)
iterations count:158 (4), effective:29 (0)
iterations count:215 (6), effective:32 (0)
iterations count:115 (3), effective:17 (0)
iterations count:36 (1), effective:1 (0)
iterations count:215 (6), effective:32 (0)
iterations count:115 (3), effective:17 (0)
iterations count:36 (1), effective:1 (0)
iterations count:147 (4), effective:21 (0)
iterations count:215 (6), effective:32 (0)
iterations count:115 (3), effective:17 (0)
iterations count:36 (1), effective:1 (0)
iterations count:75 (2), effective:11 (0)
iterations count:35 (1), effective:0 (0)
iterations count:120 (3), effective:18 (0)
iterations count:127 (3), effective:19 (0)
iterations count:35 (1), effective:0 (0)
iterations count:60 (1), effective:7 (0)
iterations count:118 (3), effective:18 (0)
iterations count:35 (1), effective:0 (0)
iterations count:35 (1), effective:0 (0)
iterations count:271 (7), effective:43 (1)
iterations count:148 (4), effective:19 (0)
iterations count:271 (7), effective:43 (1)
iterations count:271 (7), effective:43 (1)
iterations count:35 (1), effective:0 (0)
iterations count:131 (3), effective:18 (0)
iterations count:162 (4), effective:21 (0)
iterations count:162 (4), effective:21 (0)
iterations count:162 (4), effective:21 (0)
iterations count:35 (1), effective:0 (0)
iterations count:149 (4), effective:20 (0)
iterations count:139 (3), effective:22 (0)
iterations count:35 (1), effective:0 (0)
iterations count:69 (1), effective:2 (0)
iterations count:161 (4), effective:21 (0)
iterations count:75 (2), effective:4 (0)
iterations count:35 (1), effective:0 (0)
iterations count:35 (1), effective:0 (0)
iterations count:35 (1), effective:0 (0)
iterations count:35 (1), effective:0 (0)
iterations count:68 (1), effective:2 (0)
iterations count:35 (1), effective:0 (0)
iterations count:38 (1), effective:2 (0)
iterations count:35 (1), effective:0 (0)
iterations count:69 (1), effective:2 (0)
iterations count:148 (4), effective:25 (0)
iterations count:35 (1), effective:0 (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-004A"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
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 marcie"
echo " Input is ShieldRVt-PT-004A, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r417-tajo-167905972000225"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-004A.tgz
mv ShieldRVt-PT-004A 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 ;