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_FMS-PT-002, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319440700100
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433367491043

Model: S_FMS-PT-002
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: 22 NrTr: 20 NrArc: 50)

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 134 (1.3e+02) #states 3,444 (3)



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

checking: AG [[~ [[3<=P3M2 | P2wP1<=P2]] | [~ [1<=P12M3] | [3<=P2M2 | 3<=P1d]]]]
normalized: ~ [E [true U ~ [[~ [[3<=P3M2 | P2wP1<=P2]] | [[3<=P2M2 | 3<=P1d] | ~ [1<=P12M3]]]]]]

abstracting: (1<=P12M3) states: 240
abstracting: (3<=P1d) states: 0
abstracting: (3<=P2M2) states: 0
abstracting: (P2wP1<=P2) states: 2,670 (3)
abstracting: (3<=P3M2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (P3<=P3) states: 3,444 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [M3<=M2]
normalized: E [true U M3<=M2]

abstracting: (M3<=M2) states: 204
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (3<=P1M1) states: 0
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[1<=P2d | P3M2<=P1s] & [[2<=M2 & 1<=P12] & [2<=P1 | P2wP1<=P3M2]]]]
normalized: E [true U [[[2<=M2 & 1<=P12] & [2<=P1 | P2wP1<=P3M2]] & [1<=P2d | P3M2<=P1s]]]

abstracting: (P3M2<=P1s) states: 2,030 (3)
abstracting: (1<=P2d) states: 900
abstracting: (P2wP1<=P3M2) states: 2,952 (3)
abstracting: (2<=P1) states: 120
abstracting: (1<=P12) states: 240
abstracting: (2<=M2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA FMS-PT-002-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[~ [3<=P1wM1] | [3<=P3s & P3M2<=P2s]]]]
normalized: E [true U ~ [[[3<=P3s & P3M2<=P2s] | ~ [3<=P1wM1]]]]

abstracting: (3<=P1wM1) states: 0
abstracting: (P3M2<=P2s) states: 2,043 (3)
abstracting: (3<=P3s) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[[~ [2<=M2] | M1<=P1M1] | [2<=P1M1 | 1<=P12wM3]]]
normalized: ~ [E [true U ~ [[[2<=P1M1 | 1<=P12wM3] | [M1<=P1M1 | ~ [2<=M2]]]]]]

abstracting: (2<=M2) states: 0
abstracting: (M1<=P1M1) states: 120
abstracting: (1<=P12wM3) states: 240
abstracting: (2<=P1M1) states: 120
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

abstracting: (1<=M3) states: 3,438 (3)
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[1<=P2s & 1<=P12M3] & P12<=P12] | ~ [~ [3<=P12M3]]]]
normalized: E [true U [3<=P12M3 | [P12<=P12 & [1<=P2s & 1<=P12M3]]]]

abstracting: (1<=P12M3) states: 240
abstracting: (1<=P2s) states: 900
abstracting: (P12<=P12) states: 3,444 (3)
abstracting: (3<=P12M3) states: 0
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[3<=P2M2 | P12M3<=P2] & [P1wM1<=P12s & P2wP1<=P1wP2]] & [[P12wM3<=M3 & P1M1<=P12] & 2<=M2]]]
normalized: E [true U [[[3<=P2M2 | P12M3<=P2] & [P1wM1<=P12s & P2wP1<=P1wP2]] & [2<=M2 & [P12wM3<=M3 & P1M1<=P12]]]]

abstracting: (P1M1<=P12) states: 2,616 (3)
abstracting: (P12wM3<=M3) states: 3,444 (3)
abstracting: (2<=M2) states: 0
abstracting: (P2wP1<=P1wP2) states: 2,754 (3)
abstracting: (P1wM1<=P12s) states: 2,616 (3)
abstracting: (P12M3<=P2) states: 3,240 (3)
abstracting: (3<=P2M2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[P1wP2<=P12s & P2M2<=P2wP1] & ~ [P2wM2<=P2s]] & 2<=P2M2]]
normalized: E [true U [2<=P2M2 & [~ [P2wM2<=P2s] & [P1wP2<=P12s & P2M2<=P2wP1]]]]

abstracting: (P2M2<=P2wP1) states: 2,796 (3)
abstracting: (P1wP2<=P12s) states: 2,616 (3)
abstracting: (P2wM2<=P2s) states: 2,670 (3)
abstracting: (2<=P2M2) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [[~ [3<=P3] | [P2s<=P12 & ~ [3<=P1M1]]]]
normalized: ~ [E [true U ~ [[[P2s<=P12 & ~ [3<=P1M1]] | ~ [3<=P3]]]]]

abstracting: (3<=P3) states: 0
abstracting: (3<=P1M1) states: 0
abstracting: (P2s<=P12) states: 2,580 (3)
-> the formula is TRUE

FORMULA FMS-PT-002-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

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

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

FORMULA FMS-PT-002-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[1<=P2d | 2<=P1s] & [~ [P12M3<=M1] & P1d<=M3]]]
normalized: E [true U [[1<=P2d | 2<=P1s] & [P1d<=M3 & ~ [P12M3<=M1]]]]

abstracting: (P12M3<=M1) states: 3,444 (3)
abstracting: (P1d<=M3) states: 3,444 (3)
abstracting: (2<=P1s) states: 120
abstracting: (1<=P2d) states: 900
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[3<=P2wP1 & ~ [P12<=P1s]]]
normalized: E [true U [3<=P2wP1 & ~ [P12<=P1s]]]

abstracting: (P12<=P1s) states: 3,240 (3)
abstracting: (3<=P2wP1) states: 0
-> the formula is FALSE

FORMULA FMS-PT-002-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec


Total processing time: 0m7sec


BK_STOP 1433367498777

--------------------
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:174 (8), effective:34 (1)

initing FirstDep: 0m0sec


iterations count:99 (4), effective:16 (0)

iterations count:95 (4), effective:14 (0)

iterations count:126 (6), effective:19 (0)

iterations count:169 (8), effective:28 (1)

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_FMS-PT-002"
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_FMS-PT-002.tgz
mv S_FMS-PT-002 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_FMS-PT-002, 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 r162st-ebro-143319440700100"
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 ;