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 GPPP-PT-C0001N0000001000, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468027600461
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465034008172


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: GPPP_PT_C0001N0000001000
(NrP: 33 NrTr: 22 NrArc: 83)

net check time: 0m 0.000sec

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

init dd package: 0m 3.956sec


RS generation: 0m10.765sec


-> reachability set: #nodes 4058 (4.1e+03) #states 14,353,505,166 (10)



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

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

-> the formula is 2

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-0 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(NADPplus)
normalized: place_bound(NADPplus)

-> the formula is 2000

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-1 2000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(b1)
normalized: place_bound(b1)

-> the formula is 3

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-2 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ADP)
normalized: place_bound(ADP)

-> the formula is 14

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-3 14 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(NADH)
normalized: place_bound(NADH)

-> the formula is 7

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-4 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(b1)
normalized: place_bound(b1)

-> the formula is 3

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-5 3 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Pyr)
normalized: place_bound(Pyr)

-> the formula is 7

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-6 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Lac)
normalized: place_bound(Lac)

-> the formula is 7

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-7 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(a2)
normalized: place_bound(a2)

-> the formula is 2

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-8 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

-> the formula is 2

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-9 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ADP)
normalized: place_bound(ADP)

-> the formula is 14

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-10 14 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(GSH)
normalized: place_bound(GSH)

-> the formula is 2000

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-11 2000 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(PEP)
normalized: place_bound(PEP)

-> the formula is 7

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-12 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Gluc)
normalized: place_bound(Gluc)

-> the formula is 4

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-13 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(Lac)
normalized: place_bound(Lac)

-> the formula is 7

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-14 7 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(ATP)
normalized: place_bound(ATP)

-> the formula is 4007

FORMULA GPPP-PT-C0001N0000001000-UpperBounds-15 4007 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m16.156sec


BK_STOP 1465034024383

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

1092 1181 1384 1145 1128 1217 1330 1177 1171 1200 1224 1216 1226 1295 1313 1236 1299 1267 1304 1283 1332 1306 1328 1322 1372 1333 1375 1360 1406 1376 1411 1391 1424 1440 1448 1434 1553 1721 1487 1470 1503 1527 1519 1513 1542 1567 1546 1568 1587 1655 1578 1640 1609 1646 1625 1649 1636 1711 1664 1732 1675 1719 1694 1752 1718 1753 1733 1766 1782 1790 1776 1853 1956 1829 1816 1845 1869 1861 1858 1877 2003 1888 1910 1929 1997 1920 1973 1951 1988 1967 1991 1978 2132 2006 2072 2021 2058 2036 2069 2060 2093 2079 7126 7145 7138 7197 7209 7204 7212 7255 7276 7284 7320 7349 7355 7355 7371 7434 7427 7427 7574 7489 7479 7501 7570 7651 7566 7737 7657 7630 7636 7653 7711 7765 7709 7811 7769 7769 7783 7847 7888 7834 7893 7906 7912 7908 7955 7972 8000 8016 8045 8051 8051 8060 8104
iterations count:155740 (7079), effective:36555 (1661)

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="GPPP-PT-C0001N0000001000"
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/GPPP-PT-C0001N0000001000.tgz
mv GPPP-PT-C0001N0000001000 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 GPPP-PT-C0001N0000001000, 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 r221su-smll-146468027600461"
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 ;