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-167912641800601.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-05a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r449-smll-167912641800601
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 16:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 16:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 16:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 160K Feb 26 16:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Feb 26 16:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:18 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 193K 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-05a-CTLCardinality-00
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-01
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-02
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-03
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-04
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-05
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-06
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-07
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-08
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-09
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-10
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-11
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-12
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-13
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-14
FORMULA_NAME StigmergyElection-PT-05a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679391549194

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-05a
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_05a
(NrP: 72 NrTr: 450 NrArc: 3637)

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

net check time: 0m 0.000sec

init dd package: 0m 3.357sec


RS generation: 0m 0.182sec


-> reachability set: #nodes 3853 (3.9e+03) #states 4,411 (3)



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

checking: EF [~ [p62<=1]]
normalized: E [true U ~ [p62<=1]]

abstracting: (p62<=1)
states: 4,411 (3)
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [EF [~ [AX [EG [p13<=1]]]]]
normalized: E [true U E [true U EX [~ [EG [p13<=1]]]]]

abstracting: (p13<=1)
states: 4,411 (3)

EG iterations: 0
.-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: E [~ [AG [~ [AX [p58<=1]]]] U AG [1<=p10]]
normalized: E [E [true U ~ [EX [~ [p58<=1]]]] U ~ [E [true U ~ [1<=p10]]]]

abstracting: (1<=p10)
states: 1
abstracting: (p58<=1)
states: 4,411 (3)
.-> the formula is FALSE

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

MC time: 0m 0.090sec

checking: AG [AX [E [AX [EG [1<=p28]] U EF [AF [p45<=p8]]]]]
normalized: ~ [E [true U EX [~ [E [~ [EX [~ [EG [1<=p28]]]] U E [true U ~ [EG [~ [p45<=p8]]]]]]]]]

abstracting: (p45<=p8)
states: 3,786 (3)
..
EG iterations: 2
abstracting: (1<=p28)
states: 81
..........
EG iterations: 10
..-> the formula is TRUE

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

MC time: 0m 0.141sec

checking: EF [[~ [p3<=p67] & [p59<=1 & ~ [EG [E [p44<=p31 U p0<=0]]]]]]
normalized: E [true U [[~ [EG [E [p44<=p31 U p0<=0]]] & p59<=1] & ~ [p3<=p67]]]

abstracting: (p3<=p67)
states: 3,786 (3)
abstracting: (p59<=1)
states: 4,411 (3)
abstracting: (p0<=0)
states: 4,410 (3)
abstracting: (p44<=p31)
states: 3,911 (3)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AG [[E [[E [EF [1<=p23] U [p58<=1 | p0<=1]] & p13<=1] U ~ [AF [1<=p69]]] | 1<=p68]]
normalized: ~ [E [true U ~ [[E [[E [E [true U 1<=p23] U [p58<=1 | p0<=1]] & p13<=1] U EG [~ [1<=p69]]] | 1<=p68]]]]

abstracting: (1<=p68)
states: 976
abstracting: (1<=p69)
states: 81
...........
EG iterations: 11
abstracting: (p13<=1)
states: 4,411 (3)
abstracting: (p0<=1)
states: 4,411 (3)
abstracting: (p58<=1)
states: 4,411 (3)
abstracting: (1<=p23)
states: 1
-> the formula is TRUE

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

MC time: 0m 0.200sec

checking: E [[[~ [p25<=1] & EF [[AF [1<=p41] & AG [p16<=p29]]]] & 1<=p48] U ~ [EF [p40<=p54]]]
normalized: E [[[E [true U [~ [E [true U ~ [p16<=p29]]] & ~ [EG [~ [1<=p41]]]]] & ~ [p25<=1]] & 1<=p48] U ~ [E [true U p40<=p54]]]

abstracting: (p40<=p54)
states: 3,661 (3)
abstracting: (1<=p48)
states: 256
abstracting: (p25<=1)
states: 4,411 (3)
abstracting: (1<=p41)
states: 81
...........
EG iterations: 11
abstracting: (p16<=p29)
states: 3,911 (3)
-> the formula is FALSE

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

MC time: 0m 0.159sec

