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

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

=== Now, execution of the tool begins

BK_START 1432482074782

Model: Dekker-PT-020
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: 100 NrTr: 440 NrArc: 3240)

net check time: 0m0sec

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

init dd package: 0m2sec


RS generation: 0m4sec


-> reachability set: #nodes 40973 (4.1e+04) #states 11,534,336 (7)



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

checking: EF [[2<=flag_1_16 | 3<=p0_14]]
normalized: E [true U [2<=flag_1_16 | 3<=p0_14]]

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

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

MC time: 0m0sec

checking: EF [[[[p3_15<=flag_0_1 & 1<=flag_1_19] | [flag_1_6<=p1_18 & 3<=p1_13]] & 1<=p3_14]]
normalized: E [true U [1<=p3_14 & [[flag_1_6<=p1_18 & 3<=p1_13] | [p3_15<=flag_0_1 & 1<=flag_1_19]]]]

abstracting: (1<=flag_1_19) states: 6,029,312 (6)
abstracting: (p3_15<=flag_0_1) states: 11,272,192 (7)
abstracting: (3<=p1_13) states: 0
abstracting: (flag_1_6<=p1_18) states: 8,388,608 (6)
abstracting: (1<=p3_14) states: 524,288 (5)
-> the formula is TRUE

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

MC time: 0m24sec

checking: AG [[3<=p1_0 | [~ [3<=flag_1_15] | [flag_0_15<=p0_2 & 3<=flag_0_18]]]]
normalized: ~ [E [true U ~ [[3<=p1_0 | [[flag_0_15<=p0_2 & 3<=flag_0_18] | ~ [3<=flag_1_15]]]]]]

abstracting: (3<=flag_1_15) states: 0
abstracting: (3<=flag_0_18) states: 0
abstracting: (flag_0_15<=p0_2) states: 8,650,752 (6)
abstracting: (3<=p1_0) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-020-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m4sec

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

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

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

MC time: 0m0sec

checking: EF [[[~ [1<=p1_15] & [flag_1_2<=p1_4 | p3_0<=flag_0_17]] & 3<=p3_16]]
normalized: E [true U [3<=p3_16 & [~ [1<=p1_15] & [flag_1_2<=p1_4 | p3_0<=flag_0_17]]]]

abstracting: (p3_0<=flag_0_17) states: 11,272,192 (7)
abstracting: (flag_1_2<=p1_4) states: 8,388,608 (6)
abstracting: (1<=p1_15) states: 5,505,024 (6)
abstracting: (3<=p3_16) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35sec

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

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

FORMULA Dekker-PT-020-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[p3_16<=p3_14 & [[1<=p3_3 & 3<=p3_10] | [2<=flag_0_11 & 1<=p1_10]]]]
normalized: E [true U [p3_16<=p3_14 & [[2<=flag_0_11 & 1<=p1_10] | [1<=p3_3 & 3<=p3_10]]]]

abstracting: (3<=p3_10) states: 0
abstracting: (1<=p3_3) states: 524,288 (5)
abstracting: (1<=p1_10) states: 5,505,024 (6)
abstracting: (2<=flag_0_11) states: 0
abstracting: (p3_16<=p3_14) states: 11,010,048 (7)
-> the formula is FALSE

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

MC time: 0m8sec

checking: EF [[3<=flag_1_1 & ~ [3<=flag_0_18]]]
normalized: E [true U [3<=flag_1_1 & ~ [3<=flag_0_18]]]

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

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

MC time: 0m0sec

checking: EF [[[[3<=flag_0_11 & 1<=flag_0_5] & [3<=p3_17 & 3<=flag_0_5]] & p1_10<=p0_19]]
normalized: E [true U [p1_10<=p0_19 & [[3<=flag_0_11 & 1<=flag_0_5] & [3<=p3_17 & 3<=flag_0_5]]]]

abstracting: (3<=flag_0_5) states: 0
abstracting: (3<=p3_17) states: 0
abstracting: (1<=flag_0_5) states: 5,505,024 (6)
abstracting: (3<=flag_0_11) states: 0
abstracting: (p1_10<=p0_19) states: 8,650,752 (6)
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[1<=p1_16 | 2<=flag_0_6] & 3<=p3_16]]]
normalized: ~ [E [true U [3<=p3_16 & [1<=p1_16 | 2<=flag_0_6]]]]

abstracting: (2<=flag_0_6) states: 0
abstracting: (1<=p1_16) states: 5,505,024 (6)
abstracting: (3<=p3_16) states: 0
-> the formula is TRUE

FORMULA Dekker-PT-020-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [2<=p1_7] | [p0_3<=p3_6 | p3_13<=flag_1_15]] | [[flag_1_6<=p1_6 | flag_0_12<=flag_1_5] | p0_13<=p3_1]]]
normalized: ~ [E [true U ~ [[[p0_13<=p3_1 | [flag_1_6<=p1_6 | flag_0_12<=flag_1_5]] | [[p0_3<=p3_6 | p3_13<=flag_1_15] | ~ [2<=p1_7]]]]]]

abstracting: (2<=p1_7) states: 0
abstracting: (p3_13<=flag_1_15) states: 11,272,192 (7)
abstracting: (p0_3<=p3_6) states: 6,291,456 (6)
abstracting: (flag_0_12<=flag_1_5) states: 8,912,896 (6)
abstracting: (flag_1_6<=p1_6) states: 11,010,048 (7)
abstracting: (p0_13<=p3_1) states: 6,291,456 (6)
-> the formula is TRUE

FORMULA Dekker-PT-020-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m43sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [~ [~ [[flag_0_8<=p3_15 & 3<=flag_1_0]]]]
normalized: E [true U [flag_0_8<=p3_15 & 3<=flag_1_0]]

abstracting: (3<=flag_1_0) states: 0
abstracting: (flag_0_8<=p3_15) states: 6,291,456 (6)
-> the formula is FALSE

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

MC time: 0m8sec

checking: EF [[3<=flag_1_14 | 2<=p1_6]]
normalized: E [true U [3<=flag_1_14 | 2<=p1_6]]

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

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

MC time: 0m0sec

checking: EF [[[p3_15<=flag_1_18 & ~ [2<=flag_1_5]] & ~ [~ [2<=flag_0_9]]]]
normalized: E [true U [2<=flag_0_9 & [p3_15<=flag_1_18 & ~ [2<=flag_1_5]]]]

abstracting: (2<=flag_1_5) states: 0
abstracting: (p3_15<=flag_1_18) states: 11,272,192 (7)
abstracting: (2<=flag_0_9) states: 0
-> the formula is FALSE

FORMULA Dekker-PT-020-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m7sec


Total processing time: 2m36sec


BK_STOP 1432482231526

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

227 434 638 988 1477 2442 4326 8316 17332 17843 37335 37848 40973
iterations count:13005 (29), effective:275 (0)

initing FirstDep: 0m0sec

4023 4153 4327 4436 4569 4724 4943 5269 5370 6233 6337 8258 8285 8193 20974 40973
iterations count:16045 (36), effective:346 (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-020"
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-020.tgz
mv Dekker-PT-020 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-020, 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-143214376300035"
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 ;