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-R020C002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930501159
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433783148554

Model: S_ResAllocation-PT-R020C002
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: 80 NrTr: 42 NrArc: 200)

net check time: 0m0sec

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

init dd package: 0m5sec


RS generation: 0m0sec


-> reachability set: #nodes 215 (2.2e+02) #states 11,534,336 (7)



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

checking: ~ [EG [EX [p_1_2<=r_1_3]]]
normalized: ~ [EG [EX [p_1_2<=r_1_3]]]

abstracting: (p_1_2<=r_1_3) states: 11,010,048 (7)
.............................................................................................................................................................
EG iterations: 156
-> the formula is FALSE

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

MC time: 0m0sec

checking: AF [EG [[2<=r_1_10 & r_0_8<=r_0_13]]]
normalized: ~ [EG [~ [EG [[2<=r_1_10 & r_0_8<=r_0_13]]]]]

abstracting: (r_0_8<=r_0_13) states: 8,650,752 (6)
abstracting: (2<=r_1_10) states: 0
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: A [AG [r_1_5<=p_0_3] U EF [2<=r_1_5]]
normalized: [~ [EG [~ [E [true U 2<=r_1_5]]]] & ~ [E [E [true U ~ [r_1_5<=p_0_3]] U [E [true U ~ [r_1_5<=p_0_3]] & ~ [E [true U 2<=r_1_5]]]]]]

abstracting: (2<=r_1_5) states: 0
abstracting: (r_1_5<=p_0_3) states: 6,160,384 (6)
abstracting: (r_1_5<=p_0_3) states: 6,160,384 (6)
abstracting: (2<=r_1_5) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [AG [[1<=r_0_7 | [3<=r_1_8 | p_1_13<=r_0_8]]]]
normalized: E [true U ~ [[1<=r_0_7 | [3<=r_1_8 | p_1_13<=r_0_8]]]]

abstracting: (p_1_13<=r_0_8) states: 9,437,184 (6)
abstracting: (3<=r_1_8) states: 0
abstracting: (1<=r_0_7) states: 5,505,024 (6)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [EX [~ [p_1_17<=r_1_7]]]
normalized: E [true U EX [~ [p_1_17<=r_1_7]]]

abstracting: (p_1_17<=r_1_7) states: 10,354,688 (7)
.-> the formula is TRUE

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

MC time: 0m5sec

checking: [[r_0_19<=r_1_19 | [EF [r_0_12<=p_1_16] & 3<=p_0_6]] & [AF [[2<=r_0_8 & 1<=r_1_5]] | [AF [1<=r_0_2] & 1<=p_1_2]]]
normalized: [[[1<=p_1_2 & ~ [EG [~ [1<=r_0_2]]]] | ~ [EG [~ [[2<=r_0_8 & 1<=r_1_5]]]]] & [r_0_19<=r_1_19 | [3<=p_0_6 & E [true U r_0_12<=p_1_16]]]]

abstracting: (r_0_12<=p_1_16) states: 8,257,536 (6)
abstracting: (3<=p_0_6) states: 0
abstracting: (r_0_19<=r_1_19) states: 11,534,336 (7)
abstracting: (1<=r_1_5) states: 9,699,328 (6)
abstracting: (2<=r_0_8) states: 0

EG iterations: 0
abstracting: (1<=r_0_2) states: 5,505,024 (6)
............................................................................................................................
EG iterations: 124
abstracting: (1<=p_1_2) states: 1,048,576 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24sec

checking: EG [r_0_8<=r_1_11]
normalized: EG [r_0_8<=r_1_11]

abstracting: (r_0_8<=r_1_11) states: 9,961,472 (6)
..........................................................................
EG iterations: 74
-> the formula is TRUE

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

MC time: 0m0sec

checking: AF [3<=r_0_1]
normalized: ~ [EG [~ [3<=r_0_1]]]

