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-3254
Executing tool marcie
Input is DLCround-PT-06a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951500259
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823154921

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: DLCround_PT_06a
(NrP: 197 NrTr: 1313 NrArc: 5002)

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

net check time: 0m 0.000sec

init dd package: 0m 1.272sec


RS generation: 0m 3.333sec


-> reachability set: #nodes 48060 (4.8e+04) #states 24,010,000,001 (10)



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

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

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

FORMULA DLCround-PT-06a-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.017sec

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

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

FORMULA DLCround-PT-06a-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (3<=p150)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [p43<=p108]]
normalized: E [true U ~ [p43<=p108]]

abstracting: (p43<=p108)
states: 24,010,000,001 (10)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

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

abstracting: (p84<=p185)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: AG [[p158<=p177 | 1<=p62]]
normalized: ~ [E [true U ~ [[p158<=p177 | 1<=p62]]]]

abstracting: (1<=p62)
states: 2,401,000,000 (9)
abstracting: (p158<=p177)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[p111<=p109 & 3<=p100]]]
normalized: ~ [E [true U [p111<=p109 & 3<=p100]]]

abstracting: (3<=p100)
states: 0
abstracting: (p111<=p109)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[2<=p90 | [[2<=p193 | 3<=p99] | [2<=p33 & 1<=p79]]]]
normalized: E [true U [2<=p90 | [[2<=p193 | 3<=p99] | [2<=p33 & 1<=p79]]]]

abstracting: (1<=p79)
states: 2,401,000,000 (9)
abstracting: (2<=p33)
states: 0
abstracting: (3<=p99)
states: 0
abstracting: (2<=p193)
states: 0
abstracting: (2<=p90)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[3<=p118 & [~ [p4<=p76] & [1<=p176 | 3<=p73]]]]
normalized: E [true U [3<=p118 & [~ [p4<=p76] & [1<=p176 | 3<=p73]]]]

abstracting: (3<=p73)
states: 0
abstracting: (1<=p176)
states: 24,010,000,000 (10)
abstracting: (p4<=p76)
states: 20,923,000,001 (10)
abstracting: (3<=p118)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.047sec

checking: AG [[~ [[p34<=p142 & p58<=p100]] | ~ [[2<=p140 | 3<=p114]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p140 | 3<=p114]] | ~ [[p34<=p142 & p58<=p100]]]]]]

abstracting: (p58<=p100)
states: 24,010,000,001 (10)
abstracting: (p34<=p142)
states: 24,010,000,001 (10)
abstracting: (3<=p114)
states: 0
abstracting: (2<=p140)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: EF [[3<=p40 | [~ [p52<=p154] | [3<=p78 & p72<=p36]]]]
normalized: E [true U [3<=p40 | [[3<=p78 & p72<=p36] | ~ [p52<=p154]]]]

abstracting: (p52<=p154)
states: 24,010,000,001 (10)
abstracting: (p72<=p36)
states: 21,849,100,001 (10)
abstracting: (3<=p78)
states: 0
abstracting: (3<=p40)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[[~ [p115<=p186] & [1<=p1 & p139<=p114]] & ~ [~ [p65<=p11]]]]
normalized: E [true U [p65<=p11 & [[1<=p1 & p139<=p114] & ~ [p115<=p186]]]]

abstracting: (p115<=p186)
states: 24,010,000,001 (10)
abstracting: (p139<=p114)
states: 24,010,000,001 (10)
abstracting: (1<=p1)
states: 3,430,000,000 (9)
abstracting: (p65<=p11)
states: 21,952,000,001 (10)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.034sec

checking: EF [[[~ [p160<=p133] & [p5<=p176 | p184<=p175]] & p100<=p95]]
normalized: E [true U [p100<=p95 & [[p5<=p176 | p184<=p175] & ~ [p160<=p133]]]]

abstracting: (p160<=p133)
states: 24,010,000,001 (10)
abstracting: (p184<=p175)
states: 24,010,000,001 (10)
abstracting: (p5<=p176)
states: 24,010,000,001 (10)
abstracting: (p100<=p95)
states: 2,401,000,001 (9)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.008sec

checking: EF [[[3<=p190 & [p125<=p22 & p154<=p99]] & ~ [[3<=p133 & p112<=p114]]]]
normalized: E [true U [~ [[3<=p133 & p112<=p114]] & [3<=p190 & [p125<=p22 & p154<=p99]]]]

abstracting: (p154<=p99)
states: 24,010,000,001 (10)
abstracting: (p125<=p22)
states: 3,430,000,001 (9)
abstracting: (3<=p190)
states: 0
abstracting: (p112<=p114)
states: 24,010,000,001 (10)
abstracting: (3<=p133)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.020sec

checking: EF [[p171<=p119 & [[p14<=p40 & p154<=p98] & [p38<=p184 & 2<=p78]]]]
normalized: E [true U [p171<=p119 & [[p14<=p40 & p154<=p98] & [p38<=p184 & 2<=p78]]]]

abstracting: (2<=p78)
states: 0
abstracting: (p38<=p184)
states: 24,010,000,001 (10)
abstracting: (p154<=p98)
states: 2,401,000,001 (9)
abstracting: (p14<=p40)
states: 20,923,000,001 (10)
abstracting: (p171<=p119)
states: 24,010,000,001 (10)
-> the formula is FALSE

FORMULA DLCround-PT-06a-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.022sec

checking: AG [[[~ [3<=p40] & [p150<=p174 | p157<=p125]] & [~ [p92<=p180] | [p91<=p135 | 2<=p10]]]]
normalized: ~ [E [true U ~ [[[[p91<=p135 | 2<=p10] | ~ [p92<=p180]] & [[p150<=p174 | p157<=p125] & ~ [3<=p40]]]]]]

abstracting: (3<=p40)
states: 0
abstracting: (p157<=p125)
states: 24,010,000,001 (10)
abstracting: (p150<=p174)
states: 24,010,000,001 (10)
abstracting: (p92<=p180)
states: 24,010,000,001 (10)
abstracting: (2<=p10)
states: 0
abstracting: (p91<=p135)
states: 24,010,000,001 (10)
-> the formula is TRUE

FORMULA DLCround-PT-06a-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 805699(8.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3250474 16014313 19264787
used/not used/entry size/cache size: 13891115 53217749 16 1024MB
basic ops cache: hits/miss/sum: 287094 1376197 1663291
used/not used/entry size/cache size: 1662251 15114965 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: 34722 146751 181473
used/not used/entry size/cache size: 141996 1955156 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 66304981
1 802070
2 1810
3 3
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 5.630sec


BK_STOP 1495823160576

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


iterations count:37778 (28), effective:88 (0)

initing FirstDep: 0m 0.007sec

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="DLCround-PT-06a"
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/DLCround-PT-06a.tgz
mv DLCround-PT-06a execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is DLCround-PT-06a, 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 r171-csrt-149580951500259"
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 ;