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-09a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r171-csrt-149580951600313
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1495823954518

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_09a
(NrP: 299 NrTr: 2243 NrArc: 8689)

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

net check time: 0m 0.001sec

init dd package: 0m 1.273sec


RS generation: 1m 4.529sec


-> reachability set: #nodes 510890 (5.1e+05) #states 24,010,000,000,001 (13)



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

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

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

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

MC time: 0m 0.199sec

checking: EF [~ [~ [~ [p162<=p285]]]]
normalized: E [true U ~ [p162<=p285]]

abstracting: (p162<=p285)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

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

MC time: 0m 0.000sec

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

abstracting: (p77<=p278)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [1<=p206] & 3<=p179]]
normalized: E [true U [3<=p179 & ~ [1<=p206]]]

abstracting: (1<=p206)
states: 24,010,000,000,000 (13)
abstracting: (3<=p179)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.182sec

checking: EF [~ [~ [[p239<=p263 & 3<=p250]]]]
normalized: E [true U [p239<=p263 & 3<=p250]]

abstracting: (3<=p250)
states: 0
abstracting: (p239<=p263)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.072sec

checking: EF [~ [~ [[p13<=p212 & 1<=p95]]]]
normalized: E [true U [p13<=p212 & 1<=p95]]

abstracting: (1<=p95)
states: 2,401,000,000,000 (12)
abstracting: (p13<=p212)
states: 24,010,000,000,001 (13)

after gc: zbdd nodes used:639378, unused:18110622
after gc: zbdd nodes used:511922, unused:36988078-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m38.188sec

checking: AG [~ [~ [[p16<=p143 | p24<=p59]]]]
normalized: ~ [E [true U ~ [[p16<=p143 | p24<=p59]]]]

abstracting: (p24<=p59)
states: 20,923,000,000,001 (13)
abstracting: (p16<=p143)
states: 24,010,000,000,001 (13)
-> the formula is TRUE

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

MC time: 0m 0.453sec

checking: EF [[~ [p48<=p288] & p33<=p271]]
normalized: E [true U [p33<=p271 & ~ [p48<=p288]]]

abstracting: (p48<=p288)
states: 24,010,000,000,001 (13)
abstracting: (p33<=p271)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[1<=p216 | [[1<=p144 | p57<=p72] | ~ [p100<=p168]]]]
normalized: ~ [E [true U ~ [[1<=p216 | [~ [p100<=p168] | [1<=p144 | p57<=p72]]]]]]

abstracting: (p57<=p72)
states: 21,849,100,000,001 (13)
abstracting: (1<=p144)
states: 24,010,000,000,000 (13)
abstracting: (p100<=p168)
states: 24,010,000,000,001 (13)
abstracting: (1<=p216)
states: 24,010,000,000,000 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.172sec

checking: EF [[[[2<=p83 & p0<=p92] & [1<=p119 & 1<=p59]] | 2<=p121]]
normalized: E [true U [2<=p121 | [[1<=p119 & 1<=p59] & [2<=p83 & p0<=p92]]]]

abstracting: (p0<=p92)
states: 24,010,000,000,000 (13)
abstracting: (2<=p83)
states: 0
abstracting: (1<=p59)
states: 2,401,000,000,000 (12)
abstracting: (1<=p119)
states: 2,401,000,000,000 (12)
abstracting: (2<=p121)
states: 0
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.209sec

checking: EF [[[[3<=p31 & p167<=p180] & p160<=p208] & 1<=p31]]
normalized: E [true U [1<=p31 & [p160<=p208 & [3<=p31 & p167<=p180]]]]

abstracting: (p167<=p180)
states: 24,010,000,000,001 (13)
abstracting: (3<=p31)
states: 0
abstracting: (p160<=p208)
states: 24,010,000,000,001 (13)
abstracting: (1<=p31)
states: 2,401,000,000,000 (12)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.222sec

checking: AG [[[p167<=p217 & p262<=p135] & p66<=p285]]
normalized: ~ [E [true U ~ [[p66<=p285 & [p167<=p217 & p262<=p135]]]]]

