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-2979
Executing tool marcie
Input is QuasiCertifProtocol-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369143600083
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463717009923


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: QuasiCertifProtocol_PT_06
(NrP: 270 NrTr: 116 NrArc: 659)

net check time: 0m 0.000sec

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

init dd package: 0m 4.132sec


RS generation: 0m19.524sec


-> reachability set: #nodes 197623 (2.0e+05) #states 2,271,960 (6)



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

checking: place_bound(a1)
normalized: place_bound(a1)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a5)
normalized: place_bound(a5)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n2_6,n2_5,n2_4,n2_3,n2_2,n2_1,n2_0)
normalized: place_bound(n2_6,n2_5,n2_4,n2_3,n2_2,n2_1,n2_0)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-0 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c1_0,c1_1,c1_2,c1_3,c1_4,c1_5,c1_6)
normalized: place_bound(c1_0,c1_1,c1_2,c1_3,c1_4,c1_5,c1_6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-2 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s3_0,s3_1,s3_4,s3_5,s3_2,s3_3,s3_6)
normalized: place_bound(s3_0,s3_1,s3_4,s3_5,s3_2,s3_3,s3_6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-3 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n4_5,n4_6,n4_3,n4_4,n4_1,n4_2,n4_0)
normalized: place_bound(n4_5,n4_6,n4_3,n4_4,n4_1,n4_2,n4_0)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-5 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n2_6,n2_5,n2_4,n2_3,n2_2,n2_1,n2_0)
normalized: place_bound(n2_6,n2_5,n2_4,n2_3,n2_2,n2_1,n2_0)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-6 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s2_1,s2_2,s2_0,s2_5,s2_6,s2_3,s2_4)
normalized: place_bound(s2_1,s2_2,s2_0,s2_5,s2_6,s2_3,s2_4)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-8 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s5_1,s5_0,s5_3,s5_2,s5_5,s5_4,s5_6)
normalized: place_bound(s5_1,s5_0,s5_3,s5_2,s5_5,s5_4,s5_6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-9 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s4_0,s4_2,s4_1,s4_4,s4_3,s4_5,s4_6)
normalized: place_bound(s4_0,s4_2,s4_1,s4_4,s4_3,s4_5,s4_6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-10 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s2_1,s2_2,s2_0,s2_5,s2_6,s2_3,s2_4)
normalized: place_bound(s2_1,s2_2,s2_0,s2_5,s2_6,s2_3,s2_4)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-11 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(CstopOK_0,CstopOK_1,CstopOK_6,CstopOK_5,CstopOK_4,CstopOK_3,CstopOK_2)
normalized: place_bound(CstopOK_0,CstopOK_1,CstopOK_6,CstopOK_5,CstopOK_4,CstopOK_3,CstopOK_2)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(SstopOK_2,SstopOK_3,SstopOK_0,SstopOK_1,SstopOK_6,SstopOK_4,SstopOK_5)
normalized: place_bound(SstopOK_2,SstopOK_3,SstopOK_0,SstopOK_1,SstopOK_6,SstopOK_4,SstopOK_5)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-14 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n5_4,n5_5,n5_2,n5_3,n5_0,n5_1,n5_6)
normalized: place_bound(n5_4,n5_5,n5_2,n5_3,n5_0,n5_1,n5_6)

-> the formula is 7

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-15 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n9_2_0,n9_1_0,n9_0_0,n9_0_1,n9_1_1,n9_2_1,n9_3_1,n9_3_0,n9_4_0,n9_5_0,n9_6_0,n9_1_2,n9_2_2,n9_3_2,n9_4_2,n9_4_1,n9_5_1,n9_6_1,n9_0_2,n9_3_3,n9_2_3,n9_5_3,n9_4_3,n9_6_2,n9_5_2,n9_1_3,n9_0_3,n9_4_4,n9_3_4,n9_6_4,n9_5_4,n9_0_4,n9_6_3,n9_2_4,n9_1_4,n9_6_5,n9_0_6,n9_4_5,n9_5_5,n9_2_5,n9_3_5,n9_0_5,n9_1_5,n9_5_6,n9_6_6,n9_3_6,n9_4_6,n9_1_6,n9_2_6)
normalized: place_bound(n9_2_0,n9_1_0,n9_0_0,n9_0_1,n9_1_1,n9_2_1,n9_3_1,n9_3_0,n9_4_0,n9_5_0,n9_6_0,n9_1_2,n9_2_2,n9_3_2,n9_4_2,n9_4_1,n9_5_1,n9_6_1,n9_0_2,n9_3_3,n9_2_3,n9_5_3,n9_4_3,n9_6_2,n9_5_2,n9_1_3,n9_0_3,n9_4_4,n9_3_4,n9_6_4,n9_5_4,n9_0_4,n9_6_3,n9_2_4,n9_1_4,n9_6_5,n9_0_6,n9_4_5,n9_5_5,n9_2_5,n9_3_5,n9_0_5,n9_1_5,n9_5_6,n9_6_6,n9_3_6,n9_4_6,n9_1_6,n9_2_6)

-> the formula is 49

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-1 49 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n7_2_0,n7_1_0,n7_0_0,n7_3_1,n7_2_1,n7_1_1,n7_0_1,n7_6_0,n7_5_0,n7_4_0,n7_3_0,n7_6_2,n7_5_2,n7_1_3,n7_0_3,n7_3_3,n7_2_3,n7_5_3,n7_4_3,n7_5_1,n7_4_1,n7_0_2,n7_6_1,n7_2_2,n7_1_2,n7_4_2,n7_3_2,n7_0_5,n7_1_5,n7_2_5,n7_3_5,n7_4_5,n7_5_5,n7_6_5,n7_0_6,n7_6_3,n7_0_4,n7_1_4,n7_2_4,n7_3_4,n7_4_4,n7_5_4,n7_6_4,n7_4_6,n7_3_6,n7_2_6,n7_1_6,n7_6_6,n7_5_6)
normalized: place_bound(n7_2_0,n7_1_0,n7_0_0,n7_3_1,n7_2_1,n7_1_1,n7_0_1,n7_6_0,n7_5_0,n7_4_0,n7_3_0,n7_6_2,n7_5_2,n7_1_3,n7_0_3,n7_3_3,n7_2_3,n7_5_3,n7_4_3,n7_5_1,n7_4_1,n7_0_2,n7_6_1,n7_2_2,n7_1_2,n7_4_2,n7_3_2,n7_0_5,n7_1_5,n7_2_5,n7_3_5,n7_4_5,n7_5_5,n7_6_5,n7_0_6,n7_6_3,n7_0_4,n7_1_4,n7_2_4,n7_3_4,n7_4_4,n7_5_4,n7_6_4,n7_4_6,n7_3_6,n7_2_6,n7_1_6,n7_6_6,n7_5_6)

-> the formula is 49

FORMULA QuasiCertifProtocol-COL-06-UpperBounds-13 49 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m38.150sec


BK_STOP 1463717048129

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

check for maximal unmarked siphon
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

82674 100914 117263 197623
iterations count:4059 (34), effective:116 (1)

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="QuasiCertifProtocol-PT-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/QuasiCertifProtocol-PT-06.tgz
mv QuasiCertifProtocol-PT-06 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is QuasiCertifProtocol-PT-06, 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 r101kn-smll-146369143600083"
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 ;