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-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r134st-blw3-143297579700002
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433365800931

Model: S_Dekker-PT-010
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: 50 NrTr: 120 NrArc: 820)

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 1799 (1.8e+03) #states 6,144 (3)



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

checking: ~ [EX [EF [2<=p3_1]]]
normalized: ~ [EX [E [true U 2<=p3_1]]]

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

FORMULA Dekker-PT-010-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [AG [[2<=p3_8 & flag_0_2<=flag_1_5]]]
normalized: E [true U ~ [E [true U ~ [[2<=p3_8 & flag_0_2<=flag_1_5]]]]]

abstracting: (flag_0_2<=flag_1_5) states: 4,864 (3)
abstracting: (2<=p3_8) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: [EF [AG [p0_0<=p0_2]] | [[EG [2<=flag_0_7] | [~ [2<=flag_1_0] & [flag_0_5<=p1_7 | flag_0_5<=flag_0_1]]] & AG [[2<=p1_5 | p0_7<=flag_1_7]]]]
normalized: [[[EG [2<=flag_0_7] | [[flag_0_5<=p1_7 | flag_0_5<=flag_0_1] & ~ [2<=flag_1_0]]] & ~ [E [true U ~ [[2<=p1_5 | p0_7<=flag_1_7]]]]] | E [true U ~ [E [true U ~ [p0_0<=p0_2]]]]]

abstracting: (p0_0<=p0_2) states: 4,608 (3)
abstracting: (p0_7<=flag_1_7) states: 3,328 (3)
abstracting: (2<=p1_5) states: 0
abstracting: (2<=flag_1_0) states: 0
abstracting: (flag_0_5<=flag_0_1) states: 4,608 (3)
abstracting: (flag_0_5<=p1_7) states: 4,608 (3)
abstracting: (2<=flag_0_7) states: 0
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m0sec

checking: ~ [~ [[EF [2<=p1_2] & EX [p0_8<=flag_1_5]]]]
normalized: [E [true U 2<=p1_2] & EX [p0_8<=flag_1_5]]

abstracting: (p0_8<=flag_1_5) states: 4,864 (3)
.abstracting: (2<=p1_2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

FORMULA Dekker-PT-010-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [~ [AX [1<=p0_8]]] | AX [EF [3<=p1_0]]]
normalized: [~ [EX [~ [E [true U 3<=p1_0]]]] | ~ [EX [~ [1<=p0_8]]]]

abstracting: (1<=p0_8) states: 2,816 (3)
.abstracting: (3<=p1_0) states: 0
.-> the formula is FALSE

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

MC time: 0m0sec

checking: [[E [flag_0_3<=flag_0_1 U 3<=flag_0_1] & E [1<=p0_5 U 3<=p1_0]] | AG [AF [flag_0_0<=flag_0_2]]]
normalized: [[E [flag_0_3<=flag_0_1 U 3<=flag_0_1] & E [1<=p0_5 U 3<=p1_0]] | ~ [E [true U EG [~ [flag_0_0<=flag_0_2]]]]]

abstracting: (flag_0_0<=flag_0_2) states: 4,608 (3)
.
EG iterations: 1
abstracting: (3<=p1_0) states: 0
abstracting: (1<=p0_5) states: 2,816 (3)
abstracting: (3<=flag_0_1) states: 0
abstracting: (flag_0_3<=flag_0_1) states: 4,608 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [[[p1_6<=flag_1_2 | [~ [p0_6<=p3_3] | 1<=flag_1_8]] | AG [[p1_0<=flag_0_9 | p3_7<=p0_2]]] & AG [EF [p3_1<=flag_1_2]]]
normalized: [~ [E [true U ~ [E [true U p3_1<=flag_1_2]]]] & [~ [E [true U ~ [[p1_0<=flag_0_9 | p3_7<=p0_2]]]] | [p1_6<=flag_1_2 | [1<=flag_1_8 | ~ [p0_6<=p3_3]]]]]