abstracting: (p262<=p135)
states: 24,010,000,000,001 (13)
abstracting: (p167<=p217)
states: 24,010,000,000,001 (13)
abstracting: (p66<=p285)
states: 24,010,000,000,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.215sec

checking: AG [[p28<=p23 | [[3<=p55 | 1<=p267] | [1<=p126 | 1<=p190]]]]
normalized: ~ [E [true U ~ [[p28<=p23 | [[1<=p126 | 1<=p190] | [3<=p55 | 1<=p267]]]]]]

abstracting: (1<=p267)
states: 24,010,000,000,000 (13)
abstracting: (3<=p55)
states: 0
abstracting: (1<=p190)
states: 24,010,000,000,000 (13)
abstracting: (1<=p126)
states: 2,401,000,000,000 (12)
abstracting: (p28<=p23)
states: 20,580,000,000,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.223sec

checking: EF [[[[2<=p180 & 1<=p233] & [p254<=p82 & p293<=p119]] & ~ [[p82<=p293 | 2<=p245]]]]
normalized: E [true U [~ [[p82<=p293 | 2<=p245]] & [[p254<=p82 & p293<=p119] & [2<=p180 & 1<=p233]]]]

abstracting: (1<=p233)
states: 24,010,000,000,000 (13)
abstracting: (2<=p180)
states: 0
abstracting: (p293<=p119)
states: 2,401,000,000,001 (12)
abstracting: (p254<=p82)
states: 2,401,000,000,001 (12)
abstracting: (2<=p245)
states: 0
abstracting: (p82<=p293)
states: 24,010,000,000,001 (13)
-> the formula is FALSE

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

MC time: 0m 0.036sec

checking: EF [[[[p147<=p159 | 2<=p52] & ~ [p4<=p51]] & [[2<=p230 | 2<=p103] & ~ [p277<=p132]]]]
normalized: E [true U [[~ [p4<=p51] & [p147<=p159 | 2<=p52]] & [[2<=p230 | 2<=p103] & ~ [p277<=p132]]]]

abstracting: (p277<=p132)
states: 24,010,000,000,001 (13)
abstracting: (2<=p103)
states: 0
abstracting: (2<=p230)
states: 0
abstracting: (2<=p52)
states: 0
abstracting: (p147<=p159)
states: 24,010,000,000,001 (13)
abstracting: (p4<=p51)
states: 20,923,000,000,001 (13)
-> the formula is FALSE

FORMULA DLCround-PT-09a-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: AG [[[p61<=p82 | ~ [p290<=p151]] | [[p128<=p242 | 3<=p28] | p54<=p29]]]
normalized: ~ [E [true U ~ [[[p54<=p29 | [p128<=p242 | 3<=p28]] | [p61<=p82 | ~ [p290<=p151]]]]]]

abstracting: (p290<=p151)
states: 24,010,000,000,001 (13)
abstracting: (p61<=p82)
states: 21,849,100,000,001 (13)
abstracting: (3<=p28)
states: 0
abstracting: (p128<=p242)
states: 24,010,000,000,001 (13)
abstracting: (p54<=p29)
states: 21,849,100,000,001 (13)
-> the formula is TRUE

FORMULA DLCround-PT-09a-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.148sec

totally nodes used: 56350689(5.6e+07)
number of garbage collections: 2
fire ops cache: hits/miss/sum: 104686665 600504241 705190906
used/not used/entry size/cache size: 64797350 2311514 16 1024MB
basic ops cache: hits/miss/sum: 11694841 71206712 82901553
used/not used/entry size/cache size: 16475317 301899 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: 289945 1484358 1774303
used/not used/entry size/cache size: 778985 1318167 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 43201666
1 19145833
2 4121559
3 576322
4 58677
5 4500
6 286
7 20
8 1
9 0
>= 10 0

Total processing time: 2m48.115sec


BK_STOP 1495824122665

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


iterations count:89402 (39), effective:115 (0)

initing FirstDep: 0m 0.027sec


iterations count:8382 (3), effective:10 (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="DLCround-PT-09a"
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-09a.tgz
mv DLCround-PT-09a 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-09a, 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-149580951600313"
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 ;