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 FMS-PT-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r053kn-smll-146358767800070
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463598765840


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: FMS_PT_005
(NrP: 22 NrTr: 20 NrArc: 50)

net check time: 0m 0.000sec

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

init dd package: 0m 4.088sec


RS generation: 0m 0.007sec


-> reachability set: #nodes 517 (5.2e+02) #states 2,895,018 (6)



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

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

abstracting: (2<=P12s) states: 102,039 (5)
-> the formula is FALSE

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

MC time: 0m 0.008sec

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

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

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

MC time: 0m 0.000sec

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

abstracting: (P12M3<=P1d) states: 2,505,762 (6)
-> the formula is TRUE

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

MC time: 0m 0.008sec

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

abstracting: (P12wM3<=M2) states: 2,633,820 (6)
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: AG [~ [~ [[P12<=P3s | 1<=P2s]]]]
normalized: ~ [E [true U ~ [[P12<=P3s | 1<=P2s]]]]

abstracting: (1<=P2s) states: 1,356,810 (6)
abstracting: (P12<=P3s) states: 2,692,865 (6)
-> the formula is FALSE

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

MC time: 0m 0.010sec

checking: AG [~ [[3<=P12 & [3<=M3 & 2<=P12wM3]]]]
normalized: ~ [E [true U [3<=P12 & [3<=M3 & 2<=P12wM3]]]]

abstracting: (2<=P12wM3) states: 102,039 (5)
abstracting: (3<=M3) states: 0
abstracting: (3<=P12) states: 12,054 (4)
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: EF [[~ [[2<=P12 & 1<=P1M1]] & 2<=P12]]
normalized: E [true U [2<=P12 & ~ [[2<=P12 & 1<=P1M1]]]]

abstracting: (1<=P1M1) states: 1,251,306 (6)
abstracting: (2<=P12) states: 102,039 (5)
abstracting: (2<=P12) states: 102,039 (5)
-> the formula is TRUE

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

MC time: 0m 0.002sec

checking: EF [[[1<=P1d | ~ [2<=P1d]] & [3<=P3s & 3<=P12M3]]]
normalized: E [true U [[3<=P3s & 3<=P12M3] & [1<=P1d | ~ [2<=P1d]]]]

abstracting: (2<=P1d) states: 486,696 (5)
abstracting: (1<=P1d) states: 1,280,706 (6)
abstracting: (3<=P12M3) states: 0
abstracting: (3<=P3s) states: 827,148 (5)
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: EF [[~ [[P2wP1<=P3 & M2<=P1d]] & 2<=P12]]
normalized: E [true U [2<=P12 & ~ [[P2wP1<=P3 & M2<=P1d]]]]

abstracting: (M2<=P1d) states: 1,804,866 (6)
abstracting: (P2wP1<=P3) states: 2,336,723 (6)
abstracting: (2<=P12) states: 102,039 (5)
-> the formula is TRUE

FORMULA FMS-PT-005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

checking: EF [[~ [~ [3<=P1d]] & [[P2wM2<=P12M3 & P2s<=P12s] & ~ [3<=P2d]]]]
normalized: E [true U [3<=P1d & [~ [3<=P2d] & [P2wM2<=P12M3 & P2s<=P12s]]]]

abstracting: (P2s<=P12s) states: 1,714,902 (6)
abstracting: (P2wM2<=P12M3) states: 1,711,878 (6)
abstracting: (3<=P2d) states: 178,080 (5)
abstracting: (3<=P1d) states: 149,856 (5)
-> the formula is TRUE

FORMULA FMS-PT-005-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: AG [[[[3<=M2 | 3<=P1] | [2<=P1wP2 | P2wP1<=P3]] | ~ [3<=P12wM3]]]
normalized: ~ [E [true U ~ [[~ [3<=P12wM3] | [[2<=P1wP2 | P2wP1<=P3] | [3<=M2 | 3<=P1]]]]]]

abstracting: (3<=P1) states: 149,856 (5)
abstracting: (3<=M2) states: 0
abstracting: (P2wP1<=P3) states: 2,336,723 (6)
abstracting: (2<=P1wP2) states: 486,696 (5)
abstracting: (3<=P12wM3) states: 12,054 (4)
-> the formula is FALSE

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

MC time: 0m 0.011sec

checking: AG [[[1<=M2 | P1wP2<=P2wM2] | [[3<=P3 | 1<=P2wM2] | 2<=P1wP2]]]
normalized: ~ [E [true U ~ [[[2<=P1wP2 | [3<=P3 | 1<=P2wM2]] | [1<=M2 | P1wP2<=P2wM2]]]]]

