fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r449-smll-167912641700569
Last Updated
May 14, 2023

About the Execution of Marcie for StigmergyElection-PT-03a

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5450.199 6680.00 6889.00 230.80 FTTFFFTFTTFTTTTT 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-167912641700569.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-03a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641700569
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 8.7K Feb 26 16:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 101K Feb 26 16:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 26 16:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 26 16:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 16:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Feb 26 16:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 26 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 17:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 31K 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-03a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-03a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679387588860

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-03a
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_03a
(NrP: 44 NrTr: 118 NrArc: 467)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.002sec

net check time: 0m 0.000sec

init dd package: 0m 4.560sec


RS generation: 0m 0.011sec


-> reachability set: #nodes 543 (5.4e+02) #states 227



starting MCC model checker
--------------------------

checking: [~ [AF [EF [AG [p28<=0]]]] | AG [1<=p6]]
normalized: [EG [~ [E [true U ~ [E [true U ~ [p28<=0]]]]]] | ~ [E [true U ~ [1<=p6]]]]

abstracting: (1<=p6)
states: 16
abstracting: (p28<=0)
states: 218
.
EG iterations: 1
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [p37<=p0]
normalized: E [true U p37<=p0]

abstracting: (p37<=p0)
states: 226
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [AF [1<=p10] & AG [EF [~ [[AF [p20<=p29] | p39<=0]]]]]
normalized: [~ [E [true U ~ [E [true U ~ [[~ [EG [~ [p20<=p29]]] | p39<=0]]]]]] & ~ [EG [~ [1<=p10]]]]

abstracting: (1<=p10)
states: 1
.
EG iterations: 1
abstracting: (p39<=0)
states: 226
abstracting: (p20<=p29)
states: 211
..
EG iterations: 2
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AF [EX [~ [[[[1<=p31 | 1<=p23] & [1<=p22 & p34<=p3]] | ~ [p35<=p12]]]]]
normalized: ~ [EG [~ [EX [~ [[~ [p35<=p12] | [[1<=p22 & p34<=p3] & [1<=p31 | 1<=p23]]]]]]]]

abstracting: (1<=p23)
states: 1
abstracting: (1<=p31)
states: 25
abstracting: (p34<=p3)
states: 211
abstracting: (1<=p22)
states: 1
abstracting: (p35<=p12)
states: 215
..
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EX [[p12<=p11 | ~ [[AX [1<=p15] & [~ [p28<=p37] | p41<=p38]]]]]
normalized: EX [[~ [[[~ [p28<=p37] | p41<=p38] & ~ [EX [~ [1<=p15]]]]] | p12<=p11]]

abstracting: (p12<=p11)
states: 171
abstracting: (1<=p15)
states: 25
.abstracting: (p41<=p38)
states: 218
abstracting: (p28<=p37)
states: 218
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AX [AX [A [E [[p30<=1 | p25<=0] U EX [1<=p42]] U [[EF [p31<=1] | ~ [p23<=p8]] | [[1<=p18 | p27<=1] | 1<=p18]]]]]
normalized: ~ [EX [EX [~ [[~ [EG [~ [[[[1<=p18 | p27<=1] | 1<=p18] | [~ [p23<=p8] | E [true U p31<=1]]]]]] & ~ [E [~ [[[[1<=p18 | p27<=1] | 1<=p18] | [~ [p23<=p8] | E [true U p31<=1]]]] U [~ [E [[p30<=1 | p25<=0] U EX [1<=p42]]] & ~ [[[[1<=p18 | p27<=1] | 1<=p18] | [~ [p23<=p8] | E [true U p31<=1]]]]]]]]]]]]

abstracting: (p31<=1)
states: 227
abstracting: (p23<=p8)
states: 226
abstracting: (1<=p18)
states: 25
abstracting: (p27<=1)
states: 227
abstracting: (1<=p18)
states: 25
abstracting: (1<=p42)
states: 9
.abstracting: (p25<=0)
states: 226
abstracting: (p30<=1)
states: 227
abstracting: (p31<=1)
states: 227
abstracting: (p23<=p8)
states: 226
abstracting: (1<=p18)
states: 25
abstracting: (p27<=1)
states: 227
abstracting: (1<=p18)
states: 25
abstracting: (p31<=1)
states: 227
abstracting: (p23<=p8)
states: 226
abstracting: (1<=p18)
states: 25
abstracting: (p27<=1)
states: 227
abstracting: (1<=p18)
states: 25
.
EG iterations: 1
..-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec

