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.r161-tall-167838845200457.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 FlexibleBarrier-PT-06a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161-tall-167838845200457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.5K Feb 25 12:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 25 12:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 25 12:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Feb 25 12:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 16:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 12:25 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 124K Feb 25 12:25 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 25 12:24 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K Feb 25 12:24 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 41K Mar 5 18:22 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 FlexibleBarrier-PT-06a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-06a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679854471813

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=FlexibleBarrier-PT-06a
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: FlexibleBarrier_PT_06a
(NrP: 75 NrTr: 154 NrArc: 599)

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

net check time: 0m 0.000sec

init dd package: 0m 2.904sec


RS generation: 0m 0.111sec


-> reachability set: #nodes 2774 (2.8e+03) #states 2,985,985 (6)



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

checking: AG [EG [p25<=p25]]
normalized: ~ [E [true U ~ [EG [p25<=p25]]]]

abstracting: (p25<=p25)
states: 2,985,985 (6)

EG iterations: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EX [EF [EF [[EG [p49<=p43] | p41<=1]]]]]
normalized: ~ [EX [E [true U E [true U [EG [p49<=p43] | p41<=1]]]]]

abstracting: (p41<=1)
states: 2,985,985 (6)
abstracting: (p49<=p43)
states: 2,757,889 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.116sec

checking: ~ [A [~ [EF [AG [AF [p8<=p63]]]] U ~ [EF [[AF [1<=p71] & EG [1<=p28]]]]]]
normalized: ~ [[~ [EG [E [true U [EG [1<=p28] & ~ [EG [~ [1<=p71]]]]]]] & ~ [E [E [true U [EG [1<=p28] & ~ [EG [~ [1<=p71]]]]] U [E [true U ~ [E [true U EG [~ [p8<=p63]]]]] & E [true U [EG [1<=p28] & ~ [EG [~ [1<=p71]]]]]]]]]]

abstracting: (1<=p71)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (1<=p28)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (p8<=p63)
states: 2,757,889 (6)
.
EG iterations: 1
abstracting: (1<=p71)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (1<=p28)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (1<=p71)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (1<=p28)
states: 248,832 (5)
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.252sec

checking: AG [[A [AF [EF [1<=p38]] U [AG [p49<=0] | EG [[p44<=1 | p57<=0]]]] | AF [EX [EF [p40<=1]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [E [true U p40<=1]]]]] | [~ [EG [~ [[EG [[p44<=1 | p57<=0]] | ~ [E [true U ~ [p49<=0]]]]]]] & ~ [E [~ [[EG [[p44<=1 | p57<=0]] | ~ [E [true U ~ [p49<=0]]]]] U [EG [~ [E [true U 1<=p38]]] & ~ [[EG [[p44<=1 | p57<=0]] | ~ [E [true U ~ [p49<=0]]]]]]]]]]]]]

abstracting: (p49<=0)
states: 2,737,153 (6)
abstracting: (p57<=0)
states: 2,737,153 (6)
abstracting: (p44<=1)
states: 2,985,985 (6)

EG iterations: 0
abstracting: (1<=p38)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (p49<=0)
states: 2,737,153 (6)
abstracting: (p57<=0)
states: 2,737,153 (6)
abstracting: (p44<=1)
states: 2,985,985 (6)

EG iterations: 0
abstracting: (p49<=0)
states: 2,737,153 (6)
abstracting: (p57<=0)
states: 2,737,153 (6)
abstracting: (p44<=1)
states: 2,985,985 (6)

EG iterations: 0
.
EG iterations: 1
abstracting: (p40<=1)
states: 2,985,985 (6)
..
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.125sec

checking: ~ [EF [EF [[EF [[p70<=p48 & p68<=p24]] & 1<=p28]]]]
normalized: ~ [E [true U E [true U [1<=p28 & E [true U [p70<=p48 & p68<=p24]]]]]]

abstracting: (p68<=p24)
states: 2,757,889 (6)
abstracting: (p70<=p48)
states: 2,757,889 (6)
abstracting: (1<=p28)
states: 248,832 (5)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: AG [EX [A [[~ [EX [p2<=p55]] | ~ [EF [p4<=p73]]] U AX [AX [p31<=p60]]]]]
normalized: ~ [E [true U ~ [EX [[~ [EG [EX [EX [~ [p31<=p60]]]]] & ~ [E [EX [EX [~ [p31<=p60]]] U [~ [[~ [E [true U p4<=p73]] | ~ [EX [p2<=p55]]]] & EX [EX [~ [p31<=p60]]]]]]]]]]]

