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

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

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

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 202 (2.0e+02) #states 195



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

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

abstracting: (F1<=Section_1) states: 120
-> the formula is FALSE

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

MC time: 0m0sec

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

abstracting: (F8<=F5) states: 135
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[F5<=Section_8 | [[3<=F11 | 2<=F7] & [3<=Section_3 | Section_1<=Section_5]]]]
normalized: E [true U [F5<=Section_8 | [[3<=Section_3 | Section_1<=Section_5] & [3<=F11 | 2<=F7]]]]

abstracting: (2<=F7) states: 0
abstracting: (3<=F11) states: 0
abstracting: (Section_1<=Section_5) states: 167
abstracting: (3<=Section_3) states: 0
abstracting: (F5<=Section_8) states: 64
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (Section_10<=Section_1) states: 161
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[3<=Section_11 & [1<=Section_3 | 1<=Section_11]] | ~ [[F7<=F5 & 1<=Section_8]]]]
normalized: ~ [E [true U ~ [[~ [[F7<=F5 & 1<=Section_8]] | [3<=Section_11 & [1<=Section_3 | 1<=Section_11]]]]]]

abstracting: (1<=Section_11) states: 75
abstracting: (1<=Section_3) states: 75
abstracting: (3<=Section_11) states: 0
abstracting: (1<=Section_8) states: 75
abstracting: (F7<=F5) states: 178
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[1<=F4 & 3<=Section_2] | 1<=F5]]
normalized: ~ [E [true U ~ [[1<=F5 | [1<=F4 & 3<=Section_2]]]]]

abstracting: (3<=Section_2) states: 0
abstracting: (1<=F4) states: 75
abstracting: (1<=F5) states: 171
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[Section_4<=Section_1 & ~ [F11<=Section_12]] | Section_9<=Section_2]]
normalized: ~ [E [true U ~ [[Section_9<=Section_2 | [Section_4<=Section_1 & ~ [F11<=Section_12]]]]]]

abstracting: (F11<=Section_12) states: 75
abstracting: (Section_4<=Section_1) states: 161
abstracting: (Section_9<=Section_2) states: 144
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec

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

abstracting: (F1<=Section_1) states: 120
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[Section_4<=F10 | ~ [Section_8<=F9]] | 1<=Section_5]]
normalized: E [true U [1<=Section_5 | [Section_4<=F10 | ~ [Section_8<=F9]]]]

abstracting: (Section_8<=F9) states: 154
abstracting: (Section_4<=F10) states: 167
abstracting: (1<=Section_5) states: 75
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[Section_2<=Section_2 | ~ [[2<=F12 & 1<=Section_11]]]]
normalized: ~ [E [true U ~ [[Section_2<=Section_2 | ~ [[2<=F12 & 1<=Section_11]]]]]]

abstracting: (1<=Section_11) states: 75
abstracting: (2<=F12) states: 0
abstracting: (Section_2<=Section_2) states: 195
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [~ [[~ [2<=Section_4] & [2<=F4 | Section_10<=Section_4]]]]
normalized: ~ [E [true U [~ [2<=Section_4] & [2<=F4 | Section_10<=Section_4]]]]

abstracting: (Section_10<=Section_4) states: 161
abstracting: (2<=F4) states: 0
abstracting: (2<=Section_4) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [Section_8<=Section_9]
normalized: E [true U Section_8<=Section_9]

abstracting: (Section_8<=Section_9) states: 144
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[~ [[Section_12<=F12 | Section_12<=F11]] & [~ [3<=Section_5] | ~ [Section_10<=F6]]]]
normalized: ~ [E [true U ~ [[[~ [3<=Section_5] | ~ [Section_10<=F6]] & ~ [[Section_12<=F12 | Section_12<=F11]]]]]]

abstracting: (Section_12<=F11) states: 171
abstracting: (Section_12<=F12) states: 120
abstracting: (Section_10<=F6) states: 167
abstracting: (3<=Section_5) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

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

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

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

MC time: 0m0sec


Total processing time: 0m9sec


BK_STOP 1432335671452

--------------------
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:112 (9), effective:24 (2)

initing FirstDep: 0m0sec


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

iterations count:81 (6), effective:14 (1)

iterations count:53 (4), effective:10 (0)

iterations count:59 (4), effective:11 (0)

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

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

iterations count:77 (6), effective:21 (1)

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

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

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

iterations count:18 (1), effective:2 (0)

iterations count:29 (2), effective:4 (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="CircularTrains-PT-012"
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-012.tgz
mv CircularTrains-PT-012 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-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 r008kn-ebro-143214239100347"
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 ;