About the Execution of Marcie for ShieldPPPs-PT-001A
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5548.644 | 6406.00 | 6060.00 | 0.00 | FTTTTFTFTFTTTFFF | 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-167903710000353.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 ShieldPPPs-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-167903710000353
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 416K
-rw-r--r-- 1 mcc users 6.7K Feb 26 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 01:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 26 01:55 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:57 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:57 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:57 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:57 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 01:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 01:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:57 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:57 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.4K 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 ShieldPPPs-PT-001A-CTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-001A-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679044981469
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=ShieldPPPs-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: ShieldPPPs_PT_001A
(NrP: 34 NrTr: 29 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 2.873sec
RS generation: 0m 0.030sec
-> reachability set: #nodes 683 (6.8e+02) #states 61,496 (4)
starting MCC model checker
--------------------------
checking: EG [EX [~ [EG [~ [1<=p26]]]]]
normalized: EG [EX [~ [EG [~ [1<=p26]]]]]
abstracting: (1<=p26)
states: 15,900 (4)
.............................................
EG iterations: 45
.............
EG iterations: 12
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.138sec
checking: AF [AG [AF [EX [p0<=0]]]]
normalized: ~ [EG [E [true U EG [~ [EX [p0<=0]]]]]]
abstracting: (p0<=0)
states: 61,495 (4)
..
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: AX [AG [AF [[AX [1<=p14] | EX [p31<=0]]]]]
normalized: ~ [EX [E [true U EG [~ [[EX [p31<=0] | ~ [EX [~ [1<=p14]]]]]]]]]
abstracting: (1<=p14)
states: 24,335 (4)
.abstracting: (p31<=0)
states: 46,067 (4)
..
EG iterations: 1
.-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EX [A [~ [1<=p19] U EX [AF [[p10<=0 & p9<=1]]]]]
normalized: EX [[~ [EG [~ [EX [~ [EG [~ [[p10<=0 & p9<=1]]]]]]]] & ~ [E [~ [EX [~ [EG [~ [[p10<=0 & p9<=1]]]]]] U [~ [EX [~ [EG [~ [[p10<=0 & p9<=1]]]]]] & 1<=p19]]]]]
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p9<=1)
states: 61,496 (4)
abstracting: (p10<=0)
states: 49,257 (4)
...................................................
EG iterations: 51
.abstracting: (p9<=1)
states: 61,496 (4)
abstracting: (p10<=0)
states: 49,257 (4)
...................................................
EG iterations: 51
.abstracting: (p9<=1)
states: 61,496 (4)
abstracting: (p10<=0)
states: 49,257 (4)
...................................................
EG iterations: 51
..
EG iterations: 1
.-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.075sec
checking: A [EF [EX [[AG [1<=p10] & 1<=p28]]] U AF [[1<=p1 & 1<=p30]]]
normalized: [~ [EG [EG [~ [[1<=p1 & 1<=p30]]]]] & ~ [E [EG [~ [[1<=p1 & 1<=p30]]] U [~ [E [true U EX [[~ [E [true U ~ [1<=p10]]] & 1<=p28]]]] & EG [~ [[1<=p1 & 1<=p30]]]]]]]
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (1<=p1)
states: 30,202 (4)
..............
EG iterations: 14
abstracting: (1<=p28)
states: 15,035 (4)
abstracting: (1<=p10)
states: 12,239 (4)
.abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (1<=p1)
states: 30,202 (4)
..............
EG iterations: 14
abstracting: (1<=p30)
states: 15,822 (4)
abstracting: (1<=p1)
states: 30,202 (4)
..............
EG iterations: 14
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.032sec
checking: ~ [AG [EF [[EF [~ [1<=p19]] | [AF [p17<=1] & [AX [p17<=p14] & 1<=p11]]]]]]
normalized: E [true U ~ [E [true U [[[~ [EX [~ [p17<=p14]]] & 1<=p11] & ~ [EG [~ [p17<=1]]]] | E [true U ~ [1<=p19]]]]]]
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p17<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p17<=p14)
states: 46,721 (4)
.-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.041sec
checking: EF [EF [[A [~ [p25<=1] U EG [1<=p11]] | E [[~ [1<=p16] | p14<=1] U AG [p20<=p21]]]]]
normalized: E [true U E [true U [E [[~ [1<=p16] | p14<=1] U ~ [E [true U ~ [p20<=p21]]]] | [~ [EG [~ [EG [1<=p11]]]] & ~ [E [~ [EG [1<=p11]] U [~ [EG [1<=p11]] & p25<=1]]]]]]]
abstracting: (p25<=1)
states: 61,496 (4)
abstracting: (1<=p11)
states: 24,637 (4)
.....................................................
EG iterations: 53
abstracting: (1<=p11)
states: 24,637 (4)
.....................................................
EG iterations: 53
abstracting: (1<=p11)
states: 24,637 (4)
.....................................................
EG iterations: 53
EG iterations: 0
abstracting: (p20<=p21)
states: 45,914 (4)
abstracting: (p14<=1)
states: 61,496 (4)
abstracting: (1<=p16)
states: 24,435 (4)
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.093sec
checking: EG [[1<=p32 | ~ [A [AF [p19<=1] U ~ [[p6<=p7 & p13<=p16]]]]]]
normalized: EG [[~ [[~ [EG [[p6<=p7 & p13<=p16]]] & ~ [E [[p6<=p7 & p13<=p16] U [EG [~ [p19<=1]] & [p6<=p7 & p13<=p16]]]]]] | 1<=p32]]
abstracting: (1<=p32)
states: 14,919 (4)
abstracting: (p13<=p16)
states: 46,612 (4)
abstracting: (p6<=p7)
states: 37,021 (4)
abstracting: (p19<=1)
states: 61,496 (4)
.
EG iterations: 1
abstracting: (p13<=p16)
states: 46,612 (4)
abstracting: (p6<=p7)
states: 37,021 (4)
abstracting: (p13<=p16)
states: 46,612 (4)
abstracting: (p6<=p7)
states: 37,021 (4)
.............................................................
EG iterations: 61
.........................
EG iterations: 25
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.177sec
checking: AX [A [AF [[[1<=p25 & [1<=p3 & p8<=0]] | EX [p21<=1]]] U ~ [p5<=p10]]]
normalized: ~ [EX [~ [[~ [E [p5<=p10 U [EG [~ [[EX [p21<=1] | [[1<=p3 & p8<=0] & 1<=p25]]]] & p5<=p10]]] & ~ [EG [p5<=p10]]]]]]
abstracting: (p5<=p10)
states: 51,610 (4)
....................
EG iterations: 20
abstracting: (p5<=p10)
states: 51,610 (4)
abstracting: (1<=p25)
states: 30,359 (4)
abstracting: (p8<=0)
states: 36,583 (4)
abstracting: (1<=p3)
states: 30,359 (4)
abstracting: (p21<=1)
states: 61,496 (4)
..
EG iterations: 1
abstracting: (p5<=p10)
states: 51,610 (4)
.-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.039sec
checking: EF [[EX [AG [p0<=1]] & [~ [AG [~ [[1<=p8 | p13<=0]]]] & ~ [E [p32<=1 U [[p29<=1 & p33<=1] & EF [1<=p2]]]]]]]
normalized: E [true U [[~ [E [p32<=1 U [E [true U 1<=p2] & [p29<=1 & p33<=1]]]] & E [true U [1<=p8 | p13<=0]]] & EX [~ [E [true U ~ [p0<=1]]]]]]
abstracting: (p0<=1)
states: 61,496 (4)
.abstracting: (p13<=0)
states: 36,575 (4)
abstracting: (1<=p8)
states: 24,913 (4)
abstracting: (p33<=1)
states: 61,496 (4)
abstracting: (p29<=1)
states: 61,496 (4)
abstracting: (1<=p2)
states: 31,293 (4)
abstracting: (p32<=1)
states: 61,496 (4)
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.014sec
checking: AF [~ [[~ [AG [[p8<=1 | EF [1<=p11]]]] | ~ [E [~ [[p10<=p4 & 1<=p9]] U [p17<=p22 | p29<=1]]]]]]
normalized: ~ [EG [[~ [E [~ [[p10<=p4 & 1<=p9]] U [p17<=p22 | p29<=1]]] | E [true U ~ [[p8<=1 | E [true U 1<=p11]]]]]]]
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (p8<=1)
states: 61,496 (4)
abstracting: (p29<=1)
states: 61,496 (4)
abstracting: (p17<=p22)
states: 42,996 (4)
abstracting: (1<=p9)
states: 24,249 (4)
abstracting: (p10<=p4)
states: 55,491 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: E [A [1<=p25 U AX [[~ [p0<=p12] | p19<=p19]]] U ~ [[1<=p2 | [[EG [p23<=p7] | EF [[p28<=p29 & p28<=p13]]] | A [1<=p10 U ~ [p33<=p3]]]]]]
normalized: E [[~ [EG [EX [~ [[p19<=p19 | ~ [p0<=p12]]]]]] & ~ [E [EX [~ [[p19<=p19 | ~ [p0<=p12]]]] U [~ [1<=p25] & EX [~ [[p19<=p19 | ~ [p0<=p12]]]]]]]] U ~ [[1<=p2 | [[~ [EG [p33<=p3]] & ~ [E [p33<=p3 U [p33<=p3 & ~ [1<=p10]]]]] | [E [true U [p28<=p29 & p28<=p13]] | EG [p23<=p7]]]]]]
abstracting: (p23<=p7)
states: 52,150 (4)
..........................................
EG iterations: 42
abstracting: (p28<=p13)
states: 52,537 (4)
abstracting: (p28<=p29)
states: 46,461 (4)
abstracting: (1<=p10)
states: 12,239 (4)
abstracting: (p33<=p3)
states: 53,576 (4)
abstracting: (p33<=p3)
states: 53,576 (4)
abstracting: (p33<=p3)
states: 53,576 (4)
..............................................
EG iterations: 46
abstracting: (1<=p2)
states: 31,293 (4)
abstracting: (p0<=p12)
states: 61,495 (4)
abstracting: (p19<=p19)
states: 61,496 (4)
.abstracting: (1<=p25)
states: 30,359 (4)
abstracting: (p0<=p12)
states: 61,495 (4)
abstracting: (p19<=p19)
states: 61,496 (4)
.abstracting: (p0<=p12)
states: 61,495 (4)
abstracting: (p19<=p19)
states: 61,496 (4)
..
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.224sec
checking: EG [E [[AX [[[p12<=1 | p2<=0] | AX [1<=p22]]] | [p13<=1 | 1<=p24]] U [[[[~ [1<=p4] | ~ [p15<=0]] | AG [p10<=0]] | [AF [p8<=p25] | A [1<=p17 U p32<=p20]]] & [~ [EX [p15<=1]] & 1<=p29]]]]
normalized: EG [E [[[p13<=1 | 1<=p24] | ~ [EX [~ [[~ [EX [~ [1<=p22]]] | [p12<=1 | p2<=0]]]]]] U [[1<=p29 & ~ [EX [p15<=1]]] & [[[~ [EG [~ [p32<=p20]]] & ~ [E [~ [p32<=p20] U [~ [1<=p17] & ~ [p32<=p20]]]]] | ~ [EG [~ [p8<=p25]]]] | [~ [E [true U ~ [p10<=0]]] | [~ [p15<=0] | ~ [1<=p4]]]]]]]
abstracting: (1<=p4)
states: 31,136 (4)
abstracting: (p15<=0)
states: 49,024 (4)
abstracting: (p10<=0)
states: 49,257 (4)
abstracting: (p8<=p25)
states: 49,101 (4)
....................................
EG iterations: 36
abstracting: (p32<=p20)
states: 50,362 (4)
abstracting: (1<=p17)
states: 24,588 (4)
abstracting: (p32<=p20)
states: 50,362 (4)
abstracting: (p32<=p20)
states: 50,362 (4)
....................
EG iterations: 20
abstracting: (p15<=1)
states: 61,496 (4)
.abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p2<=0)
states: 30,203 (4)
abstracting: (p12<=1)
states: 61,496 (4)
abstracting: (1<=p22)
states: 15,239 (4)
..abstracting: (1<=p24)
states: 31,136 (4)
abstracting: (p13<=1)
states: 61,496 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.088sec
checking: [EF [AG [~ [1<=p29]]] | [[AF [[p5<=p27 & [[AF [p2<=p27] & ~ [1<=p24]] & [A [1<=p22 U 1<=p18] & ~ [1<=p19]]]]] & A [1<=p29 U EX [[~ [p26<=0] & ~ [1<=p26]]]]] | EG [[[p15<=p17 | [~ [E [p32<=1 U 1<=p0]] | AF [p17<=p15]]] & 1<=p31]]]]
normalized: [[EG [[1<=p31 & [p15<=p17 | [~ [EG [~ [p17<=p15]]] | ~ [E [p32<=1 U 1<=p0]]]]]] | [[~ [EG [~ [EX [[~ [1<=p26] & ~ [p26<=0]]]]]] & ~ [E [~ [EX [[~ [1<=p26] & ~ [p26<=0]]]] U [~ [1<=p29] & ~ [EX [[~ [1<=p26] & ~ [p26<=0]]]]]]]] & ~ [EG [~ [[p5<=p27 & [[~ [1<=p19] & [~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [1<=p22] & ~ [1<=p18]]]]]] & [~ [1<=p24] & ~ [EG [~ [p2<=p27]]]]]]]]]]] | E [true U ~ [E [true U 1<=p29]]]]
abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p2<=p27)
states: 37,890 (4)
..........................................
EG iterations: 42
abstracting: (1<=p24)
states: 31,136 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (1<=p22)
states: 15,239 (4)
abstracting: (1<=p18)
states: 24,589 (4)
abstracting: (1<=p18)
states: 24,589 (4)
............
EG iterations: 12
abstracting: (1<=p19)
states: 24,434 (4)
abstracting: (p5<=p27)
states: 52,296 (4)
............
EG iterations: 12
abstracting: (p26<=0)
states: 45,596 (4)
abstracting: (1<=p26)
states: 15,900 (4)
.abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (p26<=0)
states: 45,596 (4)
abstracting: (1<=p26)
states: 15,900 (4)
.abstracting: (p26<=0)
states: 45,596 (4)
abstracting: (1<=p26)
states: 15,900 (4)
.
EG iterations: 0
abstracting: (1<=p0)
states: 1
abstracting: (p32<=1)
states: 61,496 (4)
abstracting: (p17<=p15)
states: 36,908 (4)
...........
EG iterations: 11
abstracting: (p15<=p17)
states: 49,024 (4)
abstracting: (1<=p31)
states: 15,429 (4)
.....................................
EG iterations: 37
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.160sec
checking: [[EX [[A [[E [1<=p29 U 1<=p6] | 1<=p1] U ~ [AG [p16<=0]]] & [p1<=p27 & A [~ [1<=p27] U AF [1<=p33]]]]] | A [AF [[AX [p2<=p11] | ~ [E [p19<=p12 U p19<=p6]]]] U [[AG [[p30<=1 | p31<=1]] | A [[1<=p10 | p14<=1] U ~ [p26<=1]]] & [EF [~ [1<=p7]] | E [AG [p26<=0] U EG [p4<=p29]]]]]] | ~ [AX [[p10<=p7 | p17<=1]]]]
normalized: [EX [~ [[p10<=p7 | p17<=1]]] | [[~ [EG [~ [[[E [~ [E [true U ~ [p26<=0]]] U EG [p4<=p29]] | E [true U ~ [1<=p7]]] & [[~ [EG [p26<=1]] & ~ [E [p26<=1 U [p26<=1 & ~ [[1<=p10 | p14<=1]]]]]] | ~ [E [true U ~ [[p30<=1 | p31<=1]]]]]]]]] & ~ [E [~ [[[E [~ [E [true U ~ [p26<=0]]] U EG [p4<=p29]] | E [true U ~ [1<=p7]]] & [[~ [EG [p26<=1]] & ~ [E [p26<=1 U [p26<=1 & ~ [[1<=p10 | p14<=1]]]]]] | ~ [E [true U ~ [[p30<=1 | p31<=1]]]]]]] U [EG [~ [[~ [E [p19<=p12 U p19<=p6]] | ~ [EX [~ [p2<=p11]]]]]] & ~ [[[E [~ [E [true U ~ [p26<=0]]] U EG [p4<=p29]] | E [true U ~ [1<=p7]]] & [[~ [EG [p26<=1]] & ~ [E [p26<=1 U [p26<=1 & ~ [[1<=p10 | p14<=1]]]]]] | ~ [E [true U ~ [[p30<=1 | p31<=1]]]]]]]]]]] | EX [[[p1<=p27 & [~ [EG [EG [~ [1<=p33]]]] & ~ [E [EG [~ [1<=p33]] U [1<=p27 & EG [~ [1<=p33]]]]]]] & [~ [EG [~ [E [true U ~ [p16<=0]]]]] & ~ [E [~ [E [true U ~ [p16<=0]]] U [~ [[1<=p1 | E [1<=p29 U 1<=p6]]] & ~ [E [true U ~ [p16<=0]]]]]]]]]]]
abstracting: (p16<=0)
states: 37,061 (4)
abstracting: (1<=p6)
states: 24,475 (4)
abstracting: (1<=p29)
states: 15,169 (4)
abstracting: (1<=p1)
states: 30,202 (4)
abstracting: (p16<=0)
states: 37,061 (4)
abstracting: (p16<=0)
states: 37,061 (4)
.
EG iterations: 1
abstracting: (1<=p33)
states: 15,325 (4)
..............................................
EG iterations: 46
abstracting: (1<=p27)
states: 15,391 (4)
abstracting: (1<=p33)
states: 15,325 (4)
..............................................
EG iterations: 46
abstracting: (1<=p33)
states: 15,325 (4)
..............................................
EG iterations: 46
.
EG iterations: 1
abstracting: (p1<=p27)
states: 38,998 (4)
.abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (p14<=1)
states: 61,496 (4)
abstracting: (1<=p10)
states: 12,239 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (p26<=1)
states: 61,496 (4)
EG iterations: 0
abstracting: (1<=p7)
states: 24,687 (4)
abstracting: (p4<=p29)
states: 38,107 (4)
...............................
EG iterations: 31
abstracting: (p26<=0)
states: 45,596 (4)
abstracting: (p2<=p11)
states: 42,548 (4)
.abstracting: (p19<=p6)
states: 46,773 (4)
abstracting: (p19<=p12)
states: 46,862 (4)
........................................
EG iterations: 40
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (p14<=1)
states: 61,496 (4)
abstracting: (1<=p10)
states: 12,239 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (p26<=1)
states: 61,496 (4)
EG iterations: 0
abstracting: (1<=p7)
states: 24,687 (4)
abstracting: (p4<=p29)
states: 38,107 (4)
...............................
EG iterations: 31
abstracting: (p26<=0)
states: 45,596 (4)
abstracting: (p31<=1)
states: 61,496 (4)
abstracting: (p30<=1)
states: 61,496 (4)
abstracting: (p14<=1)
states: 61,496 (4)
abstracting: (1<=p10)
states: 12,239 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (p26<=1)
states: 61,496 (4)
abstracting: (p26<=1)
states: 61,496 (4)
EG iterations: 0
abstracting: (1<=p7)
states: 24,687 (4)
abstracting: (p4<=p29)
states: 38,107 (4)
...............................
EG iterations: 31
abstracting: (p26<=0)
states: 45,596 (4)
.
EG iterations: 1
abstracting: (p17<=1)
states: 61,496 (4)
abstracting: (p10<=p7)
states: 54,221 (4)
.-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.265sec
checking: [E [~ [1<=p14] U [1<=p26 & [[EG [~ [p6<=p29]] & [E [1<=p32 U 1<=p11] & EX [p2<=p14]]] | AF [~ [1<=p26]]]]] & [EG [[[EX [[p6<=0 | 1<=p4]] | E [[p6<=p5 & 1<=p31] U EX [p18<=0]]] | E [~ [[p14<=p2 | p13<=1]] U [[p19<=1 | p14<=p5] | E [p30<=p27 U 1<=p20]]]]] & A [EX [p4<=p3] U AG [AG [p16<=1]]]]]
normalized: [[[~ [EG [E [true U E [true U ~ [p16<=1]]]]] & ~ [E [E [true U E [true U ~ [p16<=1]]] U [~ [EX [p4<=p3]] & E [true U E [true U ~ [p16<=1]]]]]]] & EG [[E [~ [[p14<=p2 | p13<=1]] U [E [p30<=p27 U 1<=p20] | [p19<=1 | p14<=p5]]] | [E [[p6<=p5 & 1<=p31] U EX [p18<=0]] | EX [[p6<=0 | 1<=p4]]]]]] & E [~ [1<=p14] U [1<=p26 & [~ [EG [1<=p26]] | [[EX [p2<=p14] & E [1<=p32 U 1<=p11]] & EG [~ [p6<=p29]]]]]]]
abstracting: (p6<=p29)
states: 42,986 (4)
...........................
EG iterations: 27
abstracting: (1<=p11)
states: 24,637 (4)
abstracting: (1<=p32)
states: 14,919 (4)
abstracting: (p2<=p14)
states: 42,750 (4)
.abstracting: (1<=p26)
states: 15,900 (4)
....................................
EG iterations: 36
abstracting: (1<=p26)
states: 15,900 (4)
abstracting: (1<=p14)
states: 24,335 (4)
abstracting: (1<=p4)
states: 31,136 (4)
abstracting: (p6<=0)
states: 37,021 (4)
.abstracting: (p18<=0)
states: 36,907 (4)
.abstracting: (1<=p31)
states: 15,429 (4)
abstracting: (p6<=p5)
states: 37,021 (4)
abstracting: (p14<=p5)
states: 41,983 (4)
abstracting: (p19<=1)
states: 61,496 (4)
abstracting: (1<=p20)
states: 15,582 (4)
abstracting: (p30<=p27)
states: 49,617 (4)
abstracting: (p13<=1)
states: 61,496 (4)
abstracting: (p14<=p2)
states: 49,708 (4)
EG iterations: 0
abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (p4<=p3)
states: 30,360 (4)
.abstracting: (p16<=1)
states: 61,496 (4)
abstracting: (p16<=1)
states: 61,496 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA ShieldPPPs-PT-001A-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.173sec
totally nodes used: 1463042 (1.5e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 965980 2829445 3795425
used/not used/entry size/cache size: 4049240 63059624 16 1024MB
basic ops cache: hits/miss/sum: 368940 881825 1250765
used/not used/entry size/cache size: 1716403 15060813 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: 6076 14215 20291
used/not used/entry size/cache size: 14203 8374405 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 65741752
1 1280412
2 78127
3 7942
4 605
5 26
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 6.351sec
BK_STOP 1679044987875
--------------------
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:2740 (94), effective:505 (17)
initing FirstDep: 0m 0.000sec
iterations count:1652 (56), effective:295 (10)
iterations count:29 (1), effective:0 (0)
iterations count:141 (4), effective:19 (0)
iterations count:29 (1), effective:0 (0)
iterations count:390 (13), effective:62 (2)
iterations count:29 (1), effective:0 (0)
iterations count:1637 (56), effective:289 (9)
iterations count:29 (1), effective:0 (0)
iterations count:339 (11), effective:58 (2)
iterations count:1646 (56), effective:289 (9)
iterations count:29 (1), effective:0 (0)
iterations count:29 (1), effective:0 (0)
iterations count:1680 (57), effective:292 (10)
iterations count:134 (4), effective:17 (0)
iterations count:159 (5), effective:22 (0)
iterations count:29 (1), effective:0 (0)
iterations count:305 (10), effective:49 (1)
iterations count:29 (1), effective:0 (0)
iterations count:31 (1), effective:1 (0)
iterations count:125 (4), effective:18 (0)
iterations count:271 (9), effective:48 (1)
iterations count:78 (2), effective:8 (0)
iterations count:232 (8), effective:34 (1)
iterations count:1595 (55), effective:277 (9)
iterations count:70 (2), effective:9 (0)
iterations count:222 (7), effective:27 (0)
iterations count:29 (1), effective:0 (0)
iterations count:198 (6), effective:30 (1)
iterations count:271 (9), effective:29 (1)
iterations count:198 (6), effective:30 (1)
iterations count:46 (1), effective:4 (0)
iterations count:198 (6), effective:30 (1)
iterations count:29 (1), effective:0 (0)
iterations count:190 (6), effective:26 (0)
iterations count:250 (8), effective:33 (1)
iterations count:29 (1), effective:0 (0)
iterations count:170 (5), effective:17 (0)
iterations count:190 (6), effective:26 (0)
iterations count:250 (8), effective:33 (1)
iterations count:29 (1), effective:0 (0)
iterations count:190 (6), effective:26 (0)
iterations count:250 (8), effective:33 (1)
iterations count:29 (1), effective:0 (0)
iterations count:76 (2), effective:10 (0)
iterations count:296 (10), effective:48 (1)
iterations count:78 (2), effective:8 (0)
iterations count:311 (10), effective:57 (1)
iterations count:29 (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="ShieldPPPs-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 ShieldPPPs-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-167903710000353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-001A.tgz
mv ShieldPPPs-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 ;