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-2265
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 r050kn-ebro-143236503400035
=====================================================================

--------------------
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 1432534003922

Model: Eratosthenes-PT-020
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Calculated like in [Noa99]
--memory=6 --suppress --rs-algorithm=3 --place-order=5

Marcie rev. 1429:1432M (built: crohr on 2014-10-22)
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 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 19 NrTr: 27 NrArc: 81)

net check time: 0m0sec

parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec

init dd package: 0m5sec


RS generation: 0m0sec


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



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

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: AG [[~ [~ [p8<=p18]] | [[3<=p14 | p18<=p4] | [2<=p2 & 2<=p14]]]]
normalized: ~ [E [true U ~ [[p8<=p18 | [[3<=p14 | p18<=p4] | [2<=p2 & 2<=p14]]]]]]

abstracting: (2<=p14) states: 0
abstracting: (2<=p2) states: 0
abstracting: (p18<=p4) states: 1,536 (3)
abstracting: (3<=p14) states: 0
abstracting: (p8<=p18) states: 1,536 (3)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[[p18<=p15 | 2<=p12] & ~ [2<=p12]] & [2<=p6 & [2<=p6 | p2<=p14]]]]
normalized: E [true U [[2<=p6 & [2<=p6 | p2<=p14]] & [~ [2<=p12] & [p18<=p15 | 2<=p12]]]]

abstracting: (2<=p12) states: 0
abstracting: (p18<=p15) states: 1,536 (3)
abstracting: (2<=p12) states: 0
abstracting: (p2<=p14) states: 1,024 (3)
abstracting: (2<=p6) states: 0
abstracting: (2<=p6) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [[~ [1<=p13] & 1<=p17]]
normalized: E [true U [1<=p17 & ~ [1<=p13]]]

abstracting: (1<=p13) states: 2,048 (3)
abstracting: (1<=p17) states: 2,048 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[~ [p10<=p15] | [3<=p11 | 3<=p9]] | [~ [3<=p12] & [p18<=p2 | 2<=p17]]]]
normalized: ~ [E [true U ~ [[[[3<=p11 | 3<=p9] | ~ [p10<=p15]] | [[p18<=p2 | 2<=p17] & ~ [3<=p12]]]]]]

abstracting: (3<=p12) states: 0
abstracting: (2<=p17) states: 0
abstracting: (p18<=p2) states: 2,048 (3)
abstracting: (p10<=p15) states: 1,536 (3)
abstracting: (3<=p9) states: 0
abstracting: (3<=p11) states: 0
-> the formula is TRUE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [~ [[[p2<=p14 & p8<=p10] | [1<=p2 | p17<=p3]]]]
normalized: E [true U ~ [[[1<=p2 | p17<=p3] | [p2<=p14 & p8<=p10]]]]

abstracting: (p8<=p10) states: 1,536 (3)
abstracting: (p2<=p14) states: 1,024 (3)
abstracting: (p17<=p3) states: 2,048 (3)
abstracting: (1<=p2) states: 2,048 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[~ [3<=p2] | p18<=p16] & [[3<=p14 | p16<=p3] & [1<=p17 & 2<=p18]]]]
normalized: E [true U [[[1<=p17 & 2<=p18] & [3<=p14 | p16<=p3]] & [p18<=p16 | ~ [3<=p2]]]]

abstracting: (3<=p2) states: 0
abstracting: (p18<=p16) states: 1,536 (3)
abstracting: (p16<=p3) states: 2,048 (3)
abstracting: (3<=p14) states: 0
abstracting: (2<=p18) states: 0
abstracting: (1<=p17) states: 2,048 (3)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[[p10<=p5 & p18<=p3] | [p9<=p12 | p6<=p7]] & [1<=p17 | [1<=p19 & 3<=p20]]]]
normalized: ~ [E [true U ~ [[[[p9<=p12 | p6<=p7] | [p10<=p5 & p18<=p3]] & [1<=p17 | [1<=p19 & 3<=p20]]]]]]

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

checking: EF [[p13<=p14 & ~ [1<=p19]]]
normalized: E [true U [p13<=p14 & ~ [1<=p19]]]

abstracting: (1<=p19) states: 2,048 (3)
abstracting: (p13<=p14) states: 1,024 (3)
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m7sec


BK_STOP 1432534011803

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

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: 0m0sec


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

initing FirstDep: 0m0sec

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="/users/gast00/fkordon/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-2265"
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 r050kn-ebro-143236503400035"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 ;