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 QuasiCertifProtocol-COL-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r051-smll-149440918100191
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494664552909

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

Unfolding complete |P|=86|T|=56|A|=223
Time for unfolding: 0m 2.255sec

Net: QuasiCertifProtocol_COL_02
(NrP: 86 NrTr: 56 NrArc: 223)

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

net check time: 0m 0.002sec

init dd package: 0m 1.215sec


RS generation: 0m 0.006sec


-> reachability set: #nodes 900 (9.0e+02) #states 1,029 (3)



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

checking: place_bound(AstopOK_dot)
normalized: place_bound(AstopOK_dot)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(CstopAbort_dot)
normalized: place_bound(CstopAbort_dot)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a4_dot)
normalized: place_bound(a4_dot)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a3_dot)
normalized: place_bound(a3_dot)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a4_dot)
normalized: place_bound(a4_dot)

-> the formula is 1

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s2_tsid0,s2_tsid1,s2_tsid2)
normalized: place_bound(s2_tsid0,s2_tsid1,s2_tsid2)

-> the formula is 3

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-1 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n2_tsid0,n2_tsid1,n2_tsid2)
normalized: place_bound(n2_tsid0,n2_tsid1,n2_tsid2)

-> the formula is 3

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-6 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n3_tsid0,n3_tsid1,n3_tsid2)
normalized: place_bound(n3_tsid0,n3_tsid1,n3_tsid2)

-> the formula is 3

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

MC time: 0m 0.000sec

checking: place_bound(n1_tsid0,n1_tsid1,n1_tsid2)
normalized: place_bound(n1_tsid0,n1_tsid1,n1_tsid2)

-> the formula is 3

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-9 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(s3_tsid0,s3_tsid1,s3_tsid2)
normalized: place_bound(s3_tsid0,s3_tsid1,s3_tsid2)

-> the formula is 3

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-11 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Cstart_tsid0,Cstart_tsid1,Cstart_tsid2)
normalized: place_bound(Cstart_tsid0,Cstart_tsid1,Cstart_tsid2)

-> the formula is 3

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-13 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Cstart_tsid0,Cstart_tsid1,Cstart_tsid2)
normalized: place_bound(Cstart_tsid0,Cstart_tsid1,Cstart_tsid2)

-> the formula is 3

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-14 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Sstart_tsid0,Sstart_tsid1,Sstart_tsid2)
normalized: place_bound(Sstart_tsid0,Sstart_tsid1,Sstart_tsid2)

-> the formula is 3

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-15 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n7_tsid0_tsid0,n7_tsid0_tsid1,n7_tsid0_tsid2,n7_tsid1_tsid0,n7_tsid1_tsid1,n7_tsid1_tsid2,n7_tsid2_tsid0,n7_tsid2_tsid1,n7_tsid2_tsid2)
normalized: place_bound(n7_tsid0_tsid0,n7_tsid0_tsid1,n7_tsid0_tsid2,n7_tsid1_tsid0,n7_tsid1_tsid1,n7_tsid1_tsid2,n7_tsid2_tsid0,n7_tsid2_tsid1,n7_tsid2_tsid2)

-> the formula is 9

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-4 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n8_tsid0_tsid0,n8_tsid0_tsid1,n8_tsid0_tsid2,n8_tsid1_tsid0,n8_tsid1_tsid1,n8_tsid1_tsid2,n8_tsid2_tsid0,n8_tsid2_tsid1,n8_tsid2_tsid2)
normalized: place_bound(n8_tsid0_tsid0,n8_tsid0_tsid1,n8_tsid0_tsid2,n8_tsid1_tsid0,n8_tsid1_tsid1,n8_tsid1_tsid2,n8_tsid2_tsid0,n8_tsid2_tsid1,n8_tsid2_tsid2)

-> the formula is 9

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-5 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(n8_tsid0_tsid0,n8_tsid0_tsid1,n8_tsid0_tsid2,n8_tsid1_tsid0,n8_tsid1_tsid1,n8_tsid1_tsid2,n8_tsid2_tsid0,n8_tsid2_tsid1,n8_tsid2_tsid2)
normalized: place_bound(n8_tsid0_tsid0,n8_tsid0_tsid1,n8_tsid0_tsid2,n8_tsid1_tsid0,n8_tsid1_tsid1,n8_tsid1_tsid2,n8_tsid2_tsid0,n8_tsid2_tsid1,n8_tsid2_tsid2)

-> the formula is 9

FORMULA QuasiCertifProtocol-COL-02-UpperBounds-12 9 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 4250(4.2e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4631 26128 30759
used/not used/entry size/cache size: 23024 67085840 16 1024MB
basic ops cache: hits/miss/sum: 1439 7378 8817
used/not used/entry size/cache size: 10518 16766698 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: 284 900 1184
used/not used/entry size/cache size: 900 2096252 32 64MB
max state cache: hits/miss/sum: 2556 8100 10656
used/not used/entry size/cache size: 900 8387708 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67104614
1 4250
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.524sec


BK_STOP 1494664557467

--------------------
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.002sec


iterations count:899 (16), effective:56 (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-COL-02"
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/QuasiCertifProtocol-COL-02.tgz
mv QuasiCertifProtocol-COL-02 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 QuasiCertifProtocol-COL-02, 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 r051-smll-149440918100191"
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 ;