abstracting: (p31<=p60)
states: 2,757,889 (6)
..abstracting: (p2<=p55)
states: 2,757,889 (6)
.abstracting: (p4<=p73)
states: 2,985,985 (6)
abstracting: (p31<=p60)
states: 2,757,889 (6)
..abstracting: (p31<=p60)
states: 2,757,889 (6)
...
EG iterations: 1
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.247sec

checking: ~ [AX [~ [[[[EG [p0<=1] | ~ [p11<=1]] | [EG [p14<=1] & [1<=p12 | 1<=p32]]] & EX [[1<=p20 & p57<=p64]]]]]]
normalized: EX [[EX [[1<=p20 & p57<=p64]] & [[[1<=p12 | 1<=p32] & EG [p14<=1]] | [~ [p11<=1] | EG [p0<=1]]]]]

abstracting: (p0<=1)
states: 2,985,985 (6)

EG iterations: 0
abstracting: (p11<=1)
states: 2,985,985 (6)
abstracting: (p14<=1)
states: 2,985,985 (6)

EG iterations: 0
abstracting: (1<=p32)
states: 248,832 (5)
abstracting: (1<=p12)
states: 248,832 (5)
abstracting: (p57<=p64)
states: 2,757,889 (6)
abstracting: (1<=p20)
states: 248,832 (5)
..-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.082sec

checking: [AX [AX [EF [[AG [1<=p26] | [1<=p38 & p65<=0]]]]] & EF [AG [~ [[~ [[p48<=1 & p48<=p15]] | [p33<=0 | [1<=p73 & 1<=p4]]]]]]]
normalized: [E [true U ~ [E [true U [[p33<=0 | [1<=p73 & 1<=p4]] | ~ [[p48<=1 & p48<=p15]]]]]] & ~ [EX [EX [~ [E [true U [[1<=p38 & p65<=0] | ~ [E [true U ~ [1<=p26]]]]]]]]]]

abstracting: (1<=p26)
states: 248,832 (5)
abstracting: (p65<=0)
states: 2,737,153 (6)
abstracting: (1<=p38)
states: 248,832 (5)
..abstracting: (p48<=p15)
states: 2,757,889 (6)
abstracting: (p48<=1)
states: 2,985,985 (6)
abstracting: (1<=p4)
states: 248,832 (5)
abstracting: (1<=p73)
states: 2,985,984 (6)
abstracting: (p33<=0)
states: 2,737,153 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.042sec

checking: E [~ [p42<=p9] U E [[[[EX [p31<=p37] & EG [1<=p44]] | p5<=p18] | AG [~ [[1<=p74 & p7<=0]]]] U AX [1<=p10]]]
normalized: E [~ [p42<=p9] U E [[~ [E [true U [1<=p74 & p7<=0]]] | [p5<=p18 | [EG [1<=p44] & EX [p31<=p37]]]] U ~ [EX [~ [1<=p10]]]]]

abstracting: (1<=p10)
states: 248,832 (5)
.abstracting: (p31<=p37)
states: 2,757,889 (6)
.abstracting: (1<=p44)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (p5<=p18)
states: 2,757,889 (6)
abstracting: (p7<=0)
states: 2,737,153 (6)
abstracting: (1<=p74)
states: 2,985,984 (6)
abstracting: (p42<=p9)
states: 2,757,889 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.110sec

checking: AX [AG [[[~ [[[p21<=0 & p21<=0] & [p38<=p47 | p67<=1]]] | ~ [1<=p55]] | AF [[p17<=p53 | [p64<=p70 | 1<=p30]]]]]]
normalized: ~ [EX [E [true U ~ [[~ [EG [~ [[p17<=p53 | [p64<=p70 | 1<=p30]]]]] | [~ [1<=p55] | ~ [[[p38<=p47 | p67<=1] & [p21<=0 & p21<=0]]]]]]]]]

abstracting: (p21<=0)
states: 2,737,153 (6)
abstracting: (p21<=0)
states: 2,737,153 (6)
abstracting: (p67<=1)
states: 2,985,985 (6)
abstracting: (p38<=p47)
states: 2,737,153 (6)
abstracting: (1<=p55)
states: 248,832 (5)
abstracting: (1<=p30)
states: 248,832 (5)
abstracting: (p64<=p70)
states: 2,737,153 (6)
abstracting: (p17<=p53)
states: 2,757,889 (6)
.
EG iterations: 1
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.129sec