checking: AG [AX [E [[AG [1<=p31] & ~ [[1<=p29 | p0<=1]]] U [[E [p35<=p17 U p34<=0] & EX [1<=p17]] & [[1<=p15 & 1<=p1] | [1<=p35 | p40<=0]]]]]]
normalized: ~ [E [true U EX [~ [E [[~ [E [true U ~ [1<=p31]]] & ~ [[1<=p29 | p0<=1]]] U [[[1<=p35 | p40<=0] | [1<=p15 & 1<=p1]] & [EX [1<=p17] & E [p35<=p17 U p34<=0]]]]]]]]

abstracting: (p34<=0)
states: 211
abstracting: (p35<=p17)
states: 211
abstracting: (1<=p17)
states: 25
.abstracting: (1<=p1)
states: 25
abstracting: (1<=p15)
states: 25
abstracting: (p40<=0)
states: 171
abstracting: (1<=p35)
states: 16
abstracting: (p0<=1)
states: 227
abstracting: (1<=p29)
states: 25
abstracting: (1<=p31)
states: 25
.-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: ~ [[EX [p31<=1] & EG [[AF [E [p8<=0 U 1<=p14]] & [AX [[p18<=p38 & p18<=1]] | [~ [E [p23<=p24 U p34<=0]] & p38<=p37]]]]]]
normalized: ~ [[EG [[[[~ [E [p23<=p24 U p34<=0]] & p38<=p37] | ~ [EX [~ [[p18<=p38 & p18<=1]]]]] & ~ [EG [~ [E [p8<=0 U 1<=p14]]]]]] & EX [p31<=1]]]

abstracting: (p31<=1)
states: 227
.abstracting: (1<=p14)
states: 9
abstracting: (p8<=0)
states: 226
.
EG iterations: 1
abstracting: (p18<=1)
states: 227
abstracting: (p18<=p38)
states: 202
.abstracting: (p38<=p37)
states: 226
abstracting: (p34<=0)
states: 211
abstracting: (p23<=p24)
states: 226
.......
EG iterations: 7
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EG [[A [p25<=p40 U ~ [[EG [p41<=1] | EG [1<=p36]]]] | ~ [[1<=p13 | [EX [1<=p16] | [1<=p34 & [p19<=p4 & p31<=p15]]]]]]]
normalized: EG [[~ [[[[[p19<=p4 & p31<=p15] & 1<=p34] | EX [1<=p16]] | 1<=p13]] | [~ [EG [[EG [1<=p36] | EG [p41<=1]]]] & ~ [E [[EG [1<=p36] | EG [p41<=1]] U [~ [p25<=p40] & [EG [1<=p36] | EG [p41<=1]]]]]]]]

abstracting: (p41<=1)
states: 227

EG iterations: 0
abstracting: (1<=p36)
states: 1
.
EG iterations: 1
abstracting: (p25<=p40)
states: 227
abstracting: (p41<=1)
states: 227

EG iterations: 0
abstracting: (1<=p36)
states: 1
.
EG iterations: 1
abstracting: (p41<=1)
states: 227

EG iterations: 0
abstracting: (1<=p36)
states: 1
.
EG iterations: 1

