Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Waiting for the VM to be ready (probing ssh)
........
=====================================================================
Generated by BenchKit 2-3254
Executing tool marcie
Input is FlexibleBarrier-PT-10a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581023800057
=====================================================================

--------------------
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-10a-CTLCardinality-0
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-1
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-15
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-2
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-3
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-4
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-5
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-6
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-7
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-8
FORMULA_NAME FlexibleBarrier-PT-10a-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1495812937742

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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: marcie --net-file=model.pnml --mcc-file=CTLCardinality.xml --memory=6

parse successfull
net created successfully

Net: FlexibleBarrier_PT_10a
(NrP: 123 NrTr: 334 NrArc: 1467)

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

net check time: 0m 0.000sec

init dd package: 0m 1.241sec


RS generation: 0m 5.286sec


-> reachability set: #nodes 40477 (4.0e+04) #states 61,917,364,225 (10)



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

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

abstracting: (1<=p14)
states: 5,159,780,352 (9)

after gc: zbdd nodes used:81179, unused:18668821-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m13.816sec

checking: EF [~ [p87<=p22]]
normalized: E [true U ~ [p87<=p22]]

abstracting: (p87<=p22)
states: 57,187,565,569 (10)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.512sec

checking: AG [p50<=p0]
normalized: ~ [E [true U ~ [p50<=p0]]]

abstracting: (p50<=p0)
states: 56,757,583,873 (10)
-> the formula is FALSE

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

MC time: 0m 8.902sec

checking: A [1<=p91 U EF [1<=p55]]
normalized: [~ [EG [~ [E [true U 1<=p55]]]] & ~ [E [~ [E [true U 1<=p55]] U [~ [1<=p91] & ~ [E [true U 1<=p55]]]]]]

abstracting: (1<=p55)
states: 5,159,780,352 (9)
abstracting: (1<=p91)
states: 5,159,780,352 (9)
abstracting: (1<=p55)
states: 5,159,780,352 (9)
abstracting: (1<=p55)
states: 5,159,780,352 (9)
.
after gc: zbdd nodes used:268504, unused:37231496
after gc: zbdd nodes used:11735562, unused:63264438
EG iterations: 1
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m39.420sec

checking: AF [EF [[2<=p12 & 1<=p111]]]
normalized: ~ [EG [~ [E [true U [2<=p12 & 1<=p111]]]]]

abstracting: (1<=p111)
states: 5,159,780,352 (9)
abstracting: (2<=p12)
states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.037sec

checking: [[EX [2<=p39] & ~ [3<=p30]] | EF [AG [2<=p10]]]
normalized: [E [true U ~ [E [true U ~ [2<=p10]]]] | [~ [3<=p30] & EX [2<=p39]]]

abstracting: (2<=p39)
states: 0
.abstracting: (3<=p30)
states: 0
abstracting: (2<=p10)
states: 0
-> the formula is FALSE

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

MC time: 0m 4.241sec

checking: A [~ [~ [3<=p48]] U AG [p73<=p105]]
normalized: [~ [EG [E [true U ~ [p73<=p105]]]] & ~ [E [E [true U ~ [p73<=p105]] U [E [true U ~ [p73<=p105]] & ~ [3<=p48]]]]]

abstracting: (3<=p48)
states: 0
abstracting: (p73<=p105)
states: 57,187,565,569 (10)
abstracting: (p73<=p105)
states: 57,187,565,569 (10)
abstracting: (p73<=p105)
states: 57,187,565,569 (10)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 7.968sec

checking: AG [EX [[3<=p107 | p23<=p39]]]
normalized: ~ [E [true U ~ [EX [[3<=p107 | p23<=p39]]]]]

abstracting: (p23<=p39)
states: 57,187,565,569 (10)
abstracting: (3<=p107)
states: 0

after gc: zbdd nodes used:3003401, unused:146996599.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m24.412sec

checking: E [EG [p58<=p112] U 3<=p0]
normalized: E [EG [p58<=p112] U 3<=p0]

abstracting: (3<=p0)
states: 0
abstracting: (p58<=p112)
states: 57,187,565,569 (10)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 2m40.739sec

checking: [EF [AF [3<=p49]] & EG [EG [p27<=p115]]]
normalized: [EG [EG [p27<=p115]] & E [true U ~ [EG [~ [3<=p49]]]]]

abstracting: (3<=p49)
states: 0

EG iterations: 0
abstracting: (p27<=p115)
states: 57,187,565,569 (10)
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 5m43.704sec

checking: ~ [[EG [p25<=p1] & EF [[3<=p11 | 2<=p73]]]]
normalized: ~ [[E [true U [3<=p11 | 2<=p73]] & EG [p25<=p1]]]

abstracting: (p25<=p1)
states: 57,187,565,569 (10)
.
EG iterations: 1
abstracting: (2<=p73)
states: 0
abstracting: (3<=p11)
states: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m23.809sec

checking: ~ [E [[p68<=p57 | 3<=p91] U ~ [p112<=p109]]]
normalized: ~ [E [[p68<=p57 | 3<=p91] U ~ [p112<=p109]]]