checking: [E [[~ [[[p21<=p69 | EX [p60<=p74]] & AX [EF [1<=p16]]]] | [AG [AX [1<=p71]] & p67<=0]] U p25<=p59] & [EF [~ [EX [E [p67<=1 U p29<=0]]]] & AF [EX [p9<=p49]]]]
normalized: [[~ [EG [~ [EX [p9<=p49]]]] & E [true U ~ [EX [E [p67<=1 U p29<=0]]]]] & E [[[p67<=0 & ~ [E [true U EX [~ [1<=p71]]]]] | ~ [[~ [EX [~ [E [true U 1<=p16]]]] & [p21<=p69 | EX [p60<=p74]]]]] U p25<=p59]]

abstracting: (p25<=p59)
states: 2,757,889 (6)
abstracting: (p60<=p74)
states: 2,985,985 (6)
.abstracting: (p21<=p69)
states: 2,757,889 (6)
abstracting: (1<=p16)
states: 248,832 (5)
.abstracting: (1<=p71)
states: 248,832 (5)
.abstracting: (p67<=0)
states: 2,737,153 (6)
abstracting: (p29<=0)
states: 2,737,153 (6)
abstracting: (p67<=1)
states: 2,985,985 (6)
.abstracting: (p9<=p49)
states: 2,757,889 (6)
..
EG iterations: 1
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.150sec

checking: [[EX [AF [~ [[AG [p35<=p4] | [1<=p52 | p3<=1]]]]] | [AG [EX [[AF [p70<=p37] | 1<=p59]]] | EX [A [[[p9<=1 | p19<=p2] & E [p25<=0 U 1<=p13]] U ~ [EX [p33<=p25]]]]]] & AX [~ [AF [~ [[p61<=0 | p39<=1]]]]]]
normalized: [[EX [~ [EG [[~ [E [true U ~ [p35<=p4]]] | [1<=p52 | p3<=1]]]]] | [EX [[~ [EG [EX [p33<=p25]]] & ~ [E [EX [p33<=p25] U [~ [[E [p25<=0 U 1<=p13] & [p9<=1 | p19<=p2]]] & EX [p33<=p25]]]]]] | ~ [E [true U ~ [EX [[1<=p59 | ~ [EG [~ [p70<=p37]]]]]]]]]] & ~ [EX [~ [EG [[p61<=0 | p39<=1]]]]]]

abstracting: (p39<=1)
states: 2,985,985 (6)
abstracting: (p61<=0)
states: 2,737,153 (6)

EG iterations: 0
.abstracting: (p70<=p37)
states: 2,757,889 (6)
.
EG iterations: 1
abstracting: (1<=p59)
states: 248,832 (5)
.abstracting: (p33<=p25)
states: 2,737,153 (6)
.abstracting: (p19<=p2)
states: 2,757,889 (6)
abstracting: (p9<=1)
states: 2,985,985 (6)
abstracting: (1<=p13)
states: 248,832 (5)
abstracting: (p25<=0)
states: 2,737,153 (6)
abstracting: (p33<=p25)
states: 2,737,153 (6)
.abstracting: (p33<=p25)
states: 2,737,153 (6)
.
EG iterations: 0
.abstracting: (p3<=1)
states: 2,985,985 (6)
abstracting: (1<=p52)
states: 248,832 (5)
abstracting: (p35<=p4)
states: 2,757,889 (6)

EG iterations: 0
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.248sec

