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 Peterson-PT-2, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r041-smll-149440525400047
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Peterson-COL-2-UpperBounds-0
FORMULA_NAME Peterson-COL-2-UpperBounds-1
FORMULA_NAME Peterson-COL-2-UpperBounds-10
FORMULA_NAME Peterson-COL-2-UpperBounds-11
FORMULA_NAME Peterson-COL-2-UpperBounds-12
FORMULA_NAME Peterson-COL-2-UpperBounds-13
FORMULA_NAME Peterson-COL-2-UpperBounds-14
FORMULA_NAME Peterson-COL-2-UpperBounds-15
FORMULA_NAME Peterson-COL-2-UpperBounds-2
FORMULA_NAME Peterson-COL-2-UpperBounds-3
FORMULA_NAME Peterson-COL-2-UpperBounds-4
FORMULA_NAME Peterson-COL-2-UpperBounds-5
FORMULA_NAME Peterson-COL-2-UpperBounds-6
FORMULA_NAME Peterson-COL-2-UpperBounds-7
FORMULA_NAME Peterson-COL-2-UpperBounds-8
FORMULA_NAME Peterson-COL-2-UpperBounds-9

=== Now, execution of the tool begins

BK_START 1494485409119

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=UpperBounds.xml --memory=6

parse successfull
net created successfully

Net: Peterson_PT_2
(NrP: 102 NrTr: 126 NrArc: 384)

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

net check time: 0m 0.000sec

init dd package: 0m 1.255sec


RS generation: 0m 0.110sec


-> reachability set: #nodes 1459 (1.5e+03) #states 20,754 (4)



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

checking: place_bound(CS_0,CS_1,CS_2)
normalized: place_bound(CS_0,CS_1,CS_2)

-> the formula is 1

FORMULA Peterson-COL-2-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(AskForSection_1_1,AskForSection_2_1,AskForSection_2_0,AskForSection_0_1,AskForSection_0_0,AskForSection_1_0)
normalized: place_bound(AskForSection_1_1,AskForSection_2_1,AskForSection_2_0,AskForSection_0_1,AskForSection_0_0,AskForSection_1_0)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(WantSection_1_T,WantSection_2_T,WantSection_0_T,WantSection_2_F,WantSection_1_F,WantSection_0_F)
normalized: place_bound(WantSection_1_T,WantSection_2_T,WantSection_0_T,WantSection_2_F,WantSection_1_F,WantSection_0_F)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-3 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(AskForSection_1_1,AskForSection_2_1,AskForSection_2_0,AskForSection_0_1,AskForSection_0_0,AskForSection_1_0)
normalized: place_bound(AskForSection_1_1,AskForSection_2_1,AskForSection_2_0,AskForSection_0_1,AskForSection_0_0,AskForSection_1_0)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-6 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(EndTurn_0_0,EndTurn_2_0,EndTurn_1_0,EndTurn_1_1,EndTurn_0_1,EndTurn_2_1)
normalized: place_bound(EndTurn_0_0,EndTurn_2_0,EndTurn_1_0,EndTurn_1_1,EndTurn_0_1,EndTurn_2_1)

-> the formula is 2

FORMULA Peterson-COL-2-UpperBounds-7 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Turn_0_0,Turn_1_2,Turn_0_1,Turn_1_0,Turn_0_2,Turn_1_1)
normalized: place_bound(Turn_0_0,Turn_1_2,Turn_0_1,Turn_1_0,Turn_0_2,Turn_1_1)

-> the formula is 2

FORMULA Peterson-COL-2-UpperBounds-8 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestTurn_0_0,TestTurn_2_1,TestTurn_1_0,TestTurn_2_0,TestTurn_0_1,TestTurn_1_1)
normalized: place_bound(TestTurn_0_0,TestTurn_2_1,TestTurn_1_0,TestTurn_2_0,TestTurn_0_1,TestTurn_1_1)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-9 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Turn_0_0,Turn_1_2,Turn_0_1,Turn_1_0,Turn_0_2,Turn_1_1)
normalized: place_bound(Turn_0_0,Turn_1_2,Turn_0_1,Turn_1_0,Turn_0_2,Turn_1_1)

-> the formula is 2

FORMULA Peterson-COL-2-UpperBounds-11 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(WantSection_1_T,WantSection_2_T,WantSection_0_T,WantSection_2_F,WantSection_1_F,WantSection_0_F)
normalized: place_bound(WantSection_1_T,WantSection_2_T,WantSection_0_T,WantSection_2_F,WantSection_1_F,WantSection_0_F)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-12 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Turn_0_0,Turn_1_2,Turn_0_1,Turn_1_0,Turn_0_2,Turn_1_1)
normalized: place_bound(Turn_0_0,Turn_1_2,Turn_0_1,Turn_1_0,Turn_0_2,Turn_1_1)

-> the formula is 2

