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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r181-blw3-149581023800061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495812940833

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=ReachabilityCardinality.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.006sec

net check time: 0m 0.000sec

init dd package: 0m 1.192sec


RS generation: 0m 5.805sec


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



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

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

abstracting: (2<=p0)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.018sec

checking: EF [2<=p12]
normalized: E [true U 2<=p12]

abstracting: (2<=p12)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [3<=p59]
normalized: E [true U 3<=p59]

abstracting: (3<=p59)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [2<=p4]
normalized: E [true U 2<=p4]

abstracting: (2<=p4)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

after gc: zbdd nodes used:67353, unused:18682647-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.882sec

checking: EF [~ [p115<=p91]]
normalized: E [true U ~ [p115<=p91]]

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

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

MC time: 0m 3.975sec

checking: EF [~ [p16<=p73]]
normalized: E [true U ~ [p16<=p73]]

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

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.805sec

checking: EF [~ [[p2<=p2 | [p0<=p14 & p84<=p18]]]]
normalized: E [true U ~ [[p2<=p2 | [p0<=p14 & p84<=p18]]]]

abstracting: (p84<=p18)
states: 57,187,565,569 (10)
abstracting: (p0<=p14)
states: 61,917,364,224 (10)
abstracting: (p2<=p2)
states: 61,917,364,225 (10)
-> the formula is FALSE

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

MC time: 0m 0.057sec

checking: AG [[[~ [p58<=p98] & ~ [2<=p92]] | ~ [[2<=p89 & p53<=p66]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p89 & p53<=p66]] | [~ [2<=p92] & ~ [p58<=p98]]]]]]

abstracting: (p58<=p98)
states: 57,187,565,569 (10)
abstracting: (2<=p92)
states: 0
abstracting: (p53<=p66)
states: 57,187,565,569 (10)
abstracting: (2<=p89)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.040sec

checking: AG [[~ [[2<=p18 & p121<=p52]] | ~ [[p99<=p27 | p97<=p29]]]]
normalized: ~ [E [true U ~ [[~ [[p99<=p27 | p97<=p29]] | ~ [[2<=p18 & p121<=p52]]]]]]

abstracting: (p121<=p52)
states: 5,159,780,353 (9)
abstracting: (2<=p18)
states: 0
abstracting: (p97<=p29)
states: 57,187,565,569 (10)
abstracting: (p99<=p27)
states: 57,187,565,569 (10)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.069sec

checking: EF [~ [[[p117<=p100 | p54<=p57] & [p76<=p113 | 2<=p47]]]]
normalized: E [true U ~ [[[p76<=p113 | 2<=p47] & [p117<=p100 | p54<=p57]]]]

abstracting: (p54<=p57)
states: 56,757,583,873 (10)
abstracting: (p117<=p100)
states: 57,187,565,569 (10)
abstracting: (2<=p47)
states: 0
abstracting: (p76<=p113)
states: 57,187,565,569 (10)

after gc: zbdd nodes used:233068, unused:37266932-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15.699sec

checking: EF [[[[1<=p68 | 3<=p68] & [p84<=p97 | p40<=p116]] & ~ [[p79<=p107 | 2<=p0]]]]
normalized: E [true U [~ [[p79<=p107 | 2<=p0]] & [[p84<=p97 | p40<=p116] & [1<=p68 | 3<=p68]]]]

abstracting: (3<=p68)
states: 0
abstracting: (1<=p68)
states: 5,159,780,352 (9)
abstracting: (p40<=p116)
states: 57,187,565,569 (10)
abstracting: (p84<=p97)
states: 57,187,565,569 (10)
abstracting: (2<=p0)
states: 0
abstracting: (p79<=p107)
states: 57,187,565,569 (10)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.940sec

checking: AG [[[~ [1<=p120] | [1<=p63 | p91<=p105]] | [[3<=p55 & 1<=p72] | [2<=p31 | p60<=p7]]]]
normalized: ~ [E [true U ~ [[[[2<=p31 | p60<=p7] | [3<=p55 & 1<=p72]] | [[1<=p63 | p91<=p105] | ~ [1<=p120]]]]]]

