About the Execution of Marcie for TriangularGrid-PT-3011
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5543.260 | 13992.00 | 14010.00 | 141.40 | 1 1 1 4 1 1 1 4 1 1 1 4 1 1 1 1 | 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-2979
Executing tool marcie
Input is TriangularGrid-PT-3011, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468028400758
=====================================================================
--------------------
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 TriangularGrid-PT-3011-UpperBounds-0
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-1
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-10
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-11
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-12
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-13
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-14
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-15
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-2
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-3
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-4
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-5
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-6
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-7
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-8
FORMULA_NAME TriangularGrid-PT-3011-UpperBounds-9
=== Now, execution of the tool begins
BK_START 1465162494663
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: TriangularGrid_PT_3011
(NrP: 108 NrTr: 90 NrArc: 360)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
init dd package: 0m 3.679sec
RS generation: 0m 8.214sec
-> reachability set: #nodes 6882 (6.9e+03) #states 284,675,587,524,871,889,466 (20)
starting MCC model checker
--------------------------
checking: place_bound(pil2_3_5)
normalized: place_bound(pil2_3_5)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pi3_2_3)
normalized: place_bound(pi3_2_3)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(po1_3_3)
normalized: place_bound(po1_3_3)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pol1_3_3)
normalized: place_bound(pol1_3_3)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pil1_3_5)
normalized: place_bound(pil1_3_5)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pb2_2_3)
normalized: place_bound(pb2_2_3)
-> the formula is 4
FORMULA TriangularGrid-PT-3011-UpperBounds-5 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pil1_1_1)
normalized: place_bound(pil1_1_1)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pil2_3_5)
normalized: place_bound(pil2_3_5)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pol2_3_1)
normalized: place_bound(pol2_3_1)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(po1_3_3)
normalized: place_bound(po1_3_3)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pi2_2_1)
normalized: place_bound(pi2_2_1)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pb3_3_3)
normalized: place_bound(pb3_3_3)
-> the formula is 4
FORMULA TriangularGrid-PT-3011-UpperBounds-11 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pi2_1_1)
normalized: place_bound(pi2_1_1)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(po3_2_3)
normalized: place_bound(po3_2_3)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(po3_3_5)
normalized: place_bound(po3_3_5)
-> the formula is 1
FORMULA TriangularGrid-PT-3011-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: place_bound(pb2_3_2)
normalized: place_bound(pb2_3_2)
-> the formula is 4
FORMULA TriangularGrid-PT-3011-UpperBounds-15 4 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
Total processing time: 0m13.953sec
BK_STOP 1465162508655
--------------------
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.001sec
1196 1057 2104 2827 3809 4377 3534 3004 3203 3438 4753 4454 6291 5194 5432 4838 4592 5585 6612 6070 4936 5308 3453 5694 5271 5918 9238 9579 8332 8825 6769 5940 5543 6881 5557 6687 8039 7537 7905 6461 6047 7209 7626 6169 6200 6312 6306 9009 7201 8785 7095 6617 6743 8000 7296 6949 9089 8041 9231 7768 7646 8189 6932 6737 6702 6859 6888 6675 7653 10027 9751 9711 9630 8421 8087 8932 8460 8520 7008
iterations count:79085 (878), effective:12928 (143)
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="TriangularGrid-PT-3011"
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/TriangularGrid-PT-3011.tgz
mv TriangularGrid-PT-3011 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 TriangularGrid-PT-3011, 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-146468028400758"
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 ;