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_PhilosophersDyn-PT-03, examination is ReachabilityComputeBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r204st-blw3-143341205100777
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433671246596

Model: S_PhilosophersDyn-PT-03
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: 30 NrTr: 84 NrArc: 564)

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 442 (4.4e+02) #states 325



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

checking: sum(maxVal(HasRight_3), maxVal(HasRight_1), maxVal(HasRight_2))
normalized: sum(maxVal(HasRight_3), maxVal(HasRight_1), maxVal(HasRight_2))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-0 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(WaitRight_3), maxVal(WaitRight_2), maxVal(WaitRight_1))
normalized: sum(maxVal(WaitRight_3), maxVal(WaitRight_2), maxVal(WaitRight_1))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Forks_3), maxVal(Forks_2), maxVal(Forks_1))
normalized: sum(maxVal(Forks_3), maxVal(Forks_2), maxVal(Forks_1))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-2 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))
normalized: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))

-> the formula is 9

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-3 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(WaitLeft_1), maxVal(WaitLeft_3), maxVal(WaitLeft_2))
normalized: sum(maxVal(WaitLeft_1), maxVal(WaitLeft_3), maxVal(WaitLeft_2))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-4 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))
normalized: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))

-> the formula is 9

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-5 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(WaitLeft_1), maxVal(WaitLeft_3), maxVal(WaitLeft_2))
normalized: sum(maxVal(WaitLeft_1), maxVal(WaitLeft_3), maxVal(WaitLeft_2))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-6 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))
normalized: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))

-> the formula is 9

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-7 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(HasLeft_1), maxVal(HasLeft_3), maxVal(HasLeft_2))
normalized: sum(maxVal(HasLeft_1), maxVal(HasLeft_3), maxVal(HasLeft_2))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-8 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))
normalized: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))

-> the formula is 9

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-9 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))
normalized: sum(maxVal(Neighbourhood_3_1), maxVal(Neighbourhood_3_2), maxVal(Neighbourhood_1_3), maxVal(Neighbourhood_2_1), maxVal(Neighbourhood_2_3), maxVal(Neighbourhood_1_1), maxVal(Neighbourhood_3_3), maxVal(Neighbourhood_2_2), maxVal(Neighbourhood_1_2))

-> the formula is 9

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-10 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Outside_1), maxVal(Outside_2), maxVal(Outside_3))
normalized: sum(maxVal(Outside_1), maxVal(Outside_2), maxVal(Outside_3))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-11 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(Forks_3), maxVal(Forks_2), maxVal(Forks_1))
normalized: sum(maxVal(Forks_3), maxVal(Forks_2), maxVal(Forks_1))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-12 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(WaitLeft_1), maxVal(WaitLeft_3), maxVal(WaitLeft_2))
normalized: sum(maxVal(WaitLeft_1), maxVal(WaitLeft_3), maxVal(WaitLeft_2))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(HasLeft_1), maxVal(HasLeft_3), maxVal(HasLeft_2))
normalized: sum(maxVal(HasLeft_1), maxVal(HasLeft_3), maxVal(HasLeft_2))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-14 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: sum(maxVal(HasLeft_1), maxVal(HasLeft_3), maxVal(HasLeft_2))
normalized: sum(maxVal(HasLeft_1), maxVal(HasLeft_3), maxVal(HasLeft_2))

-> the formula is 3

FORMULA PhilosophersDyn-COL-03-ReachabilityComputeBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433671250826

--------------------
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

293
iterations count:1652 (19), effective:60 (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_PhilosophersDyn-PT-03"
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_PhilosophersDyn-PT-03.tgz
mv S_PhilosophersDyn-PT-03 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_PhilosophersDyn-PT-03, 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-143341205100777"
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 ;