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 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 r149kn-smll-146416259400655
=====================================================================

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


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_010
(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 3.862sec


RS generation: 0m 0.027sec


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



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

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

abstracting: (3<=P1d) states: 496,756,788 (8)
-> the formula is FALSE

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

MC time: 0m 0.014sec

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

abstracting: (3<=P2wP1) states: 556,422,900 (8)
-> the formula is FALSE

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

MC time: 0m 0.043sec

checking: EF [[~ [1<=P3] & ~ [~ [2<=P2wM2]]]]
normalized: E [true U [2<=P2wM2 & ~ [1<=P3]]]

abstracting: (1<=P3) states: 2,084,511,000 (9)
abstracting: (2<=P2wM2) states: 970,876,698 (8)
-> the formula is TRUE

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

MC time: 0m 0.059sec

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

abstracting: (P2d<=P2d) states: 2,501,413,200 (9)
-> the formula is TRUE

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

MC time: 0m 0.001sec

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

abstracting: (P1<=P1) states: 2,501,413,200 (9)
abstracting: (2<=P12M3) states: 250,149,042 (8)
-> the formula is TRUE

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

MC time: 0m 0.029sec

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

abstracting: (P12<=P2wM2) states: 1,999,708,128 (9)
abstracting: (1<=P12) states: 993,692,700 (8)
-> the formula is TRUE

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

MC time: 0m 0.024sec

checking: EF [[[[2<=P1wP2 | 3<=P2wP1] | [1<=M1 & 3<=P3]] & 1<=P12wM3]]
normalized: E [true U [1<=P12wM3 & [[1<=M1 & 3<=P3] | [2<=P1wP2 | 3<=P2wP1]]]]

abstracting: (3<=P2wP1) states: 556,422,900 (8)
abstracting: (2<=P1wP2) states: 903,699,852 (8)
abstracting: (3<=P3) states: 1,364,407,200 (9)
abstracting: (1<=M1) states: 2,245,463,220 (9)
abstracting: (1<=P12wM3) states: 993,692,700 (8)
-> the formula is TRUE

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

MC time: 0m 0.073sec

checking: AG [[~ [~ [1<=P1]] | [[3<=P3s | P2d<=P12s] | P1M1<=M1]]]
normalized: ~ [E [true U ~ [[1<=P1 | [P1M1<=M1 | [3<=P3s | P2d<=P12s]]]]]]

abstracting: (P2d<=P12s) states: 1,229,682,234 (9)
abstracting: (3<=P3s) states: 1,364,407,200 (9)
abstracting: (P1M1<=M1) states: 1,807,171,080 (9)
abstracting: (1<=P1) states: 1,543,588,332 (9)
-> the formula is FALSE

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

MC time: 0m 0.105sec

checking: AG [[[~ [M3<=P2wM2] | [3<=P2wM2 | 3<=P2s]] | ~ [P2wM2<=P2d]]]
normalized: ~ [E [true U ~ [[~ [P2wM2<=P2d] | [~ [M3<=P2wM2] | [3<=P2wM2 | 3<=P2s]]]]]]

abstracting: (3<=P2s) states: 556,422,900 (8)
abstracting: (3<=P2wM2) states: 556,422,900 (8)
abstracting: (M3<=P2wM2) states: 1,304,693,676 (9)
abstracting: (P2wM2<=P2d) states: 1,516,159,788 (9)
-> the formula is FALSE

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

MC time: 0m 0.118sec

checking: EF [[~ [3<=P1] & [[3<=P2d | 1<=P12s] & [P2wP1<=P2s & 2<=M3]]]]
normalized: E [true U [[[P2wP1<=P2s & 2<=M3] & [3<=P2d | 1<=P12s]] & ~ [3<=P1]]]

abstracting: (3<=P1) states: 496,756,788 (8)
abstracting: (1<=P12s) states: 993,692,700 (8)
abstracting: (3<=P2d) states: 556,422,900 (8)
abstracting: (2<=M3) states: 1,594,469,448 (9)
abstracting: (P2wP1<=P2s) states: 1,516,159,788 (9)
-> the formula is TRUE

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

MC time: 0m 0.097sec

checking: AG [[P12s<=P2wM2 & [~ [1<=P1wM1] | [M2<=P1M1 | P1<=P1]]]]
normalized: ~ [E [true U ~ [[P12s<=P2wM2 & [[M2<=P1M1 | P1<=P1] | ~ [1<=P1wM1]]]]]]

abstracting: (1<=P1wM1) states: 1,543,588,332 (9)
abstracting: (P1<=P1) states: 2,501,413,200 (9)
abstracting: (M2<=P1M1) states: 1,834,188,642 (9)
abstracting: (P12s<=P2wM2) states: 1,999,708,128 (9)
-> the formula is FALSE

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

MC time: 0m 0.033sec

checking: EF [[[[2<=P3s & 1<=P1M1] & [3<=P12M3 & 1<=P2wM2]] & [~ [2<=P12] | [1<=P2wP1 | 2<=P1]]]]
normalized: E [true U [[[1<=P2wP1 | 2<=P1] | ~ [2<=P12]] & [[3<=P12M3 & 1<=P2wM2] & [2<=P3s & 1<=P1M1]]]]

abstracting: (1<=P1M1) states: 1,404,008,892 (9)
abstracting: (2<=P3s) states: 1,705,509,000 (9)
abstracting: (1<=P2wM2) states: 1,596,875,280 (9)
abstracting: (3<=P12M3) states: 0
abstracting: (2<=P12) states: 363,737,418 (8)
abstracting: (2<=P1) states: 903,699,852 (8)
abstracting: (1<=P2wP1) states: 1,596,875,280 (9)
-> the formula is FALSE

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

MC time: 0m 0.008sec

checking: AG [[M3<=P2 & [~ [3<=P3] | [P12s<=P2M2 | P3<=P2wM2]]]]
normalized: ~ [E [true U ~ [[M3<=P2 & [[P12s<=P2M2 | P3<=P2wM2] | ~ [3<=P3]]]]]]

abstracting: (3<=P3) states: 1,364,407,200 (9)
abstracting: (P3<=P2wM2) states: 909,759,218 (8)
abstracting: (P12s<=P2M2) states: 1,754,087,148 (9)
abstracting: (M3<=P2) states: 1,304,693,676 (9)
-> the formula is FALSE

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

MC time: 0m 0.081sec

checking: AG [[~ [[1<=P12s & 2<=M3]] | [[1<=P12M3 | P12wM3<=P12M3] & ~ [P12M3<=P1wM1]]]]
normalized: ~ [E [true U ~ [[[~ [P12M3<=P1wM1] & [1<=P12M3 | P12wM3<=P12M3]] | ~ [[1<=P12s & 2<=M3]]]]]]

abstracting: (2<=M3) states: 1,594,469,448 (9)
abstracting: (1<=P12s) states: 993,692,700 (8)
abstracting: (P12wM3<=P12M3) states: 1,750,665,510 (9)
abstracting: (1<=P12M3) states: 906,943,752 (8)
abstracting: (P12M3<=P1wM1) states: 2,067,743,568 (9)
-> the formula is FALSE

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

MC time: 0m 0.015sec

checking: AG [[P12M3<=P12M3 | [[P2<=P2 & P3s<=P2wM2] | [P3M2<=P1wP2 | 3<=P12]]]]
normalized: ~ [E [true U ~ [[P12M3<=P12M3 | [[P3M2<=P1wP2 | 3<=P12] | [P2<=P2 & P3s<=P2wM2]]]]]]

abstracting: (P3s<=P2wM2) states: 909,759,218 (8)
abstracting: (P2<=P2) states: 2,501,413,200 (9)
abstracting: (3<=P12) states: 120,792,408 (8)
abstracting: (P3M2<=P1wP2) states: 876,645,696 (8)
abstracting: (P12M3<=P12M3) states: 2,501,413,200 (9)
-> the formula is TRUE

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

MC time: 0m 0.052sec

checking: EF [[[[M2<=P1d & P2<=P2M2] & [1<=P2M2 & P12<=P1s]] & [[2<=P2s | 1<=P2s] & ~ [P12<=M2]]]]
normalized: E [true U [[[2<=P2s | 1<=P2s] & ~ [P12<=M2]] & [[1<=P2M2 & P12<=P1s] & [M2<=P1d & P2<=P2M2]]]]

abstracting: (P2<=P2M2) states: 1,156,904,958 (9)
abstracting: (M2<=P1d) states: 1,917,852,222 (9)
abstracting: (P12<=P1s) states: 1,977,224,106 (9)
abstracting: (1<=P2M2) states: 985,253,412 (8)
abstracting: (P12<=M2) states: 1,891,309,134 (9)
abstracting: (1<=P2s) states: 1,596,875,280 (9)
abstracting: (2<=P2s) states: 970,876,698 (8)
-> the formula is TRUE

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

MC time: 0m 0.035sec


Total processing time: 0m 6.086sec


BK_STOP 1464439441876

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


iterations count:740 (37), effective:160 (8)

initing FirstDep: 0m 0.000sec


iterations count:254 (12), effective:42 (2)

iterations count:161 (8), effective:27 (1)

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

iterations count:180 (9), effective:28 (1)

iterations count:334 (16), effective:58 (2)

iterations count:221 (11), effective:38 (1)

iterations count:373 (18), effective:72 (3)

iterations count:383 (19), effective:58 (2)

iterations count:658 (32), effective:114 (5)

iterations count:198 (9), effective:39 (1)

iterations count:173 (8), effective:37 (1)

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

iterations count:461 (23), effective:75 (3)

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="/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/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-2979"
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 r149kn-smll-146416259400655"
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 ;