checking: A [[1<=p65 & EX [[[EX [p18<=0] | AG [p21<=1]] | [p59<=p54 & [EX [p34<=1] & p44<=1]]]]] U EF [~ [EF [EF [1<=p50]]]]]
normalized: [~ [EG [~ [E [true U ~ [E [true U E [true U 1<=p50]]]]]]] & ~ [E [~ [E [true U ~ [E [true U E [true U 1<=p50]]]]] U [~ [[EX [[[[EX [p34<=1] & p44<=1] & p59<=p54] | [~ [E [true U ~ [p21<=1]]] | EX [p18<=0]]]] & 1<=p65]] & ~ [E [true U ~ [E [true U E [true U 1<=p50]]]]]]]]]

abstracting: (1<=p50)
states: 1
abstracting: (1<=p65)
states: 1
abstracting: (p18<=0)
states: 3,786 (3)
.abstracting: (p21<=1)
states: 4,411 (3)
abstracting: (p59<=p54)
states: 3,911 (3)
abstracting: (p44<=1)
states: 4,411 (3)
abstracting: (p34<=1)
states: 4,411 (3)
..abstracting: (1<=p50)
states: 1
abstracting: (1<=p50)
states: 1
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.080sec

checking: [E [p26<=p31 U EF [[~ [EF [p0<=0]] | EG [~ [p20<=1]]]]] & ~ [A [[p5<=0 & EG [~ [EX [1<=p16]]]] U [EG [[EG [1<=p42] & AX [p53<=1]]] | ~ [EF [E [1<=p17 U p65<=0]]]]]]]
normalized: [~ [[~ [EG [~ [[~ [E [true U E [1<=p17 U p65<=0]]] | EG [[~ [EX [~ [p53<=1]]] & EG [1<=p42]]]]]]] & ~ [E [~ [[~ [E [true U E [1<=p17 U p65<=0]]] | EG [[~ [EX [~ [p53<=1]]] & EG [1<=p42]]]]] U [~ [[EG [~ [EX [1<=p16]]] & p5<=0]] & ~ [[~ [E [true U E [1<=p17 U p65<=0]]] | EG [[~ [EX [~ [p53<=1]]] & EG [1<=p42]]]]]]]]]] & E [p26<=p31 U E [true U [EG [~ [p20<=1]] | ~ [E [true U p0<=0]]]]]]

abstracting: (p0<=0)
states: 4,410 (3)
abstracting: (p20<=1)
states: 4,411 (3)
.
EG iterations: 1
abstracting: (p26<=p31)
states: 3,560 (3)
abstracting: (1<=p42)
states: 81
..........
EG iterations: 10
abstracting: (p53<=1)
states: 4,411 (3)
..
EG iterations: 1
abstracting: (p65<=0)
states: 4,410 (3)
abstracting: (1<=p17)
states: 625
abstracting: (p5<=0)
states: 4,155 (3)
abstracting: (1<=p16)
states: 625
...
EG iterations: 2
abstracting: (1<=p42)
states: 81
..........
EG iterations: 10
abstracting: (p53<=1)
states: 4,411 (3)
..
EG iterations: 1
abstracting: (p65<=0)
states: 4,410 (3)
abstracting: (1<=p17)
states: 625
abstracting: (1<=p42)
states: 81
..........
EG iterations: 10
abstracting: (p53<=1)
states: 4,411 (3)
..
EG iterations: 1
abstracting: (p65<=0)
states: 4,410 (3)
abstracting: (1<=p17)
states: 625

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.147sec

checking: [~ [EF [[[[1<=p2 | EF [p62<=p40]] & AG [p7<=1]] & AF [E [1<=p36 U 1<=p44]]]]] & EF [EF [~ [A [~ [1<=p64] U [p70<=p27 & p47<=p59]]]]]]
normalized: [E [true U E [true U ~ [[~ [EG [~ [[p70<=p27 & p47<=p59]]]] & ~ [E [~ [[p70<=p27 & p47<=p59]] U [~ [[p70<=p27 & p47<=p59]] & 1<=p64]]]]]]] & ~ [E [true U [~ [EG [~ [E [1<=p36 U 1<=p44]]]] & [~ [E [true U ~ [p7<=1]]] & [E [true U p62<=p40] | 1<=p2]]]]]]

