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-2979
Executing tool marcie
Input is DES-PT-02a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026700043
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464800946861


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: DES_PT_02a
(NrP: 123 NrTr: 80 NrArc: 400)

net check time: 0m 0.000sec

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

init dd package: 0m 3.835sec


RS generation: 0m 5.202sec


-> reachability set: #nodes 46825 (4.7e+04) #states 4,953,223,116 (9)



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

checking: EF [~ [p28<=p109]]
normalized: E [true U ~ [p28<=p109]]

abstracting: (p28<=p109) states: 4,569,752,912 (9)
-> the formula is TRUE

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

MC time: 0m 7.621sec

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

abstracting: (p80<=p51) states: 3,907,755,468 (9)
-> the formula is FALSE

FORMULA DES-PT-02a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.863sec

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

abstracting: (p84<=p92) states: 3,907,755,468 (9)
-> the formula is FALSE

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

MC time: 0m 2.883sec

checking: EF [~ [p86<=p110]]
normalized: E [true U ~ [p86<=p110]]

abstracting: (p86<=p110) states: 3,694,569,624 (9)
-> the formula is TRUE

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

MC time: 0m 2.518sec

checking: EF [~ [[~ [3<=p72] | [3<=p67 | 3<=p90]]]]
normalized: E [true U ~ [[[3<=p67 | 3<=p90] | ~ [3<=p72]]]]

abstracting: (3<=p72) states: 0
abstracting: (3<=p90) states: 0
abstracting: (3<=p67) states: 0
-> the formula is FALSE

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

MC time: 0m 0.023sec

checking: AG [~ [[[2<=p45 | p38<=p6] & 2<=p102]]]
normalized: ~ [E [true U [2<=p102 & [2<=p45 | p38<=p6]]]]

abstracting: (p38<=p6) states: 3,042,281,955 (9)
abstracting: (2<=p45) states: 0
abstracting: (2<=p102) states: 0
-> the formula is TRUE

FORMULA DES-PT-02a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.058sec

checking: AG [~ [[[3<=p107 | p82<=p7] & 1<=p2]]]
normalized: ~ [E [true U [1<=p2 & [3<=p107 | p82<=p7]]]]

abstracting: (p82<=p7) states: 3,355,055,370 (9)
abstracting: (3<=p107) states: 0
abstracting: (1<=p2) states: 1,892,905,273 (9)
-> the formula is FALSE

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

MC time: 0m 1.679sec

checking: AG [[3<=p46 | [2<=p72 | p46<=p48]]]
normalized: ~ [E [true U ~ [[3<=p46 | [2<=p72 | p46<=p48]]]]]

abstracting: (p46<=p48) states: 4,335,324,759 (9)
abstracting: (2<=p72) states: 0
abstracting: (3<=p46) states: 0
-> the formula is FALSE

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

MC time: 0m 3.096sec

checking: EF [[[[3<=p28 | p2<=p52] & p15<=p43] & 3<=p4]]
normalized: E [true U [3<=p4 & [p15<=p43 & [3<=p28 | p2<=p52]]]]

abstracting: (p2<=p52) states: 4,308,559,620 (9)
abstracting: (3<=p28) states: 0
abstracting: (p15<=p43) states: 4,312,865,055 (9)
abstracting: (3<=p4) states: 0
-> the formula is FALSE

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

MC time: 0m 0.122sec

checking: EF [[p23<=p120 & [[p18<=p19 & 3<=p22] & p45<=p34]]]
normalized: E [true U [p23<=p120 & [p45<=p34 & [p18<=p19 & 3<=p22]]]]

abstracting: (3<=p22) states: 0
abstracting: (p18<=p19) states: 2,505,443,580 (9)
abstracting: (p45<=p34) states: 4,934,097,886 (9)
abstracting: (p23<=p120) states: 4,274,093,219 (9)
-> the formula is FALSE

FORMULA DES-PT-02a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.180sec

checking: EF [[~ [~ [1<=p109]] & [[p117<=p92 | p20<=p42] & p1<=p29]]]
normalized: E [true U [1<=p109 & [p1<=p29 & [p117<=p92 | p20<=p42]]]]

abstracting: (p20<=p42) states: 1,768,007,422 (9)
abstracting: (p117<=p92) states: 4,454,873,065 (9)
abstracting: (p1<=p29) states: 2,832,980,493 (9)
abstracting: (1<=p109) states: 189,300,311 (8)
-> the formula is TRUE

FORMULA DES-PT-02a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.850sec

