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 DES-PT-40a, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r011-ebro-149436297200304
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494456139274

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_40a
(NrP: 274 NrTr: 231 NrArc: 1116)

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

net check time: 0m 0.000sec

init dd package: 0m 2.448sec


after gc: zbdd nodes used:86559, unused:18663441
RS generation: 0m49.907sec


-> reachability set: #nodes 89580 (9.0e+04) #states 35,225,598,483,445 (13)



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

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

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

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

MC time: 0m 0.079sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [p45<=p29]
normalized: ~ [E [true U ~ [p45<=p29]]]

abstracting: (p45<=p29)
states: 34,282,279,431,341 (13)

after gc: zbdd nodes used:104483, unused:37395517
after gc: zbdd nodes used:201909, unused:74798091-> the formula is FALSE

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

MC time: 2m13.461sec

checking: EF [~ [~ [[3<=p88 | 3<=p243]]]]
normalized: E [true U [3<=p88 | 3<=p243]]

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

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

MC time: 0m 0.105sec

checking: AG [~ [[~ [p56<=p236] & ~ [3<=p183]]]]
normalized: ~ [E [true U [~ [3<=p183] & ~ [p56<=p236]]]]

abstracting: (p56<=p236)
states: 34,842,248,543,405 (13)
abstracting: (3<=p183)
states: 0
-> the formula is FALSE

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

MC time: 1m41.546sec

checking: EF [[[1<=p177 & ~ [1<=p100]] & ~ [~ [2<=p158]]]]
normalized: E [true U [2<=p158 & [1<=p177 & ~ [1<=p100]]]]

abstracting: (1<=p100)
states: 903,432,785,776 (11)
abstracting: (1<=p177)
states: 8,511,988,357,254 (12)
abstracting: (2<=p158)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.298sec

checking: AG [[p8<=p211 | ~ [~ [p64<=p246]]]]
normalized: ~ [E [true U ~ [[p8<=p211 | p64<=p246]]]]

abstracting: (p64<=p246)
states: 34,842,248,543,405 (13)
abstracting: (p8<=p211)
states: 34,876,608,180,381 (13)
-> the formula is TRUE

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

MC time: 0m 0.109sec

checking: EF [[[~ [3<=p115] & ~ [p101<=p83]] | 3<=p202]]
normalized: E [true U [3<=p202 | [~ [p101<=p83] & ~ [3<=p115]]]]

abstracting: (3<=p115)
states: 0
abstracting: (p101<=p83)
states: 34,322,165,697,669 (13)
abstracting: (3<=p202)
states: 0

after gc: zbdd nodes used:294256, unused:149705744-> the formula is TRUE

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

MC time: 6m36.882sec

checking: EF [[~ [[2<=p78 | p125<=p95]] & 3<=p111]]
normalized: E [true U [3<=p111 & ~ [[2<=p78 | p125<=p95]]]]

abstracting: (p125<=p95)
states: 34,306,487,897,357 (13)
abstracting: (2<=p78)
states: 0
abstracting: (3<=p111)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.210sec

checking: AG [[p109<=p85 & [~ [2<=p30] | p225<=p172]]]
normalized: ~ [E [true U ~ [[p109<=p85 & [p225<=p172 | ~ [2<=p30]]]]]]

abstracting: (2<=p30)
states: 0
abstracting: (p225<=p172)
states: 24,262,978,873,313 (13)
abstracting: (p109<=p85)
states: 34,322,165,697,669 (13)

after gc: zbdd nodes used:393384, unused:299606616-> the formula is FALSE

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

MC time: 3m39.996sec

checking: AG [[[[3<=p131 | 1<=p40] & ~ [3<=p10]] | p182<=p254]]
normalized: ~ [E [true U ~ [[p182<=p254 | [~ [3<=p10] & [3<=p131 | 1<=p40]]]]]]

abstracting: (1<=p40)
states: 2,380 (3)
abstracting: (3<=p131)
states: 0
abstracting: (3<=p10)
states: 0
abstracting: (p182<=p254)
states: 26,975,219,291,716 (13)
-> the formula is FALSE

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

MC time: 1m59.475sec

checking: AG [~ [[[p259<=p42 & 2<=p172] & ~ [p50<=p45]]]]
normalized: ~ [E [true U [~ [p50<=p45] & [p259<=p42 & 2<=p172]]]]

abstracting: (2<=p172)
states: 0
abstracting: (p259<=p42)
states: 31,461,853,368,193 (13)
abstracting: (p50<=p45)
states: 34,282,279,431,341 (13)
-> the formula is TRUE

FORMULA DES-PT-40a-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.302sec

checking: EF [~ [[[p35<=p146 & p224<=p79] | [p39<=p124 & 2<=p119]]]]
normalized: E [true U ~ [[[p39<=p124 & 2<=p119] | [p35<=p146 & p224<=p79]]]]

abstracting: (p224<=p79)
states: 22,218,490,107,024 (13)
abstracting: (p35<=p146)
states: 34,282,293,671,513 (13)
abstracting: (2<=p119)
states: 0
abstracting: (p39<=p124)
states: 34,830,664,181,981 (13)
-> the formula is TRUE

FORMULA DES-PT-40a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 4.840sec

checking: EF [[3<=p155 & [[1<=p206 | 1<=p149] & [p171<=p229 | p237<=p57]]]]
normalized: E [true U [3<=p155 & [[p171<=p229 | p237<=p57] & [1<=p206 | 1<=p149]]]]

abstracting: (1<=p149)
states: 943,319,052,104 (11)
abstracting: (1<=p206)
states: 13,012,066,055,068 (13)
abstracting: (p237<=p57)
states: 23,769,438,310,192 (13)
abstracting: (p171<=p229)
states: 22,213,532,428,377 (13)
abstracting: (3<=p155)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.778sec

totally nodes used: 505541919(5.1e+08)
number of garbage collections: 5
fire ops cache: hits/miss/sum: 379813489 490938256 870751745
used/not used/entry size/cache size: 61932462 5176402 16 1024MB
basic ops cache: hits/miss/sum: 735177379 1068991292 1804168671
used/not used/entry size/cache size: 16777216 0 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: 691491 856918 1548409
used/not used/entry size/cache size: 338885 1758267 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 2706167
1 8667548
2 13899551
3 14893589
4 11971709
5 7720556
6 4151001
7 1917964
8 774361
9 279595
>= 10 126823

Total processing time: 19m46.803sec


BK_STOP 1494457326168

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

70967 83735 90874 86075 89643 89318 88791 92681
iterations count:871957 (3774), effective:56567 (244)

initing FirstDep: 0m 0.001sec

109310 109086 114992
iterations count:351880 (1523), effective:22519 (97)
111331 115898
iterations count:236609 (1024), effective:14867 (64)
115447
iterations count:156569 (677), effective:13352 (57)
106550
iterations count:119644 (517), effective:10864 (47)

iterations count:33947 (146), effective:1749 (7)

iterations count:37470 (162), effective:1835 (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-40a"
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/DES-PT-40a.tgz
mv DES-PT-40a 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 DES-PT-40a, 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 r011-ebro-149436297200304"
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 ;