abstracting: (1<=p2)
states: 625
abstracting: (p62<=p40)
states: 4,219 (3)
abstracting: (p7<=1)
states: 4,411 (3)
abstracting: (1<=p44)
states: 625
abstracting: (1<=p36)
states: 1
...
EG iterations: 3
abstracting: (1<=p64)
states: 1
abstracting: (p47<=p59)
states: 4,155 (3)
abstracting: (p70<=p27)
states: 4,357 (3)
abstracting: (p47<=p59)
states: 4,155 (3)
abstracting: (p70<=p27)
states: 4,357 (3)
abstracting: (p47<=p59)
states: 4,155 (3)
abstracting: (p70<=p27)
states: 4,357 (3)
........
EG iterations: 8
-> the formula is FALSE

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

MC time: 0m 0.188sec

checking: [AG [AX [[[p58<=p29 | AG [p0<=p65]] | ~ [1<=p24]]]] | [[AF [~ [[[p20<=0 | p47<=p8] & p52<=0]]] & EG [~ [p29<=1]]] & EG [~ [EG [p27<=p55]]]]]
normalized: [~ [E [true U EX [~ [[~ [1<=p24] | [~ [E [true U ~ [p0<=p65]]] | p58<=p29]]]]]] | [[EG [~ [p29<=1]] & ~ [EG [[[p20<=0 | p47<=p8] & p52<=0]]]] & EG [~ [EG [p27<=p55]]]]]

abstracting: (p27<=p55)
states: 4,357 (3)
........
EG iterations: 8
.........
EG iterations: 9
abstracting: (p52<=0)
states: 4,410 (3)
abstracting: (p47<=p8)
states: 4,155 (3)
abstracting: (p20<=0)
states: 4,155 (3)
.
EG iterations: 1
abstracting: (p29<=1)
states: 4,411 (3)
.
EG iterations: 1
abstracting: (p58<=p29)
states: 3,911 (3)
abstracting: (p0<=p65)
states: 4,410 (3)
abstracting: (1<=p24)
states: 1
.-> the formula is TRUE

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

MC time: 0m 0.130sec

checking: ~ [EX [E [E [[AF [p6<=0] & [p22<=p34 | p28<=p1]] U 1<=p5] U [[[AG [p21<=1] & AG [1<=p58]] & EG [p35<=1]] & A [p45<=p11 U EG [p28<=0]]]]]]
normalized: ~ [EX [E [E [[[p22<=p34 | p28<=p1] & ~ [EG [~ [p6<=0]]]] U 1<=p5] U [[~ [EG [~ [EG [p28<=0]]]] & ~ [E [~ [EG [p28<=0]] U [~ [p45<=p11] & ~ [EG [p28<=0]]]]]] & [EG [p35<=1] & [~ [E [true U ~ [1<=p58]]] & ~ [E [true U ~ [p21<=1]]]]]]]]]

abstracting: (p21<=1)
states: 4,411 (3)
abstracting: (1<=p58)
states: 625
abstracting: (p35<=1)
states: 4,411 (3)

EG iterations: 0
abstracting: (p28<=0)
states: 4,330 (3)
..
EG iterations: 2
abstracting: (p45<=p11)
states: 3,786 (3)
abstracting: (p28<=0)
states: 4,330 (3)
..
EG iterations: 2
abstracting: (p28<=0)
states: 4,330 (3)
..
EG iterations: 2
...........
EG iterations: 11
abstracting: (1<=p5)
states: 256
abstracting: (p6<=0)
states: 4,155 (3)
..
EG iterations: 2
abstracting: (p28<=p1)
states: 4,330 (3)
abstracting: (p22<=p34)
states: 4,410 (3)
.-> the formula is TRUE

FORMULA StigmergyElection-PT-05a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.134sec

checking: AX [[p43<=1 | [p36<=p34 | [[p28<=p54 | [[p58<=1 & [p4<=p17 | 1<=p50]] | ~ [A [p30<=p55 U p7<=0]]]] | 1<=p44]]]]
normalized: ~ [EX [~ [[[[[[~ [[~ [EG [~ [p7<=0]]] & ~ [E [~ [p7<=0] U [~ [p30<=p55] & ~ [p7<=0]]]]]] | [[p4<=p17 | 1<=p50] & p58<=1]] | p28<=p54] | 1<=p44] | p36<=p34] | p43<=1]]]]

