About the Execution of Marcie for S_FMS-PT-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3963.100 | 28220.00 | 27844.00 | 195.90 | FFTTFFTTTFTFFTTF | normal |
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-005, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319440700113
=====================================================================
--------------------
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 1433367508815
Model: S_FMS-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: 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 476 (4.8e+02) #states 2,895,018 (6)
starting MCC model checker
--------------------------
checking: AG [[~ [[3<=P2 & 2<=P2wP1]] | 2<=P2wM2]]
normalized: ~ [E [true U ~ [[2<=P2wM2 | ~ [[3<=P2 & 2<=P2wP1]]]]]]
abstracting: (2<=P2wP1) states: 547,239 (5)
abstracting: (3<=P2) states: 178,080 (5)
abstracting: (2<=P2wM2) states: 547,239 (5)
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [3<=P2M2]
normalized: E [true U 3<=P2M2]
abstracting: (3<=P2M2) states: 0
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [P2<=P2]
normalized: ~ [E [true U ~ [P2<=P2]]]
abstracting: (P2<=P2) states: 2,895,018 (6)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [~ [[3<=P1s & [3<=P1d | 2<=P12]]]]
normalized: ~ [E [true U [3<=P1s & [3<=P1d | 2<=P12]]]]
abstracting: (2<=P12) states: 102,039 (5)
abstracting: (3<=P1d) states: 149,856 (5)
abstracting: (3<=P1s) states: 149,856 (5)
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[[P3<=P12M3 | P3M2<=P2wM2] | ~ [P1M1<=P2s]] & [P2wM2<=P2 & 3<=P12s]]]
normalized: E [true U [[P2wM2<=P2 & 3<=P12s] & [~ [P1M1<=P2s] | [P3<=P12M3 | P3M2<=P2wM2]]]]
abstracting: (P3M2<=P2wM2) states: 1,284,072 (6)
abstracting: (P3<=P12M3) states: 987,822 (5)
abstracting: (P1M1<=P2s) states: 2,098,362 (6)
abstracting: (3<=P12s) states: 12,054 (4)
abstracting: (P2wM2<=P2) states: 1,943,697 (6)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [~ [[[P2d<=M3 | P12s<=M3] | P1d<=M1]]]
normalized: E [true U ~ [[P1d<=M1 | [P2d<=M3 | P12s<=M3]]]]
abstracting: (P12s<=M3) states: 2,861,376 (6)
abstracting: (P2d<=M3) states: 2,628,864 (6)
abstracting: (P1d<=M1) states: 2,777,418 (6)
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m3sec
checking: AG [[P2<=P1M1 | P1wP2<=M3]]
normalized: ~ [E [true U ~ [[P2<=P1M1 | P1wP2<=M3]]]]
abstracting: (P1wP2<=M3) states: 2,664,501 (6)
abstracting: (P2<=P1M1) states: 1,958,208 (6)
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: EF [[[~ [P2d<=P2s] & 2<=M3] & ~ [P12<=P1M1]]]
normalized: E [true U [~ [P12<=P1M1] & [2<=M3 & ~ [P2d<=P2s]]]]
abstracting: (P2d<=P2s) states: 1,943,697 (6)
abstracting: (2<=M3) states: 2,292,192 (6)
abstracting: (P12<=P1M1) states: 2,492,217 (6)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: EF [[[~ [P1d<=M1] & P2wP1<=P2s] & ~ [P12s<=P1M1]]]
normalized: E [true U [~ [P12s<=P1M1] & [P2wP1<=P2s & ~ [P1d<=M1]]]]
abstracting: (P1d<=M1) states: 2,777,418 (6)
abstracting: (P2wP1<=P2s) states: 1,943,697 (6)
abstracting: (P12s<=P1M1) states: 2,492,217 (6)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m3sec
checking: AG [2<=M3]
normalized: ~ [E [true U ~ [2<=M3]]]
abstracting: (2<=M3) states: 2,292,192 (6)
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[~ [~ [P2M2<=P1M1]] | [M2<=M1 | [1<=P1M1 | 2<=P12]]]]
normalized: ~ [E [true U ~ [[P2M2<=P1M1 | [M2<=M1 | [1<=P1M1 | 2<=P12]]]]]]
abstracting: (2<=P12) states: 102,039 (5)
abstracting: (1<=P1M1) states: 1,251,306 (6)
abstracting: (M2<=M1) states: 2,818,578 (6)
abstracting: (P2M2<=P1M1) states: 2,360,568 (6)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[3<=P12wM3 & [[1<=P3s & P12s<=P1wM1] & 2<=P3s]]]
normalized: E [true U [3<=P12wM3 & [2<=P3s & [1<=P3s & P12s<=P1wM1]]]]
abstracting: (P12s<=P1wM1) states: 2,494,422 (6)
abstracting: (1<=P3s) states: 2,067,870 (6)
abstracting: (2<=P3s) states: 1,378,580 (6)
abstracting: (3<=P12wM3) states: 12,054 (4)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[P1wP2<=P1wM1 | ~ [[3<=P2d & P12s<=P1]]]]
normalized: ~ [E [true U ~ [[P1wP2<=P1wM1 | ~ [[3<=P2d & P12s<=P1]]]]]]
abstracting: (P12s<=P1) states: 2,494,422 (6)
abstracting: (3<=P2d) states: 178,080 (5)
abstracting: (P1wP2<=P1wM1) states: 1,980,552 (6)
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: EF [[[[P2s<=P2wP1 & P3M2<=P1d] & ~ [P3M2<=M1]] & ~ [[P12s<=P1s | P1s<=P3]]]]
normalized: E [true U [[[P2s<=P2wP1 & P3M2<=P1d] & ~ [P3M2<=M1]] & ~ [[P12s<=P1s | P1s<=P3]]]]
abstracting: (P1s<=P3) states: 2,379,498 (6)
abstracting: (P12s<=P1s) states: 2,494,422 (6)
abstracting: (P3M2<=M1) states: 2,188,666 (6)
abstracting: (P3M2<=P1d) states: 1,249,578 (6)
abstracting: (P2s<=P2wP1) states: 1,943,697 (6)
-> the formula is FALSE
FORMULA FMS-PT-005-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m7sec
checking: AG [~ [[[P1wP2<=P1wM1 & P12s<=M3] & [3<=P3M2 & 3<=P3s]]]]
normalized: ~ [E [true U [[P1wP2<=P1wM1 & P12s<=M3] & [3<=P3M2 & 3<=P3s]]]]
abstracting: (3<=P3s) states: 827,148 (5)
abstracting: (3<=P3M2) states: 827,148 (5)
abstracting: (P12s<=M3) states: 2,861,376 (6)
abstracting: (P1wP2<=P1wM1) states: 1,980,552 (6)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: EF [2<=P2wP1]
normalized: E [true U 2<=P2wP1]
abstracting: (2<=P2wP1) states: 547,239 (5)
-> the formula is TRUE
FORMULA FMS-PT-005-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m28sec
BK_STOP 1433367537035
--------------------
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:405 (20), effective:85 (4)
initing FirstDep: 0m0sec
iterations count:226 (11), effective:40 (2)
iterations count:275 (13), effective:48 (2)
iterations count:282 (14), effective:53 (2)
iterations count:145 (7), effective:25 (1)
iterations count:177 (8), effective:30 (1)
iterations count:327 (16), effective:59 (2)
iterations count:95 (4), effective:14 (0)
iterations count:175 (8), effective:27 (1)
iterations count:290 (14), effective:50 (2)
iterations count:108 (5), effective:17 (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-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_FMS-PT-005.tgz
mv S_FMS-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_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 r162st-ebro-143319440700113"
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 '
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 ;