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

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

=== Now, execution of the tool begins

BK_START 1433367523854

Model: S_FMS-PT-010
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: 0m6sec


RS generation: 0m0sec


-> reachability set: #nodes 1496 (1.5e+03) #states 2,501,413,200 (9)



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

checking: AG [[[[3<=P1wM1 | P2wP1<=P1s] & ~ [1<=P12]] | [3<=P2 | [1<=P2s & 1<=P1]]]]
normalized: ~ [E [true U ~ [[[3<=P2 | [1<=P2s & 1<=P1]] | [~ [1<=P12] & [3<=P1wM1 | P2wP1<=P1s]]]]]]

abstracting: (P2wP1<=P1s) states: 1,516,999,770 (9)
abstracting: (3<=P1wM1) states: 496,756,788 (8)
abstracting: (1<=P12) states: 993,692,700 (8)
abstracting: (1<=P1) states: 1,543,588,332 (9)
abstracting: (1<=P2s) states: 1,596,875,280 (9)
abstracting: (3<=P2) states: 556,422,900 (8)
-> the formula is FALSE

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

MC time: 20m26sec

checking: AG [[~ [2<=P2M2] | [[P12M3<=P1wM1 | P3<=P12M3] & 3<=P3s]]]
normalized: ~ [E [true U ~ [[[3<=P3s & [P12M3<=P1wM1 | P3<=P12M3]] | ~ [2<=P2M2]]]]]

abstracting: (2<=P2M2) states: 0
abstracting: (P3<=P12M3) states: 588,429,153 (8)
abstracting: (P12M3<=P1wM1) states: 2,067,743,568 (9)
abstracting: (3<=P3s) states: 1,364,407,200 (9)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (2<=P1) states: 903,699,852 (8)
-> the formula is TRUE

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

MC time: 0m0sec

checking: EF [[[[P1<=P3s | P3M2<=P2wP1] & 2<=P1s] & ~ [[P2wM2<=P2M2 | M2<=P3]]]]
normalized: E [true U [~ [[P2wM2<=P2M2 | M2<=P3]] & [2<=P1s & [P1<=P3s | P3M2<=P2wP1]]]]

abstracting: (P3M2<=P2wP1) states: 909,759,218 (8)
abstracting: (P1<=P3s) states: 1,990,375,656 (9)
abstracting: (2<=P1s) states: 903,699,852 (8)
abstracting: (M2<=P3) states: 2,248,719,902 (9)
abstracting: (P2wM2<=P2M2) states: 1,156,904,958 (9)
-> the formula is TRUE

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

MC time: 3m11sec

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

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

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

MC time: 0m0sec

checking: EF [[P1<=P1s & [~ [3<=P2wP1] & [P3M2<=P12 | M3<=P2wM2]]]]
normalized: E [true U [P1<=P1s & [~ [3<=P2wP1] & [P3M2<=P12 | M3<=P2wM2]]]]

abstracting: (M3<=P2wM2) states: 1,304,693,676 (9)
abstracting: (P3M2<=P12) states: 636,479,958 (8)
abstracting: (3<=P2wP1) states: 556,422,900 (8)
abstracting: (P1<=P1s) states: 1,535,696,448 (9)
-> the formula is TRUE

FORMULA FMS-PT-010-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 26m7sec

checking: EF [~ [[~ [2<=M2] | ~ [P12s<=P3M2]]]]
normalized: E [true U ~ [[~ [2<=M2] | ~ [P12s<=P3M2]]]]

abstracting: (P12s<=P3M2) states: 2,258,725,329 (9)
abstracting: (2<=M2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [[3<=P12s & M3<=P2M2]] | ~ [P3s<=P2wP1]]]
normalized: ~ [E [true U ~ [[~ [P3s<=P2wP1] | ~ [[3<=P12s & M3<=P2M2]]]]]]

abstracting: (M3<=P2M2) states: 505,991,772 (8)
abstracting: (3<=P12s) states: 120,792,408 (8)
abstracting: (P3s<=P2wP1) states: 909,759,218 (8)
-> the formula is FALSE

FORMULA FMS-PT-010-ReachabilityCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m16sec

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

abstracting: (P12M3<=P12s) states: 1,871,457,918 (9)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[[2<=P1 & [2<=P2wM2 & 3<=P12]] & [~ [2<=P1M1] | [M2<=P2s | 3<=P1s]]]]
normalized: E [true U [[[M2<=P2s | 3<=P1s] | ~ [2<=P1M1]] & [2<=P1 & [2<=P2wM2 & 3<=P12]]]]

abstracting: (3<=P12) states: 120,792,408 (8)
abstracting: (2<=P2wM2) states: 970,876,698 (8)
abstracting: (2<=P1) states: 903,699,852 (8)
abstracting: (2<=P1M1) states: 694,242,120 (8)
abstracting: (3<=P1s) states: 496,756,788 (8)
abstracting: (M2<=P2s) states: 1,970,506,824 (9)
-> the formula is TRUE

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

MC time: 0m26sec

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

abstracting: (P2M2<=M3) states: 2,406,450,618 (9)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[~ [[M2<=P12 | 2<=P1wM1]] & P2<=M3]]
normalized: E [true U [P2<=M3 & ~ [[M2<=P12 | 2<=P1wM1]]]]

abstracting: (2<=P1wM1) states: 903,699,852 (8)
abstracting: (M2<=P12) states: 1,596,242,934 (9)
abstracting: (P2<=M3) states: 1,729,928,772 (9)

BK_TIME_CONFINEMENT_REACHED

--------------------
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:790 (39), effective:170 (8)

initing FirstDep: 0m0sec


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

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

iterations count:191 (9), effective:34 (1)

iterations count:150 (7), effective:25 (1)

iterations count:493 (24), effective:89 (4)

iterations count:98 (4), effective:15 (0)

iterations count:336 (16), effective:61 (3)

iterations count:191 (9), effective:33 (1)

iterations count:83 (4), effective:9 (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_FMS-PT-010"
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-010.tgz
mv S_FMS-PT-010 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-010, 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-143319440700126"
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 ;