abstracting: (p43<=1)
states: 4,411 (3)
abstracting: (p36<=p34)
states: 4,410 (3)
abstracting: (1<=p44)
states: 625
abstracting: (p28<=p54)
states: 4,357 (3)
abstracting: (p58<=1)
states: 4,411 (3)
abstracting: (1<=p50)
states: 1
abstracting: (p4<=p17)
states: 3,911 (3)
abstracting: (p7<=0)
states: 4,155 (3)
abstracting: (p30<=p55)
states: 3,786 (3)
abstracting: (p7<=0)
states: 4,155 (3)
abstracting: (p7<=0)
states: 4,155 (3)
..
EG iterations: 2
.-> the formula is TRUE

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

MC time: 0m 0.010sec

checking: EX [[~ [[A [[AX [p63<=p37] & AG [p48<=p47]] U [p48<=1 | [p40<=0 & p27<=p16]]] | A [AG [1<=p0] U p54<=1]]] & AG [[[[AG [p47<=0] & AG [1<=p15]] | p40<=p19] & [~ [[p21<=1 & p29<=0]] & [p3<=1 & EF [p47<=1]]]]]]]
normalized: EX [[~ [E [true U ~ [[[[E [true U p47<=1] & p3<=1] & ~ [[p21<=1 & p29<=0]]] & [[~ [E [true U ~ [1<=p15]]] & ~ [E [true U ~ [p47<=0]]]] | p40<=p19]]]]] & ~ [[[~ [EG [~ [p54<=1]]] & ~ [E [~ [p54<=1] U [E [true U ~ [1<=p0]] & ~ [p54<=1]]]]] | [~ [EG [~ [[[p40<=0 & p27<=p16] | p48<=1]]]] & ~ [E [~ [[[p40<=0 & p27<=p16] | p48<=1]] U [~ [[~ [E [true U ~ [p48<=p47]]] & ~ [EX [~ [p63<=p37]]]]] & ~ [[[p40<=0 & p27<=p16] | p48<=1]]]]]]]]]]

abstracting: (p48<=1)
states: 4,411 (3)
abstracting: (p27<=p16)
states: 4,330 (3)
abstracting: (p40<=0)
states: 3,435 (3)
abstracting: (p63<=p37)
states: 4,155 (3)
.abstracting: (p48<=p47)
states: 4,155 (3)
abstracting: (p48<=1)
states: 4,411 (3)
abstracting: (p27<=p16)
states: 4,330 (3)
abstracting: (p40<=0)
states: 3,435 (3)
abstracting: (p48<=1)
states: 4,411 (3)
abstracting: (p27<=p16)
states: 4,330 (3)
abstracting: (p40<=0)
states: 3,435 (3)
.
EG iterations: 1
abstracting: (p54<=1)
states: 4,411 (3)
abstracting: (1<=p0)
states: 1
abstracting: (p54<=1)
states: 4,411 (3)
abstracting: (p54<=1)
states: 4,411 (3)
.
EG iterations: 1
abstracting: (p40<=p19)
states: 3,499 (3)
abstracting: (p47<=0)
states: 4,155 (3)
abstracting: (1<=p15)
states: 625
abstracting: (p29<=0)
states: 3,786 (3)
abstracting: (p21<=1)
states: 4,411 (3)
abstracting: (p3<=1)
states: 4,411 (3)
abstracting: (p47<=1)
states: 4,411 (3)
.-> the formula is FALSE

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

MC time: 0m 0.072sec