abstracting: (1<=p120)
states: 5,159,780,352 (9)
abstracting: (p91<=p105)
states: 57,187,565,569 (10)
abstracting: (1<=p63)
states: 5,159,780,352 (9)
abstracting: (1<=p72)
states: 5,159,780,352 (9)
abstracting: (3<=p55)
states: 0
abstracting: (p60<=p7)
states: 57,187,565,569 (10)
abstracting: (2<=p31)
states: 0
-> the formula is FALSE

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

MC time: 0m 8.001sec

checking: AG [[[[2<=p94 | 2<=p99] | [p68<=p112 | 1<=p42]] | [p114<=p16 & [2<=p27 | p50<=p35]]]]
normalized: ~ [E [true U ~ [[[p114<=p16 & [2<=p27 | p50<=p35]] | [[p68<=p112 | 1<=p42] | [2<=p94 | 2<=p99]]]]]]

abstracting: (2<=p99)
states: 0
abstracting: (2<=p94)
states: 0
abstracting: (1<=p42)
states: 5,159,780,352 (9)
abstracting: (p68<=p112)
states: 57,187,565,569 (10)
abstracting: (p50<=p35)
states: 57,187,565,569 (10)
abstracting: (2<=p27)
states: 0
abstracting: (p114<=p16)
states: 57,187,565,569 (10)
-> the formula is FALSE

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

MC time: 0m11.182sec

checking: EF [[[[3<=p47 & 3<=p41] | [p73<=p62 & 1<=p40]] & [[3<=p24 & 2<=p66] | [p113<=p95 & p69<=p43]]]]
normalized: E [true U [[[p113<=p95 & p69<=p43] | [3<=p24 & 2<=p66]] & [[p73<=p62 & 1<=p40] | [3<=p47 & 3<=p41]]]]

abstracting: (3<=p41)
states: 0
abstracting: (3<=p47)
states: 0
abstracting: (1<=p40)
states: 5,159,780,352 (9)
abstracting: (p73<=p62)
states: 57,187,565,569 (10)
abstracting: (2<=p66)
states: 0
abstracting: (3<=p24)
states: 0
abstracting: (p69<=p43)
states: 57,187,565,569 (10)
abstracting: (p113<=p95)
states: 57,187,565,569 (10)
-> the formula is TRUE

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

MC time: 0m 5.517sec

checking: EF [[[[p117<=p84 | p29<=p20] & [p56<=p4 | p71<=p90]] & [[1<=p19 & p18<=p72] & 1<=p107]]]
normalized: E [true U [[1<=p107 & [1<=p19 & p18<=p72]] & [[p56<=p4 | p71<=p90] & [p117<=p84 | p29<=p20]]]]

abstracting: (p29<=p20)
states: 57,187,565,569 (10)
abstracting: (p117<=p84)
states: 57,187,565,569 (10)
abstracting: (p71<=p90)
states: 57,187,565,569 (10)
abstracting: (p56<=p4)
states: 57,187,565,569 (10)
abstracting: (p18<=p72)
states: 57,187,565,569 (10)
abstracting: (1<=p19)
states: 5,159,780,352 (9)
abstracting: (1<=p107)
states: 5,159,780,352 (9)

after gc: zbdd nodes used:509399, unused:74490601-> the formula is TRUE

FORMULA FlexibleBarrier-PT-10a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 9.980sec

totally nodes used: 68568591(6.9e+07)
number of garbage collections: 3
fire ops cache: hits/miss/sum: 73082585 85996594 159079179
used/not used/entry size/cache size: 3501359 63607505 16 1024MB
basic ops cache: hits/miss/sum: 82018748 104571026 186589774
used/not used/entry size/cache size: 6220177 10557039 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: 544909 567886 1112795
used/not used/entry size/cache size: 0 2097152 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 63458803
1 3548586
2 99623
3 1829
4 23
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 1m28.062sec


BK_STOP 1495813028927

--------------------
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:9106 (27), effective:210 (0)

initing FirstDep: 0m 0.000sec


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

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

iterations count:1559 (4), effective:24 (0)

iterations count:2437 (7), effective:42 (0)

iterations count:3207 (9), effective:46 (0)

iterations count:3179 (9), effective:48 (0)

iterations count:2479 (7), effective:41 (0)

iterations count:1748 (5), effective:29 (0)

iterations count:2920 (8), effective:48 (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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r181-blw3-149581023800061"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.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 ;