abstracting: (P1wP2<=P2wM2) states: 2,067,492 (6)
abstracting: (1<=M2) states: 1,943,697 (6)
abstracting: (1<=P2wM2) states: 1,356,810 (6)
abstracting: (3<=P3) states: 827,148 (5)
abstracting: (2<=P1wP2) states: 486,696 (5)
-> the formula is FALSE

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

MC time: 0m 0.012sec

checking: AG [~ [[[P2wM2<=P12s | P3M2<=P2wP1] & [M1<=P3M2 & 1<=P12M3]]]]
normalized: ~ [E [true U [[P2wM2<=P12s | P3M2<=P2wP1] & [M1<=P3M2 & 1<=P12M3]]]]

abstracting: (1<=P12M3) states: 602,826 (5)
abstracting: (M1<=P3M2) states: 1,206,632 (6)
abstracting: (P3M2<=P2wP1) states: 1,284,072 (6)
abstracting: (P2wM2<=P12s) states: 1,714,902 (6)
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: EF [[[[3<=P12M3 & 2<=P1M1] & [2<=P1M1 | M1<=P3M2]] & P3<=P2wP1]]
normalized: E [true U [P3<=P2wP1 & [[3<=P12M3 & 2<=P1M1] & [2<=P1M1 | M1<=P3M2]]]]

abstracting: (M1<=P3M2) states: 1,206,632 (6)
abstracting: (2<=P1M1) states: 453,180 (5)
abstracting: (2<=P1M1) states: 453,180 (5)
abstracting: (3<=P12M3) states: 0
abstracting: (P3<=P2wP1) states: 1,284,072 (6)
-> the formula is FALSE

FORMULA FMS-PT-005-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [[[[2<=P12 & M1<=P1wP2] | 1<=P2wP1] & [[1<=P1wP2 & P12<=P2wM2] | ~ [P12wM3<=P1M1]]]]
normalized: E [true U [[[1<=P1wP2 & P12<=P2wM2] | ~ [P12wM3<=P1M1]] & [1<=P2wP1 | [2<=P12 & M1<=P1wP2]]]]

abstracting: (M1<=P1wP2) states: 465,360 (5)
abstracting: (2<=P12) states: 102,039 (5)
abstracting: (1<=P2wP1) states: 1,356,810 (6)
abstracting: (P12wM3<=P1M1) states: 2,492,217 (6)
abstracting: (P12<=P2wM2) states: 2,508,177 (6)
abstracting: (1<=P1wP2) states: 1,280,706 (6)
-> the formula is TRUE

FORMULA FMS-PT-005-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.012sec

checking: AG [[[[1<=M2 & P1s<=P2M2] & [P1s<=P2wP1 | P2wP1<=P1s]] | ~ [[3<=P12M3 & 2<=P12s]]]]
normalized: ~ [E [true U ~ [[~ [[3<=P12M3 & 2<=P12s]] | [[P1s<=P2wP1 | P2wP1<=P1s] & [1<=M2 & P1s<=P2M2]]]]]]

abstracting: (P1s<=P2M2) states: 1,876,518 (6)
abstracting: (1<=M2) states: 1,943,697 (6)
abstracting: (P2wP1<=P1s) states: 1,974,378 (6)
abstracting: (P1s<=P2wP1) states: 2,067,492 (6)
abstracting: (2<=P12s) states: 102,039 (5)
abstracting: (3<=P12M3) states: 0
-> the formula is TRUE

FORMULA FMS-PT-005-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.005sec


Total processing time: 0m 5.755sec


BK_STOP 1463598771631

--------------------
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.000sec


iterations count:380 (19), effective:80 (4)

initing FirstDep: 0m 0.000sec


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

iterations count:164 (8), effective:25 (1)

iterations count:201 (10), effective:30 (1)

iterations count:137 (6), effective:23 (1)

iterations count:183 (9), effective:31 (1)

iterations count:196 (9), effective:40 (2)

iterations count:362 (18), effective:66 (3)

iterations count:357 (17), effective:63 (3)

iterations count:343 (17), effective:58 (2)

iterations count:212 (10), effective:42 (2)

iterations count:183 (9), effective:30 (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="FMS-PT-005"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/FMS-PT-005.tgz
mv FMS-PT-005 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 FMS-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 r053kn-smll-146358767800070"
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 ;