FORMULA Peterson-COL-2-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(AskForSection_1_1,AskForSection_2_1,AskForSection_2_0,AskForSection_0_1,AskForSection_0_0,AskForSection_1_0)
normalized: place_bound(AskForSection_1_1,AskForSection_2_1,AskForSection_2_0,AskForSection_0_1,AskForSection_0_0,AskForSection_1_0)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestAlone_1_0_0,TestAlone_0_0_1,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_2_1_1,TestAlone_0_1_1,TestAlone_2_0_1,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_1_0_2)
normalized: place_bound(TestAlone_1_0_0,TestAlone_0_0_1,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_2_1_1,TestAlone_0_1_1,TestAlone_2_0_1,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_1_0_2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-5 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestAlone_1_0_0,TestAlone_0_0_1,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_2_1_1,TestAlone_0_1_1,TestAlone_2_0_1,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_1_0_2)
normalized: place_bound(TestAlone_1_0_0,TestAlone_0_0_1,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_2_1_1,TestAlone_0_1_1,TestAlone_2_0_1,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_1_0_2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-10 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(TestAlone_1_0_0,TestAlone_0_0_1,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_2_1_1,TestAlone_0_1_1,TestAlone_2_0_1,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_1_0_2)
normalized: place_bound(TestAlone_1_0_0,TestAlone_0_0_1,TestAlone_2_1_0,TestAlone_1_1_0,TestAlone_2_0_0,TestAlone_0_0_2,TestAlone_2_1_1,TestAlone_0_1_1,TestAlone_2_0_1,TestAlone_1_1_2,TestAlone_0_1_2,TestAlone_1_0_2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(IsEndLoop_0_0_0,IsEndLoop_1_0_0,IsEndLoop_2_0_0,IsEndLoop_0_1_0,IsEndLoop_1_1_0,IsEndLoop_2_1_0,IsEndLoop_0_0_1,IsEndLoop_1_0_1,IsEndLoop_2_0_1,IsEndLoop_0_1_1,IsEndLoop_1_1_1,IsEndLoop_2_1_1,IsEndLoop_0_0_2,IsEndLoop_2_0_2,IsEndLoop_1_0_2,IsEndLoop_1_1_2,IsEndLoop_0_1_2,IsEndLoop_2_1_2)
normalized: place_bound(IsEndLoop_0_0_0,IsEndLoop_1_0_0,IsEndLoop_2_0_0,IsEndLoop_0_1_0,IsEndLoop_1_1_0,IsEndLoop_2_1_0,IsEndLoop_0_0_1,IsEndLoop_1_0_1,IsEndLoop_2_0_1,IsEndLoop_0_1_1,IsEndLoop_1_1_1,IsEndLoop_2_1_1,IsEndLoop_0_0_2,IsEndLoop_2_0_2,IsEndLoop_1_0_2,IsEndLoop_1_1_2,IsEndLoop_0_1_2,IsEndLoop_2_1_2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(IsEndLoop_0_0_0,IsEndLoop_1_0_0,IsEndLoop_2_0_0,IsEndLoop_0_1_0,IsEndLoop_1_1_0,IsEndLoop_2_1_0,IsEndLoop_0_0_1,IsEndLoop_1_0_1,IsEndLoop_2_0_1,IsEndLoop_0_1_1,IsEndLoop_1_1_1,IsEndLoop_2_1_1,IsEndLoop_0_0_2,IsEndLoop_2_0_2,IsEndLoop_1_0_2,IsEndLoop_1_1_2,IsEndLoop_0_1_2,IsEndLoop_2_1_2)
normalized: place_bound(IsEndLoop_0_0_0,IsEndLoop_1_0_0,IsEndLoop_2_0_0,IsEndLoop_0_1_0,IsEndLoop_1_1_0,IsEndLoop_2_1_0,IsEndLoop_0_0_1,IsEndLoop_1_0_1,IsEndLoop_2_0_1,IsEndLoop_0_1_1,IsEndLoop_1_1_1,IsEndLoop_2_1_1,IsEndLoop_0_0_2,IsEndLoop_2_0_2,IsEndLoop_1_0_2,IsEndLoop_1_1_2,IsEndLoop_0_1_2,IsEndLoop_2_1_2)

-> the formula is 3

FORMULA Peterson-COL-2-UpperBounds-2 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 49912(5.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 271423 371212 642635
used/not used/entry size/cache size: 340839 66768025 16 1024MB
basic ops cache: hits/miss/sum: 68246 167901 236147
used/not used/entry size/cache size: 210216 16567000 12 192MB
unary ops cache: hits/miss/sum: 0 28 28
used/not used/entry size/cache size: 28 8388580 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: 1099 1459 2558
used/not used/entry size/cache size: 1459 2095693 32 64MB
max state cache: hits/miss/sum: 8792 11672 20464
used/not used/entry size/cache size: 1459 8387149 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67058970
1 49876
2 18
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.577sec


BK_STOP 1494485411732

--------------------
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:10912 (86), effective:662 (5)

initing FirstDep: 0m 0.000sec

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="Peterson-PT-2"
export BK_EXAMINATION="UpperBounds"
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/Peterson-PT-2.tgz
mv Peterson-PT-2 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 Peterson-PT-2, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r041-smll-149440525400047"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.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 '' UpperBounds.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 ;