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_DES-PT-00a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r091-ebro-149488438500232
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495052862299

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: DES_PT_00a
(NrP: 115 NrTr: 76 NrArc: 373)

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

net check time: 0m 0.000sec

init dd package: 0m 2.179sec


RS generation: 0m 3.463sec


-> reachability set: #nodes 4322 (4.3e+03) #states 24,196,956,529 (10)



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

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

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

FORMULA DES-PT-00a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [1<=p33]
normalized: E [true U 1<=p33]

abstracting: (1<=p33)
states: 8,150,706,240 (9)
-> the formula is TRUE

FORMULA DES-PT-00a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.927sec

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

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

FORMULA DES-PT-00a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA DES-PT-00a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [~ [[p103<=p8 | 1<=p108]]]]
normalized: ~ [E [true U ~ [[p103<=p8 | 1<=p108]]]]

abstracting: (1<=p108)
states: 6,229,135,968 (9)
abstracting: (p103<=p8)
states: 20,518,845,169 (10)
-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.597sec

checking: AG [[~ [[3<=p48 & 1<=p86]] | ~ [2<=p75]]]
normalized: ~ [E [true U ~ [[~ [2<=p75] | ~ [[3<=p48 & 1<=p86]]]]]]

abstracting: (1<=p86)
states: 8,092,389,888 (9)
abstracting: (3<=p48)
states: 0
abstracting: (2<=p75)
states: 0
-> the formula is TRUE

FORMULA DES-PT-00a-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [~ [[p30<=p48 | ~ [2<=p7]]]]
normalized: E [true U ~ [[p30<=p48 | ~ [2<=p7]]]]

abstracting: (2<=p7)
states: 0
abstracting: (p30<=p48)
states: 19,721,010,889 (10)
-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[2<=p109 & ~ [~ [p114<=p52]]]]
normalized: E [true U [2<=p109 & p114<=p52]]

abstracting: (p114<=p52)
states: 22,624,005,361 (10)
abstracting: (2<=p109)
states: 0
-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[p52<=p18 | ~ [3<=p21]] | 3<=p65]]
normalized: ~ [E [true U ~ [[3<=p65 | [p52<=p18 | ~ [3<=p21]]]]]]

abstracting: (3<=p21)
states: 0
abstracting: (p52<=p18)
states: 12,648,368,033 (10)
abstracting: (3<=p65)
states: 0
-> the formula is TRUE

FORMULA DES-PT-00a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[[p13<=p61 | ~ [p11<=p23]] & 3<=p96]]
normalized: E [true U [3<=p96 & [p13<=p61 | ~ [p11<=p23]]]]

abstracting: (p11<=p23)
states: 17,672,370,601 (10)
abstracting: (p13<=p61)
states: 16,565,903,473 (10)
abstracting: (3<=p96)
states: 0
-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: EF [[[[p101<=p14 | 2<=p111] | [3<=p15 & 1<=p112]] & 2<=p21]]
normalized: E [true U [2<=p21 & [[p101<=p14 | 2<=p111] | [3<=p15 & 1<=p112]]]]

abstracting: (1<=p112)
states: 15,544,653,456 (10)
abstracting: (3<=p15)
states: 0
abstracting: (2<=p111)
states: 0
abstracting: (p101<=p14)
states: 23,612,805,841 (10)
abstracting: (2<=p21)
states: 0
-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.004sec

checking: AG [[[~ [2<=p22] | ~ [1<=p90]] | [~ [3<=p51] & [1<=p93 | p98<=p4]]]]
normalized: ~ [E [true U ~ [[[~ [2<=p22] | ~ [1<=p90]] | [[1<=p93 | p98<=p4] & ~ [3<=p51]]]]]]

abstracting: (3<=p51)
states: 0
abstracting: (p98<=p4)
states: 20,366,896,401 (10)
abstracting: (1<=p93)
states: 1,980,988,416 (9)
abstracting: (1<=p90)
states: 1,591,781,232 (9)
abstracting: (2<=p22)
states: 0
-> the formula is TRUE

FORMULA DES-PT-00a-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: EF [[[~ [p110<=p34] | [p4<=p72 & 3<=p84]] & ~ [~ [3<=p36]]]]
normalized: E [true U [3<=p36 & [[p4<=p72 & 3<=p84] | ~ [p110<=p34]]]]

abstracting: (p110<=p34)
states: 21,506,844,481 (10)
abstracting: (3<=p84)
states: 0
abstracting: (p4<=p72)
states: 16,151,509,409 (10)
abstracting: (3<=p36)
states: 0
-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[[1<=p51 & [2<=p25 | 3<=p36]] & [p59<=p35 & [3<=p111 | 1<=p102]]]]
normalized: E [true U [[p59<=p35 & [3<=p111 | 1<=p102]] & [1<=p51 & [2<=p25 | 3<=p36]]]]

abstracting: (3<=p36)
states: 0
abstracting: (2<=p25)
states: 0
abstracting: (1<=p51)
states: 8,951,891,280 (9)
abstracting: (1<=p102)
states: 7,743,828,336 (9)
abstracting: (3<=p111)
states: 0
abstracting: (p59<=p35)
states: 21,305,858,497 (10)
-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [~ [[[p109<=p46 & p89<=p13] | [2<=p11 & p41<=p24]]]]
normalized: E [true U ~ [[[2<=p11 & p41<=p24] | [p109<=p46 & p89<=p13]]]]

abstracting: (p89<=p13)
states: 23,787,244,801 (10)
abstracting: (p109<=p46)
states: 23,334,428,785 (10)
abstracting: (p41<=p24)
states: 17,417,186,097 (10)
abstracting: (2<=p11)
states: 0
-> the formula is TRUE

FORMULA DES-PT-00a-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.876sec

checking: AG [[[[3<=p40 & 3<=p91] | [p18<=p103 | p81<=p83]] | ~ [[p87<=p106 | p84<=p50]]]]
normalized: ~ [E [true U ~ [[~ [[p87<=p106 | p84<=p50]] | [[p18<=p103 | p81<=p83] | [3<=p40 & 3<=p91]]]]]]

abstracting: (3<=p91)
states: 0
abstracting: (3<=p40)
states: 0
abstracting: (p81<=p83)
states: 19,208,497,009 (10)
abstracting: (p18<=p103)
states: 19,914,812,457 (10)
abstracting: (p84<=p50)
states: 21,093,026,161 (10)
abstracting: (p87<=p106)
states: 13,202,013,361 (10)

after gc: zbdd nodes used:54863, unused:18695137-> the formula is FALSE

FORMULA DES-PT-00a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.795sec

totally nodes used: 10488785(1.0e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 2612655 8740057 11352712
used/not used/entry size/cache size: 682660 66426204 16 1024MB
basic ops cache: hits/miss/sum: 3773240 12598286 16371526
used/not used/entry size/cache size: 2900863 13876353 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 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: 13701 42358 56059
used/not used/entry size/cache size: 0 2097152 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 65946462
1 1156180
2 6198
3 24
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m14.999sec


BK_STOP 1495052877344

--------------------
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:10891 (143), effective:1446 (19)

initing FirstDep: 0m 0.001sec


iterations count:1607 (21), effective:180 (2)

iterations count:2760 (36), effective:324 (4)

iterations count:3056 (40), effective:381 (5)

iterations count:2833 (37), effective:341 (4)

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_DES-PT-00a"
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/S_DES-PT-00a.tgz
mv S_DES-PT-00a 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_DES-PT-00a, 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 r091-ebro-149488438500232"
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 ;