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 Dekker-PT-015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r022kn-blw3-143214376300022
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432482059895

Model: 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=ReachabilityCardinality.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: EF [~ [~ [[2<=flag_0_1 & p1_6<=flag_0_13]]]]
normalized: E [true U [2<=flag_0_1 & p1_6<=flag_0_13]]

abstracting: (p1_6<=flag_0_13) states: 208,896 (5)
abstracting: (2<=flag_0_1) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (p3_2<=p3_2) states: 278,528 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[~ [3<=flag_1_1] | [1<=p0_2 & flag_0_4<=p3_11]]]]
normalized: E [true U ~ [[[1<=p0_2 & flag_0_4<=p3_11] | ~ [3<=flag_1_1]]]]

abstracting: (3<=flag_1_1) states: 0
abstracting: (flag_0_4<=p3_11) states: 155,648 (5)
abstracting: (1<=p0_2) states: 131,072 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[2<=p1_4 & ~ [[p1_10<=p3_2 | flag_0_1<=p0_7]]]]
normalized: E [true U [2<=p1_4 & ~ [[p1_10<=p3_2 | flag_0_1<=p0_7]]]]

abstracting: (flag_0_1<=p0_7) states: 208,896 (5)
abstracting: (p1_10<=p3_2) states: 155,648 (5)
abstracting: (2<=p1_4) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

FORMULA Dekker-PT-015-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [[3<=p3_14 & p0_12<=flag_0_7]] | [[flag_1_8<=p3_6 | 3<=p0_14] & ~ [flag_0_3<=flag_1_1]]]]
normalized: ~ [E [true U ~ [[[~ [flag_0_3<=flag_1_1] & [flag_1_8<=p3_6 | 3<=p0_14]] | ~ [[3<=p3_14 & p0_12<=flag_0_7]]]]]]

abstracting: (p0_12<=flag_0_7) states: 208,896 (5)
abstracting: (3<=p3_14) states: 0
abstracting: (3<=p0_14) states: 0
abstracting: (flag_1_8<=p3_6) states: 139,264 (5)
abstracting: (flag_0_3<=flag_1_1) states: 217,088 (5)
-> the formula is TRUE

FORMULA Dekker-PT-015-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[~ [2<=flag_0_1] & 3<=flag_1_9] & ~ [[p1_2<=p3_12 & 1<=p0_10]]]]
normalized: E [true U [~ [[p1_2<=p3_12 & 1<=p0_10]] & [3<=flag_1_9 & ~ [2<=flag_0_1]]]]

abstracting: (2<=flag_0_1) states: 0
abstracting: (3<=flag_1_9) states: 0
abstracting: (1<=p0_10) states: 131,072 (5)
abstracting: (p1_2<=p3_12) states: 155,648 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[[p1_10<=p3_4 & flag_1_9<=flag_1_12] & [flag_0_1<=p0_8 & 2<=p3_3]] | 2<=flag_1_6]]
normalized: E [true U [2<=flag_1_6 | [[p1_10<=p3_4 & flag_1_9<=flag_1_12] & [flag_0_1<=p0_8 & 2<=p3_3]]]]

abstracting: (2<=p3_3) states: 0
abstracting: (flag_0_1<=p0_8) states: 208,896 (5)
abstracting: (flag_1_9<=flag_1_12) states: 208,896 (5)
abstracting: (p1_10<=p3_4) states: 155,648 (5)
abstracting: (2<=flag_1_6) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [2<=flag_0_0]]
normalized: ~ [E [true U 2<=flag_0_0]]

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

FORMULA Dekker-PT-015-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[flag_0_4<=flag_0_3 | p3_8<=flag_0_7]]
normalized: ~ [E [true U ~ [[flag_0_4<=flag_0_3 | p3_8<=flag_0_7]]]]

abstracting: (p3_8<=flag_0_7) states: 270,336 (5)
abstracting: (flag_0_4<=flag_0_3) states: 208,896 (5)
-> the formula is FALSE

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

MC time: 0m1sec

checking: EF [~ [~ [[3<=flag_1_5 & 2<=p3_11]]]]
normalized: E [true U [3<=flag_1_5 & 2<=p3_11]]

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

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

MC time: 0m0sec

checking: EF [[[[p1_6<=p1_8 & flag_1_0<=p1_2] & [2<=flag_0_12 | p1_3<=flag_1_7]] & ~ [~ [2<=p0_13]]]]
normalized: E [true U [2<=p0_13 & [[p1_6<=p1_8 & flag_1_0<=p1_2] & [2<=flag_0_12 | p1_3<=flag_1_7]]]]

abstracting: (p1_3<=flag_1_7) states: 217,088 (5)
abstracting: (2<=flag_0_12) states: 0
abstracting: (flag_1_0<=p1_2) states: 200,704 (5)
abstracting: (p1_6<=p1_8) states: 208,896 (5)
abstracting: (2<=p0_13) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [~ [[p0_14<=flag_0_13 & [2<=p0_7 & 3<=flag_1_9]]]]
normalized: ~ [E [true U [p0_14<=flag_0_13 & [2<=p0_7 & 3<=flag_1_9]]]]

abstracting: (3<=flag_1_9) states: 0
abstracting: (2<=p0_7) states: 0
abstracting: (p0_14<=flag_0_13) states: 208,896 (5)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [~ [~ [[p1_5<=p1_1 & 2<=p1_12]]]]
normalized: E [true U [p1_5<=p1_1 & 2<=p1_12]]

abstracting: (2<=p1_12) states: 0
abstracting: (p1_5<=p1_1) states: 208,896 (5)
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

FORMULA Dekker-PT-015-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m10sec


BK_STOP 1432482070198

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

2382 5057
iterations count:2523 (9), effective:54 (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="Dekker-PT-015"
export BK_EXAMINATION="ReachabilityCardinality"
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/Dekker-PT-015.tgz
mv Dekker-PT-015 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 Dekker-PT-015, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r022kn-blw3-143214376300022"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.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 ;