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 S_Railroad-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r218st-ebro-143344930300945
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433781995977

Model: S_Railroad-PT-005
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: 68 NrTr: 56 NrArc: 313)

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 1751 (1.8e+03) #states 1,838 (3)



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

checking: EF [[~ [~ [1<=pl_P7_3]] & [[1<=pl_P10_1 | pl_P29_4<=pl_P34_4] & ~ [pl_P40_3<=pl_P42_1]]]]
normalized: E [true U [1<=pl_P7_3 & [~ [pl_P40_3<=pl_P42_1] & [1<=pl_P10_1 | pl_P29_4<=pl_P34_4]]]]

abstracting: (pl_P29_4<=pl_P34_4) states: 1,838 (3)
abstracting: (1<=pl_P10_1) states: 5
abstracting: (pl_P40_3<=pl_P42_1) states: 1,582 (3)
abstracting: (1<=pl_P7_3) states: 6
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[[3<=pl_P15_1 & 1<=pl_P23_1] & ~ [1<=pl_P14_1]] | pl_P7_4<=pl_P40_6]]
normalized: ~ [E [true U ~ [[pl_P7_4<=pl_P40_6 | [~ [1<=pl_P14_1] & [3<=pl_P15_1 & 1<=pl_P23_1]]]]]]

abstracting: (1<=pl_P23_1) states: 1,805 (3)
abstracting: (3<=pl_P15_1) states: 0
abstracting: (1<=pl_P14_1) states: 0
abstracting: (pl_P7_4<=pl_P40_6) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [[3<=pl_P13_1 | 2<=pl_P34_2]] | [1<=pl_P14_1 | [pl_P29_4<=pl_P38_1 & pl_P40_4<=pl_P0_1]]]]
normalized: ~ [E [true U ~ [[~ [[3<=pl_P13_1 | 2<=pl_P34_2]] | [1<=pl_P14_1 | [pl_P29_4<=pl_P38_1 & pl_P40_4<=pl_P0_1]]]]]]

abstracting: (pl_P40_4<=pl_P0_1) states: 1,508 (3)
abstracting: (pl_P29_4<=pl_P38_1) states: 1,838 (3)
abstracting: (1<=pl_P14_1) states: 0
abstracting: (2<=pl_P34_2) states: 0
abstracting: (3<=pl_P13_1) states: 0
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (pl_P36_1<=pl_P34_1) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Railroad-PT-005-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Railroad-PT-005-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA Railroad-PT-005-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[3<=pl_P0_3 & pl_P29_3<=pl_P7_4]]
normalized: E [true U [3<=pl_P0_3 & pl_P29_3<=pl_P7_4]]

abstracting: (pl_P29_3<=pl_P7_4) states: 1,821 (3)
abstracting: (3<=pl_P0_3) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[~ [1<=pl_P34_2] | 3<=pl_P31_1] & 3<=pl_P40_6]]
normalized: E [true U [3<=pl_P40_6 & [3<=pl_P31_1 | ~ [1<=pl_P34_2]]]]

abstracting: (1<=pl_P34_2) states: 80
abstracting: (3<=pl_P31_1) states: 0
abstracting: (3<=pl_P40_6) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (pl_P38_1<=pl_P0_6) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [[pl_P27_1<=pl_P23_1 | 1<=pl_P29_4]] & [[2<=pl_P7_1 & 3<=pl_P34_3] & [pl_P34_6<=pl_P6_1 & 2<=pl_P34_3]]]]
normalized: E [true U [[[pl_P34_6<=pl_P6_1 & 2<=pl_P34_3] & [2<=pl_P7_1 & 3<=pl_P34_3]] & ~ [[pl_P27_1<=pl_P23_1 | 1<=pl_P29_4]]]]

abstracting: (1<=pl_P29_4) states: 0
abstracting: (pl_P27_1<=pl_P23_1) states: 1,811 (3)
abstracting: (3<=pl_P34_3) states: 0
abstracting: (2<=pl_P7_1) states: 0
abstracting: (2<=pl_P34_3) states: 0
abstracting: (pl_P34_6<=pl_P6_1) states: 1,676 (3)
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [2<=pl_P16_1] & [~ [3<=pl_P13_1] | [pl_P6_1<=pl_P7_6 | pl_P21_1<=pl_P7_6]]]]
normalized: ~ [E [true U ~ [[[[pl_P6_1<=pl_P7_6 | pl_P21_1<=pl_P7_6] | ~ [3<=pl_P13_1]] & ~ [2<=pl_P16_1]]]]]

abstracting: (2<=pl_P16_1) states: 0
abstracting: (3<=pl_P13_1) states: 0
abstracting: (pl_P21_1<=pl_P7_6) states: 1,407 (3)
abstracting: (pl_P6_1<=pl_P7_6) states: 949
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (pl_P29_2<=pl_P29_2) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [[1<=pl_P1_1 | 3<=pl_P32_1]]]]
normalized: E [true U [1<=pl_P1_1 | 3<=pl_P32_1]]

abstracting: (3<=pl_P32_1) states: 0
abstracting: (1<=pl_P1_1) states: 0
-> the formula is FALSE

FORMULA Railroad-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (pl_P34_5<=pl_P11_1) states: 1,838 (3)
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[1<=pl_P12_1 & [3<=pl_P36_1 & pl_P0_1<=pl_P22_1]]]]
normalized: ~ [E [true U [1<=pl_P12_1 & [3<=pl_P36_1 & pl_P0_1<=pl_P22_1]]]]

abstracting: (pl_P0_1<=pl_P22_1) states: 1,481 (3)
abstracting: (3<=pl_P36_1) states: 0
abstracting: (1<=pl_P12_1) states: 431
-> the formula is TRUE

FORMULA Railroad-PT-005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m8sec


BK_STOP 1433782004838

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

1244
iterations count:1690 (30), effective:66 (1)

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="S_Railroad-PT-005"
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/S_Railroad-PT-005.tgz
mv S_Railroad-PT-005 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 S_Railroad-PT-005, 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 r218st-ebro-143344930300945"
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 ;