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 ResAllocation-PT-R015C002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369144000367
=====================================================================

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-0
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-1
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-10
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-11
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-12
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-13
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-14
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-15
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-2
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-3
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-4
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-5
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-6
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-7
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-8
FORMULA_NAME ResAllocation-PT-R015C002-ReachabilityCardinality-9

=== Now, execution of the tool begins

BK_START 1463779465071


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=ReachabilityCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: ResAllocation_PT_R015C002
(NrP: 60 NrTr: 32 NrArc: 150)

net check time: 0m 0.000sec

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

init dd package: 0m 4.109sec


RS generation: 0m 0.018sec


-> reachability set: #nodes 171 (1.7e+02) #states 278,528 (5)



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

checking: EF [2<=r_1_13]
normalized: E [true U 2<=r_1_13]

abstracting: (2<=r_1_13) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=p_0_9]
normalized: E [true U 2<=p_0_9]

abstracting: (2<=p_0_9) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=r_1_2]
normalized: E [true U 3<=r_1_2]

abstracting: (3<=r_1_2) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [3<=p_1_3]
normalized: E [true U 3<=p_1_3]

abstracting: (3<=p_1_3) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [2<=r_0_6]
normalized: E [true U 2<=r_0_6]

abstracting: (2<=r_0_6) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [[r_0_6<=r_0_0 | p_0_6<=p_1_13]]]]
normalized: ~ [E [true U ~ [[r_0_6<=r_0_0 | p_0_6<=p_1_13]]]]

abstracting: (p_0_6<=p_1_13) states: 229,376 (5)
abstracting: (r_0_6<=r_0_0) states: 208,896 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[1<=r_1_14 & [3<=r_1_8 & r_0_3<=r_1_1]]]]
normalized: ~ [E [true U [1<=r_1_14 & [3<=r_1_8 & r_0_3<=r_1_1]]]]

abstracting: (r_0_3<=r_1_1) states: 266,240 (5)
abstracting: (3<=r_1_8) states: 0
abstracting: (1<=r_1_14) states: 147,456 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [[[2<=p_0_13 & p_1_9<=r_1_12] | ~ [2<=p_1_5]]]]
normalized: E [true U ~ [[~ [2<=p_1_5] | [2<=p_0_13 & p_1_9<=r_1_12]]]]

abstracting: (p_1_9<=r_1_12) states: 233,472 (5)
abstracting: (2<=p_0_13) states: 0
abstracting: (2<=p_1_5) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[r_1_3<=p_1_12 | 1<=p_0_0] & [1<=r_1_3 & 3<=p_0_1]]]]
normalized: ~ [E [true U [[r_1_3<=p_1_12 | 1<=p_0_0] & [1<=r_1_3 & 3<=p_0_1]]]]

abstracting: (3<=p_0_1) states: 0
abstracting: (1<=r_1_3) states: 237,568 (5)
abstracting: (1<=p_0_0) states: 131,072 (5)
abstracting: (r_1_3<=p_1_12) states: 135,168 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[~ [1<=r_1_8] | ~ [3<=p_0_9]] | [~ [2<=p_1_7] | ~ [p_1_4<=p_0_12]]]]
normalized: ~ [E [true U ~ [[[~ [p_1_4<=p_0_12] | ~ [2<=p_1_7]] | [~ [3<=p_0_9] | ~ [1<=r_1_8]]]]]]

abstracting: (1<=r_1_8) states: 196,608 (5)
abstracting: (3<=p_0_9) states: 0
abstracting: (2<=p_1_7) states: 0
abstracting: (p_1_4<=p_0_12) states: 229,376 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[3<=r_1_5 & [[2<=p_1_9 & r_0_9<=p_1_5] | 3<=r_0_7]]]
normalized: E [true U [3<=r_1_5 & [3<=r_0_7 | [2<=p_1_9 & r_0_9<=p_1_5]]]]

abstracting: (r_0_9<=p_1_5) states: 176,128 (5)
abstracting: (2<=p_1_9) states: 0
abstracting: (3<=r_0_7) states: 0
abstracting: (3<=r_1_5) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[[r_1_1<=r_1_10 & 2<=r_0_8] & [2<=p_0_1 | r_1_5<=r_1_0]]]]
normalized: ~ [E [true U [[r_1_1<=r_1_10 & 2<=r_0_8] & [2<=p_0_1 | r_1_5<=r_1_0]]]]

abstracting: (r_1_5<=r_1_0) states: 270,336 (5)
abstracting: (2<=p_0_1) states: 0
abstracting: (2<=r_0_8) states: 0
abstracting: (r_1_1<=r_1_10) states: 192,512 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[p_0_1<=r_0_4 & [[2<=p_1_12 | 2<=r_1_10] & r_0_12<=p_0_2]]]
normalized: E [true U [p_0_1<=r_0_4 & [r_0_12<=p_0_2 & [2<=p_1_12 | 2<=r_1_10]]]]

abstracting: (2<=r_1_10) states: 0
abstracting: (2<=p_1_12) states: 0
abstracting: (r_0_12<=p_0_2) states: 200,704 (5)
abstracting: (p_0_1<=r_0_4) states: 212,992 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[1<=r_0_11 & [[2<=p_1_0 & p_0_6<=p_1_7] & ~ [p_0_6<=p_1_12]]]]
normalized: E [true U [1<=r_0_11 & [[2<=p_1_0 & p_0_6<=p_1_7] & ~ [p_0_6<=p_1_12]]]]

abstracting: (p_0_6<=p_1_12) states: 225,280 (5)
abstracting: (p_0_6<=p_1_7) states: 204,800 (5)
abstracting: (2<=p_1_0) states: 0
abstracting: (1<=r_0_11) states: 131,072 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [~ [3<=r_0_7]] & [r_1_4<=p_0_3 & [p_0_0<=p_0_5 | p_0_7<=r_0_14]]]]
normalized: E [true U [3<=r_0_7 & [r_1_4<=p_0_3 & [p_0_0<=p_0_5 | p_0_7<=r_0_14]]]]

abstracting: (p_0_7<=r_0_14) states: 237,568 (5)
abstracting: (p_0_0<=p_0_5) states: 192,512 (5)
abstracting: (r_1_4<=p_0_3) states: 147,456 (5)
abstracting: (3<=r_0_7) states: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[3<=r_1_8 & 1<=r_0_7]] | [[1<=p_1_10 & r_0_7<=r_0_3] & ~ [p_1_9<=p_0_9]]]]
normalized: ~ [E [true U ~ [[[~ [p_1_9<=p_0_9] & [1<=p_1_10 & r_0_7<=r_0_3]] | ~ [[3<=r_1_8 & 1<=r_0_7]]]]]]

abstracting: (1<=r_0_7) states: 131,072 (5)
abstracting: (3<=r_1_8) states: 0
abstracting: (r_0_7<=r_0_3) states: 208,896 (5)
abstracting: (1<=p_1_10) states: 98,304 (4)
abstracting: (p_1_9<=p_0_9) states: 188,416 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec


Total processing time: 0m 5.533sec


BK_STOP 1463779470640

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


iterations count:914 (28), effective:240 (7)

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="ResAllocation-PT-R015C002"
export BK_EXAMINATION="ReachabilityCardinality"
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/ResAllocation-PT-R015C002.tgz
mv ResAllocation-PT-R015C002 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 ResAllocation-PT-R015C002, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r101kn-smll-146369144000367"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;