checking: A [[EF [~ [1<=p59]] & ~ [E [A [[p23<=p70 | 1<=p60] U p19<=1] U 1<=p63]]] U [[~ [[EX [[1<=p2 & p2<=p60]] | p50<=0]] | ~ [[A [~ [1<=p20] U [p35<=p67 | p20<=1]] & AF [A [p8<=0 U 1<=p46]]]]] & EF [~ [[EF [p64<=p67] & AX [p64<=p65]]]]]]
normalized: [~ [EG [~ [[E [true U ~ [[~ [EX [~ [p64<=p65]]] & E [true U p64<=p67]]]] & [~ [[~ [EG [~ [[~ [EG [~ [1<=p46]]] & ~ [E [~ [1<=p46] U [~ [p8<=0] & ~ [1<=p46]]]]]]]] & [~ [EG [~ [[p35<=p67 | p20<=1]]]] & ~ [E [~ [[p35<=p67 | p20<=1]] U [1<=p20 & ~ [[p35<=p67 | p20<=1]]]]]]]] | ~ [[p50<=0 | EX [[1<=p2 & p2<=p60]]]]]]]]] & ~ [E [~ [[E [true U ~ [[~ [EX [~ [p64<=p65]]] & E [true U p64<=p67]]]] & [~ [[~ [EG [~ [[~ [EG [~ [1<=p46]]] & ~ [E [~ [1<=p46] U [~ [p8<=0] & ~ [1<=p46]]]]]]]] & [~ [EG [~ [[p35<=p67 | p20<=1]]]] & ~ [E [~ [[p35<=p67 | p20<=1]] U [1<=p20 & ~ [[p35<=p67 | p20<=1]]]]]]]] | ~ [[p50<=0 | EX [[1<=p2 & p2<=p60]]]]]]] U [~ [[~ [E [[~ [EG [~ [p19<=1]]] & ~ [E [~ [p19<=1] U [~ [[p23<=p70 | 1<=p60]] & ~ [p19<=1]]]]] U 1<=p63]] & E [true U ~ [1<=p59]]]] & ~ [[E [true U ~ [[~ [EX [~ [p64<=p65]]] & E [true U p64<=p67]]]] & [~ [[~ [EG [~ [[~ [EG [~ [1<=p46]]] & ~ [E [~ [1<=p46] U [~ [p8<=0] & ~ [1<=p46]]]]]]]] & [~ [EG [~ [[p35<=p67 | p20<=1]]]] & ~ [E [~ [[p35<=p67 | p20<=1]] U [1<=p20 & ~ [[p35<=p67 | p20<=1]]]]]]]] | ~ [[p50<=0 | EX [[1<=p2 & p2<=p60]]]]]]]]]]]

abstracting: (p2<=p60)
states: 2,757,889 (6)
abstracting: (1<=p2)
states: 248,832 (5)
.abstracting: (p50<=0)
states: 2,737,153 (6)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
abstracting: (1<=p20)
states: 248,832 (5)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
.
EG iterations: 1
abstracting: (1<=p46)
states: 248,832 (5)
abstracting: (p8<=0)
states: 2,737,153 (6)
abstracting: (1<=p46)
states: 248,832 (5)
abstracting: (1<=p46)
states: 248,832 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p64<=p67)
states: 2,737,153 (6)
abstracting: (p64<=p65)
states: 2,737,153 (6)
.abstracting: (1<=p59)
states: 248,832 (5)
abstracting: (1<=p63)
states: 248,832 (5)
abstracting: (p19<=1)
states: 2,985,985 (6)
abstracting: (1<=p60)
states: 248,832 (5)
abstracting: (p23<=p70)
states: 2,757,889 (6)
abstracting: (p19<=1)
states: 2,985,985 (6)
abstracting: (p19<=1)
states: 2,985,985 (6)
.
EG iterations: 1
abstracting: (p2<=p60)
states: 2,757,889 (6)
abstracting: (1<=p2)
states: 248,832 (5)
.abstracting: (p50<=0)
states: 2,737,153 (6)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
abstracting: (1<=p20)
states: 248,832 (5)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
.
EG iterations: 1
abstracting: (1<=p46)
states: 248,832 (5)
abstracting: (p8<=0)
states: 2,737,153 (6)
abstracting: (1<=p46)
states: 248,832 (5)
abstracting: (1<=p46)
states: 248,832 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p64<=p67)
states: 2,737,153 (6)
abstracting: (p64<=p65)
states: 2,737,153 (6)
.abstracting: (p2<=p60)
states: 2,757,889 (6)
abstracting: (1<=p2)
states: 248,832 (5)
.abstracting: (p50<=0)
states: 2,737,153 (6)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
abstracting: (1<=p20)
states: 248,832 (5)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
abstracting: (p20<=1)
states: 2,985,985 (6)
abstracting: (p35<=p67)
states: 2,757,889 (6)
.
EG iterations: 1
abstracting: (1<=p46)
states: 248,832 (5)
abstracting: (p8<=0)
states: 2,737,153 (6)
abstracting: (1<=p46)
states: 248,832 (5)
abstracting: (1<=p46)
states: 248,832 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p64<=p67)
states: 2,737,153 (6)
abstracting: (p64<=p65)
states: 2,737,153 (6)
..
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.171sec