checking: AG [[2<=p4 | [[1<=p6 | p6<=p122] & [2<=p44 | p103<=p57]]]]
normalized: ~ [E [true U ~ [[2<=p4 | [[2<=p44 | p103<=p57] & [1<=p6 | p6<=p122]]]]]]

abstracting: (p6<=p122) states: 3,870,258,025 (9)
abstracting: (1<=p6) states: 1,521,156,147 (9)
abstracting: (p103<=p57) states: 4,891,346,393 (9)
abstracting: (2<=p44) states: 0
abstracting: (2<=p4) states: 0
-> the formula is FALSE

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

MC time: 0m 0.662sec

checking: EF [[3<=p77 | [[3<=p10 & p59<=p73] & [p28<=p32 & 3<=p31]]]]
normalized: E [true U [3<=p77 | [[3<=p10 & p59<=p73] & [p28<=p32 & 3<=p31]]]]

abstracting: (3<=p31) states: 0
abstracting: (p28<=p32) states: 4,556,160,433 (9)
abstracting: (p59<=p73) states: 3,848,037,580 (9)
abstracting: (3<=p10) states: 0
abstracting: (3<=p77) states: 0
-> the formula is FALSE

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

MC time: 0m 0.110sec

checking: AG [[[~ [p40<=p89] & [p86<=p54 | p60<=p81]] | p115<=p48]]
normalized: ~ [E [true U ~ [[p115<=p48 | [[p86<=p54 | p60<=p81] & ~ [p40<=p89]]]]]]

abstracting: (p40<=p89) states: 3,585,006,969 (9)
abstracting: (p60<=p81) states: 3,781,681,081 (9)
abstracting: (p86<=p54) states: 4,923,256,842 (9)
abstracting: (p115<=p48) states: 4,541,584,266 (9)
-> the formula is FALSE

FORMULA DES-PT-02a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.066sec

checking: EF [[~ [[p92<=p92 & p121<=p72]] | [[2<=p38 | 1<=p81] | [2<=p119 & 2<=p90]]]]
normalized: E [true U [[[2<=p119 & 2<=p90] | [2<=p38 | 1<=p81]] | ~ [[p92<=p92 & p121<=p72]]]]

abstracting: (p121<=p72) states: 4,207,345,761 (9)
abstracting: (p92<=p92) states: 4,953,223,116 (9)
abstracting: (1<=p81) states: 3,109,530,566 (9)
abstracting: (2<=p38) states: 0
abstracting: (2<=p90) states: 0
abstracting: (2<=p119) states: 0
-> the formula is TRUE

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

MC time: 0m 2.035sec

checking: EF [[[~ [1<=p6] | [p28<=p2 & p78<=p26]] & [[3<=p23 & p59<=p38] | [3<=p56 | 2<=p14]]]]
normalized: E [true U [[[p28<=p2 & p78<=p26] | ~ [1<=p6]] & [[3<=p23 & p59<=p38] | [3<=p56 | 2<=p14]]]]

abstracting: (2<=p14) states: 0
abstracting: (3<=p56) states: 0
abstracting: (p59<=p38) states: 4,425,413,904 (9)
abstracting: (3<=p23) states: 0
abstracting: (1<=p6) states: 1,521,156,147 (9)
abstracting: (p78<=p26) states: 2,477,460,958 (9)
abstracting: (p28<=p2) states: 4,739,399,758 (9)
-> the formula is FALSE

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

MC time: 0m 0.331sec


Total processing time: 0m45.861sec


BK_STOP 1464800992784

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

check for maximal unmarked siphon
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.002sec

13038 22420 35546 46922
iterations count:4708 (58), effective:544 (6)

initing FirstDep: 0m 0.000sec

69680
iterations count:1251 (15), effective:145 (1)
63175 70596
iterations count:2004 (25), effective:238 (2)
47929
iterations count:1948 (24), effective:226 (2)
44226 51965
iterations count:2041 (25), effective:246 (3)
35952 58281
iterations count:2357 (29), effective:278 (3)
66046 89696 91227
iterations count:3758 (46), effective:471 (5)
30534
iterations count:1336 (16), effective:138 (1)
47045
iterations count:1541 (19), effective:183 (2)
70492 91710 93634
iterations count:3080 (38), effective:378 (4)
51381
iterations count:1468 (18), effective:171 (2)

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="DES-PT-02a"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/DES-PT-02a.tgz
mv DES-PT-02a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is DES-PT-02a, 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 r221su-smll-146468026700043"
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 ;