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

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

=== Now, execution of the tool begins

BK_START 1495823107590

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_04a
(NrP: 139 NrTr: 823 NrArc: 3074)

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

net check time: 0m 0.000sec

init dd package: 0m 1.260sec


RS generation: 0m 0.371sec


-> reachability set: #nodes 8594 (8.6e+03) #states 240,100,001 (8)



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

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

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

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

MC time: 0m 0.004sec

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

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

FORMULA DLCround-PT-04a-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [p48<=p122]
normalized: ~ [E [true U ~ [p48<=p122]]]

abstracting: (p48<=p122)
states: 240,100,001 (8)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[1<=p80 & ~ [~ [1<=p44]]]]
normalized: E [true U [1<=p80 & 1<=p44]]

abstracting: (1<=p44)
states: 24,010,000 (7)
abstracting: (1<=p80)
states: 240,100,000 (8)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.963sec

checking: EF [[2<=p92 & 1<=p50]]
normalized: E [true U [2<=p92 & 1<=p50]]

abstracting: (1<=p50)
states: 24,010,000 (7)
abstracting: (2<=p92)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [p98<=p91]
normalized: ~ [E [true U ~ [p98<=p91]]]

abstracting: (p98<=p91)
states: 240,100,001 (8)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[1<=p72 & p46<=p138]]
normalized: E [true U [1<=p72 & p46<=p138]]

abstracting: (p46<=p138)
states: 240,100,001 (8)
abstracting: (1<=p72)
states: 24,010,000 (7)
-> the formula is TRUE

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

MC time: 0m 0.030sec

checking: AG [~ [[3<=p135 & [2<=p127 | 3<=p138]]]]
normalized: ~ [E [true U [3<=p135 & [2<=p127 | 3<=p138]]]]

abstracting: (3<=p138)
states: 0
abstracting: (2<=p127)
states: 0
abstracting: (3<=p135)
states: 0
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[2<=p85 & 2<=p93] | 1<=p4] | [[3<=p23 | p100<=p95] | p32<=p103]]]
normalized: ~ [E [true U ~ [[[1<=p4 | [2<=p85 & 2<=p93]] | [p32<=p103 | [3<=p23 | p100<=p95]]]]]]

abstracting: (p100<=p95)
states: 240,100,001 (8)
abstracting: (3<=p23)
states: 0
abstracting: (p32<=p103)
states: 240,100,001 (8)
abstracting: (2<=p93)
states: 0
abstracting: (2<=p85)
states: 0
abstracting: (1<=p4)
states: 34,300,000 (7)
-> the formula is TRUE

FORMULA DLCround-PT-04a-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[[2<=p22 | [3<=p73 | 3<=p0]] | [[p64<=p31 & p40<=p107] | p11<=p28]]]
normalized: ~ [E [true U ~ [[[2<=p22 | [3<=p73 | 3<=p0]] | [[p64<=p31 & p40<=p107] | p11<=p28]]]]]

abstracting: (p11<=p28)
states: 210,700,001 (8)
abstracting: (p40<=p107)
states: 240,100,001 (8)
abstracting: (p64<=p31)
states: 218,491,001 (8)
abstracting: (3<=p0)
states: 0
abstracting: (3<=p73)
states: 0
abstracting: (2<=p22)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.140sec

checking: EF [[[[p13<=p31 | p78<=p82] | [p32<=p69 | 1<=p137]] & ~ [p44<=p95]]]
normalized: E [true U [[[p13<=p31 | p78<=p82] | [p32<=p69 | 1<=p137]] & ~ [p44<=p95]]]

abstracting: (p44<=p95)
states: 240,100,001 (8)
abstracting: (1<=p137)
states: 240,100,000 (8)
abstracting: (p32<=p69)
states: 218,491,001 (8)
abstracting: (p78<=p82)
states: 240,100,001 (8)
abstracting: (p13<=p31)
states: 209,230,001 (8)
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: AG [[[[p70<=p122 | 2<=p54] & [p88<=p66 | p137<=p103]] | [~ [3<=p98] | ~ [p2<=p113]]]]
normalized: ~ [E [true U ~ [[[~ [p2<=p113] | ~ [3<=p98]] | [[p70<=p122 | 2<=p54] & [p88<=p66 | p137<=p103]]]]]]

abstracting: (p137<=p103)
states: 240,100,001 (8)
abstracting: (p88<=p66)
states: 24,010,001 (7)
abstracting: (2<=p54)
states: 0
abstracting: (p70<=p122)
states: 240,100,001 (8)
abstracting: (3<=p98)
states: 0
abstracting: (p2<=p113)
states: 240,100,001 (8)
-> the formula is TRUE

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

MC time: 0m 0.004sec

checking: EF [[[[2<=p81 & p54<=p61] & p28<=p31] & [~ [p51<=p50] | [p111<=p64 & p6<=p40]]]]
normalized: E [true U [[[2<=p81 & p54<=p61] & p28<=p31] & [~ [p51<=p50] | [p111<=p64 & p6<=p40]]]]

abstracting: (p6<=p40)
states: 209,230,001 (8)
abstracting: (p111<=p64)
states: 24,010,001 (7)
abstracting: (p51<=p50)
states: 216,090,001 (8)
abstracting: (p28<=p31)
states: 209,230,001 (8)
abstracting: (p54<=p61)
states: 218,491,001 (8)
abstracting: (2<=p81)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.010sec

totally nodes used: 1031188(1.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1474210 5376958 6851168
used/not used/entry size/cache size: 5006484 62102380 16 1024MB
basic ops cache: hits/miss/sum: 411494 1372781 1784275
used/not used/entry size/cache size: 2469782 14307434 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: 11325 33927 45252
used/not used/entry size/cache size: 33721 2063431 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 66082018
1 1022511
2 4328
3 7
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 3.546sec


BK_STOP 1495823111164

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


iterations count:17669 (21), effective:70 (0)

initing FirstDep: 0m 0.006sec


iterations count:1976 (2), effective:10 (0)

iterations count:5353 (6), effective:10 (0)

iterations count:4571 (5), effective:18 (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-04a"
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-04a.tgz
mv DLCround-PT-04a 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-04a, 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-149580951500223"
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 ;