About the Execution of Marcie for S_IOTPpurchase-PT-C01M01P01D01
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5416.410 | 5192.00 | 5029.00 | 30.20 | FFFFTFFFTTFTFTTT | 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-2979
Executing tool marcie
Input is S_IOTPpurchase-PT-C01M01P01D01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r161kn-blw3-146416418100070
=====================================================================
--------------------
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 IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-0
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-1
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-10
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-11
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-12
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-13
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-14
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-15
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-2
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-3
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-4
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-5
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-6
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-7
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-8
FORMULA_NAME IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-9
=== Now, execution of the tool begins
BK_START 1464330519732
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: IOTPpurchase_PT_C01M01P01D01
(NrP: 111 NrTr: 45 NrArc: 224)
net check time: 0m 0.000sec
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
init dd package: 0m 3.715sec
RS generation: 0m 0.017sec
-> reachability set: #nodes 651 (6.5e+02) #states 204
starting MCC model checker
--------------------------
checking: AG [3<=DeliveryRequest_p12_5]
normalized: ~ [E [true U ~ [3<=DeliveryRequest_p12_5]]]
abstracting: (3<=DeliveryRequest_p12_5) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: AG [2<=p11_11]
normalized: ~ [E [true U ~ [2<=p11_11]]]
abstracting: (2<=p11_11) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: AG [2<=p1_3]
normalized: ~ [E [true U ~ [2<=p1_3]]]
abstracting: (2<=p1_3) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [[~ [2<=p7_1] & ~ [2<=PaymentNote_p21_13]]]]
normalized: E [true U ~ [[~ [2<=p7_1] & ~ [2<=PaymentNote_p21_13]]]]
abstracting: (2<=PaymentNote_p21_13) states: 0
abstracting: (2<=p7_1) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [~ [~ [[DeliveryNote_p22_12<=PaymentAmount_p11_6 | 1<=p3_2]]]]
normalized: E [true U [DeliveryNote_p22_12<=PaymentAmount_p11_6 | 1<=p3_2]]
abstracting: (1<=p3_2) states: 16
abstracting: (DeliveryNote_p22_12<=PaymentAmount_p11_6) states: 200
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[~ [~ [p6_5<=p4_4]] | 1<=Status_p22_13]]
normalized: E [true U [p6_5<=p4_4 | 1<=Status_p22_13]]
abstracting: (1<=Status_p22_13) states: 8
abstracting: (p6_5<=p4_4) states: 180
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: EF [~ [[p3_8<=Order_p20 | 3<=ConsumerDelivery_p6_0]]]
normalized: E [true U ~ [[p3_8<=Order_p20 | 3<=ConsumerDelivery_p6_0]]]
abstracting: (3<=ConsumerDelivery_p6_0) states: 0
abstracting: (p3_8<=Order_p20) states: 190
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EF [~ [~ [[2<=BrandList_p11_2 & p11_7<=Order_p22_3]]]]
normalized: E [true U [2<=BrandList_p11_2 & p11_7<=Order_p22_3]]
abstracting: (p11_7<=Order_p22_3) states: 8
abstracting: (2<=BrandList_p11_2) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [[~ [p3_7<=p7_3] | [2<=p4_1 | ~ [2<=p3_1]]]]
normalized: E [true U [[2<=p4_1 | ~ [2<=p3_1]] | ~ [p3_7<=p7_3]]]
abstracting: (p3_7<=p7_3) states: 200
abstracting: (2<=p3_1) states: 0
abstracting: (2<=p4_1) states: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [~ [[~ [3<=p3_8] | [2<=p4_4 & Status_p22_11<=PaymentNote_p21_13]]]]
normalized: ~ [E [true U [[2<=p4_4 & Status_p22_11<=PaymentNote_p21_13] | ~ [3<=p3_8]]]]
abstracting: (3<=p3_8) states: 0
abstracting: (Status_p22_11<=PaymentNote_p21_13) states: 196
abstracting: (2<=p4_4) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[2<=Delivery_p20_10 & ~ [[PaymentNote_p21_16<=p11_3 & p11_3<=Delivery_p22_4]]]]
normalized: ~ [E [true U ~ [[2<=Delivery_p20_10 & ~ [[PaymentNote_p21_16<=p11_3 & p11_3<=Delivery_p22_4]]]]]]
abstracting: (p11_3<=Delivery_p22_4) states: 20
abstracting: (PaymentNote_p21_16<=p11_3) states: 204
abstracting: (2<=Delivery_p20_10) states: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [[[3<=p11_7 & [p3_8<=p10_2 & 3<=p7_2]] | DeliveryHandlerDelivery_p8_0<=WhatDeliver_p12_1]]
normalized: E [true U [DeliveryHandlerDelivery_p8_0<=WhatDeliver_p12_1 | [3<=p11_7 & [p3_8<=p10_2 & 3<=p7_2]]]]
abstracting: (3<=p7_2) states: 0
abstracting: (p3_8<=p10_2) states: 190
abstracting: (3<=p11_7) states: 0
abstracting: (DeliveryHandlerDelivery_p8_0<=WhatDeliver_p12_1) states: 108
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: EF [[[~ [3<=p3_2] & [1<=Payment_p21_7 | Order_p20<=Status_p21_14]] & ~ [[1<=p5_3 & 2<=Status_p22_7]]]]
normalized: E [true U [~ [[1<=p5_3 & 2<=Status_p22_7]] & [[1<=Payment_p21_7 | Order_p20<=Status_p21_14] & ~ [3<=p3_2]]]]
abstracting: (3<=p3_2) states: 0
abstracting: (Order_p20<=Status_p21_14) states: 200
abstracting: (1<=Payment_p21_7) states: 2
abstracting: (2<=Status_p22_7) states: 0
abstracting: (1<=p5_3) states: 4
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[~ [3<=p2_2] | [[p12_3<=DeliveryHandlerDelivery_p8_0 | DeliveryNote_p22_14<=p1_2] | [2<=PaySchemeData_p21_10 & PaySchemeData_p21_10<=p7_1]]]]
normalized: ~ [E [true U ~ [[~ [3<=p2_2] | [[2<=PaySchemeData_p21_10 & PaySchemeData_p21_10<=p7_1] | [p12_3<=DeliveryHandlerDelivery_p8_0 | DeliveryNote_p22_14<=p1_2]]]]]]
abstracting: (DeliveryNote_p22_14<=p1_2) states: 196
abstracting: (p12_3<=DeliveryHandlerDelivery_p8_0) states: 102
abstracting: (PaySchemeData_p21_10<=p7_1) states: 200
abstracting: (2<=PaySchemeData_p21_10) states: 0
abstracting: (3<=p2_2) states: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: AG [[BrandList_p11_2<=Order_p22_3 & [[PayReceipt_p21_12<=Order_p22_6 & Delivery_p22_4<=p4_1] & [p11_13<=p7_1 & 1<=PaymentAmount_p11_6]]]]
normalized: ~ [E [true U ~ [[BrandList_p11_2<=Order_p22_3 & [[PayReceipt_p21_12<=Order_p22_6 & Delivery_p22_4<=p4_1] & [p11_13<=p7_1 & 1<=PaymentAmount_p11_6]]]]]]
abstracting: (1<=PaymentAmount_p11_6) states: 4
abstracting: (p11_13<=p7_1) states: 12
abstracting: (Delivery_p22_4<=p4_1) states: 188
abstracting: (PayReceipt_p21_12<=Order_p22_6) states: 200
abstracting: (BrandList_p11_2<=Order_p22_3) states: 200
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.002sec
checking: EF [[[[2<=p4_2 & 2<=p5_4] & [2<=p6_2 & OfferResponce_p10<=Order_p22_10]] & [Status_p22_7<=MerchantDelivery_p4_6 & [p11_11<=p11_11 | p6_1<=p10_2]]]]
normalized: E [true U [[Status_p22_7<=MerchantDelivery_p4_6 & [p11_11<=p11_11 | p6_1<=p10_2]] & [[2<=p6_2 & OfferResponce_p10<=Order_p22_10] & [2<=p4_2 & 2<=p5_4]]]]
abstracting: (2<=p5_4) states: 0
abstracting: (2<=p4_2) states: 0
abstracting: (OfferResponce_p10<=Order_p22_10) states: 8
abstracting: (2<=p6_2) states: 0
abstracting: (p6_1<=p10_2) states: 200
abstracting: (p11_11<=p11_11) states: 204
abstracting: (Status_p22_7<=MerchantDelivery_p4_6) states: 196
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
Total processing time: 0m 5.159sec
BK_STOP 1464330524924
--------------------
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:457 (10), effective:83 (1)
initing FirstDep: 0m 0.000sec
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:47 (1), effective:1 (0)
iterations count:58 (1), effective:5 (0)
iterations count:242 (5), effective:40 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:248 (5), effective:41 (0)
iterations count:50 (1), effective:1 (0)
iterations count:45 (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="S_IOTPpurchase-PT-C01M01P01D01"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/home/hulinhub/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_IOTPpurchase-PT-C01M01P01D01.tgz
mv S_IOTPpurchase-PT-C01M01P01D01 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_IOTPpurchase-PT-C01M01P01D01, 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 r161kn-blw3-146416418100070"
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 '
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 ;