EG iterations: 0
abstracting: (1<=p13)
states: 9
abstracting: (1<=p16)
states: 25
.abstracting: (1<=p34)
states: 16
abstracting: (p31<=p15)
states: 207
abstracting: (p19<=p4)
states: 211
.......
EG iterations: 7
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: [A [p5<=p17 U ~ [[[AG [p31<=p27] & EF [1<=p19]] | p28<=p23]]] & A [~ [p13<=1] U EF [[~ [AX [p32<=1]] | AG [p38<=p35]]]]]
normalized: [[~ [EG [~ [E [true U [~ [E [true U ~ [p38<=p35]]] | EX [~ [p32<=1]]]]]]] & ~ [E [~ [E [true U [~ [E [true U ~ [p38<=p35]]] | EX [~ [p32<=1]]]]] U [~ [E [true U [~ [E [true U ~ [p38<=p35]]] | EX [~ [p32<=1]]]]] & p13<=1]]]] & [~ [EG [[[E [true U 1<=p19] & ~ [E [true U ~ [p31<=p27]]]] | p28<=p23]]] & ~ [E [[[E [true U 1<=p19] & ~ [E [true U ~ [p31<=p27]]]] | p28<=p23] U [~ [p5<=p17] & [[E [true U 1<=p19] & ~ [E [true U ~ [p31<=p27]]]] | p28<=p23]]]]]]

abstracting: (p28<=p23)
states: 218
abstracting: (p31<=p27)
states: 202
abstracting: (1<=p19)
states: 16
abstracting: (p5<=p17)
states: 211
abstracting: (p28<=p23)
states: 218
abstracting: (p31<=p27)
states: 202
abstracting: (1<=p19)
states: 16
abstracting: (p28<=p23)
states: 218
abstracting: (p31<=p27)
states: 202
abstracting: (1<=p19)
states: 16
..
EG iterations: 2
abstracting: (p13<=1)
states: 227
abstracting: (p32<=1)
states: 227
.abstracting: (p38<=p35)
states: 226
abstracting: (p32<=1)
states: 227
.abstracting: (p38<=p35)
states: 226
abstracting: (p32<=1)
states: 227
.abstracting: (p38<=p35)
states: 226
.
EG iterations: 1
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.049sec

checking: EF [[[~ [[EX [1<=p37] | EF [AG [1<=p16]]]] | E [[EG [p2<=p10] | [1<=p31 & [p31<=p33 & p35<=p30]]] U ~ [AG [p15<=0]]]] | AG [A [EF [p23<=p0] U p24<=p22]]]]
normalized: E [true U [~ [E [true U ~ [[~ [EG [~ [p24<=p22]]] & ~ [E [~ [p24<=p22] U [~ [E [true U p23<=p0]] & ~ [p24<=p22]]]]]]]] | [E [[[1<=p31 & [p31<=p33 & p35<=p30]] | EG [p2<=p10]] U E [true U ~ [p15<=0]]] | ~ [[E [true U ~ [E [true U ~ [1<=p16]]]] | EX [1<=p37]]]]]]

