About the Execution of Marcie for S_Eratosthenes-PT-020
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3959.070 | 10175.00 | 9990.00 | 29.70 | FTFFTTFTFFFTTTFT | 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_Eratosthenes-PT-020, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r162st-ebro-143319440600028
=====================================================================
--------------------
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 Eratosthenes-PT-020-CTLCardinality-0
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-1
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-10
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-11
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-12
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-13
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-14
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-15
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-2
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-3
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-4
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-5
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-6
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-7
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-8
FORMULA_NAME Eratosthenes-PT-020-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433367403119
Model: S_Eratosthenes-PT-020
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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 19 NrTr: 27 NrArc: 81)
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 19 (1.9e+01) #states 2,048 (3)
starting MCC model checker
--------------------------
checking: EF [AX [~ [p9<=p9]]]
normalized: E [true U ~ [EX [p9<=p9]]]
abstracting: (p9<=p9) states: 2,048 (3)
.-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[AG [[2<=p8 & p9<=p19]] | [[~ [1<=p10] & 2<=p10] | EG [p4<=p5]]] & ~ [2<=p17]]
normalized: [~ [2<=p17] & [~ [E [true U ~ [[2<=p8 & p9<=p19]]]] | [EG [p4<=p5] | [2<=p10 & ~ [1<=p10]]]]]
abstracting: (1<=p10) states: 1,024 (3)
abstracting: (2<=p10) states: 0
abstracting: (p4<=p5) states: 2,048 (3)
EG iterations: 0
abstracting: (p9<=p19) states: 2,048 (3)
abstracting: (2<=p8) states: 0
abstracting: (2<=p17) states: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [AG [~ [2<=p19]]]
normalized: E [true U 2<=p19]
abstracting: (2<=p19) states: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[~ [~ [p12<=p2]] | ~ [~ [p14<=p6]]] & p20<=p13] & EF [[~ [2<=p8] & ~ [p12<=p12]]]]
normalized: [E [true U [~ [2<=p8] & ~ [p12<=p12]]] & [p20<=p13 & [p12<=p2 | p14<=p6]]]
abstracting: (p14<=p6) states: 1,536 (3)
abstracting: (p12<=p2) states: 2,048 (3)
abstracting: (p20<=p13) states: 2,048 (3)
abstracting: (p12<=p12) states: 2,048 (3)
abstracting: (2<=p8) states: 0
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [3<=p15] & [[[[2<=p5 & p2<=p4] | [p16<=p9 | p19<=p19]] & EF [2<=p9]] & ~ [EX [3<=p19]]]]
normalized: [[~ [EX [3<=p19]] & [E [true U 2<=p9] & [[p16<=p9 | p19<=p19] | [2<=p5 & p2<=p4]]]] & ~ [3<=p15]]
abstracting: (3<=p15) states: 0
abstracting: (p2<=p4) states: 1,024 (3)
abstracting: (2<=p5) states: 0
abstracting: (p19<=p19) states: 2,048 (3)
abstracting: (p16<=p9) states: 1,536 (3)
abstracting: (2<=p9) states: 0
abstracting: (3<=p19) states: 0
.-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [1<=p2]
normalized: ~ [E [true U ~ [1<=p2]]]
abstracting: (1<=p2) states: 2,048 (3)
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [AG [AF [3<=p15]]]
normalized: E [true U EG [~ [3<=p15]]]
abstracting: (3<=p15) states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [A [p15<=p9 U p20<=p2]]
normalized: ~ [E [true U ~ [[~ [EG [~ [p20<=p2]]] & ~ [E [~ [p15<=p9] U [~ [p20<=p2] & ~ [p15<=p9]]]]]]]]
abstracting: (p15<=p9) states: 1,536 (3)
abstracting: (p20<=p2) states: 2,048 (3)
abstracting: (p15<=p9) states: 1,536 (3)
abstracting: (p20<=p2) states: 2,048 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [AF [[1<=p8 | 2<=p15]]]
normalized: ~ [E [true U EG [~ [[1<=p8 | 2<=p15]]]]]
abstracting: (2<=p15) states: 0
abstracting: (1<=p8) states: 1,024 (3)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [AG [p16<=p13]]
normalized: EG [~ [E [true U ~ [p16<=p13]]]]
abstracting: (p16<=p13) states: 2,048 (3)
EG iterations: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [~ [~ [p12<=p15]] U EF [2<=p15]]
normalized: E [p12<=p15 U E [true U 2<=p15]]
abstracting: (2<=p15) states: 0
abstracting: (p12<=p15) states: 1,536 (3)
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [p3<=p8]
normalized: EG [p3<=p8]
abstracting: (p3<=p8) states: 1,024 (3)
............
EG iterations: 12
-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [[~ [~ [3<=p5]] | p10<=p3]]
normalized: EG [[3<=p5 | p10<=p3]]
abstracting: (p10<=p3) states: 2,048 (3)
abstracting: (3<=p5) states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [A [[p20<=p13 | p9<=p18] U [3<=p7 & 2<=p11]]]
normalized: ~ [[~ [EG [~ [[3<=p7 & 2<=p11]]]] & ~ [E [~ [[p20<=p13 | p9<=p18]] U [~ [[p20<=p13 | p9<=p18]] & ~ [[3<=p7 & 2<=p11]]]]]]]
abstracting: (2<=p11) states: 0
abstracting: (3<=p7) states: 0
abstracting: (p9<=p18) states: 1,536 (3)
abstracting: (p20<=p13) states: 2,048 (3)
abstracting: (p9<=p18) states: 1,536 (3)
abstracting: (p20<=p13) states: 2,048 (3)
abstracting: (2<=p11) states: 0
abstracting: (3<=p7) states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [AF [EX [2<=p16]] & EX [~ [~ [p19<=p8]]]]
normalized: [EX [p19<=p8] & ~ [EG [~ [EX [2<=p16]]]]]
abstracting: (2<=p16) states: 0
.
EG iterations: 0
abstracting: (p19<=p8) states: 1,024 (3)
.-> the formula is FALSE
FORMULA Eratosthenes-PT-020-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [p15<=p4]
normalized: EG [p15<=p4]
abstracting: (p15<=p4) states: 1,536 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Eratosthenes-PT-020-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m10sec
BK_STOP 1433367413294
--------------------
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:86 (3), effective:11 (0)
initing FirstDep: 0m0sec
iterations count:27 (1), effective:0 (0)
iterations count:27 (1), effective:0 (0)
iterations count:33 (1), effective:1 (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_Eratosthenes-PT-020"
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/S_Eratosthenes-PT-020.tgz
mv S_Eratosthenes-PT-020 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_Eratosthenes-PT-020, 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 r162st-ebro-143319440600028"
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 ;