About the Execution of Marcie for Railroad-PT-005
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
3962.480 | 9513.00 | 9019.00 | 20.20 | TFTFFFFTFFFTFFFF | 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 Railroad-PT-005, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r078kn-ebro-143262779500938
=====================================================================
--------------------
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 Railroad-PT-005-CTLCardinality-0
FORMULA_NAME Railroad-PT-005-CTLCardinality-1
FORMULA_NAME Railroad-PT-005-CTLCardinality-10
FORMULA_NAME Railroad-PT-005-CTLCardinality-11
FORMULA_NAME Railroad-PT-005-CTLCardinality-12
FORMULA_NAME Railroad-PT-005-CTLCardinality-13
FORMULA_NAME Railroad-PT-005-CTLCardinality-14
FORMULA_NAME Railroad-PT-005-CTLCardinality-15
FORMULA_NAME Railroad-PT-005-CTLCardinality-2
FORMULA_NAME Railroad-PT-005-CTLCardinality-3
FORMULA_NAME Railroad-PT-005-CTLCardinality-4
FORMULA_NAME Railroad-PT-005-CTLCardinality-5
FORMULA_NAME Railroad-PT-005-CTLCardinality-6
FORMULA_NAME Railroad-PT-005-CTLCardinality-7
FORMULA_NAME Railroad-PT-005-CTLCardinality-8
FORMULA_NAME Railroad-PT-005-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1432914964442
Model: Railroad-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=CTLCardinality.xml --memory=6 --suppress --rs-algorithm=3 --place-order=5
parse successfull
net created successfully
(NrP: 68 NrTr: 56 NrArc: 313)
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 1751 (1.8e+03) #states 1,838 (3)
starting MCC model checker
--------------------------
checking: [[~ [EX [1<=pl_P22_1]] & AG [~ [1<=pl_P1_1]]] & [~ [[[3<=pl_P29_3 | 2<=pl_P8_1] & 2<=pl_P41_1]] | 3<=pl_P0_6]]
normalized: [[~ [EX [1<=pl_P22_1]] & ~ [E [true U 1<=pl_P1_1]]] & [3<=pl_P0_6 | ~ [[2<=pl_P41_1 & [3<=pl_P29_3 | 2<=pl_P8_1]]]]]
abstracting: (2<=pl_P8_1) states: 0
abstracting: (3<=pl_P29_3) states: 0
abstracting: (2<=pl_P41_1) states: 0
abstracting: (3<=pl_P0_6) states: 0
abstracting: (1<=pl_P1_1) states: 0
abstracting: (1<=pl_P22_1) states: 431
.-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [[[[pl_P10_1<=pl_P3_1 & 2<=pl_P13_1] & ~ [pl_P34_3<=pl_P40_2]] & 3<=pl_P34_4]] & [[pl_P0_2<=pl_P38_1 | [~ [pl_P39_1<=pl_P40_5] | ~ [3<=pl_P0_6]]] & EF [2<=pl_P34_4]]]
normalized: [~ [[3<=pl_P34_4 & [~ [pl_P34_3<=pl_P40_2] & [pl_P10_1<=pl_P3_1 & 2<=pl_P13_1]]]] & [[pl_P0_2<=pl_P38_1 | [~ [pl_P39_1<=pl_P40_5] | ~ [3<=pl_P0_6]]] & E [true U 2<=pl_P34_4]]]
abstracting: (2<=pl_P34_4) states: 0
abstracting: (3<=pl_P0_6) states: 0
abstracting: (pl_P39_1<=pl_P40_5) states: 1,832 (3)
abstracting: (pl_P0_2<=pl_P38_1) states: 1,380 (3)
abstracting: (2<=pl_P13_1) states: 0
abstracting: (pl_P10_1<=pl_P3_1) states: 1,833 (3)
abstracting: (pl_P34_3<=pl_P40_2) states: 1,600 (3)
abstracting: (3<=pl_P34_4) states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[pl_P33_1<=pl_P40_1 | pl_P29_2<=pl_P38_1] U ~ [pl_P38_1<=pl_P23_1]]
normalized: E [[pl_P33_1<=pl_P40_1 | pl_P29_2<=pl_P38_1] U ~ [pl_P38_1<=pl_P23_1]]
abstracting: (pl_P38_1<=pl_P23_1) states: 1,838 (3)
abstracting: (pl_P29_2<=pl_P38_1) states: 1,827 (3)
abstracting: (pl_P33_1<=pl_P40_1) states: 1,832 (3)
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[2<=pl_P34_4 | EG [1<=pl_P29_3]]]
normalized: E [true U [2<=pl_P34_4 | EG [1<=pl_P29_3]]]
abstracting: (1<=pl_P29_3) states: 17
.....
EG iterations: 5
abstracting: (2<=pl_P34_4) states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[[pl_P34_3<=pl_P38_1 & 2<=pl_P7_4] | ~ [pl_P6_1<=pl_P23_1]] & ~ [[2<=pl_P34_3 | pl_P14_1<=pl_P20_1]]]]
normalized: E [true U [~ [[2<=pl_P34_3 | pl_P14_1<=pl_P20_1]] & [~ [pl_P6_1<=pl_P23_1] | [pl_P34_3<=pl_P38_1 & 2<=pl_P7_4]]]]
abstracting: (2<=pl_P7_4) states: 0
abstracting: (pl_P34_3<=pl_P38_1) states: 1,558 (3)
abstracting: (pl_P6_1<=pl_P23_1) states: 1,811 (3)
abstracting: (pl_P14_1<=pl_P20_1) states: 1,838 (3)
abstracting: (2<=pl_P34_3) states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [EF [2<=pl_P29_6]] | AF [EF [3<=pl_P36_1]]]
normalized: [~ [EG [~ [E [true U 3<=pl_P36_1]]]] | ~ [E [true U 2<=pl_P29_6]]]
abstracting: (2<=pl_P29_6) states: 0
abstracting: (3<=pl_P36_1) states: 0
EG iterations: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [1<=pl_P38_1]
normalized: E [true U 1<=pl_P38_1]
abstracting: (1<=pl_P38_1) states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [[[~ [pl_P34_6<=pl_P36_1] & pl_P28_1<=pl_P17_1] & [3<=pl_P23_1 | [3<=pl_P29_2 | 3<=pl_P7_6]]]]
normalized: E [true U [[3<=pl_P23_1 | [3<=pl_P29_2 | 3<=pl_P7_6]] & [pl_P28_1<=pl_P17_1 & ~ [pl_P34_6<=pl_P36_1]]]]
abstracting: (pl_P34_6<=pl_P36_1) states: 1,595 (3)
abstracting: (pl_P28_1<=pl_P17_1) states: 1,535 (3)
abstracting: (3<=pl_P7_6) states: 0
abstracting: (3<=pl_P29_2) states: 0
abstracting: (3<=pl_P23_1) states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: E [[3<=pl_P34_1 | pl_P39_1<=pl_P28_1] U ~ [[pl_P0_2<=pl_P1_1 | pl_P3_1<=pl_P17_1]]]
normalized: E [[3<=pl_P34_1 | pl_P39_1<=pl_P28_1] U ~ [[pl_P0_2<=pl_P1_1 | pl_P3_1<=pl_P17_1]]]
abstracting: (pl_P3_1<=pl_P17_1) states: 1,838 (3)
abstracting: (pl_P0_2<=pl_P1_1) states: 1,380 (3)
abstracting: (pl_P39_1<=pl_P28_1) states: 1,832 (3)
abstracting: (3<=pl_P34_1) states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[2<=pl_P28_1 & [pl_P7_3<=pl_P40_2 | ~ [pl_P0_1<=pl_P27_1]]] | [EG [3<=pl_P29_5] | ~ [[3<=pl_P33_1 | pl_P13_1<=pl_P34_1]]]] | E [pl_P14_1<=pl_P0_4 U [2<=pl_P14_1 & 3<=pl_P29_5]]]
normalized: [E [pl_P14_1<=pl_P0_4 U [2<=pl_P14_1 & 3<=pl_P29_5]] | [[~ [[3<=pl_P33_1 | pl_P13_1<=pl_P34_1]] | EG [3<=pl_P29_5]] | [2<=pl_P28_1 & [pl_P7_3<=pl_P40_2 | ~ [pl_P0_1<=pl_P27_1]]]]]
abstracting: (pl_P0_1<=pl_P27_1) states: 1,603 (3)
abstracting: (pl_P7_3<=pl_P40_2) states: 1,832 (3)
abstracting: (2<=pl_P28_1) states: 0
abstracting: (3<=pl_P29_5) states: 0
.
EG iterations: 1
abstracting: (pl_P13_1<=pl_P34_1) states: 1,324 (3)
abstracting: (3<=pl_P33_1) states: 0
abstracting: (3<=pl_P29_5) states: 0
abstracting: (2<=pl_P14_1) states: 0
abstracting: (pl_P14_1<=pl_P0_4) states: 1,838 (3)
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [AG [[[pl_P27_1<=pl_P7_6 & pl_P40_4<=pl_P34_1] | ~ [1<=pl_P7_5]]] & [[[[pl_P19_1<=pl_P34_2 & pl_P7_5<=pl_P7_1] & ~ [1<=pl_P21_1]] | [~ [1<=pl_P22_1] | [2<=pl_P21_1 | pl_P28_1<=pl_P34_2]]] | [AG [pl_P4_1<=pl_P29_3] | [1<=pl_P1_1 & [3<=pl_P18_1 | 2<=pl_P21_1]]]]]
normalized: [~ [E [true U ~ [[~ [1<=pl_P7_5] | [pl_P27_1<=pl_P7_6 & pl_P40_4<=pl_P34_1]]]]] & [[[1<=pl_P1_1 & [3<=pl_P18_1 | 2<=pl_P21_1]] | ~ [E [true U ~ [pl_P4_1<=pl_P29_3]]]] | [[~ [1<=pl_P22_1] | [2<=pl_P21_1 | pl_P28_1<=pl_P34_2]] | [~ [1<=pl_P21_1] & [pl_P19_1<=pl_P34_2 & pl_P7_5<=pl_P7_1]]]]]
abstracting: (pl_P7_5<=pl_P7_1) states: 1,838 (3)
abstracting: (pl_P19_1<=pl_P34_2) states: 1,412 (3)
abstracting: (1<=pl_P21_1) states: 431
abstracting: (pl_P28_1<=pl_P34_2) states: 1,412 (3)
abstracting: (2<=pl_P21_1) states: 0
abstracting: (1<=pl_P22_1) states: 431
abstracting: (pl_P4_1<=pl_P29_3) states: 1,407 (3)
abstracting: (2<=pl_P21_1) states: 0
abstracting: (3<=pl_P18_1) states: 0
abstracting: (1<=pl_P1_1) states: 0
abstracting: (pl_P40_4<=pl_P34_1) states: 1,407 (3)
abstracting: (pl_P27_1<=pl_P7_6) states: 949
abstracting: (1<=pl_P7_5) states: 0
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EF [AG [[1<=pl_P37_1 & pl_P31_1<=pl_P26_1]]]
normalized: E [true U ~ [E [true U ~ [[1<=pl_P37_1 & pl_P31_1<=pl_P26_1]]]]]
abstracting: (pl_P31_1<=pl_P26_1) states: 963
abstracting: (1<=pl_P37_1) states: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [EF [[3<=pl_P17_1 & 2<=pl_P34_1]]]
normalized: ~ [EG [~ [E [true U [3<=pl_P17_1 & 2<=pl_P34_1]]]]]
abstracting: (2<=pl_P34_1) states: 0
abstracting: (3<=pl_P17_1) states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [EF [2<=pl_P40_4]]
normalized: ~ [EG [~ [E [true U 2<=pl_P40_4]]]]
abstracting: (2<=pl_P40_4) states: 0
EG iterations: 0
-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EX [[[pl_P32_1<=pl_P35_1 & pl_P23_1<=pl_P41_1] | EF [2<=pl_P15_1]]]
normalized: EX [[[pl_P32_1<=pl_P35_1 & pl_P23_1<=pl_P41_1] | E [true U 2<=pl_P15_1]]]
abstracting: (2<=pl_P15_1) states: 0
abstracting: (pl_P23_1<=pl_P41_1) states: 464
abstracting: (pl_P32_1<=pl_P35_1) states: 953
.-> the formula is FALSE
FORMULA Railroad-PT-005-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[~ [3<=pl_P21_1] | ~ [[~ [2<=pl_P29_4] & ~ [pl_P11_1<=pl_P1_1]]]] & AG [AG [pl_P7_4<=pl_P34_6]]]
normalized: [~ [E [true U E [true U ~ [pl_P7_4<=pl_P34_6]]]] & [~ [[~ [pl_P11_1<=pl_P1_1] & ~ [2<=pl_P29_4]]] | ~ [3<=pl_P21_1]]]
abstracting: (3<=pl_P21_1) states: 0
abstracting: (2<=pl_P29_4) states: 0
abstracting: (pl_P11_1<=pl_P1_1) states: 28
abstracting: (pl_P7_4<=pl_P34_6) states: 1,838 (3)
-> the formula is TRUE
FORMULA Railroad-PT-005-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m9sec
BK_STOP 1432914973955
--------------------
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
1244
iterations count:1690 (30), effective:66 (1)
initing FirstDep: 0m0sec
iterations count:871 (15), effective:34 (0)
iterations count:56 (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="Railroad-PT-005"
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/Railroad-PT-005.tgz
mv Railroad-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 Railroad-PT-005, 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 r078kn-ebro-143262779500938"
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 ;