About the Execution of MARCIE for QuasiCertifProtocol-PT-02
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
2205.900 | 2214.00 | 2010.00 | 30.30 | 1 3 1 3 9 3 3 3 1 1 9 9 3 3 1 3 | normal |
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-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r051-smll-149440918200245
=====================================================================
--------------------
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 1494685405971
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: QuasiCertifProtocol_PT_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.000sec
init dd package: 0m 1.121sec
RS generation: 0m 0.010sec
-> reachability set: #nodes 900 (9.0e+02) #states 1,029 (3)
starting MCC model checker
--------------------------
checking: place_bound(AstopOK)
normalized: place_bound(AstopOK)
-> 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)
normalized: place_bound(CstopAbort)
-> 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)
normalized: place_bound(a4)
-> 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)
normalized: place_bound(a3)
-> 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)
normalized: place_bound(a4)
-> 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_0,s2_2,s2_1)
normalized: place_bound(s2_0,s2_2,s2_1)
-> 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_0,n2_1,n2_2)
normalized: place_bound(n2_0,n2_1,n2_2)
-> 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_0,n3_1,n3_2)
normalized: place_bound(n3_0,n3_1,n3_2)
-> 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_2,n1_0,n1_1)
normalized: place_bound(n1_2,n1_0,n1_1)
-> 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_1,s3_0,s3_2)
normalized: place_bound(s3_1,s3_0,s3_2)
-> 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_1,Cstart_0,Cstart_2)
normalized: place_bound(Cstart_1,Cstart_0,Cstart_2)
-> 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_1,Cstart_0,Cstart_2)
normalized: place_bound(Cstart_1,Cstart_0,Cstart_2)
-> 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_1,Sstart_0,Sstart_2)
normalized: place_bound(Sstart_1,Sstart_0,Sstart_2)
-> 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_1_0,n7_2_0,n7_0_0,n7_0_2,n7_2_1,n7_1_1,n7_0_1,n7_2_2,n7_1_2)
normalized: place_bound(n7_1_0,n7_2_0,n7_0_0,n7_0_2,n7_2_1,n7_1_1,n7_0_1,n7_2_2,n7_1_2)
-> 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_2_0,n8_1_0,n8_0_0,n8_0_2,n8_2_1,n8_1_1,n8_0_1,n8_1_2,n8_2_2)
normalized: place_bound(n8_2_0,n8_1_0,n8_0_0,n8_0_2,n8_2_1,n8_1_1,n8_0_1,n8_1_2,n8_2_2)
-> 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_2_0,n8_1_0,n8_0_0,n8_0_2,n8_2_1,n8_1_1,n8_0_1,n8_1_2,n8_2_2)
normalized: place_bound(n8_2_0,n8_1_0,n8_0_0,n8_0_2,n8_2_1,n8_1_1,n8_0_1,n8_1_2,n8_2_2)
-> 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: 4138(4.1e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 4653 26023 30676
used/not used/entry size/cache size: 22736 67086128 16 1024MB
basic ops cache: hits/miss/sum: 1434 7133 8567
used/not used/entry size/cache size: 10234 16766982 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 67104726
1 4138
2 0
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 2.180sec
BK_STOP 1494685408185
--------------------
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.001sec
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-PT-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-PT-02.tgz
mv QuasiCertifProtocol-PT-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-PT-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-149440918200245"
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 '
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 ;