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.031 | 5613.00 | 5070.00 | 0.00 | TTTFTTTFTTTFTTTF | 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-167912641700558.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641700558
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-01
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-02
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-03
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-04
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-05
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-06
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-07
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-08
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-09
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-10
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-11
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-12
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-13
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-14
FORMULA_NAME StigmergyElection-PT-02a-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679387293031
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=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyElection-PT-02a
Not applying reductions.
Model is PT
ReachabilityCardinality 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=ReachabilityCardinality.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.631sec
RS generation: 0m 0.002sec
-> reachability set: #nodes 172 (1.7e+02) #states 57
starting MCC model checker
--------------------------
checking: EF [p2<=1]
normalized: E [true U p2<=1]
abstracting: (p2<=1)
states: 57
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [1<=p26]
normalized: E [true U 1<=p26]
abstracting: (1<=p26)
states: 14
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [p20<=1]
normalized: ~ [E [true U ~ [p20<=1]]]
abstracting: (p20<=1)
states: 57
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [p6<=p17]
normalized: ~ [E [true U ~ [p6<=p17]]]
abstracting: (p6<=p17)
states: 53
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: EF [p16<=p11]
normalized: E [true U p16<=p11]
abstracting: (p16<=p11)
states: 52
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [p20<=p12]
normalized: E [true U p20<=p12]
abstracting: (p20<=p12)
states: 54
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[1<=p20 & p8<=0]]
normalized: E [true U [1<=p20 & p8<=0]]
abstracting: (p8<=0)
states: 56
abstracting: (1<=p20)
states: 4
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[~ [p20<=0] | p9<=0]]
normalized: ~ [E [true U ~ [[~ [p20<=0] | p9<=0]]]]
abstracting: (p9<=0)
states: 56
abstracting: (p20<=0)
states: 53
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [~ [[p10<=1 & [~ [[~ [[p20<=p16 & [1<=p22 & [p5<=0 | 1<=p24]]]] & [[[[p7<=0 & p26<=0] | 1<=p23] & [~ [p11<=0] & 1<=p3]] | p19<=0]]] | p7<=p13]]]]
normalized: E [true U ~ [[[~ [[[[[~ [p11<=0] & 1<=p3] & [[p7<=0 & p26<=0] | 1<=p23]] | p19<=0] & ~ [[[[p5<=0 | 1<=p24] & 1<=p22] & p20<=p16]]]] | p7<=p13] & p10<=1]]]
abstracting: (p10<=1)
states: 57
abstracting: (p7<=p13)
states: 53
abstracting: (p20<=p16)
states: 53
abstracting: (1<=p22)
states: 1
abstracting: (1<=p24)
states: 1
abstracting: (p5<=0)
states: 53
abstracting: (p19<=0)
states: 53
abstracting: (1<=p23)
states: 1
abstracting: (p26<=0)
states: 43
abstracting: (p7<=0)
states: 53
abstracting: (1<=p3)
states: 5
abstracting: (p11<=0)
states: 56
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: EF [[~ [[1<=p6 & [~ [[[~ [p10<=0] | [[1<=p24 & p21<=p6] | p24<=0]] & [[~ [p6<=1] | [p1<=p29 | p1<=p17]] | [[1<=p4 | 1<=p11] | [p19<=1 & p1<=1]]]]] | [~ [p13<=0] & 1<=p29]]]] & ~ [p5<=p28]]]
normalized: E [true U [~ [[[~ [[[[[p19<=1 & p1<=1] | [1<=p4 | 1<=p11]] | [[p1<=p29 | p1<=p17] | ~ [p6<=1]]] & [[[1<=p24 & p21<=p6] | p24<=0] | ~ [p10<=0]]]] | [~ [p13<=0] & 1<=p29]] & 1<=p6]] & ~ [p5<=p28]]]
abstracting: (p5<=p28)
states: 53
abstracting: (1<=p6)
states: 4
abstracting: (1<=p29)
states: 56
abstracting: (p13<=0)
states: 54
abstracting: (p10<=0)
states: 56
abstracting: (p24<=0)
states: 56
abstracting: (p21<=p6)
states: 54
abstracting: (1<=p24)
states: 1
abstracting: (p6<=1)
states: 57
abstracting: (p1<=p17)
states: 53
abstracting: (p1<=p29)
states: 57
abstracting: (1<=p11)
states: 1
abstracting: (1<=p4)
states: 5
abstracting: (p1<=1)
states: 57
abstracting: (p19<=1)
states: 57
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AG [[~ [1<=p14] & [[p18<=0 & p25<=0] | ~ [[~ [[[[~ [p18<=p22] & [p24<=p6 | 1<=p28]] | ~ [p21<=p4]] & p4<=p5]] | [[~ [1<=p2] | p0<=1] | ~ [[p26<=p23 | [[p14<=0 & 1<=p5] & [p9<=p26 | p18<=0]]]]]]]]]]
normalized: ~ [E [true U ~ [[[~ [[~ [[[~ [p21<=p4] | [[p24<=p6 | 1<=p28] & ~ [p18<=p22]]] & p4<=p5]] | [~ [[[[p14<=0 & 1<=p5] & [p9<=p26 | p18<=0]] | p26<=p23]] | [~ [1<=p2] | p0<=1]]]] | [p18<=0 & p25<=0]] & ~ [1<=p14]]]]]
abstracting: (1<=p14)
states: 3
abstracting: (p25<=0)
states: 56
abstracting: (p18<=0)
states: 52
abstracting: (p0<=1)
states: 57
abstracting: (1<=p2)
states: 5
abstracting: (p26<=p23)
states: 43
abstracting: (p18<=0)
states: 52
abstracting: (p9<=p26)
states: 57
abstracting: (1<=p5)
states: 4
abstracting: (p14<=0)
states: 54
abstracting: (p4<=p5)
states: 52
abstracting: (p18<=p22)
states: 52
abstracting: (1<=p28)
states: 3
abstracting: (p24<=p6)
states: 56
abstracting: (p21<=p4)
states: 53
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.004sec
checking: AG [~ [[1<=p17 & ~ [[~ [[p26<=p29 & [~ [[p0<=p24 & p28<=1]] | ~ [p27<=1]]]] & [[[p23<=1 & [[p9<=p1 & 1<=p17] | [p12<=1 | p18<=p22]]] & p2<=0] | ~ [[[[p0<=p4 | p4<=1] & [p28<=0 | p16<=p21]] & 1<=p25]]]]]]]]
normalized: ~ [E [true U [~ [[[~ [[[[p28<=0 | p16<=p21] & [p0<=p4 | p4<=1]] & 1<=p25]] | [[[[p12<=1 | p18<=p22] | [p9<=p1 & 1<=p17]] & p23<=1] & p2<=0]] & ~ [[[~ [p27<=1] | ~ [[p0<=p24 & p28<=1]]] & p26<=p29]]]] & 1<=p17]]]
abstracting: (1<=p17)
states: 5
abstracting: (p26<=p29)
states: 57
abstracting: (p28<=1)
states: 57
abstracting: (p0<=p24)
states: 56
abstracting: (p27<=1)
states: 57
abstracting: (p2<=0)
states: 52
abstracting: (p23<=1)
states: 57
abstracting: (1<=p17)
states: 5
abstracting: (p9<=p1)
states: 56
abstracting: (p18<=p22)
states: 52
abstracting: (p12<=1)
states: 57
abstracting: (1<=p25)
states: 1
abstracting: (p4<=1)
states: 57
abstracting: (p0<=p4)
states: 56
abstracting: (p16<=p21)
states: 52
abstracting: (p28<=0)
states: 54
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [~ [[[p26<=p18 & 1<=p14] & [~ [[[~ [[p1<=p11 & p18<=p25]] | [[p13<=0 & 1<=p25] & ~ [p22<=0]]] & [1<=p3 & [~ [1<=p10] & ~ [1<=p9]]]]] & [~ [p4<=0] | [~ [[[[p14<=0 | p25<=1] | [1<=p12 & p25<=p29]] & [~ [1<=p19] | [1<=p2 & p25<=0]]]] & 1<=p7]]]]]]
normalized: E [true U ~ [[[[[~ [[[~ [1<=p19] | [1<=p2 & p25<=0]] & [[1<=p12 & p25<=p29] | [p14<=0 | p25<=1]]]] & 1<=p7] | ~ [p4<=0]] & ~ [[[[~ [1<=p9] & ~ [1<=p10]] & 1<=p3] & [[~ [p22<=0] & [p13<=0 & 1<=p25]] | ~ [[p1<=p11 & p18<=p25]]]]]] & [p26<=p18 & 1<=p14]]]]
abstracting: (1<=p14)
states: 3
abstracting: (p26<=p18)
states: 43
abstracting: (p18<=p25)
states: 52
abstracting: (p1<=p11)
states: 52
abstracting: (1<=p25)
states: 1
abstracting: (p13<=0)
states: 54
abstracting: (p22<=0)
states: 56
abstracting: (1<=p3)
states: 5
abstracting: (1<=p10)
states: 1
abstracting: (1<=p9)
states: 1
abstracting: (p4<=0)
states: 52
abstracting: (1<=p7)
states: 4
abstracting: (p25<=1)
states: 57
abstracting: (p14<=0)
states: 54
abstracting: (p25<=p29)
states: 57
abstracting: (1<=p12)
states: 14
abstracting: (p25<=0)
states: 56
abstracting: (1<=p2)
states: 5
abstracting: (1<=p19)
states: 4
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[~ [[~ [1<=p21] | ~ [1<=p0]]] & [p13<=p29 | [[~ [[1<=p3 & [[p26<=1 | p23<=1] & ~ [p15<=p13]]]] | ~ [[~ [p10<=p26] & [~ [1<=p17] | [p3<=0 | p1<=p10]]]]] & [p12<=0 | [[p2<=p2 | ~ [p6<=p9]] | p20<=0]]]]] & [1<=p29 | ~ [[[p16<=p15 & [1<=p23 & p2<=0]] & [[[p25<=p17 | ~ [1<=p0]] & p27<=p15] | ~ [[1<=p27 | p29<=p7]]]]]]]]
normalized: E [true U [[~ [[[~ [[1<=p27 | p29<=p7]] | [[~ [1<=p0] | p25<=p17] & p27<=p15]] & [[1<=p23 & p2<=0] & p16<=p15]]] | 1<=p29] & [[[[[[~ [p6<=p9] | p2<=p2] | p20<=0] | p12<=0] & [~ [[[[p3<=0 | p1<=p10] | ~ [1<=p17]] & ~ [p10<=p26]]] | ~ [[[~ [p15<=p13] & [p26<=1 | p23<=1]] & 1<=p3]]]] | p13<=p29] & ~ [[~ [1<=p0] | ~ [1<=p21]]]]]]
abstracting: (1<=p21)
states: 4
abstracting: (1<=p0)
states: 1
abstracting: (p13<=p29)
states: 57
abstracting: (1<=p3)
states: 5
abstracting: (p23<=1)
states: 57
abstracting: (p26<=1)
states: 57
abstracting: (p15<=p13)
states: 52
abstracting: (p10<=p26)
states: 57
abstracting: (1<=p17)
states: 5
abstracting: (p1<=p10)
states: 52
abstracting: (p3<=0)
states: 52
abstracting: (p12<=0)
states: 43
abstracting: (p20<=0)
states: 53
abstracting: (p2<=p2)
states: 57
abstracting: (p6<=p9)
states: 53
abstracting: (1<=p29)
states: 56
abstracting: (p16<=p15)
states: 52
abstracting: (p2<=0)
states: 52
abstracting: (1<=p23)
states: 1
abstracting: (p27<=p15)
states: 54
abstracting: (p25<=p17)
states: 56
abstracting: (1<=p0)
states: 1
abstracting: (p29<=p7)
states: 5
abstracting: (1<=p27)
states: 3
-> the formula is FALSE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[~ [[[p23<=1 & ~ [[[1<=p10 & p7<=p20] & ~ [1<=p29]]]] & [[[[p13<=1 | ~ [1<=p23]] | [~ [[p28<=0 | p25<=p12]] & [[p7<=p11 & p13<=1] | [p10<=p16 & 1<=p11]]]] & p14<=p27] | 1<=p1]]] | [~ [p19<=0] | ~ [[~ [[[~ [p17<=0] & 1<=p16] & p9<=p0]] & [p3<=0 & [p17<=p7 & [p26<=p18 & [[1<=p0 & p24<=0] & [p25<=p16 & 1<=p20]]]]]]]]]]
normalized: E [true U [[~ [[[[[[[p25<=p16 & 1<=p20] & [1<=p0 & p24<=0]] & p26<=p18] & p17<=p7] & p3<=0] & ~ [[[~ [p17<=0] & 1<=p16] & p9<=p0]]]] | ~ [p19<=0]] | ~ [[[[[[[[p10<=p16 & 1<=p11] | [p7<=p11 & p13<=1]] & ~ [[p28<=0 | p25<=p12]]] | [~ [1<=p23] | p13<=1]] & p14<=p27] | 1<=p1] & [~ [[~ [1<=p29] & [1<=p10 & p7<=p20]]] & p23<=1]]]]]
abstracting: (p23<=1)
states: 57
abstracting: (p7<=p20)
states: 54
abstracting: (1<=p10)
states: 1
abstracting: (1<=p29)
states: 56
abstracting: (1<=p1)
states: 5
abstracting: (p14<=p27)
states: 55
abstracting: (p13<=1)
states: 57
abstracting: (1<=p23)
states: 1
abstracting: (p25<=p12)
states: 57
abstracting: (p28<=0)
states: 54
abstracting: (p13<=1)
states: 57
abstracting: (p7<=p11)
states: 53
abstracting: (1<=p11)
states: 1
abstracting: (p10<=p16)
states: 56
abstracting: (p19<=0)
states: 53
abstracting: (p9<=p0)
states: 56
abstracting: (1<=p16)
states: 5
abstracting: (p17<=0)
states: 52
abstracting: (p3<=0)
states: 52
abstracting: (p17<=p7)
states: 52
abstracting: (p26<=p18)
states: 43
abstracting: (p24<=0)
states: 56
abstracting: (1<=p0)
states: 1
abstracting: (1<=p20)
states: 4
abstracting: (p25<=p16)
states: 56
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[[~ [[~ [[~ [[[p16<=1 & p5<=1] | [p14<=1 & p9<=p15]]] | [~ [[1<=p27 & p5<=0]] & [~ [p8<=p5] | [p16<=p20 | p2<=0]]]]] & [[[~ [[1<=p19 & 1<=p19]] & 1<=p0] | [p6<=1 & [[1<=p13 & p18<=1] & [p29<=0 | p5<=p23]]]] & ~ [1<=p29]]]] | [[~ [[p7<=p3 | p18<=p12]] & [~ [1<=p6] | ~ [[[p13<=p26 | ~ [1<=p2]] & ~ [p9<=p2]]]]] | ~ [[[~ [[~ [1<=p23] | ~ [1<=p21]]] | ~ [p28<=1]] | ~ [[[[1<=p21 & p19<=p7] | 1<=p18] & ~ [1<=p24]]]]]]] & [~ [[[[~ [[p14<=0 & p28<=1]] & [[~ [p4<=0] & ~ [p26<=1]] | ~ [[p14<=1 & 1<=p29]]]] & [~ [[~ [p18<=0] | [1<=p15 & p3<=p22]]] & [[[1<=p8 & p26<=p19] | [p15<=1 | p22<=p15]] & [p19<=p13 | ~ [p18<=1]]]]] & [[~ [[[p18<=p1 | p24<=p5] | [1<=p6 | p2<=p23]]] & p17<=0] | [~ [p29<=0] | ~ [[[1<=p15 & p3<=p21] | [p18<=p3 | p11<=1]]]]]]] | [[[[p11<=p10 & [[~ [p0<=p13] | [1<=p26 & p10<=p8]] | ~ [p21<=0]]] & ~ [[p26<=p7 | p8<=0]]] & ~ [[[p9<=p20 | ~ [[p14<=p10 & p21<=1]]] & ~ [[[p0<=1 | 1<=p16] & p24<=p17]]]]] | [[~ [[~ [p4<=p11] & p14<=p8]] & [~ [[[p27<=0 & p13<=p4] & [p13<=0 & p0<=p23]]] & [[~ [1<=p26] | p17<=0] | [[p17<=0 & p20<=0] | p7<=p0]]]] & ~ [[1<=p26 & p14<=p23]]]]]]]
normalized: E [true U [[~ [[[[~ [[[p18<=p3 | p11<=1] | [1<=p15 & p3<=p21]]] | ~ [p29<=0]] | [~ [[[1<=p6 | p2<=p23] | [p18<=p1 | p24<=p5]]] & p17<=0]] & [[[[~ [p18<=1] | p19<=p13] & [[p15<=1 | p22<=p15] | [1<=p8 & p26<=p19]]] & ~ [[[1<=p15 & p3<=p22] | ~ [p18<=0]]]] & [[~ [[p14<=1 & 1<=p29]] | [~ [p26<=1] & ~ [p4<=0]]] & ~ [[p14<=0 & p28<=1]]]]]] | [[~ [[1<=p26 & p14<=p23]] & [[[[[p17<=0 & p20<=0] | p7<=p0] | [~ [1<=p26] | p17<=0]] & ~ [[[p13<=0 & p0<=p23] & [p27<=0 & p13<=p4]]]] & ~ [[~ [p4<=p11] & p14<=p8]]]] | [~ [[~ [[[p0<=1 | 1<=p16] & p24<=p17]] & [~ [[p14<=p10 & p21<=1]] | p9<=p20]]] & [~ [[p26<=p7 | p8<=0]] & [[~ [p21<=0] | [[1<=p26 & p10<=p8] | ~ [p0<=p13]]] & p11<=p10]]]]] & [[~ [[~ [[~ [1<=p24] & [[1<=p21 & p19<=p7] | 1<=p18]]] | [~ [p28<=1] | ~ [[~ [1<=p21] | ~ [1<=p23]]]]]] | [[~ [[~ [p9<=p2] & [~ [1<=p2] | p13<=p26]]] | ~ [1<=p6]] & ~ [[p7<=p3 | p18<=p12]]]] | ~ [[[~ [1<=p29] & [[[[p29<=0 | p5<=p23] & [1<=p13 & p18<=1]] & p6<=1] | [~ [[1<=p19 & 1<=p19]] & 1<=p0]]] & ~ [[[[[p16<=p20 | p2<=0] | ~ [p8<=p5]] & ~ [[1<=p27 & p5<=0]]] | ~ [[[p14<=1 & p9<=p15] | [p16<=1 & p5<=1]]]]]]]]]]
abstracting: (p5<=1)
states: 57
abstracting: (p16<=1)
states: 57
abstracting: (p9<=p15)
states: 56
abstracting: (p14<=1)
states: 57
abstracting: (p5<=0)
states: 53
abstracting: (1<=p27)
states: 3
abstracting: (p8<=p5)
states: 56
abstracting: (p2<=0)
states: 52
abstracting: (p16<=p20)
states: 52
abstracting: (1<=p0)
states: 1
abstracting: (1<=p19)
states: 4
abstracting: (1<=p19)
states: 4
abstracting: (p6<=1)
states: 57
abstracting: (p18<=1)
states: 57
abstracting: (1<=p13)
states: 3
abstracting: (p5<=p23)
states: 53
abstracting: (p29<=0)
states: 1
abstracting: (1<=p29)
states: 56
abstracting: (p18<=p12)
states: 53
abstracting: (p7<=p3)
states: 53
abstracting: (1<=p6)
states: 4
abstracting: (p13<=p26)
states: 55
abstracting: (1<=p2)
states: 5
abstracting: (p9<=p2)
states: 56
abstracting: (1<=p23)
states: 1
abstracting: (1<=p21)
states: 4
abstracting: (p28<=1)
states: 57
abstracting: (1<=p18)
states: 5
abstracting: (p19<=p7)
states: 54
abstracting: (1<=p21)
states: 4
abstracting: (1<=p24)
states: 1
abstracting: (p11<=p10)
states: 56
abstracting: (p0<=p13)
states: 56
abstracting: (p10<=p8)
states: 56
abstracting: (1<=p26)
states: 14
abstracting: (p21<=0)
states: 53
abstracting: (p8<=0)
states: 56
abstracting: (p26<=p7)
states: 44
abstracting: (p9<=p20)
states: 56
abstracting: (p21<=1)
states: 57
abstracting: (p14<=p10)
states: 54
abstracting: (p24<=p17)
states: 56
abstracting: (1<=p16)
states: 5
abstracting: (p0<=1)
states: 57
abstracting: (p14<=p8)
states: 54
abstracting: (p4<=p11)
states: 52
abstracting: (p13<=p4)
states: 54
abstracting: (p27<=0)
states: 54
abstracting: (p0<=p23)
states: 56
abstracting: (p13<=0)
states: 54
abstracting: (p17<=0)
states: 52
abstracting: (1<=p26)
states: 14
abstracting: (p7<=p0)
states: 53
abstracting: (p20<=0)
states: 53
abstracting: (p17<=0)
states: 52
abstracting: (p14<=p23)
states: 54
abstracting: (1<=p26)
states: 14
abstracting: (p28<=1)
states: 57
abstracting: (p14<=0)
states: 54
abstracting: (p4<=0)
states: 52
abstracting: (p26<=1)
states: 57
abstracting: (1<=p29)
states: 56
abstracting: (p14<=1)
states: 57
abstracting: (p18<=0)
states: 52
abstracting: (p3<=p22)
states: 52
abstracting: (1<=p15)
states: 5
abstracting: (p26<=p19)
states: 43
abstracting: (1<=p8)
states: 1
abstracting: (p22<=p15)
states: 56
abstracting: (p15<=1)
states: 57
abstracting: (p19<=p13)
states: 53
abstracting: (p18<=1)
states: 57
abstracting: (p17<=0)
states: 52
abstracting: (p24<=p5)
states: 56
abstracting: (p18<=p1)
states: 53
abstracting: (p2<=p23)
states: 52
abstracting: (1<=p6)
states: 4
abstracting: (p29<=0)
states: 1
abstracting: (p3<=p21)
states: 52
abstracting: (1<=p15)
states: 5
abstracting: (p11<=1)
states: 57
abstracting: (p18<=p3)
states: 53
-> the formula is TRUE
FORMULA StigmergyElection-PT-02a-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.006sec
totally nodes used: 6657 (6.7e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 7281 24854 32135
used/not used/entry size/cache size: 28310 67080554 16 1024MB
basic ops cache: hits/miss/sum: 7387 19756 27143
used/not used/entry size/cache size: 29299 16747917 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: 768 1420 2188
used/not used/entry size/cache size: 1420 8387188 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 67102258
1 6555
2 51
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.541sec
BK_STOP 1679387298644
--------------------
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:66 (1), effective:0 (0)
iterations count:235 (3), effective:13 (0)
iterations count:414 (6), effective:25 (0)
iterations count:72 (1), effective:1 (0)
iterations count:74 (1), effective:1 (0)
iterations count:422 (6), effective:25 (0)
iterations count:410 (6), effective:25 (0)
iterations count:421 (6), effective:25 (0)
iterations count:425 (6), effective:25 (0)
iterations count:419 (6), effective:23 (0)
iterations count:66 (1), effective:0 (0)
iterations count:66 (1), effective:0 (0)
iterations count:66 (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="StigmergyElection-PT-02a"
export BK_EXAMINATION="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167912641700558"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;