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-R010C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r101kn-smll-146369144000354
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463779208024


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_R010C002
(NrP: 40 NrTr: 22 NrArc: 100)

net check time: 0m 0.000sec

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

init dd package: 0m 3.892sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 116 (1.2e+02) #states 6,144 (3)



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

checking: EG [~ [EG [1<=r_0_5]]]
normalized: EG [~ [EG [1<=r_0_5]]]

abstracting: (1<=r_0_5) states: 2,816 (3)
..........................................
EG iterations: 42

EG iterations: 0
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EX [~ [EF [3<=r_1_6]]]
normalized: EX [~ [E [true U 3<=r_1_6]]]

abstracting: (3<=r_1_6) states: 0
.-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [AF [~ [3<=r_0_8]]]
normalized: ~ [E [true U EG [3<=r_0_8]]]

abstracting: (3<=r_0_8) states: 0
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

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

FORMULA ResAllocation-PT-R010C002-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: ~ [EG [AF [r_0_4<=r_0_7]]]
normalized: ~ [EG [~ [EG [~ [r_0_4<=r_0_7]]]]]

abstracting: (r_0_4<=r_0_7) states: 4,608 (3)
..........................
EG iterations: 26

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: EF [~ [EF [r_0_3<=r_0_2]]]
normalized: E [true U ~ [E [true U r_0_3<=r_0_2]]]

abstracting: (r_0_3<=r_0_2) states: 4,608 (3)
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [~ [EG [r_1_1<=p_0_5]]]
normalized: ~ [E [true U EG [r_1_1<=p_0_5]]]

abstracting: (r_1_1<=p_0_5) states: 2,304 (3)
...................
EG iterations: 19
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: E [~ [3<=p_0_9] U 2<=p_1_9]
normalized: E [~ [3<=p_0_9] U 2<=p_1_9]

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

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

MC time: 0m 0.000sec

checking: E [~ [1<=p_1_4] U AG [1<=p_1_8]]
normalized: E [~ [1<=p_1_4] U ~ [E [true U ~ [1<=p_1_8]]]]

abstracting: (1<=p_1_8) states: 2,560 (3)
abstracting: (1<=p_1_4) states: 1,536 (3)
-> the formula is TRUE

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

MC time: 0m 0.006sec

checking: EF [EG [[1<=p_1_8 & 1<=r_1_7]]]
normalized: E [true U EG [[1<=p_1_8 & 1<=r_1_7]]]

abstracting: (1<=r_1_7) states: 3,840 (3)
abstracting: (1<=p_1_8) states: 2,560 (3)
.......................
EG iterations: 23
-> the formula is TRUE

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

MC time: 0m 0.017sec

checking: ~ [~ [~ [EG [r_1_4<=r_0_5]]]]
normalized: ~ [EG [r_1_4<=r_0_5]]

abstracting: (r_1_4<=r_0_5) states: 3,584 (3)
.....................................
EG iterations: 37
-> the formula is TRUE

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

MC time: 0m 0.028sec

checking: EF [[AF [2<=p_1_3] & ~ [~ [r_0_4<=r_1_1]]]]
normalized: E [true U [r_0_4<=r_1_1 & ~ [EG [~ [2<=p_1_3]]]]]

abstracting: (2<=p_1_3) states: 0

EG iterations: 0
abstracting: (r_0_4<=r_1_1) states: 5,760 (3)
-> the formula is FALSE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [AX [AX [2<=r_0_4]] | EF [AG [r_0_5<=r_1_4]]]
normalized: [E [true U ~ [E [true U ~ [r_0_5<=r_1_4]]]] | ~ [EX [EX [~ [2<=r_0_4]]]]]

abstracting: (2<=r_0_4) states: 0
..abstracting: (r_0_5<=r_1_4) states: 5,376 (3)
-> the formula is TRUE

FORMULA ResAllocation-PT-R010C002-CTLCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: [1<=p_1_3 | AX [EG [p_0_5<=p_0_6]]]
normalized: [1<=p_1_3 | ~ [EX [~ [EG [p_0_5<=p_0_6]]]]]

abstracting: (p_0_5<=p_0_6) states: 5,248 (3)
.......................
EG iterations: 23
.abstracting: (1<=p_1_3) states: 1,280 (3)
-> the formula is TRUE

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

MC time: 0m 0.008sec

checking: EF [[~ [~ [r_1_4<=r_1_6]] & AG [p_0_4<=p_1_7]]]
normalized: E [true U [r_1_4<=r_1_6 & ~ [E [true U ~ [p_0_4<=p_1_7]]]]]

abstracting: (p_0_4<=p_1_7) states: 4,864 (3)
abstracting: (r_1_4<=r_1_6) states: 4,864 (3)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: [~ [AF [[r_1_1<=p_0_4 | 2<=r_0_5]]] & r_1_3<=r_1_6]
normalized: [r_1_3<=r_1_6 & EG [~ [[r_1_1<=p_0_4 | 2<=r_0_5]]]]

abstracting: (2<=r_0_5) states: 0
abstracting: (r_1_1<=p_0_4) states: 2,560 (3)
.....................
EG iterations: 21
abstracting: (r_1_3<=r_1_6) states: 4,736 (3)
-> the formula is TRUE

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

MC time: 0m 0.008sec


Total processing time: 0m 5.497sec


BK_STOP 1463779213557

--------------------
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:434 (19), effective:110 (5)

initing FirstDep: 0m 0.000sec


iterations count:109 (4), effective:29 (1)

iterations count:162 (7), effective:40 (1)

iterations count:49 (2), effective:9 (0)

iterations count:134 (6), effective:41 (1)

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

iterations count:116 (5), effective:32 (1)

iterations count:152 (6), effective:43 (1)

iterations count:106 (4), effective:28 (1)

iterations count:94 (4), effective:26 (1)

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-R010C002"
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/ResAllocation-PT-R010C002.tgz
mv ResAllocation-PT-R010C002 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-R010C002, 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 r101kn-smll-146369144000354"
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 ;