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 S_ResAllocation-PT-R015C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r185kn-smll-146444128700363
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464599781814


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=CTLCardinality.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 3.722sec


RS generation: 0m 0.017sec


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



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

checking: EG [~ [EF [2<=p_1_12]]]
normalized: EG [~ [E [true U 2<=p_1_12]]]

abstracting: (2<=p_1_12) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EG [~ [EX [2<=p_1_6]]]
normalized: EG [~ [EX [2<=p_1_6]]]

abstracting: (2<=p_1_6) states: 0
.
EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [~ [[~ [3<=p_1_0] & ~ [r_0_14<=r_1_11]]]]
normalized: EG [~ [[~ [r_0_14<=r_1_11] & ~ [3<=p_1_0]]]]

abstracting: (3<=p_1_0) states: 0
abstracting: (r_0_14<=r_1_11) states: 225,280 (5)
....................................................................................................
EG iterations: 100
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.241sec

checking: EG [~ [[~ [1<=r_1_2] & ~ [p_0_3<=p_1_11]]]]
normalized: EG [~ [[~ [1<=r_1_2] & ~ [p_0_3<=p_1_11]]]]

abstracting: (p_0_3<=p_1_11) states: 208,896 (5)
abstracting: (1<=r_1_2) states: 245,760 (5)

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [E [r_1_5<=p_0_3 U 3<=r_0_6]]
normalized: ~ [EG [~ [E [r_1_5<=p_0_3 U 3<=r_0_6]]]]

abstracting: (3<=r_0_6) states: 0
abstracting: (r_1_5<=p_0_3) states: 151,552 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [[[EG [3<=p_0_8] | AF [1<=p_1_7]] & EF [~ [1<=p_0_4]]]]
normalized: ~ [[E [true U ~ [1<=p_0_4]] & [~ [EG [~ [1<=p_1_7]]] | EG [3<=p_0_8]]]]

abstracting: (3<=p_0_8) states: 0
.
EG iterations: 1
abstracting: (1<=p_1_7) states: 73,728 (4)
..................................................
EG iterations: 50
abstracting: (1<=p_0_4) states: 98,304 (4)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.115sec

checking: [r_1_3<=p_1_13 | EG [AF [r_1_8<=p_0_11]]]
normalized: [r_1_3<=p_1_13 | EG [~ [EG [~ [r_1_8<=p_0_11]]]]]

abstracting: (r_1_8<=p_0_11) states: 122,880 (5)
......................................................................
EG iterations: 70
.
EG iterations: 1
abstracting: (r_1_3<=p_1_13) states: 143,360 (5)
-> the formula is FALSE

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

MC time: 0m 0.160sec

checking: ~ [[[EF [r_1_2<=r_0_10] | AF [3<=p_0_10]] & AF [~ [p_1_5<=r_1_11]]]]
normalized: ~ [[[~ [EG [~ [3<=p_0_10]]] | E [true U r_1_2<=r_0_10]] & ~ [EG [p_1_5<=r_1_11]]]]

abstracting: (p_1_5<=r_1_11) states: 249,856 (5)
........................................................................................
EG iterations: 88
abstracting: (r_1_2<=r_0_10) states: 147,456 (5)
abstracting: (3<=p_0_10) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m 0.155sec

checking: E [[[r_0_13<=r_1_9 | 3<=p_0_4] | [1<=p_1_13 & 1<=r_1_3]] U EF [3<=r_0_13]]
normalized: E [[[r_0_13<=r_1_9 | 3<=p_0_4] | [1<=p_1_13 & 1<=r_1_3]] U E [true U 3<=r_0_13]]

abstracting: (3<=r_0_13) states: 0
abstracting: (1<=r_1_3) states: 237,568 (5)
abstracting: (1<=p_1_13) states: 122,880 (5)
abstracting: (3<=p_0_4) states: 0
abstracting: (r_0_13<=r_1_9) states: 233,472 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [~ [[p_0_10<=p_0_3 | p_0_11<=p_1_1]] U EG [r_0_12<=r_1_14]]
normalized: [~ [EG [~ [EG [r_0_12<=r_1_14]]]] & ~ [E [~ [EG [r_0_12<=r_1_14]] U [~ [EG [r_0_12<=r_1_14]] & [p_0_10<=p_0_3 | p_0_11<=p_1_1]]]]]

abstracting: (p_0_11<=p_1_1) states: 237,568 (5)
abstracting: (p_0_10<=p_0_3) states: 253,952 (5)
abstracting: (r_0_12<=r_1_14) states: 217,088 (5)
...................................................................
EG iterations: 67
abstracting: (r_0_12<=r_1_14) states: 217,088 (5)
...................................................................
EG iterations: 67
abstracting: (r_0_12<=r_1_14) states: 217,088 (5)
...................................................................
EG iterations: 67
..............................................................................................................................................................
EG iterations: 158
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.424sec

checking: E [[~ [p_1_11<=r_1_12] & ~ [r_0_8<=p_1_13]] U EG [p_1_11<=r_0_13]]
normalized: E [[~ [p_1_11<=r_1_12] & ~ [r_0_8<=p_1_13]] U EG [p_1_11<=r_0_13]]

abstracting: (p_1_11<=r_0_13) states: 225,280 (5)
...................................................................................................
EG iterations: 99
abstracting: (r_0_8<=p_1_13) states: 204,800 (5)
abstracting: (p_1_11<=r_1_12) states: 225,280 (5)
-> the formula is TRUE

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

