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-010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503400015
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432533981215

Model: Eratosthenes-PT-010
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5

parse successfull
net created successfully

(NrP: 9 NrTr: 8 NrArc: 24)

net check time: 0m0sec

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

init dd package: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 9 (9.0e+00) #states 32



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

checking: AF [AG [~ [p6<=p3]]]
normalized: ~ [EG [E [true U p6<=p3]]]

abstracting: (p6<=p3) states: 32

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EG [[p3<=p7 | ~ [3<=p5]]] | ~ [~ [EG [3<=p10]]]]
normalized: [EG [3<=p10] | EG [[p3<=p7 | ~ [3<=p5]]]]

abstracting: (3<=p5) states: 0
abstracting: (p3<=p7) states: 32

EG iterations: 0
abstracting: (3<=p10) states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [p2<=p5 & A [~ [2<=p6] U ~ [p9<=p6]]]
normalized: [p2<=p5 & [~ [EG [p9<=p6]] & ~ [E [2<=p6 U [2<=p6 & p9<=p6]]]]]

abstracting: (p9<=p6) states: 24
abstracting: (2<=p6) states: 0
abstracting: (2<=p6) states: 0
abstracting: (p9<=p6) states: 24
.
EG iterations: 1
abstracting: (p2<=p5) states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: A [[[p9<=p6 | p9<=p5] | ~ [2<=p2]] U [~ [p7<=p10] & [p9<=p7 & 2<=p8]]]
normalized: [~ [EG [~ [[[p9<=p7 & 2<=p8] & ~ [p7<=p10]]]]] & ~ [E [~ [[~ [2<=p2] | [p9<=p6 | p9<=p5]]] U [~ [[~ [2<=p2] | [p9<=p6 | p9<=p5]]] & ~ [[[p9<=p7 & 2<=p8] & ~ [p7<=p10]]]]]]]

abstracting: (p7<=p10) states: 16
abstracting: (2<=p8) states: 0
abstracting: (p9<=p7) states: 32
abstracting: (p9<=p5) states: 32
abstracting: (p9<=p6) states: 24
abstracting: (2<=p2) states: 0
abstracting: (p9<=p5) states: 32
abstracting: (p9<=p6) states: 24
abstracting: (2<=p2) states: 0
abstracting: (p7<=p10) states: 16
abstracting: (2<=p8) states: 0
abstracting: (p9<=p7) states: 32

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [EF [[p3<=p3 | p2<=p2]]]
normalized: EG [E [true U [p3<=p3 | p2<=p2]]]

abstracting: (p2<=p2) states: 32
abstracting: (p3<=p3) states: 32

EG iterations: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EG [~ [[p7<=p10 & 3<=p10]]] & p8<=p3]
normalized: [p8<=p3 & EG [~ [[p7<=p10 & 3<=p10]]]]

abstracting: (3<=p10) states: 0
abstracting: (p7<=p10) states: 16

EG iterations: 0
abstracting: (p8<=p3) states: 32
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [p7<=p10 & ~ [EG [[1<=p3 | 2<=p6]]]]
normalized: [p7<=p10 & ~ [EG [[1<=p3 | 2<=p6]]]]

abstracting: (2<=p6) states: 0
abstracting: (1<=p3) states: 32

EG iterations: 0
abstracting: (p7<=p10) states: 16
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EG [~ [2<=p5]]
normalized: EG [~ [2<=p5]]

abstracting: (2<=p5) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AF [AG [p7<=p6]] & [p9<=p4 | [p6<=p10 & [1<=p4 | [p10<=p5 | 1<=p6]]]]]
normalized: [[p9<=p4 | [p6<=p10 & [1<=p4 | [p10<=p5 | 1<=p6]]]] & ~ [EG [E [true U ~ [p7<=p6]]]]]

abstracting: (p7<=p6) states: 16

EG iterations: 0
abstracting: (1<=p6) states: 16
abstracting: (p10<=p5) states: 32
abstracting: (1<=p4) states: 16
abstracting: (p6<=p10) states: 24
abstracting: (p9<=p4) states: 24
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [EF [[1<=p7 & p7<=p2]]] | EG [AF [p3<=p3]]]
normalized: [EG [~ [EG [~ [p3<=p3]]]] | ~ [E [true U [1<=p7 & p7<=p2]]]]

abstracting: (p7<=p2) states: 32
abstracting: (1<=p7) states: 32
abstracting: (p3<=p3) states: 32
.
EG iterations: 1

EG iterations: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: ~ [AX [EG [p9<=p3]]]
normalized: EX [~ [EG [p9<=p3]]]

abstracting: (p9<=p3) states: 32

EG iterations: 0
.-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [~ [2<=p5] & ~ [AF [[2<=p3 & p4<=p7]]]]
normalized: [EG [~ [[2<=p3 & p4<=p7]]] & ~ [2<=p5]]

abstracting: (2<=p5) states: 0
abstracting: (p4<=p7) states: 32
abstracting: (2<=p3) states: 0

EG iterations: 0
-> the formula is TRUE

FORMULA Eratosthenes-PT-010-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AF [[~ [p9<=p2] | [2<=p10 & 1<=p9]]] & ~ [AG [~ [1<=p7]]]]
normalized: [E [true U 1<=p7] & ~ [EG [~ [[[2<=p10 & 1<=p9] | ~ [p9<=p2]]]]]]

abstracting: (p9<=p2) states: 32
abstracting: (1<=p9) states: 16
abstracting: (2<=p10) states: 0

EG iterations: 0
abstracting: (1<=p7) states: 32
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [EF [[[3<=p8 | 3<=p8] & ~ [p2<=p10]]] & [~ [AX [p2<=p10]] & AF [[3<=p3 & p10<=p9]]]]
normalized: [[~ [EG [~ [[3<=p3 & p10<=p9]]]] & EX [~ [p2<=p10]]] & E [true U [~ [p2<=p10] & [3<=p8 | 3<=p8]]]]

abstracting: (3<=p8) states: 0
abstracting: (3<=p8) states: 0
abstracting: (p2<=p10) states: 16
abstracting: (p2<=p10) states: 16
.abstracting: (p10<=p9) states: 24
abstracting: (3<=p3) states: 0

EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: [AF [~ [[p8<=p9 | 3<=p5]]] | ~ [AF [1<=p4]]]
normalized: [EG [~ [1<=p4]] | ~ [EG [[p8<=p9 | 3<=p5]]]]

abstracting: (3<=p5) states: 0
abstracting: (p8<=p9) states: 24
.
EG iterations: 1
abstracting: (1<=p4) states: 16
.
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AF [EX [[1<=p8 & 2<=p3]]]
normalized: ~ [EG [~ [EX [[1<=p8 & 2<=p3]]]]]

abstracting: (2<=p3) states: 0
abstracting: (1<=p8) states: 16
.
EG iterations: 0
-> the formula is FALSE

FORMULA Eratosthenes-PT-010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1432533989708

--------------------
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:20 (2), effective:5 (0)

initing FirstDep: 0m0sec


iterations count:8 (1), effective:0 (0)

iterations count:8 (1), effective:0 (0)

iterations count:9 (1), effective:1 (0)

iterations count:8 (1), effective:0 (0)

iterations count:8 (1), effective:0 (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-010"
export BK_EXAMINATION="CTLCardinality"
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-010.tgz
mv Eratosthenes-PT-010 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-010, examination is CTLCardinality"
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-143236503400015"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.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 ;