abstracting: (p112<=p109)
states: 56,757,583,873 (10)
abstracting: (3<=p91)
states: 0
abstracting: (p68<=p57)
states: 57,187,565,569 (10)
-> the formula is FALSE

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

MC time: 0m 7.343sec

checking: ~ [~ [[[~ [1<=p87] | [p52<=p74 & 1<=p112]] & AG [p99<=p117]]]]
normalized: [~ [E [true U ~ [p99<=p117]]] & [[p52<=p74 & 1<=p112] | ~ [1<=p87]]]

abstracting: (1<=p87)
states: 5,159,780,352 (9)
abstracting: (1<=p112)
states: 5,159,780,352 (9)
abstracting: (p52<=p74)
states: 57,187,565,569 (10)
abstracting: (p99<=p117)
states: 57,187,565,569 (10)
-> the formula is FALSE

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

MC time: 0m 9.128sec

checking: E [AG [p101<=p97] U [[p117<=p88 & p100<=p8] & ~ [p92<=p88]]]
normalized: E [~ [E [true U ~ [p101<=p97]]] U [~ [p92<=p88] & [p117<=p88 & p100<=p8]]]

abstracting: (p100<=p8)
states: 57,187,565,569 (10)
abstracting: (p117<=p88)
states: 57,187,565,569 (10)
abstracting: (p92<=p88)
states: 56,757,583,873 (10)
abstracting: (p101<=p97)
states: 56,757,583,873 (10)
-> the formula is FALSE

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

MC time: 0m 6.924sec

checking: [AG [[p90<=p29 & [p3<=p106 & p18<=p71]]] & [[AX [p61<=p96] | AF [p117<=p15]] | [3<=p78 | ~ [~ [2<=p62]]]]]
normalized: [[[3<=p78 | 2<=p62] | [~ [EG [~ [p117<=p15]]] | ~ [EX [~ [p61<=p96]]]]] & ~ [E [true U ~ [[p90<=p29 & [p3<=p106 & p18<=p71]]]]]]

abstracting: (p18<=p71)
states: 57,187,565,569 (10)
abstracting: (p3<=p106)
states: 57,187,565,569 (10)
abstracting: (p90<=p29)
states: 57,187,565,569 (10)

after gc: zbdd nodes used:427666, unused:299572334abstracting: (p61<=p96)
states: 57,187,565,569 (10)
.abstracting: (p117<=p15)
states: 57,187,565,569 (10)
.
EG iterations: 1
abstracting: (2<=p62)
states: 0
abstracting: (3<=p78)
states: 0
-> the formula is FALSE

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

MC time: 1m14.839sec

checking: [[2<=p85 | ~ [~ [~ [1<=p36]]]] & [[[~ [1<=p12] & [1<=p62 | 1<=p49]] & [[3<=p36 & p47<=p103] | [2<=p68 | p59<=p3]]] | E [p56<=p73 U 3<=p61]]]
normalized: [[E [p56<=p73 U 3<=p61] | [[[2<=p68 | p59<=p3] | [3<=p36 & p47<=p103]] & [[1<=p62 | 1<=p49] & ~ [1<=p12]]]] & [2<=p85 | ~ [1<=p36]]]

abstracting: (1<=p36)
states: 5,159,780,352 (9)
abstracting: (2<=p85)
states: 0
abstracting: (1<=p12)
states: 5,159,780,352 (9)
abstracting: (1<=p49)
states: 5,159,780,352 (9)
abstracting: (1<=p62)
states: 5,159,780,352 (9)
abstracting: (p47<=p103)
states: 57,187,565,569 (10)
abstracting: (3<=p36)
states: 0
abstracting: (p59<=p3)
states: 57,187,565,569 (10)
abstracting: (2<=p68)
states: 0
abstracting: (3<=p61)
states: 0
abstracting: (p56<=p73)
states: 57,187,565,569 (10)
-> the formula is FALSE

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

MC time: 0m 0.123sec

totally nodes used: 321002814(3.2e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 78473652 92223136 170696788
used/not used/entry size/cache size: 9160350 57948514 16 1024MB
basic ops cache: hits/miss/sum: 908557616 1857027454 2765585070
used/not used/entry size/cache size: 16777137 79 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 545317 571272 1116589
used/not used/entry size/cache size: 108048 1989104 32 64MB
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 33889697
1 23131396
2 7916212
3 1810844
4 311865
5 43361
6 4962
7 480
8 46
9 1
>= 10 0

Total processing time: 19m20.388sec


BK_STOP 1495814098159

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


iterations count:9106 (27), effective:210 (0)

initing FirstDep: 0m 0.000sec


iterations count:1550 (4), effective:23 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:1674 (5), 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-10a"
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"

# 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

tar xzf /home/mcc/BenchKit/INPUTS/FlexibleBarrier-PT-10a.tgz
mv FlexibleBarrier-PT-10a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is FlexibleBarrier-PT-10a, 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 r181-blw3-149581023800057"
echo "====================================================================="
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
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 ;