About the Execution of Marcie for ShieldIIPt-PT-002A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.747 | 4721.00 | 4060.00 | 0.00 | TTTTFTTFTFTFFTTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r385-oct2-167903709800193.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marcie
Input is ShieldIIPt-PT-002A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r385-oct2-167903709800193
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.1K Feb 25 17:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 17:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 17:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K Feb 25 17:09 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 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 165K Feb 25 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Feb 25 17:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 25 17:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 ShieldIIPt-PT-002A-CTLCardinality-00
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-01
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-02
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-03
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-04
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-05
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-06
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-07
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-08
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-09
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-10
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-11
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-12
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-13
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-14
FORMULA_NAME ShieldIIPt-PT-002A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679042439599
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=ShieldIIPt-PT-002A
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: ShieldIIPt_PT_002A
(NrP: 41 NrTr: 31 NrArc: 126)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.869sec
RS generation: 0m 0.004sec
-> reachability set: #nodes 101 (1.0e+02) #states 819,201 (5)
starting MCC model checker
--------------------------
checking: EF [~ [EX [EF [~ [A [1<=p23 U p36<=1]]]]]]
normalized: E [true U ~ [EX [E [true U ~ [[~ [E [~ [p36<=1] U [~ [p36<=1] & ~ [1<=p23]]]] & ~ [EG [~ [p36<=1]]]]]]]]]
abstracting: (p36<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p23)
states: 409,600 (5)
abstracting: (p36<=1)
states: 819,201 (5)
abstracting: (p36<=1)
states: 819,201 (5)
.-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [EF [~ [[p7<=0 & EG [~ [p3<=0]]]]]]
normalized: E [true U E [true U ~ [[EG [~ [p3<=0]] & p7<=0]]]]
abstracting: (p7<=0)
states: 491,521 (5)
abstracting: (p3<=0)
states: 409,601 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [AG [AG [[[AF [1<=p15] & AG [p12<=p0]] | p4<=1]]]]
normalized: ~ [E [true U E [true U E [true U ~ [[[~ [E [true U ~ [p12<=p0]]] & ~ [EG [~ [1<=p15]]]] | p4<=1]]]]]]
abstracting: (p4<=1)
states: 819,201 (5)
abstracting: (1<=p15)
states: 409,600 (5)
..
EG iterations: 2
abstracting: (p12<=p0)
states: 409,601 (5)
-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [EF [AF [[[[1<=p19 & p24<=1] & EG [p13<=1]] & 1<=p9]]]]
normalized: ~ [E [true U ~ [E [true U ~ [EG [~ [[[EG [p13<=1] & [1<=p19 & p24<=1]] & 1<=p9]]]]]]]]
abstracting: (1<=p9)
states: 327,680 (5)
abstracting: (p24<=1)
states: 819,201 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (p13<=1)
states: 819,201 (5)
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [AX [[[1<=p34 & ~ [p11<=1]] & p28<=p6]]]
normalized: E [true U ~ [EX [~ [[[~ [p11<=1] & 1<=p34] & p28<=p6]]]]]
abstracting: (p28<=p6)
states: 622,593 (5)
abstracting: (1<=p34)
states: 409,600 (5)
abstracting: (p11<=1)
states: 819,201 (5)
.-> the formula is FALSE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: [~ [EF [AF [EF [AF [1<=p40]]]]] | AG [[~ [p2<=p29] | AX [EF [A [p1<=1 U 1<=p18]]]]]]
normalized: [~ [E [true U ~ [[~ [EX [~ [E [true U [~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [p1<=1] & ~ [1<=p18]]]]]]]]] | ~ [p2<=p29]]]]] | ~ [E [true U ~ [EG [~ [E [true U ~ [EG [~ [1<=p40]]]]]]]]]]
abstracting: (1<=p40)
states: 409,600 (5)
...........
EG iterations: 11
.
EG iterations: 1
abstracting: (p2<=p29)
states: 614,401 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (p1<=1)
states: 819,201 (5)
abstracting: (1<=p18)
states: 409,600 (5)
abstracting: (1<=p18)
states: 409,600 (5)
.
EG iterations: 1
.-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: ~ [EF [AG [~ [[[[p38<=1 | 1<=p11] | ~ [p26<=p35]] | E [1<=p6 U 1<=p19]]]]]]
normalized: ~ [E [true U ~ [E [true U [E [1<=p6 U 1<=p19] | [~ [p26<=p35] | [p38<=1 | 1<=p11]]]]]]]
abstracting: (1<=p11)
states: 409,600 (5)
abstracting: (p38<=1)
states: 819,201 (5)
abstracting: (p26<=p35)
states: 655,361 (5)
abstracting: (1<=p19)
states: 409,600 (5)
abstracting: (1<=p6)
states: 327,680 (5)
-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [EX [E [[~ [EX [1<=p14]] & [~ [1<=p7] & p39<=0]] U [A [1<=p40 U p14<=0] | [~ [p26<=0] | AF [p9<=1]]]]]]
normalized: ~ [E [true U ~ [EX [E [[[~ [1<=p7] & p39<=0] & ~ [EX [1<=p14]]] U [[~ [EG [~ [p9<=1]]] | ~ [p26<=0]] | [~ [EG [~ [p14<=0]]] & ~ [E [~ [p14<=0] U [~ [1<=p40] & ~ [p14<=0]]]]]]]]]]]
abstracting: (p14<=0)
states: 409,601 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p14<=0)
states: 409,601 (5)
abstracting: (p14<=0)
states: 409,601 (5)
.
EG iterations: 1
abstracting: (p26<=0)
states: 491,521 (5)
abstracting: (p9<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (1<=p14)
states: 409,600 (5)
.abstracting: (p39<=0)
states: 409,601 (5)
abstracting: (1<=p7)
states: 327,680 (5)
.-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[~ [AG [EF [p22<=1]]] & [EX [p37<=p7] | EG [p18<=0]]] | [1<=p22 & [~ [[EF [p39<=1] | AF [p22<=1]]] & EG [AG [p39<=0]]]]]]
normalized: E [true U [[[EG [~ [E [true U ~ [p39<=0]]]] & ~ [[~ [EG [~ [p22<=1]]] | E [true U p39<=1]]]] & 1<=p22] | [[EG [p18<=0] | EX [p37<=p7]] & E [true U ~ [E [true U p22<=1]]]]]]
abstracting: (p22<=1)
states: 819,201 (5)
abstracting: (p37<=p7)
states: 573,441 (5)
.abstracting: (p18<=0)
states: 409,601 (5)
.
EG iterations: 1
abstracting: (1<=p22)
states: 409,600 (5)
abstracting: (p39<=1)
states: 819,201 (5)
abstracting: (p22<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (p39<=0)
states: 409,601 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[AF [[[p12<=p28 | [~ [p8<=0] | ~ [1<=p29]]] & [AX [1<=p9] & EF [1<=p22]]]] & ~ [[EX [[p11<=0 & 1<=p8]] | 1<=p24]]]]
normalized: E [true U [~ [[EX [[p11<=0 & 1<=p8]] | 1<=p24]] & ~ [EG [~ [[[E [true U 1<=p22] & ~ [EX [~ [1<=p9]]]] & [p12<=p28 | [~ [1<=p29] | ~ [p8<=0]]]]]]]]]
abstracting: (p8<=0)
states: 491,521 (5)
abstracting: (1<=p29)
states: 409,600 (5)
abstracting: (p12<=p28)
states: 573,441 (5)
abstracting: (1<=p9)
states: 327,680 (5)
.abstracting: (1<=p22)
states: 409,600 (5)
.
EG iterations: 1
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (1<=p8)
states: 327,680 (5)
abstracting: (p11<=0)
states: 409,601 (5)
.-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[~ [[EG [EG [p9<=p23]] | [1<=p29 | A [p15<=1 U EF [p9<=p1]]]]] | ~ [AG [E [EX [1<=p24] U [p13<=1 | 1<=p10]]]]]]
normalized: ~ [EG [~ [[E [true U ~ [E [EX [1<=p24] U [p13<=1 | 1<=p10]]]] | ~ [[[[~ [EG [~ [E [true U p9<=p1]]]] & ~ [E [~ [E [true U p9<=p1]] U [~ [p15<=1] & ~ [E [true U p9<=p1]]]]]] | 1<=p29] | EG [EG [p9<=p23]]]]]]]]
abstracting: (p9<=p23)
states: 655,361 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p29)
states: 409,600 (5)
abstracting: (p9<=p1)
states: 655,361 (5)
abstracting: (p15<=1)
states: 819,201 (5)
abstracting: (p9<=p1)
states: 655,361 (5)
abstracting: (p9<=p1)
states: 655,361 (5)
.
EG iterations: 1
abstracting: (1<=p10)
states: 409,600 (5)
abstracting: (p13<=1)
states: 819,201 (5)
abstracting: (1<=p24)
states: 163,840 (5)
.
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: [AF [EF [EX [1<=p5]]] & AF [[EF [AG [~ [p3<=0]]] & [[p26<=1 & [[EF [p1<=p13] | [p26<=0 & p38<=0]] & EG [p3<=0]]] | AX [EX [p38<=1]]]]]]
normalized: [~ [EG [~ [[[~ [EX [~ [EX [p38<=1]]]] | [[EG [p3<=0] & [[p26<=0 & p38<=0] | E [true U p1<=p13]]] & p26<=1]] & E [true U ~ [E [true U p3<=0]]]]]]] & ~ [EG [~ [E [true U EX [1<=p5]]]]]]
abstracting: (1<=p5)
states: 163,840 (5)
..
EG iterations: 1
abstracting: (p3<=0)
states: 409,601 (5)
abstracting: (p26<=1)
states: 819,201 (5)
abstracting: (p1<=p13)
states: 614,401 (5)
abstracting: (p38<=0)
states: 409,601 (5)
abstracting: (p26<=0)
states: 491,521 (5)
abstracting: (p3<=0)
states: 409,601 (5)
..
EG iterations: 2
abstracting: (p38<=1)
states: 819,201 (5)
..
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: ~ [EG [A [[EG [~ [p9<=1]] & E [AG [p29<=p13] U [p30<=0 | p10<=p18]]] U ~ [[[~ [1<=p24] | p30<=0] & [~ [p5<=0] & AF [p11<=p36]]]]]]]
normalized: ~ [EG [[~ [EG [[[~ [EG [~ [p11<=p36]]] & ~ [p5<=0]] & [~ [1<=p24] | p30<=0]]]] & ~ [E [[[~ [EG [~ [p11<=p36]]] & ~ [p5<=0]] & [~ [1<=p24] | p30<=0]] U [[[~ [EG [~ [p11<=p36]]] & ~ [p5<=0]] & [~ [1<=p24] | p30<=0]] & ~ [[E [~ [E [true U ~ [p29<=p13]]] U [p30<=0 | p10<=p18]] & EG [~ [p9<=1]]]]]]]]]]
abstracting: (p9<=1)
states: 819,201 (5)
.
EG iterations: 1
abstracting: (p10<=p18)
states: 614,401 (5)
abstracting: (p30<=0)
states: 409,601 (5)
abstracting: (p29<=p13)
states: 614,401 (5)
abstracting: (p30<=0)
states: 409,601 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p5<=0)
states: 655,361 (5)
abstracting: (p11<=p36)
states: 614,401 (5)
.
EG iterations: 1
abstracting: (p30<=0)
states: 409,601 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p5<=0)
states: 655,361 (5)
abstracting: (p11<=p36)
states: 614,401 (5)
.
EG iterations: 1
abstracting: (p30<=0)
states: 409,601 (5)
abstracting: (1<=p24)
states: 163,840 (5)
abstracting: (p5<=0)
states: 655,361 (5)
abstracting: (p11<=p36)
states: 614,401 (5)
.
EG iterations: 1
.
EG iterations: 1
..
EG iterations: 2
-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: A [[p40<=p0 | [p7<=p13 | 1<=p12]] U ~ [[EF [AF [1<=p2]] | AG [[E [1<=p1 U p37<=p21] | [p8<=p27 & 1<=p40]]]]]]
normalized: [~ [EG [[~ [E [true U ~ [[[p8<=p27 & 1<=p40] | E [1<=p1 U p37<=p21]]]]] | E [true U ~ [EG [~ [1<=p2]]]]]]] & ~ [E [[~ [E [true U ~ [[[p8<=p27 & 1<=p40] | E [1<=p1 U p37<=p21]]]]] | E [true U ~ [EG [~ [1<=p2]]]]] U [~ [[[p7<=p13 | 1<=p12] | p40<=p0]] & [~ [E [true U ~ [[[p8<=p27 & 1<=p40] | E [1<=p1 U p37<=p21]]]]] | E [true U ~ [EG [~ [1<=p2]]]]]]]]]
abstracting: (1<=p2)
states: 409,600 (5)
.
EG iterations: 1
abstracting: (p37<=p21)
states: 614,401 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p8<=p27)
states: 622,593 (5)
abstracting: (p40<=p0)
states: 409,601 (5)
abstracting: (1<=p12)
states: 409,600 (5)
abstracting: (p7<=p13)
states: 655,361 (5)
abstracting: (1<=p2)
states: 409,600 (5)
.
EG iterations: 1
abstracting: (p37<=p21)
states: 614,401 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p8<=p27)
states: 622,593 (5)
abstracting: (1<=p2)
states: 409,600 (5)
.
EG iterations: 1
abstracting: (p37<=p21)
states: 614,401 (5)
abstracting: (1<=p1)
states: 409,600 (5)
abstracting: (1<=p40)
states: 409,600 (5)
abstracting: (p8<=p27)
states: 622,593 (5)
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: EF [[[[[~ [[~ [p7<=p20] & [p36<=p20 & p29<=p32]]] & [AX [p36<=1] | [[p6<=0 | 1<=p17] & AF [p11<=p3]]]] & AX [[EF [p19<=0] | p8<=0]]] | AG [AF [~ [p38<=p4]]]] | 1<=p16]]
normalized: E [true U [[~ [E [true U EG [p38<=p4]]] | [~ [EX [~ [[E [true U p19<=0] | p8<=0]]]] & [[[~ [EG [~ [p11<=p3]]] & [p6<=0 | 1<=p17]] | ~ [EX [~ [p36<=1]]]] & ~ [[[p36<=p20 & p29<=p32] & ~ [p7<=p20]]]]]] | 1<=p16]]
abstracting: (1<=p16)
states: 409,600 (5)
abstracting: (p7<=p20)
states: 655,361 (5)
abstracting: (p29<=p32)
states: 614,401 (5)
abstracting: (p36<=p20)
states: 614,401 (5)
abstracting: (p36<=1)
states: 819,201 (5)
.abstracting: (1<=p17)
states: 409,600 (5)
abstracting: (p6<=0)
states: 491,521 (5)
abstracting: (p11<=p3)
states: 614,401 (5)
.
EG iterations: 1
abstracting: (p8<=0)
states: 491,521 (5)
abstracting: (p19<=0)
states: 409,601 (5)
.abstracting: (p38<=p4)
states: 614,401 (5)
..................................
EG iterations: 34
-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: ~ [[E [p35<=1 U [p25<=p12 & [AG [~ [p28<=p5]] | [[p17<=p4 & ~ [1<=p11]] | [[p4<=p29 | p38<=1] & ~ [1<=p39]]]]]] & E [[AX [p4<=p18] & EF [AF [p2<=1]]] U [[~ [A [1<=p27 U p30<=p0]] & AX [AG [1<=p26]]] & ~ [[E [p11<=0 U p9<=p29] & p0<=1]]]]]]
normalized: ~ [[E [[E [true U ~ [EG [~ [p2<=1]]]] & ~ [EX [~ [p4<=p18]]]] U [~ [[E [p11<=0 U p9<=p29] & p0<=1]] & [~ [EX [E [true U ~ [1<=p26]]]] & ~ [[~ [EG [~ [p30<=p0]]] & ~ [E [~ [p30<=p0] U [~ [1<=p27] & ~ [p30<=p0]]]]]]]]] & E [p35<=1 U [p25<=p12 & [[[~ [1<=p39] & [p4<=p29 | p38<=1]] | [p17<=p4 & ~ [1<=p11]]] | ~ [E [true U p28<=p5]]]]]]]
abstracting: (p28<=p5)
states: 557,057 (5)
abstracting: (1<=p11)
states: 409,600 (5)
abstracting: (p17<=p4)
states: 614,401 (5)
abstracting: (p38<=1)
states: 819,201 (5)
abstracting: (p4<=p29)
states: 614,401 (5)
abstracting: (1<=p39)
states: 409,600 (5)
abstracting: (p25<=p12)
states: 655,361 (5)
abstracting: (p35<=1)
states: 819,201 (5)
abstracting: (p30<=p0)
states: 409,601 (5)
abstracting: (1<=p27)
states: 327,680 (5)
abstracting: (p30<=p0)
states: 409,601 (5)
abstracting: (p30<=p0)
states: 409,601 (5)
.
EG iterations: 1
abstracting: (1<=p26)
states: 327,680 (5)
.abstracting: (p0<=1)
states: 819,201 (5)
abstracting: (p9<=p29)
states: 655,361 (5)
abstracting: (p11<=0)
states: 409,601 (5)
abstracting: (p4<=p18)
states: 614,401 (5)
.abstracting: (p2<=1)
states: 819,201 (5)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldIIPt-PT-002A-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
totally nodes used: 42719 (4.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 38977 100495 139472
used/not used/entry size/cache size: 138169 66970695 16 1024MB
basic ops cache: hits/miss/sum: 11616 26300 37916
used/not used/entry size/cache size: 49658 16727558 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: 677 1594 2271
used/not used/entry size/cache size: 1594 8387014 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 67066491
1 42031
2 338
3 4
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 4.667sec
BK_STOP 1679042444320
--------------------
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:795 (25), effective:193 (6)
initing FirstDep: 0m 0.000sec
iterations count:31 (1), effective:0 (0)
iterations count:125 (4), effective:25 (0)
iterations count:31 (1), effective:0 (0)
iterations count:122 (3), effective:17 (0)
iterations count:257 (8), effective:57 (1)
iterations count:78 (2), effective:21 (0)
iterations count:31 (1), effective:0 (0)
iterations count:111 (3), effective:13 (0)
iterations count:73 (2), effective:14 (0)
iterations count:31 (1), effective:0 (0)
iterations count:42 (1), effective:3 (0)
iterations count:31 (1), effective:0 (0)
iterations count:31 (1), effective:0 (0)
iterations count:31 (1), effective:0 (0)
iterations count:69 (2), effective:4 (0)
iterations count:72 (2), effective:7 (0)
iterations count:294 (9), effective:67 (2)
iterations count:67 (2), effective:13 (0)
iterations count:67 (2), effective:13 (0)
iterations count:67 (2), effective:13 (0)
iterations count:31 (1), effective:0 (0)
iterations count:124 (4), effective:26 (0)
iterations count:125 (4), effective:25 (0)
iterations count:62 (2), effective:10 (0)
iterations count:147 (4), effective:26 (0)
iterations count:31 (1), effective:0 (0)
iterations count:31 (1), effective:0 (0)
iterations count:117 (3), effective:14 (0)
iterations count:32 (1), effective:1 (0)
iterations count:233 (7), effective:48 (1)
iterations count:117 (3), effective:14 (0)
iterations count:32 (1), effective:1 (0)
iterations count:233 (7), effective:48 (1)
iterations count:117 (3), effective:14 (0)
iterations count:32 (1), effective:1 (0)
iterations count:233 (7), effective:48 (1)
iterations count:84 (2), effective:12 (0)
iterations count:117 (3), effective:20 (0)
iterations count:42 (1), effective:5 (0)
iterations count:44 (1), effective:3 (0)
iterations count:59 (1), effective:9 (0)
iterations count:35 (1), effective:2 (0)
iterations count:37 (1), effective:3 (0)
iterations count:56 (1), effective:9 (0)
iterations count:31 (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="ShieldIIPt-PT-002A"
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 ShieldIIPt-PT-002A, 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 r385-oct2-167903709800193"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-002A.tgz
mv ShieldIIPt-PT-002A 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 ;