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 CircularTrains-PT-024, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r008kn-ebro-143214239100360
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1432335686676

Model: CircularTrains-PT-024
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: 48 NrTr: 24 NrArc: 96)

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 778 (7.8e+02) #states 86,515 (4)



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

checking: EF [[[~ [Section_22<=F23] & Section_20<=Section_8] & [2<=F17 | [F17<=Section_6 & Section_11<=Section_21]]]]
normalized: E [true U [[Section_20<=Section_8 & ~ [Section_22<=F23]] & [2<=F17 | [F17<=Section_6 & Section_11<=Section_21]]]]

abstracting: (Section_11<=Section_21) states: 64,774 (4)
abstracting: (F17<=Section_6) states: 28,799 (4)
abstracting: (2<=F17) states: 30,758 (4)
abstracting: (Section_22<=F23) states: 86,515 (4)
abstracting: (Section_20<=Section_8) states: 64,774 (4)
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[F7<=Section_5 | F6<=Section_4] & [F1<=F1 & 2<=F13]]]]
normalized: ~ [E [true U [[F1<=F1 & 2<=F13] & [F7<=Section_5 | F6<=Section_4]]]]

abstracting: (F6<=Section_4) states: 59,746 (4)
abstracting: (F7<=Section_5) states: 66,993 (4)
abstracting: (2<=F13) states: 0
abstracting: (F1<=F1) states: 86,515 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [3<=F12] | ~ [1<=Section_8]] | [[2<=Section_12 & 2<=F7] | ~ [Section_2<=Section_5]]]]
normalized: ~ [E [true U ~ [[[~ [Section_2<=Section_5] | [2<=Section_12 & 2<=F7]] | [~ [1<=Section_8] | ~ [3<=F12]]]]]]

abstracting: (3<=F12) states: 0
abstracting: (1<=Section_8) states: 34,016 (4)
abstracting: (2<=F7) states: 0
abstracting: (2<=Section_12) states: 0
abstracting: (Section_2<=Section_5) states: 64,774 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [[3<=F18 | 3<=Section_24]] | [[3<=F13 | F6<=Section_13] & [3<=Section_4 | F3<=F22]]]]
normalized: ~ [E [true U ~ [[[[3<=Section_4 | F3<=F22] & [3<=F13 | F6<=Section_13]] | ~ [[3<=F18 | 3<=Section_24]]]]]]

abstracting: (3<=Section_24) states: 0
abstracting: (3<=F18) states: 0
abstracting: (F6<=Section_13) states: 59,746 (4)
abstracting: (3<=F13) states: 0
abstracting: (F3<=F22) states: 64,774 (4)
abstracting: (3<=Section_4) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[~ [Section_13<=Section_2] & [2<=Section_7 & F18<=F5]]]]
normalized: ~ [E [true U [[2<=Section_7 & F18<=F5] & ~ [Section_13<=Section_2]]]]

abstracting: (Section_13<=Section_2) states: 75,279 (4)
abstracting: (F18<=F5) states: 80,826 (4)
abstracting: (2<=Section_7) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[~ [1<=Section_19] & 3<=Section_18]]]
normalized: ~ [E [true U [3<=Section_18 & ~ [1<=Section_19]]]]

abstracting: (1<=Section_19) states: 18,483 (4)
abstracting: (3<=Section_18) states: 0
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[2<=Section_8 & [[1<=Section_9 & 1<=F9] & [F15<=Section_8 | 3<=F19]]]]
normalized: E [true U [2<=Section_8 & [[F15<=Section_8 | 3<=F19] & [1<=Section_9 & 1<=F9]]]]

abstracting: (1<=F9) states: 34,016 (4)
abstracting: (1<=Section_9) states: 34,016 (4)
abstracting: (3<=F19) states: 0
abstracting: (F15<=Section_8) states: 66,993 (4)
abstracting: (2<=Section_8) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[~ [1<=Section_18] | [2<=Section_24 & F8<=Section_15]] & 3<=Section_13]]
normalized: E [true U [3<=Section_13 & [[2<=Section_24 & F8<=Section_15] | ~ [1<=Section_18]]]]

abstracting: (1<=Section_18) states: 34,016 (4)
abstracting: (F8<=Section_15) states: 28,799 (4)
abstracting: (2<=Section_24) states: 0
abstracting: (3<=Section_13) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [[3<=Section_2 & 3<=F3]]]]
normalized: E [true U [3<=Section_2 & 3<=F3]]

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

FORMULA CircularTrains-PT-024-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[2<=F9 & [~ [F13<=F24] | ~ [F10<=Section_18]]]]
normalized: E [true U [2<=F9 & [~ [F10<=Section_18] | ~ [F13<=F24]]]]

abstracting: (F13<=F24) states: 64,774 (4)
abstracting: (F10<=Section_18) states: 66,993 (4)
abstracting: (2<=F9) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [3<=F9] | ~ [F10<=F17]]]
normalized: ~ [E [true U ~ [[~ [F10<=F17] | ~ [3<=F9]]]]]

abstracting: (3<=F9) states: 0
abstracting: (F10<=F17) states: 80,826 (4)
-> the formula is TRUE

FORMULA CircularTrains-PT-024-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m10sec


BK_STOP 1432335697424

--------------------
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:464 (19), effective:96 (4)

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="CircularTrains-PT-024"
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/CircularTrains-PT-024.tgz
mv CircularTrains-PT-024 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 CircularTrains-PT-024, 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 r008kn-ebro-143214239100360"
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 ;