abstracting: (1<=p37)
states: 1
.abstracting: (1<=p16)
states: 25
abstracting: (p15<=0)
states: 202
abstracting: (p2<=p10)
states: 202
...
EG iterations: 3
abstracting: (p35<=p30)
states: 211
abstracting: (p31<=p33)
states: 202
abstracting: (1<=p31)
states: 25
abstracting: (p24<=p22)
states: 226
abstracting: (p23<=p0)
states: 226
abstracting: (p24<=p22)
states: 226
abstracting: (p24<=p22)
states: 226
..
EG iterations: 2
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: [A [A [[[AF [p6<=p18] & [~ [1<=p39] | EF [1<=p7]]] | AF [AF [p12<=0]]] U EF [EG [p43<=p37]]] U [[A [EX [1<=p18] U ~ [AX [p30<=1]]] | EX [[[p39<=p18 & p30<=0] & ~ [1<=p11]]]] | p24<=p33]] & AX [EG [A [~ [p29<=p31] U A [1<=p42 U p21<=p10]]]]]
normalized: [~ [EX [~ [EG [[~ [EG [~ [[~ [EG [~ [p21<=p10]]] & ~ [E [~ [p21<=p10] U [~ [1<=p42] & ~ [p21<=p10]]]]]]]] & ~ [E [~ [[~ [EG [~ [p21<=p10]]] & ~ [E [~ [p21<=p10] U [~ [1<=p42] & ~ [p21<=p10]]]]]] U [p29<=p31 & ~ [[~ [EG [~ [p21<=p10]]] & ~ [E [~ [p21<=p10] U [~ [1<=p42] & ~ [p21<=p10]]]]]]]]]]]]]] & [~ [EG [~ [[p24<=p33 | [EX [[~ [1<=p11] & [p39<=p18 & p30<=0]]] | [~ [EG [~ [EX [~ [p30<=1]]]]] & ~ [E [~ [EX [~ [p30<=1]]] U [~ [EX [1<=p18]] & ~ [EX [~ [p30<=1]]]]]]]]]]]] & ~ [E [~ [[p24<=p33 | [EX [[~ [1<=p11] & [p39<=p18 & p30<=0]]] | [~ [EG [~ [EX [~ [p30<=1]]]]] & ~ [E [~ [EX [~ [p30<=1]]] U [~ [EX [1<=p18]] & ~ [EX [~ [p30<=1]]]]]]]]]] U [~ [[~ [EG [~ [E [true U EG [p43<=p37]]]]] & ~ [E [~ [E [true U EG [p43<=p37]]] U [~ [[~ [EG [EG [~ [p12<=0]]]] | [[E [true U 1<=p7] | ~ [1<=p39]] & ~ [EG [~ [p6<=p18]]]]]] & ~ [E [true U EG [p43<=p37]]]]]]]] & ~ [[p24<=p33 | [EX [[~ [1<=p11] & [p39<=p18 & p30<=0]]] | [~ [EG [~ [EX [~ [p30<=1]]]]] & ~ [E [~ [EX [~ [p30<=1]]] U [~ [EX [1<=p18]] & ~ [EX [~ [p30<=1]]]]]]]]]]]]]]]

abstracting: (p30<=1)
states: 227
.abstracting: (1<=p18)
states: 25
.abstracting: (p30<=1)
states: 227
.abstracting: (p30<=1)
states: 227
.
EG iterations: 0
abstracting: (p30<=0)
states: 202
abstracting: (p39<=p18)
states: 226
abstracting: (1<=p11)
states: 1
.abstracting: (p24<=p33)
states: 226
abstracting: (p43<=p37)
states: 2
..
EG iterations: 2
abstracting: (p6<=p18)
states: 211
..
EG iterations: 2
abstracting: (1<=p39)
states: 1
abstracting: (1<=p7)
states: 16
abstracting: (p12<=0)
states: 171
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p43<=p37)
states: 2
..
EG iterations: 2
abstracting: (p43<=p37)
states: 2
..
EG iterations: 2

