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 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 r091-ebro-149488438500201
=====================================================================

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

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=CTLCardinality.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.002sec

net check time: 0m 0.000sec

init dd package: 0m 2.283sec


RS generation: 0m 0.016sec


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



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

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.017sec

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

abstracting: (1<=p0_3)
states: 2,816 (3)
-> the formula is TRUE

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

MC time: 0m 0.005sec

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

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

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

MC time: 0m 0.004sec

checking: [EF [1<=flag_1_5] & AG [EF [1<=p3_2]]]
normalized: [E [true U 1<=flag_1_5] & ~ [E [true U ~ [E [true U 1<=p3_2]]]]]

abstracting: (1<=p3_2)
states: 512
abstracting: (1<=flag_1_5)
states: 3,328 (3)
-> the formula is TRUE

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

MC time: 0m 0.017sec

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

abstracting: (3<=p1_9)
states: 0

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

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[EG [3<=p0_6] & EF [2<=p0_0]]]
normalized: E [true U [E [true U 2<=p0_0] & EG [3<=p0_6]]]

abstracting: (3<=p0_6)
states: 0
.
EG iterations: 1
abstracting: (2<=p0_0)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AF [E [p1_9<=p3_3 U 2<=flag_0_9]]
normalized: ~ [EG [~ [E [p1_9<=p3_3 U 2<=flag_0_9]]]]

abstracting: (2<=flag_0_9)
states: 0
abstracting: (p1_9<=p3_3)
states: 3,584 (3)

EG iterations: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[AX [1<=flag_0_1] | EF [p1_4<=p1_5]]]
normalized: ~ [E [true U ~ [[E [true U p1_4<=p1_5] | ~ [EX [~ [1<=flag_0_1]]]]]]]

abstracting: (1<=flag_0_1)
states: 2,816 (3)
.abstracting: (p1_4<=p1_5)
states: 4,608 (3)
-> the formula is TRUE

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

MC time: 0m 0.009sec

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

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

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

MC time: 0m 0.000sec

checking: EF [[~ [[p3_5<=flag_0_7 | p0_9<=p1_7]] | EX [2<=flag_1_4]]]
normalized: E [true U [EX [2<=flag_1_4] | ~ [[p3_5<=flag_0_7 | p0_9<=p1_7]]]]

abstracting: (p0_9<=p1_7)
states: 4,608 (3)
abstracting: (p3_5<=flag_0_7)
states: 5,888 (3)
abstracting: (2<=flag_1_4)
states: 0
.-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [~ [EF [2<=p3_9]] & [~ [EG [3<=p1_6]] & [1<=p0_9 | flag_0_4<=p3_1]]]
normalized: [[[1<=p0_9 | flag_0_4<=p3_1] & ~ [EG [3<=p1_6]]] & ~ [E [true U 2<=p3_9]]]

abstracting: (2<=p3_9)
states: 0
abstracting: (3<=p1_6)
states: 0
.
EG iterations: 1
abstracting: (flag_0_4<=p3_1)
states: 3,584 (3)
abstracting: (1<=p0_9)
states: 2,816 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: [EF [2<=p0_9] | [~ [[~ [3<=p3_3] | [3<=flag_0_6 & flag_1_7<=flag_1_1]]] | [1<=flag_1_0 & 1<=p1_9]]]
normalized: [[[1<=flag_1_0 & 1<=p1_9] | ~ [[[3<=flag_0_6 & flag_1_7<=flag_1_1] | ~ [3<=p3_3]]]] | E [true U 2<=p0_9]]

abstracting: (2<=p0_9)
states: 0
abstracting: (3<=p3_3)
states: 0
abstracting: (flag_1_7<=flag_1_1)
states: 4,608 (3)
abstracting: (3<=flag_0_6)
states: 0
abstracting: (1<=p1_9)
states: 2,816 (3)
abstracting: (1<=flag_1_0)
states: 3,328 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: [[AG [[p1_4<=p1_2 & 3<=p1_7]] & [~ [~ [1<=p1_8]] | p3_5<=p0_9]] | AG [EF [flag_1_6<=p3_8]]]
normalized: [~ [E [true U ~ [E [true U flag_1_6<=p3_8]]]] | [[1<=p1_8 | p3_5<=p0_9] & ~ [E [true U ~ [[p1_4<=p1_2 & 3<=p1_7]]]]]]

abstracting: (3<=p1_7)
states: 0
abstracting: (p1_4<=p1_2)
states: 4,608 (3)
abstracting: (p3_5<=p0_9)
states: 5,888 (3)
abstracting: (1<=p1_8)
states: 2,816 (3)
abstracting: (flag_1_6<=p3_8)
states: 3,072 (3)
-> the formula is TRUE

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

MC time: 0m 0.005sec

checking: AG [[[~ [p34<=p0_5] | ~ [3<=p1_5]] & [~ [p0_8<=p0_5] | [p0_1<=p0_1 | 1<=flag_0_8]]]]
normalized: ~ [E [true U ~ [[[[p0_1<=p0_1 | 1<=flag_0_8] | ~ [p0_8<=p0_5]] & [~ [3<=p1_5] | ~ [p34<=p0_5]]]]]]

abstracting: (p34<=p0_5)
states: 5,888 (3)
abstracting: (3<=p1_5)
states: 0
abstracting: (p0_8<=p0_5)
states: 4,608 (3)
abstracting: (1<=flag_0_8)
states: 2,816 (3)
abstracting: (p0_1<=p0_1)
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: 0m 0.000sec

checking: [EF [AG [2<=p3_7]] | [AG [[flag_0_8<=p3_1 | p3_8<=p3_0]] & [~ [~ [flag_1_4<=p3_2]] & flag_0_4<=flag_1_5]]]
normalized: [[~ [E [true U ~ [[flag_0_8<=p3_1 | p3_8<=p3_0]]]] & [flag_1_4<=p3_2 & flag_0_4<=flag_1_5]] | E [true U ~ [E [true U ~ [2<=p3_7]]]]]

abstracting: (2<=p3_7)
states: 0
abstracting: (flag_0_4<=flag_1_5)
states: 4,864 (3)
abstracting: (flag_1_4<=p3_2)
states: 3,072 (3)
abstracting: (p3_8<=p3_0)
states: 5,632 (3)
abstracting: (flag_0_8<=p3_1)
states: 3,584 (3)
-> the formula is FALSE

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

MC time: 0m 0.001sec

totally nodes used: 56781(5.7e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17174 54851 72025
used/not used/entry size/cache size: 52691 67056173 16 1024MB
basic ops cache: hits/miss/sum: 25841 69331 95172
used/not used/entry size/cache size: 137378 16639838 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: 342 970 1312
used/not used/entry size/cache size: 969 2096183 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 67052092
1 56763
2 9
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.316sec


BK_STOP 1495052830118

--------------------
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.002sec


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

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

iterations count:878 (7), effective:51 (0)

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

iterations count:139 (1), effective:2 (0)

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

iterations count:143 (1), effective:3 (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="/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/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-3253"
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 r091-ebro-149488438500201"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 ;