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-3253
Executing tool marcie
Input is Dekker-PT-010, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r011-ebro-149436297100205
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494452398194

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: Dekker_PT_010
(NrP: 50 NrTr: 120 NrArc: 820)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec

net check time: 0m 0.000sec

init dd package: 0m 2.266sec


RS generation: 0m 0.017sec


-> reachability set: #nodes 95 (9.5e+01) #states 6,144 (3)



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: EF [[~ [~ [3<=p3_8]] & 2<=p1_3]]
normalized: E [true U [3<=p3_8 & 2<=p1_3]]

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

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

MC time: 0m 0.000sec

checking: AG [[2<=p1_4 | ~ [[p3_5<=p3_0 & 2<=flag_0_3]]]]
normalized: ~ [E [true U ~ [[2<=p1_4 | ~ [[p3_5<=p3_0 & 2<=flag_0_3]]]]]]

abstracting: (2<=flag_0_3)
states: 0
abstracting: (p3_5<=p3_0)
states: 5,632 (3)
abstracting: (2<=p1_4)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[[[3<=p1_7 | 3<=p0_4] & [1<=flag_1_7 | 3<=p0_8]] & ~ [2<=flag_1_0]]]
normalized: E [true U [~ [2<=flag_1_0] & [[1<=flag_1_7 | 3<=p0_8] & [3<=p1_7 | 3<=p0_4]]]]

abstracting: (3<=p0_4)
states: 0
abstracting: (3<=p1_7)
states: 0
abstracting: (3<=p0_8)
states: 0
abstracting: (1<=flag_1_7)
states: 3,328 (3)
abstracting: (2<=flag_1_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [~ [[[1<=p0_5 | flag_0_7<=p1_0] | [1<=flag_0_7 | 3<=p0_4]]]]
normalized: E [true U ~ [[[1<=flag_0_7 | 3<=p0_4] | [1<=p0_5 | flag_0_7<=p1_0]]]]

abstracting: (flag_0_7<=p1_0)
states: 4,608 (3)
abstracting: (1<=p0_5)
states: 2,816 (3)
abstracting: (3<=p0_4)
states: 0
abstracting: (1<=flag_0_7)
states: 2,816 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[1<=p1_8 & flag_1_8<=flag_1_9] & flag_0_2<=flag_1_9] & 2<=p0_0]]
normalized: E [true U [2<=p0_0 & [flag_0_2<=flag_1_9 & [1<=p1_8 & flag_1_8<=flag_1_9]]]]

abstracting: (flag_1_8<=flag_1_9)
states: 4,608 (3)
abstracting: (1<=p1_8)
states: 2,816 (3)
abstracting: (flag_0_2<=flag_1_9)
states: 4,864 (3)
abstracting: (2<=p0_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[3<=p34 & [[2<=flag_1_4 | p0_5<=p3_1] | ~ [p3_9<=p1_7]]]]
normalized: E [true U [3<=p34 & [~ [p3_9<=p1_7] | [2<=flag_1_4 | p0_5<=p3_1]]]]

abstracting: (p0_5<=p3_1)
states: 3,584 (3)
abstracting: (2<=flag_1_4)
states: 0
abstracting: (p3_9<=p1_7)
states: 5,888 (3)
abstracting: (3<=p34)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[2<=p0_6 & ~ [3<=p3_5]] & [1<=flag_1_9 & [flag_0_7<=p1_4 | 1<=p1_0]]]]
normalized: E [true U [[1<=flag_1_9 & [flag_0_7<=p1_4 | 1<=p1_0]] & [2<=p0_6 & ~ [3<=p3_5]]]]

abstracting: (3<=p3_5)
states: 0
abstracting: (2<=p0_6)
states: 0
abstracting: (1<=p1_0)
states: 2,816 (3)
abstracting: (flag_0_7<=p1_4)
states: 4,608 (3)
abstracting: (1<=flag_1_9)
states: 3,328 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[[p3_6<=p0_5 & 1<=flag_1_4] | flag_1_0<=flag_0_9] | flag_1_4<=flag_1_2]]
normalized: ~ [E [true U ~ [[flag_1_4<=flag_1_2 | [flag_1_0<=flag_0_9 | [p3_6<=p0_5 & 1<=flag_1_4]]]]]]

abstracting: (1<=flag_1_4)
states: 3,328 (3)
abstracting: (p3_6<=p0_5)
states: 5,888 (3)
abstracting: (flag_1_0<=flag_0_9)
states: 4,352 (3)
abstracting: (flag_1_4<=flag_1_2)
states: 4,608 (3)
-> the formula is FALSE

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

