About the Execution of Marcie for StigmergyElection-PT-02a
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5449.132 | 5379.00 | 5079.00 | 0.00 | FFFFTTFTFTFFFTTF | 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.r449-smll-167912641700553.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 StigmergyElection-PT-02a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641700553
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 10K Feb 26 16:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 26 16:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 16:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 17:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 17:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 113K Feb 26 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 26 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 15K 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 StigmergyElection-PT-02a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-02a-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679387216647
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=StigmergyElection-PT-02a
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: StigmergyElection_PT_02a
(NrP: 30 NrTr: 66 NrArc: 196)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.545sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 172 (1.7e+02) #states 57
starting MCC model checker
--------------------------
checking: ~ [EX [1<=p24]]
normalized: ~ [EX [1<=p24]]
abstracting: (1<=p24)
states: 1
.-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EX [p28<=p16]]
normalized: ~ [EX [p28<=p16]]
abstracting: (p28<=p16)
states: 54
.-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EG [EX [p12<=p23]]
normalized: EG [EX [p12<=p23]]
abstracting: (p12<=p23)
states: 44
......
EG iterations: 5
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EG [AX [AG [[[1<=p0 | [1<=p11 & p10<=1]] & p22<=p13]]]]
normalized: EG [~ [EX [E [true U ~ [[[[1<=p11 & p10<=1] | 1<=p0] & p22<=p13]]]]]]
abstracting: (p22<=p13)
states: 56
abstracting: (1<=p0)
states: 1
abstracting: (p10<=1)
states: 57
abstracting: (1<=p11)
states: 1
..
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: ~ [EX [[AX [[E [p6<=p2 U p12<=p29] & ~ [p0<=0]]] | p22<=0]]]
normalized: ~ [EX [[~ [EX [~ [[~ [p0<=0] & E [p6<=p2 U p12<=p29]]]]] | p22<=0]]]
abstracting: (p22<=0)
states: 56
abstracting: (p12<=p29)
states: 57
abstracting: (p6<=p2)
states: 53
abstracting: (p0<=0)
states: 56
..-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: ~ [EG [AF [[~ [[E [1<=p21 U p23<=p10] & [p14<=p11 & p29<=0]]] & ~ [p28<=1]]]]]
normalized: ~ [EG [~ [EG [~ [[~ [[E [1<=p21 U p23<=p10] & [p14<=p11 & p29<=0]]] & ~ [p28<=1]]]]]]]
abstracting: (p28<=1)
states: 57
abstracting: (p29<=0)
states: 1
abstracting: (p14<=p11)
states: 54
abstracting: (p23<=p10)
states: 56
abstracting: (1<=p21)
states: 4
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AF [A [~ [EG [1<=p28]] U ~ [[AX [A [1<=p5 U p10<=0]] | ~ [[[1<=p0 & p17<=p8] | [1<=p24 | p21<=p23]]]]]]]
normalized: ~ [EG [~ [[~ [EG [[~ [[[1<=p24 | p21<=p23] | [1<=p0 & p17<=p8]]] | ~ [EX [~ [[~ [EG [~ [p10<=0]]] & ~ [E [~ [p10<=0] U [~ [1<=p5] & ~ [p10<=0]]]]]]]]]]] & ~ [E [[~ [[[1<=p24 | p21<=p23] | [1<=p0 & p17<=p8]]] | ~ [EX [~ [[~ [EG [~ [p10<=0]]] & ~ [E [~ [p10<=0] U [~ [1<=p5] & ~ [p10<=0]]]]]]]]] U [EG [1<=p28] & [~ [[[1<=p24 | p21<=p23] | [1<=p0 & p17<=p8]]] | ~ [EX [~ [[~ [EG [~ [p10<=0]]] & ~ [E [~ [p10<=0] U [~ [1<=p5] & ~ [p10<=0]]]]]]]]]]]]]]]]
abstracting: (p10<=0)
states: 56
abstracting: (1<=p5)
states: 4
abstracting: (p10<=0)
states: 56
abstracting: (p10<=0)
states: 56
..
EG iterations: 2
.abstracting: (p17<=p8)
states: 52
abstracting: (1<=p0)
states: 1
abstracting: (p21<=p23)
states: 53
abstracting: (1<=p24)
states: 1
abstracting: (1<=p28)
states: 3
....
EG iterations: 4
abstracting: (p10<=0)
states: 56
abstracting: (1<=p5)
states: 4
abstracting: (p10<=0)
states: 56
abstracting: (p10<=0)
states: 56
..
EG iterations: 2
.abstracting: (p17<=p8)
states: 52
abstracting: (1<=p0)
states: 1
abstracting: (p21<=p23)
states: 53
abstracting: (1<=p24)
states: 1
abstracting: (p10<=0)
states: 56
abstracting: (1<=p5)
states: 4
abstracting: (p10<=0)
states: 56
abstracting: (p10<=0)
states: 56
..
EG iterations: 2
.abstracting: (p17<=p8)
states: 52
abstracting: (1<=p0)
states: 1
abstracting: (p21<=p23)
states: 53
abstracting: (1<=p24)
states: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: E [AG [[[p22<=0 & AX [p0<=1]] & AX [AX [p8<=p29]]]] U AX [A [EF [[p21<=p1 | 1<=p23]] U [~ [[p3<=0 & p28<=1]] | ~ [[p20<=1 & 1<=p5]]]]]]
normalized: E [~ [E [true U ~ [[[~ [EX [~ [p0<=1]]] & p22<=0] & ~ [EX [EX [~ [p8<=p29]]]]]]]] U ~ [EX [~ [[~ [EG [~ [[~ [[p20<=1 & 1<=p5]] | ~ [[p3<=0 & p28<=1]]]]]] & ~ [E [~ [[~ [[p20<=1 & 1<=p5]] | ~ [[p3<=0 & p28<=1]]]] U [~ [[~ [[p20<=1 & 1<=p5]] | ~ [[p3<=0 & p28<=1]]]] & ~ [E [true U [p21<=p1 | 1<=p23]]]]]]]]]]]
abstracting: (1<=p23)
states: 1
abstracting: (p21<=p1)
states: 53
abstracting: (p28<=1)
states: 57
abstracting: (p3<=0)
states: 52
abstracting: (1<=p5)
states: 4
abstracting: (p20<=1)
states: 57
abstracting: (p28<=1)
states: 57
abstracting: (p3<=0)
states: 52
abstracting: (1<=p5)
states: 4
abstracting: (p20<=1)
states: 57
abstracting: (p28<=1)
states: 57
abstracting: (p3<=0)
states: 52
abstracting: (1<=p5)
states: 4
abstracting: (p20<=1)
states: 57
.
EG iterations: 1
.abstracting: (p8<=p29)
states: 57
..abstracting: (p22<=0)
states: 56
abstracting: (p0<=1)
states: 57
.-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: ~ [EG [[[[A [AG [1<=p26] U [p11<=1 | p28<=1]] | p9<=1] & [[EF [1<=p4] & p7<=1] & p27<=p3]] | EG [[EG [p28<=0] & [EF [p17<=p9] & EX [p24<=1]]]]]]]
normalized: ~ [EG [[EG [[[EX [p24<=1] & E [true U p17<=p9]] & EG [p28<=0]]] | [[[E [true U 1<=p4] & p7<=1] & p27<=p3] & [[~ [EG [~ [[p11<=1 | p28<=1]]]] & ~ [E [~ [[p11<=1 | p28<=1]] U [E [true U ~ [1<=p26]] & ~ [[p11<=1 | p28<=1]]]]]] | p9<=1]]]]]
abstracting: (p9<=1)
states: 57
abstracting: (p28<=1)
states: 57
abstracting: (p11<=1)
states: 57
abstracting: (1<=p26)
states: 14
abstracting: (p28<=1)
states: 57
abstracting: (p11<=1)
states: 57
abstracting: (p28<=1)
states: 57
abstracting: (p11<=1)
states: 57
.
EG iterations: 1
abstracting: (p27<=p3)
states: 54
abstracting: (p7<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p28<=0)
states: 54
..
EG iterations: 2
abstracting: (p17<=p9)
states: 52
abstracting: (p24<=1)
states: 57
..
EG iterations: 1
EG iterations: 0
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
checking: [A [AF [AF [p23<=1]] U ~ [[E [EF [p10<=p2] U E [1<=p27 U p24<=p17]] | [[AF [p12<=0] | E [p18<=0 U 1<=p14]] & [[AX [p5<=1] | AX [1<=p10]] | EX [1<=p24]]]]]] | AG [1<=p1]]
normalized: [~ [E [true U ~ [1<=p1]]] | [~ [EG [[[[EX [1<=p24] | [~ [EX [~ [1<=p10]]] | ~ [EX [~ [p5<=1]]]]] & [E [p18<=0 U 1<=p14] | ~ [EG [~ [p12<=0]]]]] | E [E [true U p10<=p2] U E [1<=p27 U p24<=p17]]]]] & ~ [E [[[[EX [1<=p24] | [~ [EX [~ [1<=p10]]] | ~ [EX [~ [p5<=1]]]]] & [E [p18<=0 U 1<=p14] | ~ [EG [~ [p12<=0]]]]] | E [E [true U p10<=p2] U E [1<=p27 U p24<=p17]]] U [EG [EG [~ [p23<=1]]] & [[[EX [1<=p24] | [~ [EX [~ [1<=p10]]] | ~ [EX [~ [p5<=1]]]]] & [E [p18<=0 U 1<=p14] | ~ [EG [~ [p12<=0]]]]] | E [E [true U p10<=p2] U E [1<=p27 U p24<=p17]]]]]]]]
abstracting: (p24<=p17)
states: 56
abstracting: (1<=p27)
states: 3
abstracting: (p10<=p2)
states: 56
abstracting: (p12<=0)
states: 43
.
EG iterations: 1
abstracting: (1<=p14)
states: 3
abstracting: (p18<=0)
states: 52
abstracting: (p5<=1)
states: 57
.abstracting: (1<=p10)
states: 1
.abstracting: (1<=p24)
states: 1
.abstracting: (p23<=1)
states: 57
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p24<=p17)
states: 56
abstracting: (1<=p27)
states: 3
abstracting: (p10<=p2)
states: 56
abstracting: (p12<=0)
states: 43
.
EG iterations: 1
abstracting: (1<=p14)
states: 3
abstracting: (p18<=0)
states: 52
abstracting: (p5<=1)
states: 57
.abstracting: (1<=p10)
states: 1
.abstracting: (1<=p24)
states: 1
.abstracting: (p24<=p17)
states: 56
abstracting: (1<=p27)
states: 3
abstracting: (p10<=p2)
states: 56
abstracting: (p12<=0)
states: 43
.
EG iterations: 1
abstracting: (1<=p14)
states: 3
abstracting: (p18<=0)
states: 52
abstracting: (p5<=1)
states: 57
.abstracting: (1<=p10)
states: 1
.abstracting: (1<=p24)
states: 1
.
EG iterations: 0
abstracting: (1<=p1)
states: 5
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: [[~ [EF [AX [1<=p20]]] | EX [[EF [[~ [1<=p7] & [p25<=0 | 1<=p6]]] & ~ [EX [AX [p2<=0]]]]]] & ~ [A [~ [[~ [A [p19<=p22 U p17<=p13]] & E [AX [p28<=p26] U [p22<=p18 & p7<=p26]]]] U p20<=0]]]
normalized: [[EX [[~ [EX [~ [EX [~ [p2<=0]]]]] & E [true U [[p25<=0 | 1<=p6] & ~ [1<=p7]]]]] | ~ [E [true U ~ [EX [~ [1<=p20]]]]]] & ~ [[~ [EG [~ [p20<=0]]] & ~ [E [~ [p20<=0] U [[E [~ [EX [~ [p28<=p26]]] U [p22<=p18 & p7<=p26]] & ~ [[~ [EG [~ [p17<=p13]]] & ~ [E [~ [p17<=p13] U [~ [p19<=p22] & ~ [p17<=p13]]]]]]] & ~ [p20<=0]]]]]]]
abstracting: (p20<=0)
states: 53
abstracting: (p17<=p13)
states: 52
abstracting: (p19<=p22)
states: 53
abstracting: (p17<=p13)
states: 52
abstracting: (p17<=p13)
states: 52
..
EG iterations: 2
abstracting: (p7<=p26)
states: 54
abstracting: (p22<=p18)
states: 56
abstracting: (p28<=p26)
states: 54
.abstracting: (p20<=0)
states: 53
abstracting: (p20<=0)
states: 53
..
EG iterations: 2
abstracting: (1<=p20)
states: 4
.abstracting: (1<=p7)
states: 4
abstracting: (1<=p6)
states: 4
abstracting: (p25<=0)
states: 56
abstracting: (p2<=0)
states: 52
...-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
checking: ~ [[[EX [AG [[[1<=p8 & p12<=p14] & AX [p12<=0]]]] & EG [[p20<=p18 | p25<=0]]] & E [E [A [EF [1<=p2] U [1<=p28 | p10<=0]] U 1<=p14] U [[[[[p10<=1 | p22<=p3] & EX [1<=p9]] | ~ [A [1<=p8 U p3<=p19]]] & [AX [1<=p18] | 1<=p22]] & A [[p13<=p15 & p25<=0] U [EF [p2<=0] & ~ [p5<=p22]]]]]]]
normalized: ~ [[E [E [[~ [EG [~ [[1<=p28 | p10<=0]]]] & ~ [E [~ [[1<=p28 | p10<=0]] U [~ [E [true U 1<=p2]] & ~ [[1<=p28 | p10<=0]]]]]] U 1<=p14] U [[[~ [[~ [E [~ [p3<=p19] U [~ [1<=p8] & ~ [p3<=p19]]]] & ~ [EG [~ [p3<=p19]]]]] | [EX [1<=p9] & [p10<=1 | p22<=p3]]] & [~ [EX [~ [1<=p18]]] | 1<=p22]] & [~ [EG [~ [[~ [p5<=p22] & E [true U p2<=0]]]]] & ~ [E [~ [[~ [p5<=p22] & E [true U p2<=0]]] U [~ [[p13<=p15 & p25<=0]] & ~ [[~ [p5<=p22] & E [true U p2<=0]]]]]]]]] & [EG [[p20<=p18 | p25<=0]] & EX [~ [E [true U ~ [[~ [EX [~ [p12<=0]]] & [1<=p8 & p12<=p14]]]]]]]]]
abstracting: (p12<=p14)
states: 43
abstracting: (1<=p8)
states: 1
abstracting: (p12<=0)
states: 43
..abstracting: (p25<=0)
states: 56
abstracting: (p20<=p18)
states: 53
EG iterations: 0
abstracting: (p2<=0)
states: 52
abstracting: (p5<=p22)
states: 53
abstracting: (p25<=0)
states: 56
abstracting: (p13<=p15)
states: 54
abstracting: (p2<=0)
states: 52
abstracting: (p5<=p22)
states: 53
abstracting: (p2<=0)
states: 52
abstracting: (p5<=p22)
states: 53
.
EG iterations: 1
abstracting: (1<=p22)
states: 1
abstracting: (1<=p18)
states: 5
.abstracting: (p22<=p3)
states: 56
abstracting: (p10<=1)
states: 57
abstracting: (1<=p9)
states: 1
.abstracting: (p3<=p19)
states: 52
..
EG iterations: 2
abstracting: (p3<=p19)
states: 52
abstracting: (1<=p8)
states: 1
abstracting: (p3<=p19)
states: 52
abstracting: (1<=p14)
states: 3
abstracting: (p10<=0)
states: 56
abstracting: (1<=p28)
states: 3
abstracting: (1<=p2)
states: 5
abstracting: (p10<=0)
states: 56
abstracting: (1<=p28)
states: 3
abstracting: (p10<=0)
states: 56
abstracting: (1<=p28)
states: 3
..
EG iterations: 2
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: [[[AX [~ [E [[p16<=p13 | 1<=p18] U 1<=p19]]] | A [EG [[A [1<=p28 U p1<=0] | EF [p10<=p24]]] U [EG [~ [p22<=p3]] | EG [~ [1<=p4]]]]] & [~ [EX [p24<=1]] & [EF [E [[p18<=1 & p1<=1] U [p2<=1 | 1<=p2]]] | A [[~ [[p16<=p23 & p26<=1]] & [[p7<=p21 & p27<=1] | [1<=p27 & 1<=p24]]] U EG [A [1<=p4 U p9<=1]]]]]] & [EX [~ [1<=p6]] & A [AX [AF [EG [1<=p15]]] U p11<=p26]]]
normalized: [[[[[~ [EG [~ [EG [[~ [EG [~ [p9<=1]]] & ~ [E [~ [p9<=1] U [~ [1<=p4] & ~ [p9<=1]]]]]]]]] & ~ [E [~ [EG [[~ [EG [~ [p9<=1]]] & ~ [E [~ [p9<=1] U [~ [1<=p4] & ~ [p9<=1]]]]]]] U [~ [[[[1<=p27 & 1<=p24] | [p7<=p21 & p27<=1]] & ~ [[p16<=p23 & p26<=1]]]] & ~ [EG [[~ [EG [~ [p9<=1]]] & ~ [E [~ [p9<=1] U [~ [1<=p4] & ~ [p9<=1]]]]]]]]]]] | E [true U E [[p18<=1 & p1<=1] U [p2<=1 | 1<=p2]]]] & ~ [EX [p24<=1]]] & [[~ [EG [~ [[EG [~ [1<=p4]] | EG [~ [p22<=p3]]]]]] & ~ [E [~ [[EG [~ [1<=p4]] | EG [~ [p22<=p3]]]] U [~ [EG [[E [true U p10<=p24] | [~ [EG [~ [p1<=0]]] & ~ [E [~ [p1<=0] U [~ [1<=p28] & ~ [p1<=0]]]]]]]] & ~ [[EG [~ [1<=p4]] | EG [~ [p22<=p3]]]]]]]] | ~ [EX [E [[p16<=p13 | 1<=p18] U 1<=p19]]]]] & [[~ [EG [~ [p11<=p26]]] & ~ [E [~ [p11<=p26] U [EX [EG [~ [EG [1<=p15]]]] & ~ [p11<=p26]]]]] & EX [~ [1<=p6]]]]
abstracting: (1<=p6)
states: 4
.abstracting: (p11<=p26)
states: 57
abstracting: (1<=p15)
states: 5
.
EG iterations: 1
.
EG iterations: 1
.abstracting: (p11<=p26)
states: 57
abstracting: (p11<=p26)
states: 57
.
EG iterations: 1
abstracting: (1<=p19)
states: 4
abstracting: (1<=p18)
states: 5
abstracting: (p16<=p13)
states: 52
.abstracting: (p22<=p3)
states: 56
.
EG iterations: 1
abstracting: (1<=p4)
states: 5
.
EG iterations: 1
abstracting: (p1<=0)
states: 52
abstracting: (1<=p28)
states: 3
abstracting: (p1<=0)
states: 52
abstracting: (p1<=0)
states: 52
.
EG iterations: 1
abstracting: (p10<=p24)
states: 56
EG iterations: 0
abstracting: (p22<=p3)
states: 56
.
EG iterations: 1
abstracting: (1<=p4)
states: 5
.
EG iterations: 1
abstracting: (p22<=p3)
states: 56
.
EG iterations: 1
abstracting: (1<=p4)
states: 5
.
EG iterations: 1
..
EG iterations: 2
abstracting: (p24<=1)
states: 57
.abstracting: (1<=p2)
states: 5
abstracting: (p2<=1)
states: 57
abstracting: (p1<=1)
states: 57
abstracting: (p18<=1)
states: 57
abstracting: (p9<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p9<=1)
states: 57
abstracting: (p9<=1)
states: 57
.
EG iterations: 1
EG iterations: 0
abstracting: (p26<=1)
states: 57
abstracting: (p16<=p23)
states: 52
abstracting: (p27<=1)
states: 57
abstracting: (p7<=p21)
states: 54
abstracting: (1<=p24)
states: 1
abstracting: (1<=p27)
states: 3
abstracting: (p9<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p9<=1)
states: 57
abstracting: (p9<=1)
states: 57
.
EG iterations: 1
EG iterations: 0
abstracting: (p9<=1)
states: 57
abstracting: (1<=p4)
states: 5
abstracting: (p9<=1)
states: 57
abstracting: (p9<=1)
states: 57
.
EG iterations: 1
EG iterations: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: E [[~ [[~ [[p27<=p3 | p8<=p18]] & ~ [EF [[p11<=1 & p26<=0]]]]] & AG [~ [[[EF [1<=p0] | E [p17<=0 U 1<=p5]] | p22<=p21]]]] U EG [[[AX [[p3<=p11 | p17<=0]] & [AG [1<=p12] | [[p6<=p28 | p23<=1] & ~ [p11<=0]]]] | [[[[1<=p7 & 1<=p0] | [p23<=p25 | p6<=p20]] | [[p9<=0 & 1<=p22] & 1<=p17]] & [AG [p21<=p13] | AF [p22<=p23]]]]]]
normalized: E [[~ [[~ [E [true U [p11<=1 & p26<=0]]] & ~ [[p27<=p3 | p8<=p18]]]] & ~ [E [true U [[E [p17<=0 U 1<=p5] | E [true U 1<=p0]] | p22<=p21]]]] U EG [[[[~ [EG [~ [p22<=p23]]] | ~ [E [true U ~ [p21<=p13]]]] & [[[p9<=0 & 1<=p22] & 1<=p17] | [[p23<=p25 | p6<=p20] | [1<=p7 & 1<=p0]]]] | [[[~ [p11<=0] & [p6<=p28 | p23<=1]] | ~ [E [true U ~ [1<=p12]]]] & ~ [EX [~ [[p3<=p11 | p17<=0]]]]]]]]
abstracting: (p17<=0)
states: 52
abstracting: (p3<=p11)
states: 52
.abstracting: (1<=p12)
states: 14
abstracting: (p23<=1)
states: 57
abstracting: (p6<=p28)
states: 53
abstracting: (p11<=0)
states: 56
abstracting: (1<=p0)
states: 1
abstracting: (1<=p7)
states: 4
abstracting: (p6<=p20)
states: 54
abstracting: (p23<=p25)
states: 56
abstracting: (1<=p17)
states: 5
abstracting: (1<=p22)
states: 1
abstracting: (p9<=0)
states: 56
abstracting: (p21<=p13)
states: 53
abstracting: (p22<=p23)
states: 56
.
EG iterations: 1
EG iterations: 0
abstracting: (p22<=p21)
states: 56
abstracting: (1<=p0)
states: 1
abstracting: (1<=p5)
states: 4
abstracting: (p17<=0)
states: 52
abstracting: (p8<=p18)
states: 56
abstracting: (p27<=p3)
states: 54
abstracting: (p26<=0)
states: 43
abstracting: (p11<=1)
states: 57
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: E [[AF [[[A [1<=p26 U 1<=p0] & [~ [p19<=1] & EX [p15<=p11]]] | AG [~ [p0<=0]]]] & [[[~ [[~ [1<=p8] | AX [p16<=p24]]] & [1<=p19 | [~ [p14<=p5] | 1<=p17]]] | p23<=p29] | [[~ [[EF [p6<=p1] | A [p15<=0 U 1<=p15]]] | [[EG [1<=p6] | ~ [p0<=0]] & [p19<=0 & EX [1<=p13]]]] & ~ [[AX [p12<=1] | ~ [p14<=0]]]]]] U [[EG [[AX [p9<=1] & ~ [E [p25<=p18 U 1<=p21]]]] & [EF [E [p18<=p21 U 1<=p13]] | ~ [[~ [1<=p29] | [[p18<=p19 & p23<=1] | EF [p21<=p24]]]]]] & E [1<=p26 U EF [[[1<=p9 & p12<=0] & 1<=p26]]]]]
normalized: E [[[[~ [[~ [p14<=0] | ~ [EX [~ [p12<=1]]]]] & [[[EX [1<=p13] & p19<=0] & [~ [p0<=0] | EG [1<=p6]]] | ~ [[[~ [EG [~ [1<=p15]]] & ~ [E [~ [1<=p15] U [~ [p15<=0] & ~ [1<=p15]]]]] | E [true U p6<=p1]]]]] | [[[[~ [p14<=p5] | 1<=p17] | 1<=p19] & ~ [[~ [EX [~ [p16<=p24]]] | ~ [1<=p8]]]] | p23<=p29]] & ~ [EG [~ [[~ [E [true U p0<=0]] | [[EX [p15<=p11] & ~ [p19<=1]] & [~ [EG [~ [1<=p0]]] & ~ [E [~ [1<=p0] U [~ [1<=p26] & ~ [1<=p0]]]]]]]]]]] U [E [1<=p26 U E [true U [[1<=p9 & p12<=0] & 1<=p26]]] & [[~ [[[E [true U p21<=p24] | [p18<=p19 & p23<=1]] | ~ [1<=p29]]] | E [true U E [p18<=p21 U 1<=p13]]] & EG [[~ [E [p25<=p18 U 1<=p21]] & ~ [EX [~ [p9<=1]]]]]]]]
abstracting: (p9<=1)
states: 57
.abstracting: (1<=p21)
states: 4
abstracting: (p25<=p18)
states: 56
.
EG iterations: 1
abstracting: (1<=p13)
states: 3
abstracting: (p18<=p21)
states: 52
abstracting: (1<=p29)
states: 56
abstracting: (p23<=1)
states: 57
abstracting: (p18<=p19)
states: 52
abstracting: (p21<=p24)
states: 53
abstracting: (1<=p26)
states: 14
abstracting: (p12<=0)
states: 43
abstracting: (1<=p9)
states: 1
abstracting: (1<=p26)
states: 14
abstracting: (1<=p0)
states: 1
abstracting: (1<=p26)
states: 14
abstracting: (1<=p0)
states: 1
abstracting: (1<=p0)
states: 1
.
EG iterations: 1
abstracting: (p19<=1)
states: 57
abstracting: (p15<=p11)
states: 52
.abstracting: (p0<=0)
states: 56
EG iterations: 0
abstracting: (p23<=p29)
states: 57
abstracting: (1<=p8)
states: 1
abstracting: (p16<=p24)
states: 52
.abstracting: (1<=p19)
states: 4
abstracting: (1<=p17)
states: 5
abstracting: (p14<=p5)
states: 54
abstracting: (p6<=p1)
states: 53
abstracting: (1<=p15)
states: 5
abstracting: (p15<=0)
states: 52
abstracting: (1<=p15)
states: 5
abstracting: (1<=p15)
states: 5
.
EG iterations: 1
abstracting: (1<=p6)
states: 4
..
EG iterations: 2
abstracting: (p0<=0)
states: 56
abstracting: (p19<=0)
states: 53
abstracting: (1<=p13)
states: 3
.abstracting: (p12<=1)
states: 57
.abstracting: (p14<=0)
states: 54
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.011sec
checking: E [[[[E [p0<=1 U E [p19<=0 U 1<=p22]] & [~ [[AG [p11<=p1] & AF [p19<=p19]]] & [[p1<=p25 | [p10<=0 | p7<=p7]] & AX [1<=p11]]]] | [[AG [A [p27<=p20 U 1<=p27]] | [[~ [1<=p1] | EX [p21<=1]] | EX [1<=p0]]] | ~ [EX [AG [1<=p2]]]]] & E [[~ [[EX [1<=p26] & 1<=p13]] & [[[p12<=1 & p19<=p1] | [p14<=p20 & 1<=p19]] | 1<=p12]] U ~ [p9<=1]]] U [[[1<=p15 & p10<=p9] | [[[[1<=p21 | [1<=p27 & 1<=p1]] & AX [p20<=0]] & p0<=p27] | p15<=p26]] & ~ [[EF [A [p23<=p2 U p3<=p7]] | [1<=p4 | [~ [[p6<=p3 & p15<=p28]] | EG [1<=p17]]]]]]]
normalized: E [[E [[[[[p14<=p20 & 1<=p19] | [p12<=1 & p19<=p1]] | 1<=p12] & ~ [[EX [1<=p26] & 1<=p13]]] U ~ [p9<=1]] & [[~ [EX [~ [E [true U ~ [1<=p2]]]]] | [[EX [1<=p0] | [EX [p21<=1] | ~ [1<=p1]]] | ~ [E [true U ~ [[~ [EG [~ [1<=p27]]] & ~ [E [~ [1<=p27] U [~ [p27<=p20] & ~ [1<=p27]]]]]]]]]] | [[[~ [EX [~ [1<=p11]]] & [[p10<=0 | p7<=p7] | p1<=p25]] & ~ [[~ [EG [~ [p19<=p19]]] & ~ [E [true U ~ [p11<=p1]]]]]] & E [p0<=1 U E [p19<=0 U 1<=p22]]]]] U [~ [[[[EG [1<=p17] | ~ [[p6<=p3 & p15<=p28]]] | 1<=p4] | E [true U [~ [EG [~ [p3<=p7]]] & ~ [E [~ [p3<=p7] U [~ [p23<=p2] & ~ [p3<=p7]]]]]]]] & [[[[~ [EX [~ [p20<=0]]] & [[1<=p27 & 1<=p1] | 1<=p21]] & p0<=p27] | p15<=p26] | [1<=p15 & p10<=p9]]]]
abstracting: (p10<=p9)
states: 56
abstracting: (1<=p15)
states: 5
abstracting: (p15<=p26)
states: 52
abstracting: (p0<=p27)
states: 56
abstracting: (1<=p21)
states: 4
abstracting: (1<=p1)
states: 5
abstracting: (1<=p27)
states: 3
abstracting: (p20<=0)
states: 53
.abstracting: (p3<=p7)
states: 52
abstracting: (p23<=p2)
states: 56
abstracting: (p3<=p7)
states: 52
abstracting: (p3<=p7)
states: 52
..
EG iterations: 2
abstracting: (1<=p4)
states: 5
abstracting: (p15<=p28)
states: 52
abstracting: (p6<=p3)
states: 53
abstracting: (1<=p17)
states: 5
..
EG iterations: 2
abstracting: (1<=p22)
states: 1
abstracting: (p19<=0)
states: 53
abstracting: (p0<=1)
states: 57
abstracting: (p11<=p1)
states: 56
abstracting: (p19<=p19)
states: 57
.
EG iterations: 1
abstracting: (p1<=p25)
states: 52
abstracting: (p7<=p7)
states: 57
abstracting: (p10<=0)
states: 56
abstracting: (1<=p11)
states: 1
.abstracting: (1<=p27)
states: 3
abstracting: (p27<=p20)
states: 54
abstracting: (1<=p27)
states: 3
abstracting: (1<=p27)
states: 3
.....
EG iterations: 5
abstracting: (1<=p1)
states: 5
abstracting: (p21<=1)
states: 57
.abstracting: (1<=p0)
states: 1
.abstracting: (1<=p2)
states: 5
.abstracting: (p9<=1)
states: 57
abstracting: (1<=p13)
states: 3
abstracting: (1<=p26)
states: 14
.abstracting: (1<=p12)
states: 14
abstracting: (p19<=p1)
states: 53
abstracting: (p12<=1)
states: 57
abstracting: (1<=p19)
states: 4
abstracting: (p14<=p20)
states: 54
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
totally nodes used: 16458 (1.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 30549 72771 103320
used/not used/entry size/cache size: 86708 67022156 16 1024MB
basic ops cache: hits/miss/sum: 13930 26083 40013
used/not used/entry size/cache size: 40130 16737086 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: 765 1285 2050
used/not used/entry size/cache size: 1285 8387323 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 67092570
1 16131
2 162
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.310sec
BK_STOP 1679387222026
--------------------
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:558 (8), effective:31 (0)
initing FirstDep: 0m 0.000sec
iterations count:73 (1), effective:2 (0)
iterations count:66 (1), effective:0 (0)
iterations count:66 (1), effective:0 (0)
iterations count:66 (1), effective:0 (0)
iterations count:66 (1), effective:0 (0)
iterations count:66 (1), effective:0 (0)
iterations count:77 (1), effective:1 (0)
iterations count:484 (7), effective:26 (0)
iterations count:66 (1), effective:0 (0)
iterations count:260 (3), effective:13 (0)
iterations count:424 (6), effective:25 (0)
iterations count:75 (1), effective:1 (0)
iterations count:66 (1), effective:0 (0)
iterations count:71 (1), effective:1 (0)
iterations count:69 (1), effective:1 (0)
iterations count:72 (1), effective:1 (0)
iterations count:66 (1), effective:0 (0)
iterations count:71 (1), effective:1 (0)
iterations count:69 (1), effective:1 (0)
iterations count:72 (1), effective:1 (0)
iterations count:66 (1), effective:0 (0)
iterations count:71 (1), effective:1 (0)
iterations count:69 (1), effective:1 (0)
iterations count:72 (1), effective:1 (0)
iterations count:91 (1), effective:1 (0)
iterations count:75 (1), effective:1 (0)
iterations count:444 (6), effective:27 (0)
iterations count:77 (1), effective:2 (0)
iterations count:66 (1), effective:0 (0)
iterations count:90 (1), effective:1 (0)
iterations count:90 (1), effective:1 (0)
iterations count:372 (5), effective:23 (0)
iterations count:90 (1), effective:1 (0)
iterations count:66 (1), effective:0 (0)
iterations count:405 (6), effective:25 (0)
iterations count:72 (1), effective:1 (0)
iterations count:405 (6), effective:22 (0)
iterations count:66 (1), effective:0 (0)
iterations count:71 (1), effective:1 (0)
iterations count:66 (1), effective:0 (0)
iterations count:66 (1), effective:0 (0)
iterations count:254 (3), effective:13 (0)
iterations count:419 (6), effective:25 (0)
iterations count:66 (1), effective:0 (0)
iterations count:409 (6), effective:23 (0)
iterations count:66 (1), effective:0 (0)
iterations count:260 (3), effective:13 (0)
iterations count:66 (1), effective:0 (0)
iterations count:417 (6), effective:24 (0)
iterations count:73 (1), effective:2 (0)
iterations count:66 (1), effective:0 (0)
iterations count:77 (1), effective:1 (0)
iterations count:410 (6), effective:25 (0)
iterations count:66 (1), effective:0 (0)
iterations count:260 (3), effective:13 (0)
iterations count:72 (1), effective:1 (0)
iterations count:82 (1), effective:1 (0)
iterations count:75 (1), effective:1 (0)
iterations count:443 (6), effective:25 (0)
iterations count:107 (1), effective:1 (0)
iterations count:431 (6), effective:25 (0)
iterations count:94 (1), effective:3 (0)
iterations count:90 (1), effective:1 (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="StigmergyElection-PT-02a"
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 StigmergyElection-PT-02a, 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 r449-smll-167912641700553"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-02a.tgz
mv StigmergyElection-PT-02a 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 ;