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-2270
Executing tool marcie
Input is S_Dekker-PT-015, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r134st-blw3-143297579700015
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433365814951

Model: S_Dekker-PT-015
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: 75 NrTr: 255 NrArc: 1830)

net check time: 0m0sec

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

init dd package: 0m2sec


RS generation: 0m0sec


-> reachability set: #nodes 8709 (8.7e+03) #states 278,528 (5)



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

checking: [[A [1<=p1_8 U 1<=p0_11] & [EF [3<=p1_12] | 2<=p3_11]] & EX [1<=flag_0_3]]
normalized: [EX [1<=flag_0_3] & [[~ [E [~ [1<=p1_8] U [~ [1<=p0_11] & ~ [1<=p1_8]]]] & ~ [EG [~ [1<=p0_11]]]] & [2<=p3_11 | E [true U 3<=p1_12]]]]

abstracting: (3<=p1_12) states: 0
abstracting: (2<=p3_11) states: 0
abstracting: (1<=p0_11) states: 131,072 (5)
.
EG iterations: 1
abstracting: (1<=p1_8) states: 131,072 (5)
abstracting: (1<=p0_11) states: 131,072 (5)
abstracting: (1<=p1_8) states: 131,072 (5)
abstracting: (1<=flag_0_3) states: 131,072 (5)
.-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: ~ [AG [[[flag_1_14<=flag_1_0 | flag_0_8<=p1_8] | ~ [2<=flag_0_0]]]]
normalized: E [true U ~ [[~ [2<=flag_0_0] | [flag_1_14<=flag_1_0 | flag_0_8<=p1_8]]]]

abstracting: (flag_0_8<=p1_8) states: 147,456 (5)
abstracting: (flag_1_14<=flag_1_0) states: 208,896 (5)
abstracting: (2<=flag_0_0) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [A [p3_1<=flag_1_13 U 3<=flag_0_11]]
normalized: E [true U [~ [E [~ [p3_1<=flag_1_13] U [~ [p3_1<=flag_1_13] & ~ [3<=flag_0_11]]]] & ~ [EG [~ [3<=flag_0_11]]]]]

abstracting: (3<=flag_0_11) states: 0

EG iterations: 0
abstracting: (3<=flag_0_11) states: 0
abstracting: (p3_1<=flag_1_13) states: 270,336 (5)
abstracting: (p3_1<=flag_1_13) states: 270,336 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [AF [[3<=p1_14 | 2<=flag_0_2]]]
normalized: E [true U ~ [EG [~ [[3<=p1_14 | 2<=flag_0_2]]]]]

abstracting: (2<=flag_0_2) states: 0
abstracting: (3<=p1_14) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [[~ [[p1_3<=flag_1_3 | p3_11<=flag_1_1]] | EF [2<=p1_9]]]
normalized: ~ [EG [~ [[E [true U 2<=p1_9] | ~ [[p1_3<=flag_1_3 | p3_11<=flag_1_1]]]]]]

abstracting: (p3_11<=flag_1_1) states: 270,336 (5)
abstracting: (p1_3<=flag_1_3) states: 278,528 (5)
abstracting: (2<=p1_9) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AX [EF [3<=p0_14]] | AF [[1<=flag_0_2 & 2<=flag_0_9]]]
normalized: [~ [EX [~ [E [true U 3<=p0_14]]]] | ~ [EG [~ [[1<=flag_0_2 & 2<=flag_0_9]]]]]

abstracting: (2<=flag_0_9) states: 0
abstracting: (1<=flag_0_2) states: 131,072 (5)

EG iterations: 0
abstracting: (3<=p0_14) states: 0
.-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[flag_1_11<=flag_0_14 | [p0_9<=flag_0_1 & 3<=p1_2]] & AG [2<=flag_0_0]]]
normalized: E [true U [[flag_1_11<=flag_0_14 | [p0_9<=flag_0_1 & 3<=p1_2]] & ~ [E [true U ~ [2<=flag_0_0]]]]]

abstracting: (2<=flag_0_0) states: 0
abstracting: (3<=p1_2) states: 0
abstracting: (p0_9<=flag_0_1) states: 208,896 (5)
abstracting: (flag_1_11<=flag_0_14) states: 200,704 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: E [EX [flag_1_0<=p1_2] U AF [3<=flag_1_6]]
normalized: E [EX [flag_1_0<=p1_2] U ~ [EG [~ [3<=flag_1_6]]]]

abstracting: (3<=flag_1_6) states: 0

