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 Eratosthenes-PT-200, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r021-blw3-149440255100340
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494459776398

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: Eratosthenes_PT_200
(NrP: 199 NrTr: 699 NrArc: 2097)

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

net check time: 0m 0.000sec

init dd package: 0m 1.185sec


RS generation: 0m 0.439sec


-> reachability set: #nodes 199 (2.0e+02) #states 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)



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

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

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

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [1<=p179]
normalized: ~ [E [true U ~ [1<=p179]]]

abstracting: (1<=p179)
states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p51<=p23]
normalized: ~ [E [true U ~ [p51<=p23]]]

abstracting: (p51<=p23)
states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[2<=p97 & 2<=p71]] & ~ [2<=p186]]]
normalized: ~ [E [true U ~ [[~ [2<=p186] & ~ [[2<=p97 & 2<=p71]]]]]]

abstracting: (2<=p71)
states: 0
abstracting: (2<=p97)
states: 0
abstracting: (2<=p186)
states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [~ [~ [[3<=p71 & p177<=p183]]]]
normalized: E [true U [3<=p71 & p177<=p183]]

abstracting: (p177<=p183)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (3<=p71)
states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[3<=p41 | ~ [[3<=p144 & 3<=p176]]]]
normalized: ~ [E [true U ~ [[3<=p41 | ~ [[3<=p144 & 3<=p176]]]]]]

abstracting: (3<=p176)
states: 0
abstracting: (3<=p144)
states: 0
abstracting: (3<=p41)
states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p165 & [~ [3<=p175] | [3<=p198 | 1<=p15]]]]
normalized: E [true U [2<=p165 & [[3<=p198 | 1<=p15] | ~ [3<=p175]]]]

abstracting: (3<=p175)
states: 0
abstracting: (1<=p15)
states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (3<=p198)
states: 0
abstracting: (2<=p165)
states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [~ [[[3<=p103 | 2<=p36] | [2<=p79 & p105<=p85]]]]
normalized: ~ [E [true U [[2<=p79 & p105<=p85] | [3<=p103 | 2<=p36]]]]

abstracting: (2<=p36)
states: 0
abstracting: (3<=p103)
states: 0
abstracting: (p105<=p85)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (2<=p79)
states: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [~ [[[p83<=p67 & p67<=p140] | [p65<=p109 & 1<=p111]]]]
normalized: E [true U ~ [[[p65<=p109 & 1<=p111] | [p83<=p67 & p67<=p140]]]]

abstracting: (p67<=p140)
states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p83<=p67)
states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (1<=p111)
states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p65<=p109)
states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.053sec

checking: AG [[[~ [p24<=p20] | ~ [2<=p9]] | [p35<=p150 | p172<=p145]]]
normalized: ~ [E [true U ~ [[[~ [p24<=p20] | ~ [2<=p9]] | [p35<=p150 | p172<=p145]]]]]

abstracting: (p172<=p145)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p35<=p150)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (2<=p9)
states: 0
abstracting: (p24<=p20)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
-> the formula is TRUE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[[[p49<=p21 & 3<=p164] | [1<=p44 & 2<=p52]] & [~ [p111<=p53] & 2<=p23]]]
normalized: E [true U [[2<=p23 & ~ [p111<=p53]] & [[1<=p44 & 2<=p52] | [p49<=p21 & 3<=p164]]]]

abstracting: (3<=p164)
states: 0
abstracting: (p49<=p21)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (2<=p52)
states: 0
abstracting: (1<=p44)
states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p111<=p53)
states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (2<=p23)
states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: AG [[2<=p3 | [[p48<=p187 & p78<=p34] | [p139<=p143 | p21<=p68]]]]
normalized: ~ [E [true U ~ [[2<=p3 | [[p48<=p187 & p78<=p34] | [p139<=p143 | p21<=p68]]]]]]

abstracting: (p21<=p68)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p139<=p143)
states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (p78<=p34)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p48<=p187)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (2<=p3)
states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.062sec

checking: EF [[[~ [p128<=p137] | [p62<=p150 & p70<=p13]] & [~ [p74<=p21] & 2<=p144]]]
normalized: E [true U [[2<=p144 & ~ [p74<=p21]] & [[p62<=p150 & p70<=p13] | ~ [p128<=p137]]]]

abstracting: (p128<=p137)
states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (p70<=p13)
states: 11,417,981,541,647,679,048,466,287,755,595,961,091,061,972,992 (46)
abstracting: (p62<=p150)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p74<=p21)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (2<=p144)
states: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[[[1<=p4 | p89<=p154] | [3<=p19 & p186<=p180]] | ~ [[p104<=p111 & p145<=p196]]]]
normalized: ~ [E [true U ~ [[[[1<=p4 | p89<=p154] | [3<=p19 & p186<=p180]] | ~ [[p104<=p111 & p145<=p196]]]]]]

abstracting: (p145<=p196)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p104<=p111)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (p186<=p180)
states: 8,563,486,156,235,759,286,349,715,816,696,970,818,296,479,744 (45)
abstracting: (3<=p19)
states: 0
abstracting: (p89<=p154)
states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
abstracting: (1<=p4)
states: 5,708,990,770,823,839,524,233,143,877,797,980,545,530,986,496 (45)
-> the formula is FALSE

FORMULA Eratosthenes-PT-200-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

totally nodes used: 887192(8.9e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 319898 1657162 1977060
used/not used/entry size/cache size: 1637051 65471813 16 1024MB
basic ops cache: hits/miss/sum: 159230 865108 1024338
used/not used/entry size/cache size: 892890 15884326 12 192MB
unary ops cache: hits/miss/sum: 0 19701 19701
used/not used/entry size/cache size: 19700 8368908 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: 2010 2040 4050
used/not used/entry size/cache size: 2040 2095112 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 66223120
1 884297
2 1446
3 1
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 2.449sec


BK_STOP 1494459778877

--------------------
content from stderr:

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p103
p137
p109
p163
p131
p191
p167
p193
p101
p173
p127
p149
p107
p139
p157
p179
p181
p113
p197
p151
p199

The net has transition(s) that can never fire:


check for constant places
p89
p83
p163
p97
p11
p13
p17
p19
p179
p23
p29
p157
p151
p137
p131
p109
p139
p31
p37
p149
p127
p47
p43
p41
p113
p59
p53
p2
p3
p167
p7
p5
p61
p67
p107
p101
p103
p199
p193
p191
p197
p73
p71
p173
p79
p181
found 46 constant places
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


iterations count:32611 (46), effective:153 (0)

initing FirstDep: 0m 0.002sec


iterations count:877 (1), effective:2 (0)

iterations count:1130 (1), effective:4 (0)

iterations count:1586 (2), effective:4 (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="Eratosthenes-PT-200"
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/Eratosthenes-PT-200.tgz
mv Eratosthenes-PT-200 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 Eratosthenes-PT-200, 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 r021-blw3-149440255100340"
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 ;