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

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

=== Now, execution of the tool begins

BK_START 1495823190895

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_07a
(NrP: 229 NrTr: 1597 NrArc: 6125)

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

net check time: 0m 0.001sec

init dd package: 0m 1.405sec


RS generation: 0m11.639sec


-> reachability set: #nodes 103406 (1.0e+05) #states 240,100,000,001 (11)



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

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

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

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

MC time: 0m 0.049sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

checking: AG [p24<=p148]
normalized: ~ [E [true U ~ [p24<=p148]]]

abstracting: (p24<=p148)
states: 240,100,000,001 (11)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [~ [~ [p204<=p142]]]
normalized: ~ [E [true U ~ [p204<=p142]]]

abstracting: (p204<=p142)
states: 240,100,000,001 (11)
-> the formula is TRUE

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

MC time: 0m 0.013sec

checking: AG [[2<=p66 | ~ [~ [p80<=p206]]]]
normalized: ~ [E [true U ~ [[2<=p66 | p80<=p206]]]]

abstracting: (p80<=p206)
states: 240,100,000,001 (11)
abstracting: (2<=p66)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[~ [~ [2<=p64]] & ~ [~ [p148<=p137]]]]
normalized: E [true U [2<=p64 & p148<=p137]]

abstracting: (p148<=p137)
states: 240,100,000,001 (11)
abstracting: (2<=p64)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.036sec

checking: EF [[~ [1<=p179] & [~ [3<=p202] & [p116<=p170 & 1<=p180]]]]
normalized: E [true U [~ [1<=p179] & [[p116<=p170 & 1<=p180] & ~ [3<=p202]]]]

abstracting: (3<=p202)
states: 0
abstracting: (1<=p180)
states: 240,100,000,000 (11)
abstracting: (p116<=p170)
states: 240,100,000,001 (11)
abstracting: (1<=p179)
states: 240,100,000,000 (11)
-> the formula is FALSE

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

MC time: 0m 0.087sec

checking: AG [[~ [[p23<=p2 & 3<=p220]] | [~ [3<=p180] & [2<=p78 & 1<=p129]]]]
normalized: ~ [E [true U ~ [[[~ [3<=p180] & [2<=p78 & 1<=p129]] | ~ [[p23<=p2 & 3<=p220]]]]]]

abstracting: (3<=p220)
states: 0
abstracting: (p23<=p2)
states: 210,700,000,001 (11)
abstracting: (1<=p129)
states: 240,100,000,000 (11)
abstracting: (2<=p78)
states: 0
abstracting: (3<=p180)
states: 0
-> the formula is TRUE

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

MC time: 0m 0.045sec

checking: EF [~ [[[p185<=p121 & p62<=p55] | [1<=p183 & 2<=p16]]]]
normalized: E [true U ~ [[[1<=p183 & 2<=p16] | [p185<=p121 & p62<=p55]]]]

abstracting: (p62<=p55)
states: 218,491,000,001 (11)
abstracting: (p185<=p121)
states: 240,100,000,001 (11)
abstracting: (2<=p16)
states: 0
abstracting: (1<=p183)
states: 240,100,000,000 (11)
-> the formula is TRUE

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

MC time: 0m14.782sec

checking: AG [[[[p84<=p194 | 2<=p52] | ~ [p188<=p186]] & ~ [~ [p228<=p199]]]]
normalized: ~ [E [true U ~ [[p228<=p199 & [[p84<=p194 | 2<=p52] | ~ [p188<=p186]]]]]]

abstracting: (p188<=p186)
states: 240,100,000,001 (11)
abstracting: (2<=p52)
states: 0
abstracting: (p84<=p194)
states: 240,100,000,001 (11)
abstracting: (p228<=p199)
states: 240,100,000,001 (11)
-> the formula is TRUE

FORMULA DLCround-PT-07a-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AG [[p105<=p68 | [~ [p93<=p28] & [2<=p147 | p119<=p1]]]]
normalized: ~ [E [true U ~ [[p105<=p68 | [~ [p93<=p28] & [2<=p147 | p119<=p1]]]]]]

abstracting: (p119<=p1)
states: 34,300,000,001 (10)
abstracting: (2<=p147)
states: 0
abstracting: (p93<=p28)
states: 219,520,000,001 (11)
abstracting: (p105<=p68)
states: 218,491,000,001 (11)
-> the formula is FALSE

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

MC time: 0m 0.417sec

checking: AG [[p209<=p101 | [p72<=p196 | [2<=p55 & p79<=p100]]]]
normalized: ~ [E [true U ~ [[p209<=p101 | [p72<=p196 | [2<=p55 & p79<=p100]]]]]]

abstracting: (p79<=p100)
states: 218,491,000,001 (11)
abstracting: (2<=p55)
states: 0
abstracting: (p72<=p196)
states: 240,100,000,001 (11)
abstracting: (p209<=p101)
states: 24,010,000,001 (10)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[[~ [p97<=p139] & [3<=p90 & p152<=p65]] | ~ [[p127<=p209 | 1<=p71]]]]
normalized: E [true U [~ [[p127<=p209 | 1<=p71]] | [[3<=p90 & p152<=p65] & ~ [p97<=p139]]]]

abstracting: (p97<=p139)
states: 240,100,000,001 (11)
abstracting: (p152<=p65)
states: 24,010,000,001 (10)
abstracting: (3<=p90)
states: 0
abstracting: (1<=p71)
states: 24,010,000,000 (10)
abstracting: (p127<=p209)
states: 240,100,000,001 (11)
-> the formula is FALSE

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

MC time: 0m 0.003sec

checking: EF [[[[p46<=p129 & p121<=p168] & [p42<=p134 & 3<=p201]] & ~ [1<=p38]]]
normalized: E [true U [~ [1<=p38] & [[p42<=p134 & 3<=p201] & [p46<=p129 & p121<=p168]]]]

abstracting: (p121<=p168)
states: 240,100,000,001 (11)
abstracting: (p46<=p129)
states: 240,100,000,001 (11)
abstracting: (3<=p201)
states: 0
abstracting: (p42<=p134)
states: 240,100,000,001 (11)
abstracting: (1<=p38)
states: 24,010,000,000 (10)
-> the formula is FALSE

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

MC time: 0m 0.097sec

totally nodes used: 7604800(7.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16745507 79417522 96163029
used/not used/entry size/cache size: 46073688 21035176 16 1024MB
basic ops cache: hits/miss/sum: 2122116 9733273 11855389
used/not used/entry size/cache size: 10618924 6158292 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: 36654 168399 205053
used/not used/entry size/cache size: 162259 1934893 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 59892636
1 6840169
2 363827
3 11951
4 281
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m30.000sec


BK_STOP 1495823220932

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


iterations count:52246 (32), effective:97 (0)

initing FirstDep: 0m 0.012sec


iterations count:7733 (4), effective:11 (0)

iterations count:9059 (5), effective:14 (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-07a"
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-07a.tgz
mv DLCround-PT-07a 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-07a, 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-149580951600277"
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 ;