checking: AX [[[~ [EX [[~ [1<=p10] & AX [p74<=0]]]] & ~ [[~ [[A [1<=p27 U p41<=p43] | 1<=p14]] | EG [~ [1<=p67]]]]] | [EF [[[[p44<=p49 & 1<=p15] & EX [p58<=p6]] | ~ [AG [1<=p22]]]] & [[[AX [p37<=1] & ~ [[1<=p21 & 1<=p22]]] & AX [[1<=p50 & 1<=p32]]] | p60<=p73]]]]
normalized: ~ [EX [~ [[[[p60<=p73 | [~ [EX [~ [[1<=p50 & 1<=p32]]]] & [~ [[1<=p21 & 1<=p22]] & ~ [EX [~ [p37<=1]]]]]] & E [true U [E [true U ~ [1<=p22]] | [EX [p58<=p6] & [p44<=p49 & 1<=p15]]]]] | [~ [[EG [~ [1<=p67]] | ~ [[1<=p14 | [~ [EG [~ [p41<=p43]]] & ~ [E [~ [p41<=p43] U [~ [1<=p27] & ~ [p41<=p43]]]]]]]]] & ~ [EX [[~ [EX [~ [p74<=0]]] & ~ [1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 248,832 (5)
abstracting: (p74<=0)
states: 1
..abstracting: (p41<=p43)
states: 2,737,153 (6)
abstracting: (1<=p27)
states: 248,832 (5)
abstracting: (p41<=p43)
states: 2,737,153 (6)
abstracting: (p41<=p43)
states: 2,737,153 (6)
.
EG iterations: 1
abstracting: (1<=p14)
states: 248,832 (5)
abstracting: (1<=p67)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (1<=p15)
states: 248,832 (5)
abstracting: (p44<=p49)
states: 2,757,889 (6)
abstracting: (p58<=p6)
states: 2,757,889 (6)
.abstracting: (1<=p22)
states: 248,832 (5)
abstracting: (p37<=1)
states: 2,985,985 (6)
.abstracting: (1<=p22)
states: 248,832 (5)
abstracting: (1<=p21)
states: 248,832 (5)
abstracting: (1<=p32)
states: 248,832 (5)
abstracting: (1<=p50)
states: 248,832 (5)
.abstracting: (p60<=p73)
states: 2,985,985 (6)
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.141sec

checking: A [[[~ [p56<=1] & E [~ [[AX [p29<=p22] | [p54<=p17 | p9<=1]]] U [1<=p31 & p40<=0]]] | [EG [EG [1<=p39]] & [EX [EG [p28<=0]] & [A [[p66<=0 | 1<=p17] U ~ [p13<=p32]] & [[EX [1<=p12] & 1<=p58] & ~ [1<=p44]]]]]] U ~ [[p58<=p55 | AX [p56<=p53]]]]
normalized: [~ [EG [[p58<=p55 | ~ [EX [~ [p56<=p53]]]]]] & ~ [E [[p58<=p55 | ~ [EX [~ [p56<=p53]]]] U [~ [[[[[[~ [1<=p44] & [1<=p58 & EX [1<=p12]]] & [~ [EG [p13<=p32]] & ~ [E [p13<=p32 U [p13<=p32 & ~ [[p66<=0 | 1<=p17]]]]]]] & EX [EG [p28<=0]]] & EG [EG [1<=p39]]] | [E [~ [[[p54<=p17 | p9<=1] | ~ [EX [~ [p29<=p22]]]]] U [1<=p31 & p40<=0]] & ~ [p56<=1]]]] & [p58<=p55 | ~ [EX [~ [p56<=p53]]]]]]]]

abstracting: (p56<=p53)
states: 2,737,153 (6)
.abstracting: (p58<=p55)
states: 2,737,153 (6)
abstracting: (p56<=1)
states: 2,985,985 (6)
abstracting: (p40<=0)
states: 2,737,153 (6)
abstracting: (1<=p31)
states: 248,832 (5)
abstracting: (p29<=p22)
states: 2,757,889 (6)
.abstracting: (p9<=1)
states: 2,985,985 (6)
abstracting: (p54<=p17)
states: 2,757,889 (6)
abstracting: (1<=p39)
states: 248,832 (5)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p28<=0)
states: 2,737,153 (6)
.
EG iterations: 1
.abstracting: (1<=p17)
states: 248,832 (5)
abstracting: (p66<=0)
states: 2,737,153 (6)
abstracting: (p13<=p32)
states: 2,757,889 (6)
abstracting: (p13<=p32)
states: 2,757,889 (6)
abstracting: (p13<=p32)
states: 2,757,889 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 248,832 (5)
.abstracting: (1<=p58)
states: 248,832 (5)
abstracting: (1<=p44)
states: 248,832 (5)
abstracting: (p56<=p53)
states: 2,737,153 (6)
.abstracting: (p58<=p55)
states: 2,737,153 (6)
abstracting: (p56<=p53)
states: 2,737,153 (6)
.abstracting: (p58<=p55)
states: 2,737,153 (6)

EG iterations: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.237sec

checking: E [EF [[[~ [AX [p73<=0]] | p33<=p52] & [[[EX [p26<=p65] & p65<=p6] & [~ [p68<=p27] & EX [p25<=0]]] & [~ [p14<=p71] & [[p28<=0 & p65<=1] | [p6<=1 | p54<=1]]]]]] U AG [[EG [[~ [p41<=p20] & [1<=p56 | 1<=p52]]] & E [AG [p68<=0] U ~ [EF [p61<=p14]]]]]]
normalized: E [E [true U [[[[[p6<=1 | p54<=1] | [p28<=0 & p65<=1]] & ~ [p14<=p71]] & [[EX [p25<=0] & ~ [p68<=p27]] & [p65<=p6 & EX [p26<=p65]]]] & [p33<=p52 | EX [~ [p73<=0]]]]] U ~ [E [true U ~ [[E [~ [E [true U ~ [p68<=0]]] U ~ [E [true U p61<=p14]]] & EG [[[1<=p56 | 1<=p52] & ~ [p41<=p20]]]]]]]]

abstracting: (p41<=p20)
states: 2,757,889 (6)
abstracting: (1<=p52)
states: 248,832 (5)
abstracting: (1<=p56)
states: 248,832 (5)
.
EG iterations: 1
abstracting: (p61<=p14)
states: 2,757,889 (6)
abstracting: (p68<=0)
states: 2,737,153 (6)
abstracting: (p73<=0)
states: 1
.abstracting: (p33<=p52)
states: 2,757,889 (6)
abstracting: (p26<=p65)
states: 2,757,889 (6)
.abstracting: (p65<=p6)
states: 2,757,889 (6)
abstracting: (p68<=p27)
states: 2,757,889 (6)
abstracting: (p25<=0)
states: 2,737,153 (6)
.abstracting: (p14<=p71)
states: 2,757,889 (6)
abstracting: (p65<=1)
states: 2,985,985 (6)
abstracting: (p28<=0)
states: 2,737,153 (6)
abstracting: (p54<=1)
states: 2,985,985 (6)
abstracting: (p6<=1)
states: 2,985,985 (6)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-06a-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.180sec

totally nodes used: 836680 (8.4e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3052740 6896373 9949113
used/not used/entry size/cache size: 7278242 59830622 16 1024MB
basic ops cache: hits/miss/sum: 264400 544604 809004
used/not used/entry size/cache size: 869673 15907543 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: 35888 70049 105937
used/not used/entry size/cache size: 69751 8318857 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 66329442
1 728166
2 45752
3 5041
4 432
5 27
6 4
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 7.100sec


BK_STOP 1679854478960

--------------------
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:2968 (19), effective:122 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:1121 (7), effective:34 (0)

iterations count:868 (5), effective:24 (0)

iterations count:1121 (7), effective:34 (0)

iterations count:1121 (7), effective:34 (0)

iterations count:1014 (6), effective:23 (0)

iterations count:910 (5), effective:23 (0)

iterations count:1014 (6), effective:23 (0)

iterations count:1014 (6), effective:23 (0)

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

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

iterations count:843 (5), effective:23 (0)

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

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

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

iterations count:1234 (8), effective:36 (0)

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

iterations count:936 (6), effective:24 (0)

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

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

iterations count:1809 (11), effective:57 (0)

iterations count:852 (5), effective:23 (0)

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

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

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

iterations count:857 (5), effective:23 (0)

iterations count:889 (5), effective:24 (0)

iterations count:869 (5), effective:24 (0)

iterations count:860 (5), effective:23 (0)

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

iterations count:465 (3), effective:11 (0)

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

iterations count:547 (3), effective:12 (0)

iterations count:860 (5), effective:23 (0)

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

iterations count:465 (3), effective:11 (0)

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

iterations count:860 (5), effective:23 (0)

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

iterations count:465 (3), effective:11 (0)

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

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

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

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

iterations count:479 (3), effective:13 (0)

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

iterations count:173 (1), effective:5 (0)

iterations count:537 (3), effective:12 (0)

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

iterations count:1162 (7), effective:35 (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="FlexibleBarrier-PT-06a"
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 FlexibleBarrier-PT-06a, 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 r161-tall-167838845200457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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