checking: ~ [A [~ [[EG [1<=p48] & ~ [A [p52<=p26 U p62<=p63]]]] U [~ [E [[AX [p45<=1] | EG [p37<=p6]] U ~ [[1<=p32 | 1<=p59]]]] | [[[[[p34<=1 & p30<=0] | [p15<=p65 & p18<=p0]] | [1<=p18 & [1<=p9 | p60<=1]]] & AF [p21<=1]] | A [A [p35<=1 U p12<=0] U EX [p2<=0]]]]]]
normalized: ~ [[~ [EG [~ [[[[~ [EG [~ [EX [p2<=0]]]] & ~ [E [~ [EX [p2<=0]] U [~ [[~ [EG [~ [p12<=0]]] & ~ [E [~ [p12<=0] U [~ [p35<=1] & ~ [p12<=0]]]]]] & ~ [EX [p2<=0]]]]]] | [~ [EG [~ [p21<=1]]] & [[[1<=p9 | p60<=1] & 1<=p18] | [[p15<=p65 & p18<=p0] | [p34<=1 & p30<=0]]]]] | ~ [E [[EG [p37<=p6] | ~ [EX [~ [p45<=1]]]] U ~ [[1<=p32 | 1<=p59]]]]]]]] & ~ [E [~ [[[[~ [EG [~ [EX [p2<=0]]]] & ~ [E [~ [EX [p2<=0]] U [~ [[~ [EG [~ [p12<=0]]] & ~ [E [~ [p12<=0] U [~ [p35<=1] & ~ [p12<=0]]]]]] & ~ [EX [p2<=0]]]]]] | [~ [EG [~ [p21<=1]]] & [[[1<=p9 | p60<=1] & 1<=p18] | [[p15<=p65 & p18<=p0] | [p34<=1 & p30<=0]]]]] | ~ [E [[EG [p37<=p6] | ~ [EX [~ [p45<=1]]]] U ~ [[1<=p32 | 1<=p59]]]]]] U [[~ [[~ [EG [~ [p62<=p63]]] & ~ [E [~ [p62<=p63] U [~ [p52<=p26] & ~ [p62<=p63]]]]]] & EG [1<=p48]] & ~ [[[[~ [EG [~ [EX [p2<=0]]]] & ~ [E [~ [EX [p2<=0]] U [~ [[~ [EG [~ [p12<=0]]] & ~ [E [~ [p12<=0] U [~ [p35<=1] & ~ [p12<=0]]]]]] & ~ [EX [p2<=0]]]]]] | [~ [EG [~ [p21<=1]]] & [[[1<=p9 | p60<=1] & 1<=p18] | [[p15<=p65 & p18<=p0] | [p34<=1 & p30<=0]]]]] | ~ [E [[EG [p37<=p6] | ~ [EX [~ [p45<=1]]]] U ~ [[1<=p32 | 1<=p59]]]]]]]]]]]

abstracting: (1<=p59)
states: 625
abstracting: (1<=p32)
states: 625
abstracting: (p45<=1)
states: 4,411 (3)
.abstracting: (p37<=p6)
states: 4,410 (3)
..
EG iterations: 2
abstracting: (p30<=0)
states: 3,786 (3)
abstracting: (p34<=1)
states: 4,411 (3)
abstracting: (p18<=p0)
states: 3,786 (3)
abstracting: (p15<=p65)
states: 3,786 (3)
abstracting: (1<=p18)
states: 625
abstracting: (p60<=1)
states: 4,411 (3)
abstracting: (1<=p9)
states: 1
abstracting: (p21<=1)
states: 4,411 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,786 (3)
.abstracting: (p12<=0)
states: 3,435 (3)
abstracting: (p35<=1)
states: 4,411 (3)
abstracting: (p12<=0)
states: 3,435 (3)
abstracting: (p12<=0)
states: 3,435 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,786 (3)
.abstracting: (p2<=0)
states: 3,786 (3)
...
EG iterations: 2
abstracting: (1<=p48)
states: 256
..
EG iterations: 2
abstracting: (p62<=p63)
states: 4,155 (3)
abstracting: (p52<=p26)
states: 4,411 (3)
abstracting: (p62<=p63)
states: 4,155 (3)
abstracting: (p62<=p63)
states: 4,155 (3)
..
EG iterations: 2
abstracting: (1<=p59)
states: 625
abstracting: (1<=p32)
states: 625
abstracting: (p45<=1)
states: 4,411 (3)
.abstracting: (p37<=p6)
states: 4,410 (3)
..
EG iterations: 2
abstracting: (p30<=0)
states: 3,786 (3)
abstracting: (p34<=1)
states: 4,411 (3)
abstracting: (p18<=p0)
states: 3,786 (3)
abstracting: (p15<=p65)
states: 3,786 (3)
abstracting: (1<=p18)
states: 625
abstracting: (p60<=1)
states: 4,411 (3)
abstracting: (1<=p9)
states: 1
abstracting: (p21<=1)
states: 4,411 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,786 (3)
.abstracting: (p12<=0)
states: 3,435 (3)
abstracting: (p35<=1)
states: 4,411 (3)
abstracting: (p12<=0)
states: 3,435 (3)
abstracting: (p12<=0)
states: 3,435 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,786 (3)
.abstracting: (p2<=0)
states: 3,786 (3)
...
EG iterations: 2
abstracting: (1<=p59)
states: 625
abstracting: (1<=p32)
states: 625
abstracting: (p45<=1)
states: 4,411 (3)
.abstracting: (p37<=p6)
states: 4,410 (3)
..
EG iterations: 2
abstracting: (p30<=0)
states: 3,786 (3)
abstracting: (p34<=1)
states: 4,411 (3)
abstracting: (p18<=p0)
states: 3,786 (3)
abstracting: (p15<=p65)
states: 3,786 (3)
abstracting: (1<=p18)
states: 625
abstracting: (p60<=1)
states: 4,411 (3)
abstracting: (1<=p9)
states: 1
abstracting: (p21<=1)
states: 4,411 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,786 (3)
.abstracting: (p12<=0)
states: 3,435 (3)
abstracting: (p35<=1)
states: 4,411 (3)
abstracting: (p12<=0)
states: 3,435 (3)
abstracting: (p12<=0)
states: 3,435 (3)
.
EG iterations: 1
abstracting: (p2<=0)
states: 3,786 (3)
.abstracting: (p2<=0)
states: 3,786 (3)
...
EG iterations: 2
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.092sec