MC time: 0m 0.022sec

checking: AG [[[[p1_7<=flag_0_0 | p34<=p3_2] & ~ [3<=flag_0_4]] | ~ [[2<=p1_9 | 2<=flag_0_2]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p1_9 | 2<=flag_0_2]] | [~ [3<=flag_0_4] & [p1_7<=flag_0_0 | p34<=p3_2]]]]]]

abstracting: (p34<=p3_2)
states: 5,632 (3)
abstracting: (p1_7<=flag_0_0)
states: 4,608 (3)
abstracting: (3<=flag_0_4)
states: 0
abstracting: (2<=flag_0_2)
states: 0
abstracting: (2<=p1_9)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [~ [[[p0_9<=p3_5 | p3_9<=flag_0_9] | [p3_5<=flag_1_0 | flag_0_9<=p0_4]]]]
normalized: E [true U ~ [[[p3_5<=flag_1_0 | flag_0_9<=p0_4] | [p0_9<=p3_5 | p3_9<=flag_0_9]]]]

abstracting: (p3_9<=flag_0_9)
states: 5,632 (3)
abstracting: (p0_9<=p3_5)
states: 3,584 (3)
abstracting: (flag_0_9<=p0_4)
states: 4,608 (3)
abstracting: (p3_5<=flag_1_0)
states: 5,888 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[[flag_1_8<=p3_6 & 2<=p3_6] & [3<=flag_1_6 | p3_5<=p1_0]] & [3<=flag_0_2 & [flag_0_3<=flag_1_9 & p0_4<=flag_1_7]]]]
normalized: E [true U [[[flag_1_8<=p3_6 & 2<=p3_6] & [3<=flag_1_6 | p3_5<=p1_0]] & [3<=flag_0_2 & [flag_0_3<=flag_1_9 & p0_4<=flag_1_7]]]]

abstracting: (p0_4<=flag_1_7)
states: 4,864 (3)
abstracting: (flag_0_3<=flag_1_9)
states: 4,864 (3)
abstracting: (3<=flag_0_2)
states: 0
abstracting: (p3_5<=p1_0)
states: 5,888 (3)
abstracting: (3<=flag_1_6)
states: 0
abstracting: (2<=p3_6)
states: 0
abstracting: (flag_1_8<=p3_6)
states: 3,072 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[[flag_0_9<=p3_3 & flag_1_2<=flag_1_4] | [p0_5<=flag_0_5 | flag_1_1<=flag_1_9]] | [~ [p1_1<=p0_9] | ~ [flag_1_1<=flag_0_1]]]]
normalized: ~ [E [true U ~ [[[[p0_5<=flag_0_5 | flag_1_1<=flag_1_9] | [flag_0_9<=p3_3 & flag_1_2<=flag_1_4]] | [~ [flag_1_1<=flag_0_1] | ~ [p1_1<=p0_9]]]]]]

abstracting: (p1_1<=p0_9)
states: 4,608 (3)
abstracting: (flag_1_1<=flag_0_1)
states: 2,816 (3)
abstracting: (flag_1_2<=flag_1_4)
states: 4,608 (3)
abstracting: (flag_0_9<=p3_3)
states: 3,584 (3)
abstracting: (flag_1_1<=flag_1_9)
states: 4,608 (3)
abstracting: (p0_5<=flag_0_5)
states: 6,144 (3)
-> the formula is TRUE

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

MC time: 0m 0.001sec

totally nodes used: 35596(3.6e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 11660 41147 52807
used/not used/entry size/cache size: 39378 67069486 16 1024MB
basic ops cache: hits/miss/sum: 15618 44582 60200
used/not used/entry size/cache size: 80726 16696490 12 192MB
unary ops cache: hits/miss/sum: 0 190 190
used/not used/entry size/cache size: 190 8388418 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 391 1052 1443
used/not used/entry size/cache size: 1052 2096100 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67073271
1 35590
2 3
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.463sec


BK_STOP 1494452401704

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
ok
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: 0m 0.001sec


iterations count:1679 (13), effective:93 (0)

initing FirstDep: 0m 0.000sec


iterations count:871 (7), effective:41 (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-010"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-010.tgz
mv Dekker-PT-010 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3253"
echo " Executing tool marcie"
echo " Input is Dekker-PT-010, 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 r011-ebro-149436297100205"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;