EG iterations: 0
abstracting: (p30<=1)
states: 227
.abstracting: (1<=p18)
states: 25
.abstracting: (p30<=1)
states: 227
.abstracting: (p30<=1)
states: 227
.
EG iterations: 0
abstracting: (p30<=0)
states: 202
abstracting: (p39<=p18)
states: 226
abstracting: (1<=p11)
states: 1
.abstracting: (p24<=p33)
states: 226
abstracting: (p30<=1)
states: 227
.abstracting: (1<=p18)
states: 25
.abstracting: (p30<=1)
states: 227
.abstracting: (p30<=1)
states: 227
.
EG iterations: 0
abstracting: (p30<=0)
states: 202
abstracting: (p39<=p18)
states: 226
abstracting: (1<=p11)
states: 1
.abstracting: (p24<=p33)
states: 226
.
EG iterations: 1
abstracting: (p21<=p10)
states: 211
abstracting: (1<=p42)
states: 9
abstracting: (p21<=p10)
states: 211
abstracting: (p21<=p10)
states: 211
..
EG iterations: 2
abstracting: (p29<=p31)
states: 202
abstracting: (p21<=p10)
states: 211
abstracting: (1<=p42)
states: 9
abstracting: (p21<=p10)
states: 211
abstracting: (p21<=p10)
states: 211
..
EG iterations: 2
abstracting: (p21<=p10)
states: 211
abstracting: (1<=p42)
states: 9
abstracting: (p21<=p10)
states: 211
abstracting: (p21<=p10)
states: 211
..
EG iterations: 2
..
EG iterations: 2
.
EG iterations: 1
.-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: E [A [[~ [AG [AF [p20<=p15]]] & p8<=p23] U EG [EF [EX [1<=p13]]]] U A [[AF [[EX [1<=p42] | [p19<=0 & p3<=p34]]] & 1<=p17] U [[1<=p22 & AX [[p28<=p16 & p29<=p20]]] & [[[p0<=p17 | EG [1<=p42]] | ~ [[p25<=p37 | 1<=p1]]] | AX [1<=p18]]]]]
normalized: E [[~ [EG [~ [EG [E [true U EX [1<=p13]]]]]] & ~ [E [~ [EG [E [true U EX [1<=p13]]]] U [~ [[p8<=p23 & E [true U EG [~ [p20<=p15]]]]] & ~ [EG [E [true U EX [1<=p13]]]]]]]] U [~ [EG [~ [[[~ [EX [~ [1<=p18]]] | [~ [[p25<=p37 | 1<=p1]] | [p0<=p17 | EG [1<=p42]]]] & [1<=p22 & ~ [EX [~ [[p28<=p16 & p29<=p20]]]]]]]]] & ~ [E [~ [[[~ [EX [~ [1<=p18]]] | [~ [[p25<=p37 | 1<=p1]] | [p0<=p17 | EG [1<=p42]]]] & [1<=p22 & ~ [EX [~ [[p28<=p16 & p29<=p20]]]]]]] U [~ [[1<=p17 & ~ [EG [~ [[[p19<=0 & p3<=p34] | EX [1<=p42]]]]]]] & ~ [[[~ [EX [~ [1<=p18]]] | [~ [[p25<=p37 | 1<=p1]] | [p0<=p17 | EG [1<=p42]]]] & [1<=p22 & ~ [EX [~ [[p28<=p16 & p29<=p20]]]]]]]]]]]]

abstracting: (p29<=p20)
states: 202
abstracting: (p28<=p16)
states: 218
.abstracting: (1<=p22)
states: 1
abstracting: (1<=p42)
states: 9
......
EG iterations: 6
abstracting: (p0<=p17)
states: 226
abstracting: (1<=p1)
states: 25
abstracting: (p25<=p37)
states: 226
abstracting: (1<=p18)
states: 25
.abstracting: (1<=p42)
states: 9
.abstracting: (p3<=p34)
states: 202
abstracting: (p19<=0)
states: 211
..
EG iterations: 2
abstracting: (1<=p17)
states: 25
abstracting: (p29<=p20)
states: 202
abstracting: (p28<=p16)
states: 218
.abstracting: (1<=p22)
states: 1
abstracting: (1<=p42)
states: 9
......
EG iterations: 6
abstracting: (p0<=p17)
states: 226
abstracting: (1<=p1)
states: 25
abstracting: (p25<=p37)
states: 226
abstracting: (1<=p18)
states: 25
.abstracting: (p29<=p20)
states: 202
abstracting: (p28<=p16)
states: 218
.abstracting: (1<=p22)
states: 1
abstracting: (1<=p42)
states: 9
......
EG iterations: 6
abstracting: (p0<=p17)
states: 226
abstracting: (1<=p1)
states: 25
abstracting: (p25<=p37)
states: 226
abstracting: (1<=p18)
states: 25
..
EG iterations: 1
abstracting: (1<=p13)
states: 9
........
EG iterations: 7
abstracting: (p20<=p15)
states: 211
..
EG iterations: 2
abstracting: (p8<=p23)
states: 226
abstracting: (1<=p13)
states: 9
........
EG iterations: 7
abstracting: (1<=p13)
states: 9
........
EG iterations: 7