EG iterations: 0
abstracting: (flag_1_0<=p1_2) states: 200,704 (5)
.-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: [2<=p3_4 | EF [[p1_2<=p3_10 & [p1_11<=flag_1_11 & 2<=p1_13]]]]
normalized: [2<=p3_4 | E [true U [p1_2<=p3_10 & [p1_11<=flag_1_11 & 2<=p1_13]]]]

abstracting: (2<=p1_13) states: 0
abstracting: (p1_11<=flag_1_11) states: 278,528 (5)
abstracting: (p1_2<=p3_10) states: 155,648 (5)
abstracting: (2<=p3_4) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [~ [2<=p3_9]] | 3<=p0_10]]
normalized: E [true U [2<=p3_9 | 3<=p0_10]]

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

FORMULA Dekker-PT-015-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [[[flag_1_6<=p3_3 & EF [flag_0_8<=p0_13]] & ~ [3<=p0_0]] & [E [flag_1_8<=p3_8 U 3<=flag_1_3] & ~ [[2<=p0_12 & ~ [p1_11<=p3_3]]]]]
normalized: [[[flag_1_6<=p3_3 & E [true U flag_0_8<=p0_13]] & ~ [3<=p0_0]] & [~ [[2<=p0_12 & ~ [p1_11<=p3_3]]] & E [flag_1_8<=p3_8 U 3<=flag_1_3]]]

abstracting: (3<=flag_1_3) states: 0
abstracting: (flag_1_8<=p3_8) states: 147,456 (5)
abstracting: (p1_11<=p3_3) states: 155,648 (5)
abstracting: (2<=p0_12) states: 0
abstracting: (3<=p0_0) states: 0
abstracting: (flag_0_8<=p0_13) states: 208,896 (5)
abstracting: (flag_1_6<=p3_3) states: 139,264 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [AG [[flag_1_4<=p0_2 | flag_1_8<=p0_9]]]
normalized: ~ [EG [E [true U ~ [[flag_1_4<=p0_2 | flag_1_8<=p0_9]]]]]

abstracting: (flag_1_8<=p0_9) states: 200,704 (5)
abstracting: (flag_1_4<=p0_2) states: 200,704 (5)

EG iterations: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [AG [flag_0_7<=p1_1]]]
normalized: ~ [E [true U ~ [E [true U ~ [flag_0_7<=p1_1]]]]]

abstracting: (flag_0_7<=p1_1) states: 208,896 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[AX [2<=flag_0_2] & [~ [2<=p3_12] | [p3_2<=flag_0_6 | p1_1<=p3_10]]]]
normalized: E [true U [[[p3_2<=flag_0_6 | p1_1<=p3_10] | ~ [2<=p3_12]] & ~ [EX [~ [2<=flag_0_2]]]]]

abstracting: (2<=flag_0_2) states: 0
.abstracting: (2<=p3_12) states: 0
abstracting: (p1_1<=p3_10) states: 155,648 (5)
abstracting: (p3_2<=flag_0_6) states: 270,336 (5)
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[2<=flag_0_9 | EF [3<=flag_0_11]]]
normalized: E [true U [2<=flag_0_9 | E [true U 3<=flag_0_11]]]

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

FORMULA Dekker-PT-015-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[1<=flag_1_14 | flag_1_2<=p3_12] | ~ [2<=p3_7]] & [p1_11<=flag_0_5 & [2<=p1_1 | 3<=p0_13]]]]
normalized: E [true U [[~ [2<=p3_7] | [1<=flag_1_14 | flag_1_2<=p3_12]] & [p1_11<=flag_0_5 & [2<=p1_1 | 3<=p0_13]]]]

abstracting: (3<=p0_13) states: 0
abstracting: (2<=p1_1) states: 0
abstracting: (p1_11<=flag_0_5) states: 208,896 (5)
abstracting: (flag_1_2<=p3_12) states: 139,264 (5)
abstracting: (1<=flag_1_14) states: 147,456 (5)
abstracting: (2<=p3_7) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-015-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m12sec


BK_STOP 1433365827032

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

301 691 1906 3921 8045
iterations count:5412 (21), effective:156 (0)

initing FirstDep: 0m0sec


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

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

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

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

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

iterations count:384 (1), effective:5 (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_Dekker-PT-015"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/user/u8/hulinhub/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_Dekker-PT-015.tgz
mv S_Dekker-PT-015 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is S_Dekker-PT-015, 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 r134st-blw3-143297579700015"
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 ;