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-2265
Executing tool marcie
Input is S_ResAllocation-PT-R003C003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930301029
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433782627666

Model: S_ResAllocation-PT-R003C003
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 18 NrTr: 12 NrArc: 48)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 46 (4.6e+01) #states 92



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

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

abstracting: (r_1_2<=r_0_0) states: 72
-> the formula is TRUE

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

MC time: 0m0sec

checking: 1<=p_0_1
normalized: 1<=p_0_1

abstracting: (1<=p_0_1) states: 40
-> the formula is FALSE

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

MC time: 0m0sec

checking: 3<=r_0_0
normalized: 3<=r_0_0

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

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

MC time: 0m0sec

checking: A [EG [3<=p_1_2] U [[p_1_1<=p_1_0 & 3<=p_0_0] & [3<=p_0_1 & p_2_0<=p_0_0]]]
normalized: [~ [EG [~ [[[p_1_1<=p_1_0 & 3<=p_0_0] & [3<=p_0_1 & p_2_0<=p_0_0]]]]] & ~ [E [~ [EG [3<=p_1_2]] U [~ [[[p_1_1<=p_1_0 & 3<=p_0_0] & [3<=p_0_1 & p_2_0<=p_0_0]]] & ~ [EG [3<=p_1_2]]]]]]

abstracting: (3<=p_1_2) states: 0
.
EG iterations: 1
abstracting: (p_2_0<=p_0_0) states: 70
abstracting: (3<=p_0_1) states: 0
abstracting: (3<=p_0_0) states: 0
abstracting: (p_1_1<=p_1_0) states: 84
abstracting: (3<=p_1_2) states: 0
.
EG iterations: 1
abstracting: (p_2_0<=p_0_0) states: 70
abstracting: (3<=p_0_1) states: 0
abstracting: (3<=p_0_0) states: 0
abstracting: (p_1_1<=p_1_0) states: 84

EG iterations: 0
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [~ [EX [p_2_0<=p_0_2]]]
normalized: EG [~ [EX [p_2_0<=p_0_2]]]

abstracting: (p_2_0<=p_0_2) states: 64
...
EG iterations: 2
-> the formula is FALSE

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

MC time: 0m0sec

checking: [~ [EG [2<=p_2_2]] & AX [AF [r_1_2<=r_0_1]]]
normalized: [~ [EX [EG [~ [r_1_2<=r_0_1]]]] & ~ [EG [2<=p_2_2]]]

abstracting: (2<=p_2_2) states: 0
.
EG iterations: 1
abstracting: (r_1_2<=r_0_1) states: 71
.......
EG iterations: 7
.-> the formula is TRUE

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

MC time: 0m0sec

checking: EX [~ [AX [r_0_1<=p_1_2]]]
normalized: EX [EX [~ [r_0_1<=p_1_2]]]

abstracting: (r_0_1<=p_1_2) states: 59
..-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [[~ [[3<=p_1_2 | 3<=r_1_1]] | [~ [[r_1_1<=r_0_0 | 1<=r_2_2]] & [[r_2_2<=p_1_1 & 3<=r_0_0] & [3<=p_1_1 & p_0_1<=r_1_0]]]]]
normalized: ~ [[[[[3<=p_1_1 & p_0_1<=r_1_0] & [r_2_2<=p_1_1 & 3<=r_0_0]] & ~ [[r_1_1<=r_0_0 | 1<=r_2_2]]] | ~ [[3<=p_1_2 | 3<=r_1_1]]]]

abstracting: (3<=r_1_1) states: 0
abstracting: (3<=p_1_2) states: 0
abstracting: (1<=r_2_2) states: 60
abstracting: (r_1_1<=r_0_0) states: 70
abstracting: (3<=r_0_0) states: 0
abstracting: (r_2_2<=p_1_1) states: 42
abstracting: (p_0_1<=r_1_0) states: 72
abstracting: (3<=p_1_1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EG [~ [[[r_1_1<=r_0_2 & r_0_0<=r_0_2] & [3<=p_2_0 & p_1_1<=p_0_2]]]]
normalized: EG [~ [[[3<=p_2_0 & p_1_1<=p_0_2] & [r_1_1<=r_0_2 & r_0_0<=r_0_2]]]]

abstracting: (r_0_0<=r_0_2) states: 66
abstracting: (r_1_1<=r_0_2) states: 67
abstracting: (p_1_1<=p_0_2) states: 82
abstracting: (3<=p_2_0) states: 0

EG iterations: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [EG [r_2_2<=p_1_1]]
normalized: ~ [E [true U ~ [EG [r_2_2<=p_1_1]]]]

abstracting: (r_2_2<=p_1_1) states: 42
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EX [AF [2<=r_0_2]] & [AF [3<=p_2_1] | p_0_1<=r_0_1]]
normalized: [[p_0_1<=r_0_1 | ~ [EG [~ [3<=p_2_1]]]] & EX [~ [EG [~ [2<=r_0_2]]]]]

abstracting: (2<=r_0_2) states: 0

EG iterations: 0
.abstracting: (3<=p_2_1) states: 0

EG iterations: 0
abstracting: (p_0_1<=r_0_1) states: 52
-> the formula is FALSE

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

MC time: 0m0sec

checking: E [AF [r_2_2<=p_2_2] U [[3<=r_1_0 & r_0_2<=p_0_2] & [p_0_1<=p_1_0 & 2<=p_0_0]]]
normalized: E [~ [EG [~ [r_2_2<=p_2_2]]] U [[p_0_1<=p_1_0 & 2<=p_0_0] & [3<=r_1_0 & r_0_2<=p_0_2]]]

abstracting: (r_0_2<=p_0_2) states: 54
abstracting: (3<=r_1_0) states: 0
abstracting: (2<=p_0_0) states: 0
abstracting: (p_0_1<=p_1_0) states: 52
abstracting: (r_2_2<=p_2_2) states: 32
.
EG iterations: 1
-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [2<=p_1_0 | p_2_2<=p_0_1]
normalized: [2<=p_1_0 | p_2_2<=p_0_1]

abstracting: (p_2_2<=p_0_1) states: 76
abstracting: (2<=p_1_0) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

checking: ~ [3<=p_1_0]
normalized: ~ [3<=p_1_0]

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

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

MC time: 0m0sec

checking: AX [[EG [2<=r_1_2] & AX [r_0_0<=p_0_1]]]
normalized: ~ [EX [~ [[~ [EX [~ [r_0_0<=p_0_1]]] & EG [2<=r_1_2]]]]]

abstracting: (2<=r_1_2) states: 0
.
EG iterations: 1
abstracting: (r_0_0<=p_0_1) states: 68
..-> the formula is FALSE

FORMULA ResAllocation-PT-R003C003-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [~ [AF [~ [2<=p_0_2]]]]
normalized: ~ [EG [2<=p_0_2]]

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

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

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1433782637521

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

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: 0m0sec


iterations count:83 (6), effective:18 (1)

initing FirstDep: 0m0sec


iterations count:31 (2), effective:5 (0)

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

iterations count:24 (2), effective:3 (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-R003C003"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/users/gast00/fkordon/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-R003C003.tgz
mv S_ResAllocation-PT-R003C003 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2265"
echo " Executing tool marcie"
echo " Input is S_ResAllocation-PT-R003C003, 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 r218st-ebro-143344930301029"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; 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 ;