EG iterations: 0
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: [~ [A [EF [EG [[1<=p2 & p6<=0]]] U ~ [[AG [[p23<=p17 & p43<=1]] | p32<=p1]]]] & [[AX [[p21<=p13 | 1<=p35]] & [E [~ [[~ [p23<=1] & [p30<=p10 | 1<=p4]]] U AG [1<=p26]] | EG [[p2<=p10 & 1<=p17]]]] & ~ [E [p39<=0 U [[1<=p8 | [p36<=1 & 1<=p41]] | AX [[p6<=p19 & p17<=p9]]]]]]]
normalized: [[~ [E [p39<=0 U [~ [EX [~ [[p6<=p19 & p17<=p9]]]] | [1<=p8 | [p36<=1 & 1<=p41]]]]] & [[EG [[p2<=p10 & 1<=p17]] | E [~ [[[p30<=p10 | 1<=p4] & ~ [p23<=1]]] U ~ [E [true U ~ [1<=p26]]]]] & ~ [EX [~ [[p21<=p13 | 1<=p35]]]]]] & ~ [[~ [EG [[p32<=p1 | ~ [E [true U ~ [[p23<=p17 & p43<=1]]]]]]] & ~ [E [[p32<=p1 | ~ [E [true U ~ [[p23<=p17 & p43<=1]]]]] U [~ [E [true U EG [[1<=p2 & p6<=0]]]] & [p32<=p1 | ~ [E [true U ~ [[p23<=p17 & p43<=1]]]]]]]]]]]

abstracting: (p43<=1)
states: 227
abstracting: (p23<=p17)
states: 226
abstracting: (p32<=p1)
states: 207
abstracting: (p6<=0)
states: 211
abstracting: (1<=p2)
states: 25
..
EG iterations: 2
abstracting: (p43<=1)
states: 227
abstracting: (p23<=p17)
states: 226
abstracting: (p32<=p1)
states: 207
abstracting: (p43<=1)
states: 227
abstracting: (p23<=p17)
states: 226
abstracting: (p32<=p1)
states: 207
.
EG iterations: 1
abstracting: (1<=p35)
states: 16
abstracting: (p21<=p13)
states: 211
.abstracting: (1<=p26)
states: 56
abstracting: (p23<=1)
states: 227
abstracting: (1<=p4)
states: 25
abstracting: (p30<=p10)
states: 202
abstracting: (1<=p17)
states: 25
abstracting: (p2<=p10)
states: 202
...
EG iterations: 3
abstracting: (1<=p41)
states: 9
abstracting: (p36<=1)
states: 227
abstracting: (1<=p8)
states: 1
abstracting: (p17<=p9)
states: 202
abstracting: (p6<=p19)
states: 215
.abstracting: (p39<=0)
states: 226
-> the formula is FALSE

FORMULA StigmergyElection-PT-03a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: E [E [AF [EG [[p12<=p6 | p42<=p31]]] U [EF [[[p11<=1 | p29<=p42] | p43<=p12]] & EG [~ [[1<=p38 & 1<=p13]]]]] U [~ [E [[~ [[p1<=0 | p21<=1]] | [[1<=p0 | p35<=p16] & ~ [p8<=p28]]] U [~ [E [1<=p17 U 1<=p16]] & [[1<=p33 | p31<=p25] | ~ [1<=p14]]]]] | [A [EG [~ [1<=p36]] U [~ [EX [1<=p29]] & [[p7<=p22 & p18<=1] | 1<=p3]]] | 1<=p37]]]
normalized: E [E [~ [EG [~ [EG [[p12<=p6 | p42<=p31]]]]] U [EG [~ [[1<=p38 & 1<=p13]]] & E [true U [p43<=p12 | [p11<=1 | p29<=p42]]]]] U [[1<=p37 | [~ [EG [~ [[[1<=p3 | [p7<=p22 & p18<=1]] & ~ [EX [1<=p29]]]]]] & ~ [E [~ [[[1<=p3 | [p7<=p22 & p18<=1]] & ~ [EX [1<=p29]]]] U [~ [EG [~ [1<=p36]]] & ~ [[[1<=p3 | [p7<=p22 & p18<=1]] & ~ [EX [1<=p29]]]]]]]]] | ~ [E [[[~ [p8<=p28] & [1<=p0 | p35<=p16]] | ~ [[p1<=0 | p21<=1]]] U [[~ [1<=p14] | [1<=p33 | p31<=p25]] & ~ [E [1<=p17 U 1<=p16]]]]]]]

