fond
Model Checking Contest @ Petri Nets 2016
6th edition, Toruń, Poland, June 21, 2016
Execution of r053kn-smll-146358767700038
Last Updated
June 30, 2016

About the Execution of Marcie for Eratosthenes-PT-200

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5418.750 6492.00 5905.00 162.90 1 1 1 1 1 1 1 1 1 1 1 1 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 Eratosthenes-PT-200, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r053kn-smll-146358767700038
=====================================================================


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

=== Now, execution of the tool begins

BK_START 1463598166466


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: Eratosthenes_PT_200
(NrP: 199 NrTr: 699 NrArc: 2097)

net check time: 0m 0.000sec

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

init dd package: 0m 4.311sec


RS generation: 0m 0.390sec


-> reachability set: #nodes 199 (2.0e+02) #states 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)



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

checking: place_bound(p39)
normalized: place_bound(p39)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-0 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p133)
normalized: place_bound(p133)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-1 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p133)
normalized: place_bound(p133)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p88)
normalized: place_bound(p88)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p61)
normalized: place_bound(p61)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p73)
normalized: place_bound(p73)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p141)
normalized: place_bound(p141)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p151)
normalized: place_bound(p151)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p56)
normalized: place_bound(p56)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-8 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p70)
normalized: place_bound(p70)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p124)
normalized: place_bound(p124)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-10 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p137)
normalized: place_bound(p137)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p169)
normalized: place_bound(p169)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-12 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p119)
normalized: place_bound(p119)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p75)
normalized: place_bound(p75)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-14 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(p132)
normalized: place_bound(p132)

-> the formula is 1

FORMULA Eratosthenes-PT-200-UpperBounds-15 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec


Total processing time: 0m 6.457sec


BK_STOP 1463598172958

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p181
p103
p163
p109
p193
p167
p173
p113
p197
p127
p107
p157
p101
p131
p191
p137
p151
p139
p179
p149
p199

The net has transition(s) that can never fire:


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

199 199 199 199 199 199 199 199 199 199 199
iterations count:11732 (16), effective:153 (0)

initing FirstDep: 0m 0.002sec

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="Eratosthenes-PT-200"
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/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 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 Eratosthenes-PT-200, 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 r053kn-smll-146358767700038"
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 ;