About the Execution of Marcie for FMS-PT-002
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3958.930 | 7822.00 | 7020.00 | 20.20 | FTFFFTTFTTFTFFFT | 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 FMS-PT-002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r050kn-ebro-143236503400093
=====================================================================
--------------------
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-CTLCardinality-0
FORMULA_NAME FMS-PT-002-CTLCardinality-1
FORMULA_NAME FMS-PT-002-CTLCardinality-10
FORMULA_NAME FMS-PT-002-CTLCardinality-11
FORMULA_NAME FMS-PT-002-CTLCardinality-12
FORMULA_NAME FMS-PT-002-CTLCardinality-13
FORMULA_NAME FMS-PT-002-CTLCardinality-14
FORMULA_NAME FMS-PT-002-CTLCardinality-15
FORMULA_NAME FMS-PT-002-CTLCardinality-2
FORMULA_NAME FMS-PT-002-CTLCardinality-3
FORMULA_NAME FMS-PT-002-CTLCardinality-4
FORMULA_NAME FMS-PT-002-CTLCardinality-5
FORMULA_NAME FMS-PT-002-CTLCardinality-6
FORMULA_NAME FMS-PT-002-CTLCardinality-7
FORMULA_NAME FMS-PT-002-CTLCardinality-8
FORMULA_NAME FMS-PT-002-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1432534082845
Model: FMS-PT-002
reachability algorithm:
Saturation-based algorithm
variable ordering algorithm:
Plain order (as read)
--memory=6 --suppress --rs-algorithm=3 --place-order=1
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=1
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 139 (1.4e+02) #states 3,444 (3)
starting MCC model checker
--------------------------
checking: EF [EF [~ [P12wM3<=M1]]]
normalized: E [true U E [true U ~ [P12wM3<=M1]]]
abstracting: (P12wM3<=M1) states: 3,444 (3)
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [EF [[P1wM1<=P2wP1 & 2<=P12M3]]]
normalized: EG [E [true U [P1wM1<=P2wP1 & 2<=P12M3]]]
abstracting: (2<=P12M3) states: 6
abstracting: (P1wM1<=P2wP1) states: 2,790 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA FMS-PT-002-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[[P2s<=P12s | 3<=P12] | [1<=P2d | 2<=P1M1]] U EX [1<=P12M3]]
normalized: E [[[P2s<=P12s | 3<=P12] | [1<=P2d | 2<=P1M1]] U EX [1<=P12M3]]
abstracting: (1<=P12M3) states: 240
.abstracting: (2<=P1M1) states: 120
abstracting: (1<=P2d) states: 900
abstracting: (3<=P12) states: 0
abstracting: (P2s<=P12s) states: 2,580 (3)
-> the formula is TRUE
FORMULA FMS-PT-002-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [E [~ [1<=P1wP2] U [1<=M2 & 2<=P12]]]
normalized: ~ [E [~ [1<=P1wP2] U [1<=M2 & 2<=P12]]]
abstracting: (2<=P12) states: 6
abstracting: (1<=M2) states: 2,670 (3)
abstracting: (1<=P1wP2) states: 864
-> the formula is TRUE
FORMULA FMS-PT-002-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [~ [~ [2<=P1M1]]] & EG [EF [3<=P2wM2]]]
normalized: [EG [E [true U 3<=P2wM2]] & ~ [2<=P1M1]]
abstracting: (2<=P1M1) states: 120
abstracting: (3<=P2wM2) states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[P2M2<=M1 | ~ [P2M2<=P3]] | EG [M1<=P1wP2]]]
normalized: ~ [E [true U ~ [[[P2M2<=M1 | ~ [P2M2<=P3]] | EG [M1<=P1wP2]]]]]
abstracting: (M1<=P1wP2) states: 0
.
EG iterations: 1
abstracting: (P2M2<=P3) states: 3,057 (3)
abstracting: (P2M2<=M1) states: 3,444 (3)
-> the formula is TRUE
FORMULA FMS-PT-002-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[~ [M1<=P2wP1] | 1<=M2] U 3<=P2]
normalized: E [[1<=M2 | ~ [M1<=P2wP1]] U 3<=P2]
abstracting: (3<=P2) states: 0
abstracting: (M1<=P2wP1) states: 66
abstracting: (1<=M2) states: 2,670 (3)
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[~ [2<=P2s] & EX [3<=P1wM1]]]
normalized: E [true U [~ [2<=P2s] & EX [3<=P1wM1]]]
abstracting: (3<=P1wM1) states: 0
.abstracting: (2<=P2s) states: 126
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [EF [[3<=M2 & P2s<=P1M1]]]
normalized: EG [E [true U [3<=M2 & P2s<=P1M1]]]
abstracting: (P2s<=P1M1) states: 2,754 (3)
abstracting: (3<=M2) states: 0
.
EG iterations: 1
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[~ [[2<=P1wM1 | M1<=P3]] | P12s<=M1]]
normalized: ~ [E [true U ~ [[P12s<=M1 | ~ [[2<=P1wM1 | M1<=P3]]]]]]
abstracting: (M1<=P3) states: 184
abstracting: (2<=P1wM1) states: 120
abstracting: (P12s<=M1) states: 3,444 (3)
-> the formula is TRUE
FORMULA FMS-PT-002-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [AF [P12wM3<=P2wP1] U EF [M1<=P12]]
normalized: E [~ [EG [~ [P12wM3<=P2wP1]]] U E [true U M1<=P12]]
abstracting: (M1<=P12) states: 0
abstracting: (P12wM3<=P2wP1) states: 3,240 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [M2<=P2wP1 | EF [AG [2<=P12s]]]
normalized: [M2<=P2wP1 | E [true U ~ [E [true U ~ [2<=P12s]]]]]
abstracting: (2<=P12s) states: 6
abstracting: (M2<=P2wP1) states: 1,548 (3)
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [2<=M2 | [[[1<=P2wM2 & [P2<=P2wP1 & 1<=M1]] & M1<=P1wM1] | ~ [AG [P12wM3<=P12wM3]]]]
normalized: [2<=M2 | [E [true U ~ [P12wM3<=P12wM3]] | [M1<=P1wM1 & [1<=P2wM2 & [P2<=P2wP1 & 1<=M1]]]]]
abstracting: (1<=M1) states: 3,444 (3)
abstracting: (P2<=P2wP1) states: 2,670 (3)
abstracting: (1<=P2wM2) states: 900
abstracting: (M1<=P1wM1) states: 0
abstracting: (P12wM3<=P12wM3) states: 3,444 (3)
abstracting: (2<=M2) states: 0
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[[[1<=P1wP2 & P12<=P2wP1] | ~ [1<=P1d]] | EX [P1s<=P2wP1]]]
normalized: ~ [E [true U ~ [[EX [P1s<=P2wP1] | [~ [1<=P1d] | [1<=P1wP2 & P12<=P2wP1]]]]]]
abstracting: (P12<=P2wP1) states: 3,240 (3)
abstracting: (1<=P1wP2) states: 864
abstracting: (1<=P1d) states: 864
abstracting: (P1s<=P2wP1) states: 2,790 (3)
.-> the formula is TRUE
FORMULA FMS-PT-002-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [~ [1<=P3]] & EF [EF [2<=P12]]]
normalized: [1<=P3 & E [true U E [true U 2<=P12]]]
abstracting: (2<=P12) states: 6
abstracting: (1<=P3) states: 1,722 (3)
-> the formula is TRUE
FORMULA FMS-PT-002-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [EF [[3<=P1d | 3<=P1wP2]]]
normalized: ~ [E [true U ~ [E [true U [3<=P1d | 3<=P1wP2]]]]]
abstracting: (3<=P1wP2) states: 0
abstracting: (3<=P1d) states: 0
-> the formula is FALSE
FORMULA FMS-PT-002-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m7sec
BK_STOP 1432534090667
--------------------
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:164 (8), effective:32 (1)
initing FirstDep: 0m0sec
iterations count:111 (5), effective:16 (0)
iterations count:124 (6), effective:16 (0)
iterations count:20 (1), effective:0 (0)
iterations count:28 (1), effective:1 (0)
iterations count:102 (5), effective:16 (0)
iterations count:20 (1), effective:0 (0)
iterations count:20 (1), effective:0 (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="FMS-PT-002"
export BK_EXAMINATION="CTLCardinality"
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/FMS-PT-002.tgz
mv 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 FMS-PT-002, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 1"
echo " Run identifier is r050kn-ebro-143236503400093"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "ReachabilityComputeBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 ;