abstracting: (3<=r_0_1) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: A [AF [3<=r_1_10] U [[p_0_18<=p_0_14 | 1<=r_1_0] & [2<=p_0_14 & 1<=r_0_0]]]
normalized: [~ [EG [~ [[[2<=p_0_14 & 1<=r_0_0] & [p_0_18<=p_0_14 | 1<=r_1_0]]]]] & ~ [E [EG [~ [3<=r_1_10]] U [EG [~ [3<=r_1_10]] & ~ [[[2<=p_0_14 & 1<=r_0_0] & [p_0_18<=p_0_14 | 1<=r_1_0]]]]]]]

abstracting: (1<=r_1_0) states: 11,010,048 (7)
abstracting: (p_0_18<=p_0_14) states: 11,141,120 (7)
abstracting: (1<=r_0_0) states: 5,505,024 (6)
abstracting: (2<=p_0_14) states: 0
abstracting: (3<=r_1_10) states: 0

EG iterations: 0
abstracting: (3<=r_1_10) states: 0

EG iterations: 0
abstracting: (1<=r_1_0) states: 11,010,048 (7)
abstracting: (p_0_18<=p_0_14) states: 11,141,120 (7)
abstracting: (1<=r_0_0) states: 5,505,024 (6)
abstracting: (2<=p_0_14) states: 0

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m12sec

checking: AF [EG [r_0_15<=p_0_3]]
normalized: ~ [EG [~ [EG [r_0_15<=p_0_3]]]]

abstracting: (r_0_15<=p_0_3) states: 8,257,536 (6)
........................................................
EG iterations: 56
...............................................................................................................................................................................................................................................................................................
EG iterations: 287
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m2sec

checking: AG [~ [[~ [p_0_16<=p_1_1] & [r_1_4<=p_1_15 & p_1_12<=p_0_9]]]]
normalized: ~ [E [true U [[r_1_4<=p_1_15 & p_1_12<=p_0_9] & ~ [p_0_16<=p_1_1]]]]

abstracting: (p_0_16<=p_1_1) states: 10,223,616 (7)
abstracting: (p_1_12<=p_0_9) states: 8,388,608 (6)
abstracting: (r_1_4<=p_1_15) states: 5,242,880 (6)
-> the formula is TRUE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

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

abstracting: (1<=p_1_6) states: 2,097,152 (6)
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [EG [AX [1<=r_1_13]]]
normalized: ~ [EG [~ [EX [~ [1<=r_1_13]]]]]

abstracting: (1<=r_1_13) states: 7,602,176 (6)
...............................................................................................
EG iterations: 94
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: [r_1_13<=r_0_12 & EF [[3<=p_1_11 & [2<=r_1_2 | p_1_6<=r_1_15]]]]
normalized: [r_1_13<=r_0_12 & E [true U [3<=p_1_11 & [2<=r_1_2 | p_1_6<=r_1_15]]]]

abstracting: (p_1_6<=r_1_15) states: 10,485,760 (7)
abstracting: (2<=r_1_2) states: 0
abstracting: (3<=p_1_11) states: 0
abstracting: (r_1_13<=r_0_12) states: 7,602,176 (6)
-> the formula is FALSE

FORMULA ResAllocation-PT-R020C002-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

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

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

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

MC time: 0m0sec

checking: ~ [EF [[[1<=r_0_9 & 2<=p_1_2] & 2<=r_0_13]]]
normalized: ~ [E [true U [2<=r_0_13 & [1<=r_0_9 & 2<=p_1_2]]]]

abstracting: (2<=p_1_2) states: 0
abstracting: (1<=r_0_9) states: 5,505,024 (6)
abstracting: (2<=r_0_13) states: 0
-> the formula is TRUE

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

MC time: 0m0sec


Total processing time: 1m2sec


BK_STOP 1433783210912

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

511
iterations count:1511 (35), effective:420 (10)

initing FirstDep: 0m0sec


iterations count:124 (2), effective:23 (0)

iterations count:124 (2), effective:23 (0)

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

iterations count:803 (19), effective:221 (5)

iterations count:421 (10), effective:110 (2)

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

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

iterations count:461 (10), effective:119 (2)

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-R020C002"
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-R020C002.tgz
mv S_ResAllocation-PT-R020C002 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-R020C002, 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-143344930501159"
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 ;