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

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

=== Now, execution of the tool begins

BK_START 1495812883321

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_04a
(NrP: 51 NrTr: 88 NrArc: 309)

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

net check time: 0m 0.000sec

init dd package: 0m 0.942sec


RS generation: 0m 0.008sec


-> reachability set: #nodes 281 (2.8e+02) #states 20,737 (4)



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

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

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

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [~ [3<=p21]]
normalized: ~ [E [true U 3<=p21]]

abstracting: (3<=p21)
states: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[2<=p46 | [1<=p9 & 2<=p26]]]]
normalized: ~ [E [true U [2<=p46 | [1<=p9 & 2<=p26]]]]

abstracting: (2<=p26)
states: 0
abstracting: (1<=p9)
states: 1,728 (3)
abstracting: (2<=p46)
states: 0
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[p43<=p47 & p28<=p29] | ~ [2<=p24]]]]
normalized: E [true U ~ [[~ [2<=p24] | [p43<=p47 & p28<=p29]]]]

abstracting: (p28<=p29)
states: 19,009 (4)
abstracting: (p43<=p47)
states: 19,009 (4)
abstracting: (2<=p24)
states: 0
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [p48<=p21] & [~ [2<=p35] & [2<=p26 | 2<=p15]]]]
normalized: E [true U [[[2<=p26 | 2<=p15] & ~ [2<=p35]] & ~ [p48<=p21]]]

abstracting: (p48<=p21)
states: 19,153 (4)
abstracting: (2<=p35)
states: 0
abstracting: (2<=p15)
states: 0
abstracting: (2<=p26)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[~ [[3<=p9 & p45<=p30]] & [2<=p42 | ~ [2<=p41]]]]
normalized: ~ [E [true U ~ [[[~ [2<=p41] | 2<=p42] & ~ [[3<=p9 & p45<=p30]]]]]]

abstracting: (p45<=p30)
states: 19,153 (4)
abstracting: (3<=p9)
states: 0
abstracting: (2<=p42)
states: 0
abstracting: (2<=p41)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[[[1<=p22 & 1<=p27] | [1<=p31 & p43<=p48]] & 1<=p28]]
normalized: E [true U [1<=p28 & [[1<=p31 & p43<=p48] | [1<=p22 & 1<=p27]]]]

abstracting: (1<=p27)
states: 1,728 (3)
abstracting: (1<=p22)
states: 1,728 (3)
abstracting: (p43<=p48)
states: 19,009 (4)
abstracting: (1<=p31)
states: 1,728 (3)
abstracting: (1<=p28)
states: 1,728 (3)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [~ [p22<=p17]] & ~ [[p29<=p13 | p44<=p11]]]]
normalized: E [true U [p22<=p17 & ~ [[p29<=p13 | p44<=p11]]]]

abstracting: (p44<=p11)
states: 19,153 (4)
abstracting: (p29<=p13)
states: 19,153 (4)
abstracting: (p22<=p17)
states: 19,009 (4)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [[3<=p18 & [[p29<=p33 | 3<=p5] & [2<=p5 | 1<=p43]]]]
normalized: E [true U [[[p29<=p33 | 3<=p5] & [2<=p5 | 1<=p43]] & 3<=p18]]

abstracting: (3<=p18)
states: 0
abstracting: (1<=p43)
states: 1,728 (3)
abstracting: (2<=p5)
states: 0
abstracting: (3<=p5)
states: 0
abstracting: (p29<=p33)
states: 19,009 (4)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[[~ [p15<=p42] | ~ [2<=p45]] & ~ [[p40<=p47 & 2<=p3]]]]
normalized: ~ [E [true U ~ [[~ [[p40<=p47 & 2<=p3]] & [~ [p15<=p42] | ~ [2<=p45]]]]]]

abstracting: (2<=p45)
states: 0
abstracting: (p15<=p42)
states: 19,153 (4)
abstracting: (2<=p3)
states: 0
abstracting: (p40<=p47)
states: 19,009 (4)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [~ [[[p33<=p11 | p40<=p2] & [3<=p26 & p16<=p0]]]]
normalized: ~ [E [true U [[3<=p26 & p16<=p0] & [p33<=p11 | p40<=p2]]]]

abstracting: (p40<=p2)
states: 19,153 (4)
abstracting: (p33<=p11)
states: 19,153 (4)
abstracting: (p16<=p0)
states: 19,009 (4)
abstracting: (3<=p26)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[~ [3<=p24] | [[p1<=p3 & 3<=p48] & [p18<=p15 & 1<=p39]]]]
normalized: ~ [E [true U ~ [[[[p18<=p15 & 1<=p39] & [p1<=p3 & 3<=p48]] | ~ [3<=p24]]]]]

abstracting: (3<=p24)
states: 0
abstracting: (3<=p48)
states: 0
abstracting: (p1<=p3)
states: 19,009 (4)
abstracting: (1<=p39)
states: 1,728 (3)
abstracting: (p18<=p15)
states: 19,009 (4)
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[[[3<=p35 | 3<=p2] & [2<=p36 | p32<=p50]] & [~ [p49<=p39] | [1<=p15 & p15<=p6]]]]
normalized: E [true U [[[1<=p15 & p15<=p6] | ~ [p49<=p39]] & [[2<=p36 | p32<=p50] & [3<=p35 | 3<=p2]]]]

abstracting: (3<=p2)
states: 0
abstracting: (3<=p35)
states: 0
abstracting: (p32<=p50)
states: 20,737 (4)
abstracting: (2<=p36)
states: 0
abstracting: (p49<=p39)
states: 1,729 (3)
abstracting: (p15<=p6)
states: 19,153 (4)
abstracting: (1<=p15)
states: 1,728 (3)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[p23<=p15 | 2<=p27] & [p37<=p42 & p8<=p19]] | [1<=p48 | [p6<=p10 | p22<=p32]]]]
normalized: ~ [E [true U ~ [[[1<=p48 | [p6<=p10 | p22<=p32]] | [[p37<=p42 & p8<=p19] & [p23<=p15 | 2<=p27]]]]]]

abstracting: (2<=p27)
states: 0
abstracting: (p23<=p15)
states: 19,009 (4)
abstracting: (p8<=p19)
states: 19,153 (4)
abstracting: (p37<=p42)
states: 19,009 (4)
abstracting: (p22<=p32)
states: 19,153 (4)
abstracting: (p6<=p10)
states: 19,009 (4)
abstracting: (1<=p48)
states: 1,728 (3)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-04a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

totally nodes used: 60383(6.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 64790 100185 164975
used/not used/entry size/cache size: 88251 67020613 16 1024MB
basic ops cache: hits/miss/sum: 59201 99813 159014
used/not used/entry size/cache size: 202057 16575159 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: 2664 2956 5620
used/not used/entry size/cache size: 2955 2094197 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 67048515
1 60316
2 32
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.429sec


BK_STOP 1495812884779

--------------------
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:1339 (15), effective:78 (0)

initing FirstDep: 0m 0.000sec


iterations count:881 (10), effective:37 (0)

iterations count:1117 (12), effective:57 (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-04a"
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-04a.tgz
mv FlexibleBarrier-PT-04a 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-04a, 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-149581023700007"
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 ;