checking: [~ [A [[AF [E [1<=p31 U p65<=1]] & [[[~ [p23<=p33] | [1<=p44 | p7<=p47]] & [[1<=p17 & 1<=p54] | [1<=p40 & 1<=p54]]] & A [EG [1<=p60] U [1<=p47 & p57<=1]]]] U ~ [[[~ [[1<=p36 | p57<=p34]] & EX [1<=p36]] | [EF [1<=p35] | A [p57<=0 U p50<=p57]]]]]] | AX [[EF [[AF [1<=p31] & A [1<=p39 U p6<=p53]]] | 1<=p28]]]
normalized: [~ [EX [~ [[1<=p28 | E [true U [[~ [EG [~ [p6<=p53]]] & ~ [E [~ [p6<=p53] U [~ [1<=p39] & ~ [p6<=p53]]]]] & ~ [EG [~ [1<=p31]]]]]]]]] | ~ [[~ [EG [[[[~ [EG [~ [p50<=p57]]] & ~ [E [~ [p50<=p57] U [~ [p57<=0] & ~ [p50<=p57]]]]] | E [true U 1<=p35]] | [EX [1<=p36] & ~ [[1<=p36 | p57<=p34]]]]]] & ~ [E [[[[~ [EG [~ [p50<=p57]]] & ~ [E [~ [p50<=p57] U [~ [p57<=0] & ~ [p50<=p57]]]]] | E [true U 1<=p35]] | [EX [1<=p36] & ~ [[1<=p36 | p57<=p34]]]] U [~ [[[[~ [EG [~ [[1<=p47 & p57<=1]]]] & ~ [E [~ [[1<=p47 & p57<=1]] U [~ [EG [1<=p60]] & ~ [[1<=p47 & p57<=1]]]]]] & [[[1<=p40 & 1<=p54] | [1<=p17 & 1<=p54]] & [[1<=p44 | p7<=p47] | ~ [p23<=p33]]]] & ~ [EG [~ [E [1<=p31 U p65<=1]]]]]] & [[[~ [EG [~ [p50<=p57]]] & ~ [E [~ [p50<=p57] U [~ [p57<=0] & ~ [p50<=p57]]]]] | E [true U 1<=p35]] | [EX [1<=p36] & ~ [[1<=p36 | p57<=p34]]]]]]]]]]

