About the Execution of Marcie for ShieldIIPs-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5483.951 | 7306.00 | 7151.00 | 0.00 | FTFFFFFTFTFFTTTT | 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-167903709500001.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 ShieldIIPs-PT-001A, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r385-oct2-167903709500001
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 7.6K Feb 25 16:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 25 16:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K Feb 25 16:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 25 16:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 25 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 9.0K 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 ShieldIIPs-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldIIPs-PT-001A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679039988756
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=ShieldIIPs-PT-001A
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: ShieldIIPs_PT_001A
(NrP: 28 NrTr: 27 NrArc: 114)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 4.280sec
RS generation: 0m 0.024sec
-> reachability set: #nodes 505 (5.0e+02) #states 9,143 (3)
starting MCC model checker
--------------------------
checking: EF [EX [~ [p15<=1]]]
normalized: E [true U EX [~ [p15<=1]]]
abstracting: (p15<=1)
states: 9,143 (3)
.-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AF [AX [AG [AF [~ [p3<=0]]]]]
normalized: ~ [EG [EX [E [true U EG [p3<=0]]]]]
abstracting: (p3<=0)
states: 4,675 (3)
..............................
EG iterations: 30
........
EG iterations: 7
-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.079sec
checking: EF [AG [p10<=1]]
normalized: E [true U ~ [E [true U ~ [p10<=1]]]]
abstracting: (p10<=1)
states: 9,143 (3)
-> the formula is TRUE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [A [p0<=0 U AG [1<=p6]]]
normalized: ~ [[~ [EG [E [true U ~ [1<=p6]]]] & ~ [E [E [true U ~ [1<=p6]] U [~ [p0<=0] & E [true U ~ [1<=p6]]]]]]]
abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p0<=0)
states: 9,142 (3)
abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (1<=p6)
states: 3,666 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EX [[1<=p14 | [AX [~ [AF [1<=p6]]] & ~ [EX [EG [p10<=p25]]]]]]
normalized: EX [[[~ [EX [EG [p10<=p25]]] & ~ [EX [~ [EG [~ [1<=p6]]]]]] | 1<=p14]]
abstracting: (1<=p14)
states: 2,362 (3)
abstracting: (1<=p6)
states: 3,666 (3)
....................................
EG iterations: 36
.abstracting: (p10<=p25)
states: 5,845 (3)
.........
EG iterations: 9
..-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.078sec
checking: A [AF [AX [EG [[1<=p19 | p26<=0]]]] U ~ [EF [[p27<=1 & ~ [AG [p6<=1]]]]]]
normalized: [~ [EG [E [true U [E [true U ~ [p6<=1]] & p27<=1]]]] & ~ [E [E [true U [E [true U ~ [p6<=1]] & p27<=1]] U [EG [EX [~ [EG [[1<=p19 | p26<=0]]]]] & E [true U [E [true U ~ [p6<=1]] & p27<=1]]]]]]
abstracting: (p27<=1)
states: 9,143 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (p26<=0)
states: 7,071 (3)
abstracting: (1<=p19)
states: 4,468 (3)
.
EG iterations: 1
........................
EG iterations: 23
abstracting: (p27<=1)
states: 9,143 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (p27<=1)
states: 9,143 (3)
abstracting: (p6<=1)
states: 9,143 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.030sec
checking: ~ [EX [[~ [[p22<=0 & [AF [1<=p9] & [p21<=p5 | 1<=p8]]]] & EX [[AF [1<=p20] | p18<=p25]]]]]
normalized: ~ [EX [[EX [[~ [EG [~ [1<=p20]]] | p18<=p25]] & ~ [[[[p21<=p5 | 1<=p8] & ~ [EG [~ [1<=p9]]]] & p22<=0]]]]]
abstracting: (p22<=0)
states: 7,005 (3)
abstracting: (1<=p9)
states: 3,628 (3)
.............................
EG iterations: 29
abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p21<=p5)
states: 7,383 (3)
abstracting: (p18<=p25)
states: 5,569 (3)
abstracting: (1<=p20)
states: 2,476 (3)
...................................
EG iterations: 35
..-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.089sec
checking: AG [E [1<=p10 U [EF [EX [p21<=0]] | E [[EF [1<=p5] & ~ [p24<=0]] U [A [p16<=p4 U p22<=0] & [p27<=0 & 1<=p19]]]]]]
normalized: ~ [E [true U ~ [E [1<=p10 U [E [[~ [p24<=0] & E [true U 1<=p5]] U [[p27<=0 & 1<=p19] & [~ [EG [~ [p22<=0]]] & ~ [E [~ [p22<=0] U [~ [p16<=p4] & ~ [p22<=0]]]]]]] | E [true U EX [p21<=0]]]]]]]
abstracting: (p21<=0)
states: 6,917 (3)
.abstracting: (p22<=0)
states: 7,005 (3)
abstracting: (p16<=p4)
states: 8,153 (3)
abstracting: (p22<=0)
states: 7,005 (3)
abstracting: (p22<=0)
states: 7,005 (3)
............................
EG iterations: 28
abstracting: (1<=p19)
states: 4,468 (3)
abstracting: (p27<=0)
states: 6,795 (3)
abstracting: (1<=p5)
states: 1,836 (3)
abstracting: (p24<=0)
states: 6,631 (3)
abstracting: (1<=p10)
states: 4,484 (3)
-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: AF [~ [E [~ [EF [~ [p4<=p3]]] U [[AG [p21<=p26] & E [p20<=p3 U p23<=1]] | AG [AF [p15<=p23]]]]]]
normalized: ~ [EG [E [~ [E [true U ~ [p4<=p3]]] U [~ [E [true U EG [~ [p15<=p23]]]] | [E [p20<=p3 U p23<=1] & ~ [E [true U ~ [p21<=p26]]]]]]]]
abstracting: (p21<=p26)
states: 7,319 (3)
abstracting: (p23<=1)
states: 9,143 (3)
abstracting: (p20<=p3)
states: 7,895 (3)
abstracting: (p15<=p23)
states: 7,455 (3)
..............
EG iterations: 14
abstracting: (p4<=p3)
states: 4,469 (3)
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: AG [EX [EX [[EX [p4<=p8] & [[p27<=p19 | p9<=p1] & [p1<=p12 | 1<=p13]]]]]]
normalized: ~ [E [true U ~ [EX [EX [[[[p1<=p12 | 1<=p13] & [p27<=p19 | p9<=p1]] & EX [p4<=p8]]]]]]]
abstracting: (p4<=p8)
states: 6,275 (3)
.abstracting: (p9<=p1)
states: 7,253 (3)
abstracting: (p27<=p19)
states: 7,875 (3)
abstracting: (1<=p13)
states: 4,571 (3)
abstracting: (p1<=p12)
states: 6,901 (3)
..-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: AG [A [[[p5<=p18 | A [p2<=p13 U [p4<=p24 & p5<=0]]] | ~ [EG [[p7<=0 | p24<=0]]]] U [[EF [EG [p2<=1]] | EX [p1<=0]] | EG [~ [AF [p3<=0]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [[EG [EG [~ [p3<=0]]] | [EX [p1<=0] | E [true U EG [p2<=1]]]]]]] & ~ [E [~ [[EG [EG [~ [p3<=0]]] | [EX [p1<=0] | E [true U EG [p2<=1]]]]] U [~ [[~ [EG [[p7<=0 | p24<=0]]] | [[~ [EG [~ [[p4<=p24 & p5<=0]]]] & ~ [E [~ [[p4<=p24 & p5<=0]] U [~ [p2<=p13] & ~ [[p4<=p24 & p5<=0]]]]]] | p5<=p18]]] & ~ [[EG [EG [~ [p3<=0]]] | [EX [p1<=0] | E [true U EG [p2<=1]]]]]]]]]]]]
abstracting: (p2<=1)
states: 9,143 (3)
EG iterations: 0
abstracting: (p1<=0)
states: 4,659 (3)
.abstracting: (p3<=0)
states: 4,675 (3)
..............................
EG iterations: 30
.
EG iterations: 1
abstracting: (p5<=p18)
states: 8,283 (3)
abstracting: (p5<=0)
states: 7,307 (3)
abstracting: (p4<=p24)
states: 5,713 (3)
abstracting: (p2<=p13)
states: 6,814 (3)
abstracting: (p5<=0)
states: 7,307 (3)
abstracting: (p4<=p24)
states: 5,713 (3)
abstracting: (p5<=0)
states: 7,307 (3)
abstracting: (p4<=p24)
states: 5,713 (3)
.....................
EG iterations: 21
abstracting: (p24<=0)
states: 6,631 (3)
abstracting: (p7<=0)
states: 5,503 (3)
............
EG iterations: 12
abstracting: (p2<=1)
states: 9,143 (3)
EG iterations: 0
abstracting: (p1<=0)
states: 4,659 (3)
.abstracting: (p3<=0)
states: 4,675 (3)
..............................
EG iterations: 30
.
EG iterations: 1
abstracting: (p2<=1)
states: 9,143 (3)
EG iterations: 0
abstracting: (p1<=0)
states: 4,659 (3)
.abstracting: (p3<=0)
states: 4,675 (3)
..............................
EG iterations: 30
.
EG iterations: 1
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.116sec
checking: [EF [~ [E [[[[p6<=1 & 1<=p2] & ~ [1<=p4]] & ~ [A [p1<=p22 U p27<=p20]]] U [[p18<=0 & ~ [1<=p3]] | [EX [p9<=0] & AX [p16<=p19]]]]]] & [[EG [EX [~ [1<=p1]]] | AG [AF [~ [E [p21<=1 U 1<=p11]]]]] | E [AF [p3<=p9] U [EG [~ [AF [p3<=p16]]] | [~ [p5<=1] & AG [p2<=1]]]]]]
normalized: [[E [~ [EG [~ [p3<=p9]]] U [[~ [E [true U ~ [p2<=1]]] & ~ [p5<=1]] | EG [EG [~ [p3<=p16]]]]] | [~ [E [true U EG [E [p21<=1 U 1<=p11]]]] | EG [EX [~ [1<=p1]]]]] & E [true U ~ [E [[~ [[~ [EG [~ [p27<=p20]]] & ~ [E [~ [p27<=p20] U [~ [p1<=p22] & ~ [p27<=p20]]]]]] & [~ [1<=p4] & [p6<=1 & 1<=p2]]] U [[~ [EX [~ [p16<=p19]]] & EX [p9<=0]] | [p18<=0 & ~ [1<=p3]]]]]]]
abstracting: (1<=p3)
states: 4,468 (3)
abstracting: (p18<=0)
states: 4,469 (3)
abstracting: (p9<=0)
states: 5,515 (3)
.abstracting: (p16<=p19)
states: 7,963 (3)
.abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p6<=1)
states: 9,143 (3)
abstracting: (1<=p4)
states: 4,674 (3)
abstracting: (p27<=p20)
states: 7,411 (3)
abstracting: (p1<=p22)
states: 5,773 (3)
abstracting: (p27<=p20)
states: 7,411 (3)
abstracting: (p27<=p20)
states: 7,411 (3)
.....................
EG iterations: 21
abstracting: (1<=p1)
states: 4,484 (3)
........
EG iterations: 7
abstracting: (1<=p11)
states: 4,658 (3)
abstracting: (p21<=1)
states: 9,143 (3)
EG iterations: 0
abstracting: (p3<=p16)
states: 5,665 (3)
...........................
EG iterations: 27
.
EG iterations: 1
abstracting: (p5<=1)
states: 9,143 (3)
abstracting: (p2<=1)
states: 9,143 (3)
abstracting: (p3<=p9)
states: 6,411 (3)
....................
EG iterations: 20
-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.089sec
checking: [[~ [A [[p22<=1 | E [AG [1<=p20] U [1<=p1 | p19<=p0]]] U [p10<=1 | AG [EX [1<=p20]]]]] | E [AG [AX [[p12<=p0 & p5<=p15]]] U EX [EF [AG [p21<=1]]]]] | EX [EX [[E [[p11<=p15 | 1<=p7] U 1<=p17] & [AX [p17<=p21] & ~ [[p16<=p23 | 1<=p3]]]]]]]
normalized: [EX [EX [[[~ [[p16<=p23 | 1<=p3]] & ~ [EX [~ [p17<=p21]]]] & E [[p11<=p15 | 1<=p7] U 1<=p17]]]] | [E [~ [E [true U EX [~ [[p12<=p0 & p5<=p15]]]]] U EX [E [true U ~ [E [true U ~ [p21<=1]]]]]] | ~ [[~ [EG [~ [[p10<=1 | ~ [E [true U ~ [EX [1<=p20]]]]]]]] & ~ [E [~ [[p10<=1 | ~ [E [true U ~ [EX [1<=p20]]]]]] U [~ [[p22<=1 | E [~ [E [true U ~ [1<=p20]]] U [1<=p1 | p19<=p0]]]] & ~ [[p10<=1 | ~ [E [true U ~ [EX [1<=p20]]]]]]]]]]]]]
abstracting: (1<=p20)
states: 2,476 (3)
.abstracting: (p10<=1)
states: 9,143 (3)
abstracting: (p19<=p0)
states: 4,675 (3)
abstracting: (1<=p1)
states: 4,484 (3)
abstracting: (1<=p20)
states: 2,476 (3)
abstracting: (p22<=1)
states: 9,143 (3)
abstracting: (1<=p20)
states: 2,476 (3)
.abstracting: (p10<=1)
states: 9,143 (3)
abstracting: (1<=p20)
states: 2,476 (3)
.abstracting: (p10<=1)
states: 9,143 (3)
.
EG iterations: 1
abstracting: (p21<=1)
states: 9,143 (3)
.abstracting: (p5<=p15)
states: 7,777 (3)
abstracting: (p12<=p0)
states: 4,572 (3)
.abstracting: (1<=p17)
states: 2,366 (3)
abstracting: (1<=p7)
states: 3,640 (3)
abstracting: (p11<=p15)
states: 5,657 (3)
abstracting: (p17<=p21)
states: 7,357 (3)
.abstracting: (1<=p3)
states: 4,468 (3)
abstracting: (p16<=p23)
states: 7,529 (3)
..-> the formula is TRUE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.033sec
checking: EF [[[1<=p20 & [~ [EG [~ [p7<=p23]]] | [~ [[[p0<=1 & p18<=0] | AG [p26<=1]]] | [[p3<=p13 & [p15<=p0 & p8<=1]] | AF [1<=p11]]]]] & [E [[EG [p25<=1] & [p10<=p18 | A [p8<=p24 U 1<=p10]]] U EX [EX [p1<=1]]] & AG [[[~ [1<=p10] & AG [p26<=p17]] | EX [1<=p14]]]]]]
normalized: E [true U [[~ [E [true U ~ [[EX [1<=p14] | [~ [E [true U ~ [p26<=p17]]] & ~ [1<=p10]]]]]] & E [[[p10<=p18 | [~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [~ [p8<=p24] & ~ [1<=p10]]]]]] & EG [p25<=1]] U EX [EX [p1<=1]]]] & [1<=p20 & [[[~ [EG [~ [1<=p11]]] | [p3<=p13 & [p15<=p0 & p8<=1]]] | ~ [[~ [E [true U ~ [p26<=1]]] | [p0<=1 & p18<=0]]]] | ~ [EG [~ [p7<=p23]]]]]]]
abstracting: (p7<=p23)
states: 6,429 (3)
....................
EG iterations: 20
abstracting: (p18<=0)
states: 4,469 (3)
abstracting: (p0<=1)
states: 9,143 (3)
abstracting: (p26<=1)
states: 9,143 (3)
abstracting: (p8<=1)
states: 9,143 (3)
abstracting: (p15<=p0)
states: 6,899 (3)
abstracting: (p3<=p13)
states: 6,909 (3)
abstracting: (1<=p11)
states: 4,658 (3)
........................................
EG iterations: 40
abstracting: (1<=p20)
states: 2,476 (3)
abstracting: (p1<=1)
states: 9,143 (3)
..abstracting: (p25<=1)
states: 9,143 (3)
EG iterations: 0
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (p8<=p24)
states: 6,459 (3)
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (1<=p10)
states: 4,484 (3)
.......................................
EG iterations: 39
abstracting: (p10<=p18)
states: 6,975 (3)
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (p26<=p17)
states: 7,615 (3)
abstracting: (1<=p14)
states: 2,362 (3)
.-> the formula is TRUE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.141sec
checking: E [[[[A [~ [A [p22<=0 U p5<=1]] U 1<=p6] | p13<=1] & A [A [EX [p2<=0] U EG [p7<=p25]] U [[EF [1<=p24] | AG [p13<=1]] | [A [p18<=0 U 1<=p2] | ~ [1<=p10]]]]] | EG [1<=p23]] U [EG [~ [[p19<=1 | [AX [p27<=p24] & [p3<=p5 | p24<=1]]]]] & E [~ [[p27<=1 | AX [p25<=p24]]] U AX [E [p3<=1 U p23<=p1]]]]]
normalized: E [[EG [1<=p23] | [[~ [EG [~ [[[~ [1<=p10] | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [p18<=0] & ~ [1<=p2]]]]]] | [~ [E [true U ~ [p13<=1]]] | E [true U 1<=p24]]]]]] & ~ [E [~ [[[~ [1<=p10] | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [p18<=0] & ~ [1<=p2]]]]]] | [~ [E [true U ~ [p13<=1]]] | E [true U 1<=p24]]]] U [~ [[~ [EG [~ [EG [p7<=p25]]]] & ~ [E [~ [EG [p7<=p25]] U [~ [EX [p2<=0]] & ~ [EG [p7<=p25]]]]]]] & ~ [[[~ [1<=p10] | [~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [p18<=0] & ~ [1<=p2]]]]]] | [~ [E [true U ~ [p13<=1]]] | E [true U 1<=p24]]]]]]]] & [p13<=1 | [~ [EG [~ [1<=p6]]] & ~ [E [~ [1<=p6] U [[~ [EG [~ [p5<=1]]] & ~ [E [~ [p5<=1] U [~ [p22<=0] & ~ [p5<=1]]]]] & ~ [1<=p6]]]]]]]] U [E [~ [[p27<=1 | ~ [EX [~ [p25<=p24]]]]] U ~ [EX [~ [E [p3<=1 U p23<=p1]]]]] & EG [~ [[p19<=1 | [[p3<=p5 | p24<=1] & ~ [EX [~ [p27<=p24]]]]]]]]]
abstracting: (p27<=p24)
states: 6,795 (3)
.abstracting: (p24<=1)
states: 9,143 (3)
abstracting: (p3<=p5)
states: 5,535 (3)
abstracting: (p19<=1)
states: 9,143 (3)
.
EG iterations: 1
abstracting: (p23<=p1)
states: 7,895 (3)
abstracting: (p3<=1)
states: 9,143 (3)
.abstracting: (p25<=p24)
states: 6,933 (3)
.abstracting: (p27<=1)
states: 9,143 (3)
abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (p5<=1)
states: 9,143 (3)
abstracting: (p22<=0)
states: 7,005 (3)
abstracting: (p5<=1)
states: 9,143 (3)
abstracting: (p5<=1)
states: 9,143 (3)
.
EG iterations: 1
abstracting: (1<=p6)
states: 3,666 (3)
abstracting: (1<=p6)
states: 3,666 (3)
....................................
EG iterations: 36
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p18<=0)
states: 4,469 (3)
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (1<=p2)
states: 4,658 (3)
.................................
EG iterations: 33
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (p7<=p25)
states: 6,411 (3)
...............
EG iterations: 15
abstracting: (p2<=0)
states: 4,485 (3)
.abstracting: (p7<=p25)
states: 6,411 (3)
...............
EG iterations: 15
abstracting: (p7<=p25)
states: 6,411 (3)
...............
EG iterations: 15
...................................
EG iterations: 35
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p18<=0)
states: 4,469 (3)
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (1<=p2)
states: 4,658 (3)
.................................
EG iterations: 33
abstracting: (1<=p10)
states: 4,484 (3)
abstracting: (1<=p24)
states: 2,512 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (p18<=0)
states: 4,469 (3)
abstracting: (1<=p2)
states: 4,658 (3)
abstracting: (1<=p2)
states: 4,658 (3)
.................................
EG iterations: 33
abstracting: (1<=p10)
states: 4,484 (3)
.
EG iterations: 1
abstracting: (1<=p23)
states: 2,302 (3)
............................
EG iterations: 28
-> the formula is FALSE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.175sec
checking: A [[[[~ [[AX [p18<=p1] & EG [p27<=p19]]] | EG [EX [p12<=1]]] | [AG [[EF [p1<=p23] | [p11<=p15 & 1<=p21]]] | [p13<=0 & EX [[p10<=p17 | 1<=p11]]]]] | [AG [A [~ [p11<=0] U [p13<=1 & 1<=p4]]] | E [[p1<=p21 | 1<=p8] U EX [~ [p0<=1]]]]] U [[[AG [A [p0<=p10 U p18<=p13]] | 1<=p21] & p13<=1] & EF [[A [~ [p19<=1] U ~ [p25<=p0]] & E [AG [p13<=1] U ~ [p22<=p8]]]]]]
normalized: [~ [EG [~ [[E [true U [E [~ [E [true U ~ [p13<=1]]] U ~ [p22<=p8]] & [~ [EG [p25<=p0]] & ~ [E [p25<=p0 U [p19<=1 & p25<=p0]]]]]] & [p13<=1 & [1<=p21 | ~ [E [true U ~ [[~ [EG [~ [p18<=p13]]] & ~ [E [~ [p18<=p13] U [~ [p0<=p10] & ~ [p18<=p13]]]]]]]]]]]]]] & ~ [E [~ [[E [true U [E [~ [E [true U ~ [p13<=1]]] U ~ [p22<=p8]] & [~ [EG [p25<=p0]] & ~ [E [p25<=p0 U [p19<=1 & p25<=p0]]]]]] & [p13<=1 & [1<=p21 | ~ [E [true U ~ [[~ [EG [~ [p18<=p13]]] & ~ [E [~ [p18<=p13] U [~ [p0<=p10] & ~ [p18<=p13]]]]]]]]]]]] U [~ [[[E [[p1<=p21 | 1<=p8] U EX [~ [p0<=1]]] | ~ [E [true U ~ [[~ [EG [~ [[p13<=1 & 1<=p4]]]] & ~ [E [~ [[p13<=1 & 1<=p4]] U [p11<=0 & ~ [[p13<=1 & 1<=p4]]]]]]]]]] | [[[p13<=0 & EX [[p10<=p17 | 1<=p11]]] | ~ [E [true U ~ [[[p11<=p15 & 1<=p21] | E [true U p1<=p23]]]]]] | [EG [EX [p12<=1]] | ~ [[EG [p27<=p19] & ~ [EX [~ [p18<=p1]]]]]]]]] & ~ [[E [true U [E [~ [E [true U ~ [p13<=1]]] U ~ [p22<=p8]] & [~ [EG [p25<=p0]] & ~ [E [p25<=p0 U [p19<=1 & p25<=p0]]]]]] & [p13<=1 & [1<=p21 | ~ [E [true U ~ [[~ [EG [~ [p18<=p13]]] & ~ [E [~ [p18<=p13] U [~ [p0<=p10] & ~ [p18<=p13]]]]]]]]]]]]]]]]
abstracting: (p18<=p13)
states: 6,806 (3)
abstracting: (p0<=p10)
states: 9,142 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
.........................
EG iterations: 25
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
abstracting: (p19<=1)
states: 9,143 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
......................
EG iterations: 22
abstracting: (p22<=p8)
states: 7,943 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (p18<=p1)
states: 6,785 (3)
.abstracting: (p27<=p19)
states: 7,875 (3)
...................
EG iterations: 19
abstracting: (p12<=1)
states: 9,143 (3)
........
EG iterations: 7
abstracting: (p1<=p23)
states: 5,713 (3)
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p11<=p15)
states: 5,657 (3)
abstracting: (1<=p11)
states: 4,658 (3)
abstracting: (p10<=p17)
states: 5,823 (3)
.abstracting: (p13<=0)
states: 4,572 (3)
abstracting: (1<=p4)
states: 4,674 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (p11<=0)
states: 4,485 (3)
abstracting: (1<=p4)
states: 4,674 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (1<=p4)
states: 4,674 (3)
abstracting: (p13<=1)
states: 9,143 (3)
..............................
EG iterations: 30
abstracting: (p0<=1)
states: 9,143 (3)
.abstracting: (1<=p8)
states: 3,678 (3)
abstracting: (p1<=p21)
states: 5,727 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
abstracting: (p0<=p10)
states: 9,142 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
.........................
EG iterations: 25
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
abstracting: (p19<=1)
states: 9,143 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
......................
EG iterations: 22
abstracting: (p22<=p8)
states: 7,943 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
abstracting: (p0<=p10)
states: 9,142 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
abstracting: (p18<=p13)
states: 6,806 (3)
.........................
EG iterations: 25
abstracting: (1<=p21)
states: 2,226 (3)
abstracting: (p13<=1)
states: 9,143 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
abstracting: (p19<=1)
states: 9,143 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
abstracting: (p25<=p0)
states: 6,933 (3)
......................
EG iterations: 22
abstracting: (p22<=p8)
states: 7,943 (3)
abstracting: (p13<=1)
states: 9,143 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldIIPs-PT-001A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.083sec
totally nodes used: 525888 (5.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 407857 1197082 1604939
used/not used/entry size/cache size: 1595201 65513663 16 1024MB
basic ops cache: hits/miss/sum: 225362 512557 737919
used/not used/entry size/cache size: 978800 15798416 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: 3736 8727 12463
used/not used/entry size/cache size: 8724 8379884 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 66605231
1 483135
2 18843
3 1559
4 90
5 6
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 7.252sec
BK_STOP 1679039996062
--------------------
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.001sec
iterations count:1365 (50), effective:261 (9)
initing FirstDep: 0m 0.004sec
iterations count:907 (33), effective:151 (5)
iterations count:27 (1), effective:0 (0)
iterations count:45 (1), effective:4 (0)
iterations count:45 (1), effective:4 (0)
iterations count:27 (1), effective:0 (0)
iterations count:45 (1), effective:4 (0)
iterations count:50 (1), effective:1 (0)
iterations count:119 (4), effective:22 (0)
iterations count:422 (15), effective:63 (2)
iterations count:155 (5), effective:23 (0)
iterations count:27 (1), effective:0 (0)
iterations count:1220 (45), effective:206 (7)
iterations count:387 (14), effective:73 (2)
iterations count:27 (1), effective:0 (0)
iterations count:208 (7), effective:31 (1)
iterations count:27 (1), effective:0 (0)
iterations count:862 (31), effective:153 (5)
iterations count:27 (1), effective:0 (0)
iterations count:877 (32), effective:144 (5)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:28 (1), effective:1 (0)
iterations count:52 (1), effective:7 (0)
iterations count:388 (14), effective:64 (2)
iterations count:275 (10), effective:37 (1)
iterations count:27 (1), effective:0 (0)
iterations count:467 (17), effective:106 (3)
iterations count:142 (5), effective:27 (1)
iterations count:27 (1), effective:0 (0)
iterations count:467 (17), effective:106 (3)
iterations count:467 (17), effective:106 (3)
iterations count:27 (1), effective:0 (0)
iterations count:268 (9), effective:40 (1)
iterations count:27 (1), effective:0 (0)
iterations count:102 (3), effective:14 (0)
iterations count:213 (7), effective:26 (0)
iterations count:27 (1), effective:0 (0)
iterations count:691 (25), effective:102 (3)
iterations count:62 (2), effective:16 (0)
iterations count:1239 (45), effective:205 (7)
iterations count:158 (5), effective:29 (1)
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:199 (7), effective:33 (1)
iterations count:137 (5), effective:17 (0)
iterations count:344 (12), effective:49 (1)
iterations count:199 (7), effective:33 (1)
iterations count:137 (5), effective:17 (0)
iterations count:199 (7), effective:33 (1)
iterations count:137 (5), effective:17 (0)
iterations count:27 (1), effective:0 (0)
iterations count:681 (25), effective:101 (3)
iterations count:399 (14), effective:61 (2)
iterations count:238 (8), effective:36 (1)
iterations count:81 (3), effective:14 (0)
iterations count:392 (14), effective:58 (2)
iterations count:27 (1), effective:0 (0)
iterations count:681 (25), effective:101 (3)
iterations count:399 (14), effective:61 (2)
iterations count:27 (1), effective:0 (0)
iterations count:681 (25), effective:101 (3)
iterations count:399 (14), effective:61 (2)
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="ShieldIIPs-PT-001A"
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 ShieldIIPs-PT-001A, 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-167903709500001"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPs-PT-001A.tgz
mv ShieldIIPs-PT-001A execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
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 ;