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 S_CircularTrains-PT-012, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r197kn-qhx2-146444262300061
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1465118240497


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: CircularTrains_PT_012
(NrP: 24 NrTr: 12 NrArc: 48)

net check time: 0m 0.000sec

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

init dd package: 0m16.109sec


RS generation: 0m 0.003sec


-> reachability set: #nodes 203 (2.0e+02) #states 195



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

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

abstracting: (1<=F10) states: 75
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [~ [1<=Section_11]]
normalized: E [true U ~ [1<=Section_11]]

abstracting: (1<=Section_11) states: 75
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

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

abstracting: (2<=F11) states: 69
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [[2<=F9 & ~ [3<=F3]]]]
normalized: ~ [E [true U [2<=F9 & ~ [3<=F3]]]]

abstracting: (3<=F3) states: 0
abstracting: (2<=F9) states: 0
-> the formula is TRUE

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

MC time: 0m 0.000sec

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

abstracting: (Section_5<=Section_9) states: 144
-> the formula is FALSE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [Section_5<=F3]
normalized: E [true U Section_5<=F3]

abstracting: (Section_5<=F3) states: 165
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (F9<=F4) states: 144
-> the formula is FALSE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [F12<=Section_12]
normalized: E [true U F12<=Section_12]

abstracting: (F12<=Section_12) states: 120
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[~ [F5<=F4] | ~ [[Section_2<=Section_7 | 3<=F2]]]]
normalized: E [true U [~ [[Section_2<=Section_7 | 3<=F2]] | ~ [F5<=F4]]]

abstracting: (F5<=F4) states: 58
abstracting: (3<=F2) states: 0
abstracting: (Section_2<=Section_7) states: 137
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

checking: EF [[1<=F11 & [~ [F1<=F3] | [1<=Section_10 & F2<=Section_2]]]]
normalized: E [true U [1<=F11 & [~ [F1<=F3] | [1<=Section_10 & F2<=Section_2]]]]

abstracting: (F2<=Section_2) states: 75
abstracting: (1<=Section_10) states: 45
abstracting: (F1<=F3) states: 144
abstracting: (1<=F11) states: 171
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [[~ [[2<=F1 | F4<=F9]] | ~ [[Section_3<=F11 & 3<=F4]]]]
normalized: ~ [E [true U ~ [[~ [[Section_3<=F11 & 3<=F4]] | ~ [[2<=F1 | F4<=F9]]]]]]

abstracting: (F4<=F9) states: 144
abstracting: (2<=F1) states: 0
abstracting: (3<=F4) states: 0
abstracting: (Section_3<=F11) states: 189
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[[[3<=F1 & Section_1<=Section_1] & ~ [F3<=Section_5]] | F5<=Section_11]]
normalized: ~ [E [true U ~ [[F5<=Section_11 | [[3<=F1 & Section_1<=Section_1] & ~ [F3<=Section_5]]]]]]

abstracting: (F3<=Section_5) states: 165
abstracting: (Section_1<=Section_1) states: 195
abstracting: (3<=F1) states: 0
abstracting: (F5<=Section_11) states: 60
-> the formula is FALSE

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

MC time: 0m 0.002sec

checking: EF [[[[Section_5<=Section_5 & 3<=F7] | ~ [2<=Section_6]] & ~ [[Section_6<=Section_7 | 3<=Section_5]]]]
normalized: E [true U [[[Section_5<=Section_5 & 3<=F7] | ~ [2<=Section_6]] & ~ [[Section_6<=Section_7 | 3<=Section_5]]]]

abstracting: (3<=Section_5) states: 0
abstracting: (Section_6<=Section_7) states: 120
abstracting: (2<=Section_6) states: 0
abstracting: (3<=F7) states: 0
abstracting: (Section_5<=Section_5) states: 195
-> the formula is TRUE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: EF [[[F6<=F4 | Section_8<=Section_1] | ~ [[Section_9<=Section_5 & 2<=F7]]]]
normalized: E [true U [[F6<=F4 | Section_8<=Section_1] | ~ [[Section_9<=Section_5 & 2<=F7]]]]

abstracting: (2<=F7) states: 0
abstracting: (Section_9<=Section_5) states: 144
abstracting: (Section_8<=Section_1) states: 137
abstracting: (F6<=F4) states: 144
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: EF [[~ [~ [2<=F7]] | [[1<=Section_10 & F3<=Section_4] & [F2<=F2 & 3<=Section_6]]]]
normalized: E [true U [2<=F7 | [[1<=Section_10 & F3<=Section_4] & [F2<=F2 & 3<=Section_6]]]]

abstracting: (3<=Section_6) states: 0
abstracting: (F2<=F2) states: 195
abstracting: (F3<=Section_4) states: 120
abstracting: (1<=Section_10) states: 45
abstracting: (2<=F7) states: 0
-> the formula is FALSE

FORMULA CircularTrains-PT-012-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [[[[F4<=Section_3 | 3<=Section_3] & [1<=F10 & 2<=F9]] & [[F2<=Section_7 & F12<=F3] | 2<=Section_3]]]
normalized: ~ [E [true U ~ [[[[1<=F10 & 2<=F9] & [F4<=Section_3 | 3<=Section_3]] & [2<=Section_3 | [F2<=Section_7 & F12<=F3]]]]]]

abstracting: (F12<=F3) states: 144
abstracting: (F2<=Section_7) states: 48
abstracting: (2<=Section_3) states: 0
abstracting: (3<=Section_3) states: 0
abstracting: (F4<=Section_3) states: 165
abstracting: (2<=F9) states: 0
abstracting: (1<=F10) states: 75
-> the formula is FALSE

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

MC time: 0m 0.001sec


Total processing time: 0m19.997sec


BK_STOP 1465118260546

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

check for maximal unmarked siphon
ok
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.004sec


iterations count:112 (9), effective:24 (2)

initing FirstDep: 0m 0.000sec


iterations count:47 (3), effective:7 (0)

iterations count:44 (3), effective:6 (0)

iterations count:27 (2), effective:5 (0)

iterations count:71 (5), effective:10 (0)

iterations count:24 (2), effective:4 (0)

iterations count:72 (6), effective:10 (0)

iterations count:31 (2), effective:6 (0)

iterations count:29 (2), effective:6 (0)

iterations count:78 (6), effective:15 (1)

iterations count:37 (3), effective:8 (0)

iterations count:46 (3), effective:7 (0)

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

iterations count:12 (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="S_CircularTrains-PT-012"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/fko/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/S_CircularTrains-PT-012.tgz
mv S_CircularTrains-PT-012 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 S_CircularTrains-PT-012, 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 r197kn-qhx2-146444262300061"
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 ;