abstracting: (p57<=p34)
states: 3,786 (3)
abstracting: (1<=p36)
states: 1
abstracting: (1<=p36)
states: 1
.abstracting: (1<=p35)
states: 256
abstracting: (p50<=p57)
states: 4,410 (3)
abstracting: (p57<=0)
states: 3,786 (3)
abstracting: (p50<=p57)
states: 4,410 (3)
abstracting: (p50<=p57)
states: 4,410 (3)
.
EG iterations: 1
abstracting: (p65<=1)
states: 4,411 (3)
abstracting: (1<=p31)
states: 625
.
EG iterations: 1
abstracting: (p23<=p33)
states: 4,410 (3)
abstracting: (p7<=p47)
states: 4,219 (3)
abstracting: (1<=p44)
states: 625
abstracting: (1<=p54)
states: 976
abstracting: (1<=p17)
states: 625
abstracting: (1<=p54)
states: 976
abstracting: (1<=p40)
states: 976
abstracting: (p57<=1)
states: 4,411 (3)
abstracting: (1<=p47)
states: 256
abstracting: (1<=p60)
states: 625
..
EG iterations: 2
abstracting: (p57<=1)
states: 4,411 (3)
abstracting: (1<=p47)
states: 256
abstracting: (p57<=1)
states: 4,411 (3)
abstracting: (1<=p47)
states: 256
.
EG iterations: 1
abstracting: (p57<=p34)
states: 3,786 (3)
abstracting: (1<=p36)
states: 1
abstracting: (1<=p36)
states: 1
.abstracting: (1<=p35)
states: 256
abstracting: (p50<=p57)
states: 4,410 (3)
abstracting: (p57<=0)
states: 3,786 (3)
abstracting: (p50<=p57)
states: 4,410 (3)
abstracting: (p50<=p57)
states: 4,410 (3)
.
EG iterations: 1
abstracting: (p57<=p34)
states: 3,786 (3)
abstracting: (1<=p36)
states: 1
abstracting: (1<=p36)
states: 1
.abstracting: (1<=p35)
states: 256
abstracting: (p50<=p57)
states: 4,410 (3)
abstracting: (p57<=0)
states: 3,786 (3)
abstracting: (p50<=p57)
states: 4,410 (3)
abstracting: (p50<=p57)
states: 4,410 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p31)
states: 625
..
EG iterations: 2
abstracting: (p6<=p53)
states: 4,155 (3)
abstracting: (1<=p39)
states: 1
abstracting: (p6<=p53)
states: 4,155 (3)
abstracting: (p6<=p53)
states: 4,155 (3)
..
EG iterations: 2
abstracting: (1<=p28)
states: 81
.-> the formula is TRUE

FORMULA StigmergyElection-PT-05a-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

totally nodes used: 646792 (6.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 993300 3135763 4129063
used/not used/entry size/cache size: 3598766 63510098 16 1024MB
basic ops cache: hits/miss/sum: 254803 635398 890201
used/not used/entry size/cache size: 946843 15830373 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: 7561 23191 30752
used/not used/entry size/cache size: 23160 8365448 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 66519673
1 538803
2 43970
3 5702
4 642
5 69
6 5
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 6.858sec


BK_STOP 1679391556121

--------------------
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.002sec


iterations count:26311 (58), effective:230 (0)

initing FirstDep: 0m 0.001sec


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

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

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

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

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

iterations count:4213 (9), effective:61 (0)

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

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

iterations count:1105 (2), effective:12 (0)

iterations count:4234 (9), effective:62 (0)

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

iterations count:4277 (9), effective:62 (0)

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

iterations count:4291 (9), effective:62 (0)

iterations count:4277 (9), effective:62 (0)

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

iterations count:4291 (9), effective:62 (0)

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

iterations count:4277 (9), effective:62 (0)

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

iterations count:4291 (9), effective:62 (0)

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

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

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

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

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

iterations count:4121 (9), effective:60 (0)

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

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

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

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

iterations count:4182 (9), effective:61 (0)

iterations count:4351 (9), effective:61 (0)

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

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

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

iterations count:5535 (12), effective:72 (0)

iterations count:4381 (9), effective:61 (0)

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

iterations count:4351 (9), effective:61 (0)

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

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

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

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

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

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

iterations count:4120 (9), effective:61 (0)

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

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

iterations count:4120 (9), effective:61 (0)

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

iterations count:4120 (9), effective:61 (0)

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

iterations count:4225 (9), effective:61 (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-05a"
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-05a, 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-167912641800601"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/StigmergyElection-PT-05a.tgz
mv StigmergyElection-PT-05a 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 ;