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-2979
Executing tool marcie
Input is Eratosthenes-PT-020, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r053kn-smll-146358767700016
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463597987016


Marcie rev. 8535M (built: crohr on 2016-04-27)
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 --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: Eratosthenes_PT_020
(NrP: 19 NrTr: 27 NrArc: 81)

net check time: 0m 0.000sec

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

init dd package: 0m 4.256sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 19 (1.9e+01) #states 2,048 (3)



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

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

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

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

MC time: 0m 0.000sec

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

abstracting: (1<=p2) states: 2,048 (3)
-> the formula is TRUE

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

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

MC time: 0m 0.000sec

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

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

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (1<=p11) states: 2,048 (3)
-> the formula is TRUE

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [p20<=p11]
normalized: ~ [E [true U ~ [p20<=p11]]]

abstracting: (p20<=p11) states: 2,048 (3)
-> the formula is TRUE

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[3<=p10 & 1<=p15]] & ~ [~ [3<=p20]]]]
normalized: E [true U [3<=p20 & ~ [[3<=p10 & 1<=p15]]]]

abstracting: (1<=p15) states: 1,024 (3)
abstracting: (3<=p10) states: 0
abstracting: (3<=p20) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[[2<=p10 | ~ [2<=p11]] | p5<=p12]]
normalized: ~ [E [true U ~ [[p5<=p12 | [2<=p10 | ~ [2<=p11]]]]]]

abstracting: (2<=p11) states: 0
abstracting: (2<=p10) states: 0
abstracting: (p5<=p12) states: 1,024 (3)
-> the formula is TRUE

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[~ [[p18<=p17 & 2<=p5]] | 1<=p6]]
normalized: ~ [E [true U ~ [[1<=p6 | ~ [[p18<=p17 & 2<=p5]]]]]]

abstracting: (2<=p5) states: 0
abstracting: (p18<=p17) states: 2,048 (3)
abstracting: (1<=p6) states: 1,024 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[[~ [p15<=p10] & 2<=p6] & ~ [p2<=p2]]]
normalized: E [true U [[2<=p6 & ~ [p15<=p10]] & ~ [p2<=p2]]]

abstracting: (p2<=p2) states: 2,048 (3)
abstracting: (p15<=p10) states: 1,536 (3)
abstracting: (2<=p6) states: 0
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[[3<=p11 & [p13<=p16 & 3<=p8]] & ~ [~ [p10<=p16]]]]
normalized: E [true U [p10<=p16 & [3<=p11 & [p13<=p16 & 3<=p8]]]]

abstracting: (3<=p8) states: 0
abstracting: (p13<=p16) states: 1,024 (3)
abstracting: (3<=p11) states: 0
abstracting: (p10<=p16) states: 1,536 (3)
-> the formula is FALSE

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [[p7<=p9 | p8<=p19]] & [~ [p16<=p2] & ~ [1<=p12]]]]
normalized: E [true U [~ [[p7<=p9 | p8<=p19]] & [~ [p16<=p2] & ~ [1<=p12]]]]

abstracting: (1<=p12) states: 1,024 (3)
abstracting: (p16<=p2) states: 2,048 (3)
abstracting: (p8<=p19) states: 2,048 (3)
abstracting: (p7<=p9) states: 1,024 (3)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[~ [p15<=p13] & [[p11<=p19 & 3<=p15] | ~ [p19<=p19]]]]
normalized: E [true U [~ [p15<=p13] & [[p11<=p19 & 3<=p15] | ~ [p19<=p19]]]]

abstracting: (p19<=p19) states: 2,048 (3)
abstracting: (3<=p15) states: 0
abstracting: (p11<=p19) states: 2,048 (3)
abstracting: (p15<=p13) states: 2,048 (3)
-> the formula is FALSE

FORMULA Eratosthenes-PT-020-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[p12<=p6 | p20<=p3] | [p8<=p12 | p11<=p7]] | [~ [p20<=p5] | [3<=p10 | 2<=p11]]]]
normalized: ~ [E [true U ~ [[[[p8<=p12 | p11<=p7] | [p12<=p6 | p20<=p3]] | [~ [p20<=p5] | [3<=p10 | 2<=p11]]]]]]

abstracting: (2<=p11) states: 0
abstracting: (3<=p10) states: 0
abstracting: (p20<=p5) states: 2,048 (3)
abstracting: (p20<=p3) states: 2,048 (3)
abstracting: (p12<=p6) states: 1,536 (3)
abstracting: (p11<=p7) states: 2,048 (3)
abstracting: (p8<=p12) states: 1,536 (3)
-> the formula is TRUE

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

MC time: 0m 0.000sec


Total processing time: 0m 5.864sec


BK_STOP 1463597992920

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

check for maximal unmarked siphon
found
The net has a maximal unmarked siphon:
p13
p19
p17
p11

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


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


iterations count:83 (3), effective:11 (0)

initing FirstDep: 0m 0.000sec

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-020"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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-020.tgz
mv Eratosthenes-PT-020 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool marcie"
echo " Input is Eratosthenes-PT-020, 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 r053kn-smll-146358767700016"
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 ;