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-2270
Executing tool marcie
Input is S_Philosophers-PT-000010, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341204900582
=====================================================================

--------------------
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 Philosophers-COL-000010-ReachabilityComputeBounds-0
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-1
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-10
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-11
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-12
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-13
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-14
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-15
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-2
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-3
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-4
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-5
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-6
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-7
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-8
FORMULA_NAME Philosophers-COL-000010-ReachabilityComputeBounds-9

=== Now, execution of the tool begins

BK_START 1433658263837

Model: S_Philosophers-PT-000010
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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=ReachabilityComputeBounds.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 50 NrTr: 50 NrArc: 160)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m3sec


RS generation: 0m0sec


-> reachability set: #nodes 240 (2.4e+02) #states 59,049 (4)



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

checking: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))
normalized: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-0 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))
normalized: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-1 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))
normalized: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-2 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))
normalized: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-3 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))
normalized: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-4 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Think_10), maxVal(Think_9), maxVal(Think_8), maxVal(Think_7), maxVal(Think_6), maxVal(Think_5), maxVal(Think_4), maxVal(Think_3), maxVal(Think_2), maxVal(Think_1))
normalized: sum(maxVal(Think_10), maxVal(Think_9), maxVal(Think_8), maxVal(Think_7), maxVal(Think_6), maxVal(Think_5), maxVal(Think_4), maxVal(Think_3), maxVal(Think_2), maxVal(Think_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-5 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))
normalized: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-6 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))
normalized: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-7 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Catch1_10), maxVal(Catch1_8), maxVal(Catch1_9), maxVal(Catch1_6), maxVal(Catch1_7), maxVal(Catch1_4), maxVal(Catch1_5), maxVal(Catch1_2), maxVal(Catch1_3), maxVal(Catch1_1))
normalized: sum(maxVal(Catch1_10), maxVal(Catch1_8), maxVal(Catch1_9), maxVal(Catch1_6), maxVal(Catch1_7), maxVal(Catch1_4), maxVal(Catch1_5), maxVal(Catch1_2), maxVal(Catch1_3), maxVal(Catch1_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-8 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Eat_10), maxVal(Eat_6), maxVal(Eat_7), maxVal(Eat_8), maxVal(Eat_9), maxVal(Eat_3), maxVal(Eat_2), maxVal(Eat_5), maxVal(Eat_4), maxVal(Eat_1))
normalized: sum(maxVal(Eat_10), maxVal(Eat_6), maxVal(Eat_7), maxVal(Eat_8), maxVal(Eat_9), maxVal(Eat_3), maxVal(Eat_2), maxVal(Eat_5), maxVal(Eat_4), maxVal(Eat_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-9 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Eat_10), maxVal(Eat_6), maxVal(Eat_7), maxVal(Eat_8), maxVal(Eat_9), maxVal(Eat_3), maxVal(Eat_2), maxVal(Eat_5), maxVal(Eat_4), maxVal(Eat_1))
normalized: sum(maxVal(Eat_10), maxVal(Eat_6), maxVal(Eat_7), maxVal(Eat_8), maxVal(Eat_9), maxVal(Eat_3), maxVal(Eat_2), maxVal(Eat_5), maxVal(Eat_4), maxVal(Eat_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-10 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Catch1_10), maxVal(Catch1_8), maxVal(Catch1_9), maxVal(Catch1_6), maxVal(Catch1_7), maxVal(Catch1_4), maxVal(Catch1_5), maxVal(Catch1_2), maxVal(Catch1_3), maxVal(Catch1_1))
normalized: sum(maxVal(Catch1_10), maxVal(Catch1_8), maxVal(Catch1_9), maxVal(Catch1_6), maxVal(Catch1_7), maxVal(Catch1_4), maxVal(Catch1_5), maxVal(Catch1_2), maxVal(Catch1_3), maxVal(Catch1_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-11 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))
normalized: sum(maxVal(Catch2_9), maxVal(Catch2_8), maxVal(Catch2_10), maxVal(Catch2_5), maxVal(Catch2_4), maxVal(Catch2_7), maxVal(Catch2_6), maxVal(Catch2_1), maxVal(Catch2_3), maxVal(Catch2_2))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-12 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Catch1_10), maxVal(Catch1_8), maxVal(Catch1_9), maxVal(Catch1_6), maxVal(Catch1_7), maxVal(Catch1_4), maxVal(Catch1_5), maxVal(Catch1_2), maxVal(Catch1_3), maxVal(Catch1_1))
normalized: sum(maxVal(Catch1_10), maxVal(Catch1_8), maxVal(Catch1_9), maxVal(Catch1_6), maxVal(Catch1_7), maxVal(Catch1_4), maxVal(Catch1_5), maxVal(Catch1_2), maxVal(Catch1_3), maxVal(Catch1_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-13 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))
normalized: sum(maxVal(Fork_10), maxVal(Fork_8), maxVal(Fork_9), maxVal(Fork_6), maxVal(Fork_7), maxVal(Fork_4), maxVal(Fork_5), maxVal(Fork_3), maxVal(Fork_2), maxVal(Fork_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-14 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Eat_10), maxVal(Eat_6), maxVal(Eat_7), maxVal(Eat_8), maxVal(Eat_9), maxVal(Eat_3), maxVal(Eat_2), maxVal(Eat_5), maxVal(Eat_4), maxVal(Eat_1))
normalized: sum(maxVal(Eat_10), maxVal(Eat_6), maxVal(Eat_7), maxVal(Eat_8), maxVal(Eat_9), maxVal(Eat_3), maxVal(Eat_2), maxVal(Eat_5), maxVal(Eat_4), maxVal(Eat_1))

-> the formula is 10

FORMULA Philosophers-COL-000010-ReachabilityComputeBounds-15 10 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m5sec


BK_STOP 1433658269494

--------------------
content from stderr:

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: 0m0sec


iterations count:263 (5), effective:30 (0)

initing FirstDep: 0m0sec

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="S_Philosophers-PT-000010"
export BK_EXAMINATION="ReachabilityComputeBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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/S_Philosophers-PT-000010.tgz
mv S_Philosophers-PT-000010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_Philosophers-PT-000010, examination is ReachabilityComputeBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r204st-blw3-143341204900582"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityComputeBounds" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityComputeBounds" != "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 "ReachabilityComputeBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityComputeBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityComputeBounds.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 '' ReachabilityComputeBounds.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 ;