MC time: 0m 0.275sec

checking: [E [[r_0_6<=p_0_5 | 2<=r_0_12] U 3<=r_1_12] | E [~ [r_1_8<=p_0_2] U ~ [p_1_11<=r_1_6]]]
normalized: [E [~ [r_1_8<=p_0_2] U ~ [p_1_11<=r_1_6]] | E [[r_0_6<=p_0_5 | 2<=r_0_12] U 3<=r_1_12]]

abstracting: (3<=r_1_12) states: 0
abstracting: (2<=r_0_12) states: 0
abstracting: (r_0_6<=p_0_5) states: 188,416 (5)
abstracting: (p_1_11<=r_1_6) states: 245,760 (5)
abstracting: (r_1_8<=p_0_2) states: 167,936 (5)
-> the formula is FALSE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: [~ [E [r_0_7<=r_1_9 U 1<=p_1_1]] | [~ [[~ [2<=r_1_10] | ~ [p_0_13<=p_1_10]]] & r_1_0<=r_1_1]]
normalized: [[r_1_0<=r_1_1 & ~ [[~ [p_0_13<=p_1_10] | ~ [2<=r_1_10]]]] | ~ [E [r_0_7<=r_1_9 U 1<=p_1_1]]]

abstracting: (1<=p_1_1) states: 24,576 (4)
abstracting: (r_0_7<=r_1_9) states: 237,568 (5)
abstracting: (2<=r_1_10) states: 0
abstracting: (p_0_13<=p_1_10) states: 253,952 (5)
abstracting: (r_1_0<=r_1_1) states: 262,144 (5)
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: [2<=r_1_10 | [~ [EF [3<=r_0_4]] & [[[p_1_11<=p_1_13 | 3<=p_1_12] | [3<=r_1_9 | r_0_10<=r_1_3]] & p_1_12<=r_1_10]]]
normalized: [2<=r_1_10 | [[p_1_12<=r_1_10 & [[p_1_11<=p_1_13 | 3<=p_1_12] | [3<=r_1_9 | r_0_10<=r_1_3]]] & ~ [E [true U 3<=r_0_4]]]]

abstracting: (3<=r_0_4) states: 0
abstracting: (r_0_10<=r_1_3) states: 258,048 (5)
abstracting: (3<=r_1_9) states: 0
abstracting: (3<=p_1_12) states: 0
abstracting: (p_1_11<=p_1_13) states: 225,280 (5)
abstracting: (p_1_12<=r_1_10) states: 229,376 (5)
abstracting: (2<=r_1_10) states: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EF [[r_0_9<=r_0_3 | ~ [p_0_8<=p_0_7]]] & EG [[[1<=p_0_9 & r_1_1<=r_0_12] | [r_0_4<=p_0_1 | r_0_8<=r_0_6]]]]
normalized: [EG [[[r_0_4<=p_0_1 | r_0_8<=r_0_6] | [1<=p_0_9 & r_1_1<=r_0_12]]] & E [true U [r_0_9<=r_0_3 | ~ [p_0_8<=p_0_7]]]]

abstracting: (p_0_8<=p_0_7) states: 245,760 (5)
abstracting: (r_0_9<=r_0_3) states: 208,896 (5)
abstracting: (r_1_1<=r_0_12) states: 143,360 (5)
abstracting: (1<=p_0_9) states: 57,344 (4)
abstracting: (r_0_8<=r_0_6) states: 208,896 (5)
abstracting: (r_0_4<=p_0_1) states: 204,800 (5)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ResAllocation-PT-R015C002-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: [[2<=p_1_11 | [[[r_0_14<=p_1_10 | r_1_12<=p_0_6] & [p_1_1<=r_0_7 & r_1_6<=r_1_6]] | [3<=r_1_3 | p_0_7<=r_1_13]]] & ~ [EG [[r_0_4<=r_1_2 & p_0_2<=p_1_14]]]]
normalized: [~ [EG [[r_0_4<=r_1_2 & p_0_2<=p_1_14]]] & [2<=p_1_11 | [[3<=r_1_3 | p_0_7<=r_1_13] | [[p_1_1<=r_0_7 & r_1_6<=r_1_6] & [r_0_14<=p_1_10 | r_1_12<=p_0_6]]]]]

abstracting: (r_1_12<=p_0_6) states: 167,936 (5)
abstracting: (r_0_14<=p_1_10) states: 196,608 (5)
abstracting: (r_1_6<=r_1_6) states: 278,528 (5)
abstracting: (p_1_1<=r_0_7) states: 266,240 (5)
abstracting: (p_0_7<=r_1_13) states: 249,856 (5)
abstracting: (3<=r_1_3) states: 0
abstracting: (2<=p_1_11) states: 0
abstracting: (p_0_2<=p_1_14) states: 217,088 (5)
abstracting: (r_0_4<=r_1_2) states: 262,144 (5)
.................................................................................
EG iterations: 81
-> the formula is FALSE

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

MC time: 0m 0.103sec


Total processing time: 0m 6.768sec


BK_STOP 1464599788619

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


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

initing FirstDep: 0m 0.000sec


iterations count:72 (2), effective:11 (0)

iterations count:72 (2), effective:13 (0)

iterations count:49 (1), effective:4 (0)

iterations count:32 (1), effective:0 (0)

iterations count:49 (1), effective:5 (0)

iterations count:56 (1), effective:8 (0)

iterations count:116 (3), effective:27 (0)

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