abstracting: (p0_6<=p3_3) states: 3,584 (3)
abstracting: (1<=flag_1_8) states: 3,328 (3)
abstracting: (p1_6<=flag_1_2) states: 4,864 (3)
abstracting: (p3_7<=p0_2) states: 5,888 (3)
abstracting: (p1_0<=flag_0_9) states: 4,608 (3)
abstracting: (p3_1<=flag_1_2) states: 5,888 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: [[p0_1<=p1_1 | E [flag_1_6<=flag_1_5 U 3<=p3_1]] & [[p1_3<=p3_9 | 1<=flag_1_7] | [2<=p3_9 & [[2<=p0_9 & flag_1_3<=p3_2] | ~ [2<=flag_0_6]]]]]
normalized: [[[2<=p3_9 & [~ [2<=flag_0_6] | [2<=p0_9 & flag_1_3<=p3_2]]] | [p1_3<=p3_9 | 1<=flag_1_7]] & [p0_1<=p1_1 | E [flag_1_6<=flag_1_5 U 3<=p3_1]]]

abstracting: (3<=p3_1) states: 0
abstracting: (flag_1_6<=flag_1_5) states: 4,608 (3)
abstracting: (p0_1<=p1_1) states: 3,328 (3)
abstracting: (1<=flag_1_7) states: 3,328 (3)
abstracting: (p1_3<=p3_9) states: 3,584 (3)
abstracting: (flag_1_3<=p3_2) states: 3,072 (3)
abstracting: (2<=p0_9) states: 0
abstracting: (2<=flag_0_6) states: 0
abstracting: (2<=p3_9) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [E [flag_1_9<=p0_4 U 3<=flag_0_4]]
normalized: E [true U E [flag_1_9<=p0_4 U 3<=flag_0_4]]

abstracting: (3<=flag_0_4) states: 0
abstracting: (flag_1_9<=p0_4) states: 4,352 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: [~ [1<=p3_6] & [EF [2<=p0_2] | [AG [p1_3<=flag_1_2] & [~ [flag_0_8<=flag_1_5] | [3<=p3_7 & p3_7<=p0_1]]]]]
normalized: [[[[[3<=p3_7 & p3_7<=p0_1] | ~ [flag_0_8<=flag_1_5]] & ~ [E [true U ~ [p1_3<=flag_1_2]]]] | E [true U 2<=p0_2]] & ~ [1<=p3_6]]

abstracting: (1<=p3_6) states: 512
abstracting: (2<=p0_2) states: 0
abstracting: (p1_3<=flag_1_2) states: 4,864 (3)
abstracting: (flag_0_8<=flag_1_5) states: 4,864 (3)
abstracting: (p3_7<=p0_1) states: 5,888 (3)
abstracting: (3<=p3_7) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [3<=p0_3]]
normalized: ~ [E [true U 3<=p0_3]]

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

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

MC time: 0m0sec

checking: AX [[AG [p0_1<=flag_0_1] | AX [flag_1_3<=p0_0]]]
normalized: ~ [EX [~ [[~ [E [true U ~ [p0_1<=flag_0_1]]] | ~ [EX [~ [flag_1_3<=p0_0]]]]]]]

abstracting: (flag_1_3<=p0_0) states: 4,352 (3)
.abstracting: (p0_1<=flag_0_1) states: 6,144 (3)
.-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: flag_0_5<=flag_0_5
normalized: flag_0_5<=flag_0_5

abstracting: (flag_0_5<=flag_0_5) states: 6,144 (3)
-> the formula is TRUE

FORMULA Dekker-PT-010-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [A [~ [p0_4<=p3_0] U 2<=p1_3] & ~ [[EX [flag_0_7<=p0_4] | AF [2<=flag_0_2]]]]
normalized: [~ [[EX [flag_0_7<=p0_4] | ~ [EG [~ [2<=flag_0_2]]]]] & [~ [EG [~ [2<=p1_3]]] & ~ [E [p0_4<=p3_0 U [p0_4<=p3_0 & ~ [2<=p1_3]]]]]]

abstracting: (2<=p1_3) states: 0
abstracting: (p0_4<=p3_0) states: 3,584 (3)
abstracting: (p0_4<=p3_0) states: 3,584 (3)
abstracting: (2<=p1_3) states: 0

EG iterations: 0
abstracting: (2<=flag_0_2) states: 0

EG iterations: 0
abstracting: (flag_0_7<=p0_4) states: 4,608 (3)
.-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m4sec


BK_STOP 1433365805371

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

815
iterations count:1640 (13), effective:71 (0)

initing FirstDep: 0m0sec


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

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

iterations count:128 (1), effective:3 (0)

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

iterations count:930 (7), effective:31 (0)

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

iterations count:360 (3), effective:5 (0)

iterations count:120 (1), effective:0 (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-010"
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-010.tgz
mv S_Dekker-PT-010 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-010, 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-143297579700002"
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 ;