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 PermAdmissibility-PT-01, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440474100398
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494467110049

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: PermAdmissibility_PT_01
(NrP: 168 NrTr: 592 NrArc: 3456)

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

net check time: 0m 0.001sec

init dd package: 0m 1.093sec

parse successfull
net created successfully

Net: PermAdmissibility_PT_01
(NrP: 168 NrTr: 592 NrArc: 3456)

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

net check time: 0m 0.000sec

init dd package: 0m 3.436sec


RS generation: 0m28.916sec


-> reachability set: #nodes 57487 (5.7e+04) #states 52,537 (4)



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

checking: place_bound(c16)
normalized: place_bound(c16)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-2 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c15)
normalized: place_bound(c15)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-3 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c8)
normalized: place_bound(c8)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-5 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c110)
normalized: place_bound(c110)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-6 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(c110)
normalized: place_bound(c110)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-7 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(in2_2,in2_3)
normalized: place_bound(in2_2,in2_3)

-> the formula is 2

FORMULA PermAdmissibility-COL-01-UpperBounds-0 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(in1_1,in1_0)
normalized: place_bound(in1_1,in1_0)

-> the formula is 2

FORMULA PermAdmissibility-COL-01-UpperBounds-1 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(in4_6,in4_7)
normalized: place_bound(in4_6,in4_7)

-> the formula is 2

FORMULA PermAdmissibility-COL-01-UpperBounds-8 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(aux7_7,aux7_6,aux7_3,aux7_2)
normalized: place_bound(aux7_7,aux7_6,aux7_3,aux7_2)

-> the formula is 2

FORMULA PermAdmissibility-COL-01-UpperBounds-12 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(aux6_0,aux6_5,aux6_1,aux6_4)
normalized: place_bound(aux6_0,aux6_5,aux6_1,aux6_4)

-> the formula is 2

FORMULA PermAdmissibility-COL-01-UpperBounds-15 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(out2_0,out2_7,out2_5,out2_6,out2_3,out2_4,out2_1,out2_2)
normalized: place_bound(out2_0,out2_7,out2_5,out2_6,out2_3,out2_4,out2_1,out2_2)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-4 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(out2_0,out2_7,out2_5,out2_6,out2_3,out2_4,out2_1,out2_2)
normalized: place_bound(out2_0,out2_7,out2_5,out2_6,out2_3,out2_4,out2_1,out2_2)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-9 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(aux12_6,aux12_5,aux12_4,aux12_3,aux12_2,aux12_1,aux12_0,aux12_7)
normalized: place_bound(aux12_6,aux12_5,aux12_4,aux12_3,aux12_2,aux12_1,aux12_0,aux12_7)

-> the formula is 2

FORMULA PermAdmissibility-COL-01-UpperBounds-10 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(out4_0,out4_1,out4_7,out4_6,out4_3,out4_2,out4_5,out4_4)
normalized: place_bound(out4_0,out4_1,out4_7,out4_6,out4_3,out4_2,out4_5,out4_4)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-11 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(out7_1,out7_0,out7_3,out7_2,out7_5,out7_4,out7_7,out7_6)
normalized: place_bound(out7_1,out7_0,out7_3,out7_2,out7_5,out7_4,out7_7,out7_6)

-> the formula is 1

FORMULA PermAdmissibility-COL-01-UpperBounds-13 1 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: place_bound(aux12_6,aux12_5,aux12_4,aux12_3,aux12_2,aux12_1,aux12_0,aux12_7)
normalized: place_bound(aux12_6,aux12_5,aux12_4,aux12_3,aux12_2,aux12_1,aux12_0,aux12_7)

-> the formula is 2

FORMULA PermAdmissibility-COL-01-UpperBounds-14 2 TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

totally nodes used: 366916 (3.7e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 6901711 61339254 68240965
used/not used/entry size/cache size: 40364092 26744772 16 1024MB
basic ops cache: hits/miss/sum: 0 14028 14028
used/not used/entry size/cache size: 41858 16735358 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 9063 57487 66550
used/not used/entry size/cache size: 57362 8331246 32 256MB
max state cache: hits/miss/sum: 81567 517383 598950
used/not used/entry size/cache size: 57362 8331246 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66784374
1 285785
2 35232
3 3229
4 240
5 4
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m35.922sec


BK_STOP 1494467146057

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

ptnet_zbdd.cc:66: Boundedness exception: net maybe not 1-bounded!

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

6024 13526 21978 25981 29790 45194
iterations count:624986 (1055), effective:3528 (5)

initing FirstDep: 0m 0.001sec

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="PermAdmissibility-PT-01"
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/PermAdmissibility-PT-01.tgz
mv PermAdmissibility-PT-01 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 PermAdmissibility-PT-01, 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 r031-blw7-149440474100398"
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 ;