abstracting: (1<=p16)
states: 25
abstracting: (1<=p17)
states: 25
abstracting: (p31<=p25)
states: 202
abstracting: (1<=p33)
states: 16
abstracting: (1<=p14)
states: 9
abstracting: (p21<=1)
states: 227
abstracting: (p1<=0)
states: 202
abstracting: (p35<=p16)
states: 211
abstracting: (1<=p0)
states: 1
abstracting: (p8<=p28)
states: 226
abstracting: (1<=p29)
states: 25
.abstracting: (p18<=1)
states: 227
abstracting: (p7<=p22)
states: 211
abstracting: (1<=p3)
states: 25
abstracting: (1<=p36)
states: 1
.
EG iterations: 1
abstracting: (1<=p29)
states: 25
.abstracting: (p18<=1)
states: 227
abstracting: (p7<=p22)
states: 211
abstracting: (1<=p3)
states: 25
abstracting: (1<=p29)
states: 25
.abstracting: (p18<=1)
states: 227
abstracting: (p7<=p22)
states: 211
abstracting: (1<=p3)
states: 25
..
EG iterations: 2
abstracting: (1<=p37)
states: 1
abstracting: (p29<=p42)
states: 202
abstracting: (p11<=1)
states: 227
abstracting: (p43<=p12)
states: 57
abstracting: (1<=p13)
states: 9
abstracting: (1<=p38)
states: 1

EG iterations: 0
abstracting: (p42<=p31)
states: 218
abstracting: (p12<=p6)
states: 171
.
EG iterations: 1
....
EG iterations: 4
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: E [[AG [[E [~ [p3<=1] U [p32<=0 | 1<=p19]] & EF [[p31<=1 & 1<=p41]]]] | [[[~ [EX [p18<=1]] | ~ [[EF [1<=p35] | [1<=p20 | p7<=p40]]]] & ~ [E [1<=p15 U [1<=p14 & p18<=p10]]]] & [[EG [[p15<=1 & p43<=1]] & p41<=0] | [[[[1<=p43 | 1<=p1] | EX [1<=p32]] & [[1<=p16 | p14<=1] & EG [p21<=0]]] & [[~ [1<=p23] & p25<=0] | ~ [p10<=1]]]]]] U AF [[[~ [AF [1<=p15]] & [AF [p21<=1] & 1<=p43]] & [p29<=p43 | EG [~ [p29<=0]]]]]]
normalized: E [[[[[[~ [p10<=1] | [p25<=0 & ~ [1<=p23]]] & [[EG [p21<=0] & [1<=p16 | p14<=1]] & [EX [1<=p32] | [1<=p43 | 1<=p1]]]] | [p41<=0 & EG [[p15<=1 & p43<=1]]]] & [~ [E [1<=p15 U [1<=p14 & p18<=p10]]] & [~ [[[1<=p20 | p7<=p40] | E [true U 1<=p35]]] | ~ [EX [p18<=1]]]]] | ~ [E [true U ~ [[E [true U [p31<=1 & 1<=p41]] & E [~ [p3<=1] U [p32<=0 | 1<=p19]]]]]]] U ~ [EG [~ [[[p29<=p43 | EG [~ [p29<=0]]] & [[1<=p43 & ~ [EG [~ [p21<=1]]]] & EG [~ [1<=p15]]]]]]]]

abstracting: (1<=p15)
states: 25
.
EG iterations: 1
abstracting: (p21<=1)
states: 227
.
EG iterations: 1
abstracting: (1<=p43)
states: 226
abstracting: (p29<=0)
states: 202
.
EG iterations: 1
abstracting: (p29<=p43)
states: 227
..
EG iterations: 2
abstracting: (1<=p19)
states: 16
abstracting: (p32<=0)
states: 202
abstracting: (p3<=1)
states: 227
abstracting: (1<=p41)
states: 9
abstracting: (p31<=1)
states: 227
abstracting: (p18<=1)
states: 227
.abstracting: (1<=p35)
states: 16
abstracting: (p7<=p40)
states: 215
abstracting: (1<=p20)
states: 16
abstracting: (p18<=p10)
states: 202
abstracting: (1<=p14)
states: 9
abstracting: (1<=p15)
states: 25
abstracting: (p43<=1)
states: 227
abstracting: (p15<=1)
states: 227

