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-10a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r221su-smll-146468026800079
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1464823592391


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_10a
(NrP: 155 NrTr: 112 NrArc: 552)

net check time: 0m 0.000sec

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

init dd package: 0m 3.881sec


RS generation: 0m12.641sec


-> reachability set: #nodes 102633 (1.0e+05) #states 1,600,305,869,653 (12)



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

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

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

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

MC time: 0m 0.059sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.046sec

checking: EF [~ [~ [[2<=p61 & 2<=p43]]]]
normalized: E [true U [2<=p61 & 2<=p43]]

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

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

MC time: 0m 0.082sec

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

abstracting: (p34<=p60) states: 1,436,796,465,841 (12)
-> the formula is FALSE

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

MC time: 0m24.146sec

checking: EF [~ [~ [[3<=p68 | 3<=p37]]]]
normalized: E [true U [3<=p68 | 3<=p37]]

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

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

MC time: 0m 0.033sec

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

abstracting: (p139<=p121) states: 1,457,797,629,195 (12)
-> the formula is FALSE

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

MC time: 0m19.316sec

checking: AG [~ [~ [[2<=p30 | p120<=p53]]]]
normalized: ~ [E [true U ~ [[2<=p30 | p120<=p53]]]]

abstracting: (p120<=p53) states: 1,350,089,152,621 (12)
abstracting: (2<=p30) states: 0
-> the formula is FALSE

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

MC time: 0m41.340sec

checking: AG [~ [[[2<=p133 | 3<=p144] & p19<=p122]]]
normalized: ~ [E [true U [p19<=p122 & [2<=p133 | 3<=p144]]]]

abstracting: (3<=p144) states: 0
abstracting: (2<=p133) states: 0
abstracting: (p19<=p122) states: 1,574,878,004,707 (12)
-> the formula is TRUE

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

MC time: 0m 0.206sec

checking: AG [~ [[~ [p138<=p52] | [1<=p96 & 1<=p18]]]]
normalized: ~ [E [true U [~ [p138<=p52] | [1<=p96 & 1<=p18]]]]

abstracting: (1<=p18) states: 103,602,272,442 (11)
abstracting: (1<=p96) states: 1,012,857,873,224 (12)
abstracting: (p138<=p52) states: 1,600,305,869,653 (12)
-> the formula is FALSE

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

MC time: 0m 3.864sec

checking: EF [[3<=p111 & [~ [p29<=p62] & ~ [1<=p116]]]]
normalized: E [true U [3<=p111 & [~ [1<=p116] & ~ [p29<=p62]]]]

abstracting: (p29<=p62) states: 1,509,084,779,371 (12)
abstracting: (1<=p116) states: 533,102,181,777 (11)
abstracting: (3<=p111) states: 0
-> the formula is FALSE

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

MC time: 0m 0.347sec

checking: AG [[[~ [p36<=p128] | ~ [p150<=p127]] | ~ [3<=p32]]]
normalized: ~ [E [true U ~ [[~ [3<=p32] | [~ [p150<=p127] | ~ [p36<=p128]]]]]]

abstracting: (p36<=p128) states: 1,390,871,306,493 (12)
abstracting: (p150<=p127) states: 1,488,116,649,301 (12)
abstracting: (3<=p32) states: 0
-> the formula is TRUE

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

MC time: 0m 0.358sec

checking: EF [[[[3<=p68 & p60<=p65] & p133<=p28] & 2<=p119]]
normalized: E [true U [2<=p119 & [p133<=p28 & [3<=p68 & p60<=p65]]]]

abstracting: (p60<=p65) states: 1,304,843,747,859 (12)
abstracting: (3<=p68) states: 0
abstracting: (p133<=p28) states: 1,480,326,091,571 (12)
abstracting: (2<=p119) states: 0
-> the formula is FALSE

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

MC time: 0m 0.318sec

checking: EF [~ [[[p19<=p21 & 2<=p77] | [p30<=p52 | 1<=p74]]]]
normalized: E [true U ~ [[[p19<=p21 & 2<=p77] | [p30<=p52 | 1<=p74]]]]

abstracting: (1<=p74) states: 538,983,987,148 (11)
abstracting: (p30<=p52) states: 1,600,305,869,653 (12)
abstracting: (2<=p77) states: 0
abstracting: (p19<=p21) states: 1,562,781,078,958 (12)
-> the formula is FALSE

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

MC time: 0m 0.279sec

checking: EF [[[1<=p113 | [2<=p21 & 2<=p51]] & [[p72<=p106 & p84<=p73] & ~ [p4<=p99]]]]
normalized: E [true U [[[p72<=p106 & p84<=p73] & ~ [p4<=p99]] & [1<=p113 | [2<=p21 & 2<=p51]]]]

abstracting: (2<=p51) states: 0
abstracting: (2<=p21) states: 0
abstracting: (1<=p113) states: 957,014,919,151 (11)
abstracting: (p4<=p99) states: 1,463,505,415,573 (12)
abstracting: (p84<=p73) states: 934,149,927,770 (11)
abstracting: (p72<=p106) states: 1,201,975,118,957 (12)
-> the formula is TRUE

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

MC time: 0m24.211sec

checking: AG [[[[p112<=p129 & p126<=p52] & [p130<=p46 | p34<=p102]] | 3<=p143]]
normalized: ~ [E [true U ~ [[3<=p143 | [[p130<=p46 | p34<=p102] & [p112<=p129 & p126<=p52]]]]]]

abstracting: (p126<=p52) states: 1,600,305,869,653 (12)
abstracting: (p112<=p129) states: 1,067,203,687,876 (12)
abstracting: (p34<=p102) states: 1,526,789,466,305 (12)
abstracting: (p130<=p46) states: 1,532,987,507,402 (12)
abstracting: (3<=p143) states: 0
-> the formula is FALSE

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

MC time: 0m40.476sec


Total processing time: 3m 0.372sec


BK_STOP 1464823772878

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

9654 10510 10805 10721 10785 10791 10808 10758 10820 10815 10960 10869 10914 13543 23229 24319 29935 34099 34571 36350 57740 58069 66835 66321 65969 71098 72102 71399 79854 77126 76676 77581 80888 82172 85956 84677 86089 86971 85904 88783 90093 93698 92237 93309 94149 92455 94743 96192 99104 99856 98240 98527 96888 98263 99358 102088 105631 100809 99905 99113 100232 101284 103766 102129 102455 102302 102385 102967 101794 107354 104138 102489
iterations count:72986 (651), effective:8762 (78)

initing FirstDep: 0m 0.000sec

48749 56139 60929 63139 66777 72538 69282 90313 90743 88146 84988 82461 77176 77496 82360 81003 85916 87662 112921 118656 120460
iterations count:21466 (191), effective:2308 (20)
76776 88277 95738 119254 115466
iterations count:5409 (48), effective:408 (3)
82208 97360 98345 109101 118496 138147 138951 141218 143520 143552 143358 142023 141730 139838 136999 136256 137115 131157
iterations count:18527 (165), effective:1891 (16)
59728 68348 71846
iterations count:3858 (34), effective:382 (3)
46317 43748 43827 51377 51148 57432 57679 58060 63060 62068 68561 71447 69360 74570 72670 79690 83068 79986 84972 83538 88707 89303 91382 91362 95425 96629 98498 97259 102989 122151 125439 132121
iterations count:32812 (292), effective:3566 (31)
121974 135460 145785 151526 154127 181256 175974 168159
iterations count:8663 (77), effective:887 (7)

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-10a"
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-10a.tgz
mv DES-PT-10a 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-10a, 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-146468026800079"
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 ;