EG iterations: 0
abstracting: (p41<=0)
states: 218
abstracting: (1<=p1)
states: 25
abstracting: (1<=p43)
states: 226
abstracting: (1<=p32)
states: 25
.abstracting: (p14<=1)
states: 227
abstracting: (1<=p16)
states: 25
abstracting: (p21<=0)
states: 211
.
EG iterations: 1
abstracting: (1<=p23)
states: 1
abstracting: (p25<=0)
states: 226
abstracting: (p10<=1)
states: 227
-> the formula is TRUE

FORMULA StigmergyElection-PT-03a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

totally nodes used: 63629 (6.4e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 109515 311738 421253
used/not used/entry size/cache size: 364136 66744728 16 1024MB
basic ops cache: hits/miss/sum: 50404 91609 142013
used/not used/entry size/cache size: 138057 16639159 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: 1375 3569 4944
used/not used/entry size/cache size: 3569 8385039 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 67047410
1 59381
2 1976
3 92
4 5
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.550sec


BK_STOP 1679387595540

--------------------
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:1391 (11), effective:52 (0)

initing FirstDep: 0m 0.000sec


iterations count:131 (1), effective:1 (0)

iterations count:128 (1), effective:1 (0)

iterations count:129 (1), effective:2 (0)

iterations count:153 (1), effective:1 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:134 (1), effective:1 (0)

iterations count:119 (1), effective:1 (0)

iterations count:118 (1), effective:0 (0)

iterations count:135 (1), effective:2 (0)

iterations count:128 (1), effective:1 (0)

iterations count:134 (1), effective:1 (0)

iterations count:1024 (8), effective:37 (0)

iterations count:1034 (8), effective:37 (0)

iterations count:1024 (8), effective:37 (0)

iterations count:1034 (8), effective:37 (0)

iterations count:1021 (8), effective:35 (0)

iterations count:1024 (8), effective:37 (0)

iterations count:1034 (8), effective:37 (0)

iterations count:1028 (8), effective:37 (0)

iterations count:1046 (8), effective:38 (0)

iterations count:1028 (8), effective:37 (0)

iterations count:1046 (8), effective:38 (0)

iterations count:1028 (8), effective:37 (0)

iterations count:1046 (8), effective:38 (0)

iterations count:140 (1), effective:1 (0)

iterations count:1022 (8), effective:37 (0)

iterations count:118 (1), effective:0 (0)

iterations count:143 (1), effective:1 (0)

iterations count:118 (1), effective:0 (0)

iterations count:177 (1), effective:2 (0)

iterations count:1016 (8), effective:37 (0)

iterations count:177 (1), effective:2 (0)

iterations count:177 (1), effective:2 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:119 (1), effective:1 (0)

iterations count:128 (1), effective:1 (0)

iterations count:1062 (9), effective:39 (0)

iterations count:128 (1), effective:1 (0)

iterations count:1046 (8), effective:38 (0)

iterations count:128 (1), effective:1 (0)

iterations count:118 (1), effective:0 (0)

iterations count:1011 (8), effective:37 (0)

iterations count:1040 (8), effective:40 (0)

iterations count:1011 (8), effective:37 (0)

iterations count:1030 (8), effective:37 (0)

iterations count:1011 (8), effective:37 (0)

iterations count:745 (6), effective:25 (0)

iterations count:1045 (8), effective:38 (0)

iterations count:219 (1), effective:7 (0)

iterations count:119 (1), effective:1 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (1), effective:0 (0)

iterations count:257 (2), effective:4 (0)

iterations count:118 (1), effective:0 (0)

iterations count:129 (1), effective:2 (0)

iterations count:170 (1), effective:3 (0)

iterations count:1014 (8), effective:37 (0)

iterations count:118 (1), effective:0 (0)

iterations count:118 (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-03a"
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-03a, 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-167912641700569"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-03a.tgz
mv StigmergyElection-PT-03a 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;