About the Execution of Marcie for IOTPpurchase-PT-C03M03P03D03
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
4135.700 | 14761.00 | 14796.00 | 193.60 | TTTTTTFFTTTTTTFF | 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-2270
Executing tool marcie
Input is IOTPpurchase-PT-C03M03P03D03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324700093
=====================================================================
--------------------
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-C03M03P03D03-CTLCardinality-0
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-1
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-2
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-3
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-4
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-5
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-6
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-7
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-8
FORMULA_NAME IOTPpurchase-PT-C03M03P03D03-CTLCardinality-9
=== Now, execution of the tool begins
BK_START 1433633500023
Model: IOTPpurchase-PT-C03M03P03D03
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: 111 NrTr: 45 NrArc: 224)
net check time: 0m0sec
parse formulas successfull
formulas created successfully
place and transition orderings generation:0m0sec
init dd package: 0m3sec
RS generation: 0m0sec
-> reachability set: #nodes 2420 (2.4e+03) #states 354,176 (5)
starting MCC model checker
--------------------------
checking: EX [[EX [3<=Payment_p21_3] | EF [2<=p3_7]]]
normalized: EX [[EX [3<=Payment_p21_3] | E [true U 2<=p3_7]]]
abstracting: (2<=p3_7) states: 848
abstracting: (3<=Payment_p21_3) states: 64
..-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[~ [~ [~ [PaidFor_p11_1<=p1_3]]] & [[[2<=p3_5 & p5_2<=Delivery_p22_8] & [2<=Status_p21_9 & 3<=Payment_p21_7]] | [[2<=Status_p20_6 | 2<=Organization_p20_2] & [Organization_p22_2<=WhatDeliver_p12_1 & 3<=p3_1]]]] | EG [EF [OfferResponce_p10<=p5_4]]]
normalized: [EG [E [true U OfferResponce_p10<=p5_4]] | [[[[Organization_p22_2<=WhatDeliver_p12_1 & 3<=p3_1] & [2<=Status_p20_6 | 2<=Organization_p20_2]] | [[2<=p3_5 & p5_2<=Delivery_p22_8] & [2<=Status_p21_9 & 3<=Payment_p21_7]]] & ~ [PaidFor_p11_1<=p1_3]]]
abstracting: (PaidFor_p11_1<=p1_3) states: 334,328 (5)
abstracting: (3<=Payment_p21_7) states: 4
abstracting: (2<=Status_p21_9) states: 416
abstracting: (p5_2<=Delivery_p22_8) states: 339,086 (5)
abstracting: (2<=p3_5) states: 6,464 (3)
abstracting: (2<=Organization_p20_2) states: 848
abstracting: (2<=Status_p20_6) states: 848
abstracting: (3<=p3_1) states: 16
abstracting: (Organization_p22_2<=WhatDeliver_p12_1) states: 333,480 (5)
abstracting: (OfferResponce_p10<=p5_4) states: 265,408 (5)
EG iterations: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [EX [Organization_p21_2<=p8_3]]
normalized: EG [EX [Organization_p21_2<=p8_3]]
abstracting: (Organization_p21_2<=p8_3) states: 348,380 (5)
..
EG iterations: 1
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: ~ [AG [[[1<=p10_0 | 1<=MerchantOffer_p2] | ConsumerPayment_p3<=PayReceipt_p21_15]]]
normalized: E [true U ~ [[ConsumerPayment_p3<=PayReceipt_p21_15 | [1<=p10_0 | 1<=MerchantOffer_p2]]]]
abstracting: (1<=MerchantOffer_p2) states: 161,048 (5)
abstracting: (1<=p10_0) states: 320,944 (5)
abstracting: (ConsumerPayment_p3<=PayReceipt_p21_15) states: 333,496 (5)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [EF [p2_1<=p6_2]]
normalized: EG [E [true U p2_1<=p6_2]]
abstracting: (p2_1<=p6_2) states: 336,432 (5)
EG iterations: 0
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [~ [[1<=p3_6 & [3<=p4_1 | DeliveryHandlerDelivery_p8_0<=p3_2]]]]
normalized: EG [~ [[1<=p3_6 & [3<=p4_1 | DeliveryHandlerDelivery_p8_0<=p3_2]]]]
abstracting: (DeliveryHandlerDelivery_p8_0<=p3_2) states: 115,708 (5)
abstracting: (3<=p4_1) states: 16
abstracting: (1<=p3_6) states: 21,512 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [[[1<=PaymentNote_p21_16 & [~ [1<=p10_2] & 2<=p2_1]] | [[~ [3<=Order_p22_3] & [Order_p20_8<=p11_7 & 2<=p12_0]] | p7_2<=Order_p22_6]] & EF [EG [p3_5<=p3_1]]]
normalized: [E [true U EG [p3_5<=p3_1]] & [[p7_2<=Order_p22_6 | [[Order_p20_8<=p11_7 & 2<=p12_0] & ~ [3<=Order_p22_3]]] | [1<=PaymentNote_p21_16 & [2<=p2_1 & ~ [1<=p10_2]]]]]
abstracting: (1<=p10_2) states: 20,680 (4)
abstracting: (2<=p2_1) states: 848
abstracting: (1<=PaymentNote_p21_16) states: 21,512 (4)
abstracting: (3<=Order_p22_3) states: 16
abstracting: (2<=p12_0) states: 0
abstracting: (Order_p20_8<=p11_7) states: 352,512 (5)
abstracting: (p7_2<=Order_p22_6) states: 335,576 (5)
abstracting: (p3_5<=p3_1) states: 277,856 (5)
.....................
EG iterations: 21
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [EF [BrandSelection_p11_5<=PaymentRequest_p11_9]]
normalized: ~ [E [true U ~ [E [true U BrandSelection_p11_5<=PaymentRequest_p11_9]]]]
abstracting: (BrandSelection_p11_5<=PaymentRequest_p11_9) states: 334,312 (5)
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AF [[[1<=DeliveryNote_p22_12 & [p12_4<=p3_6 & 3<=PaymentNote_p21_13]] & EX [p3_2<=p6_2]]]
normalized: ~ [EG [~ [[[1<=DeliveryNote_p22_12 & [p12_4<=p3_6 & 3<=PaymentNote_p21_13]] & EX [p3_2<=p6_2]]]]]
abstracting: (p3_2<=p6_2) states: 288,832 (5)
.abstracting: (3<=PaymentNote_p21_13) states: 8
abstracting: (p12_4<=p3_6) states: 53,280 (4)
abstracting: (1<=DeliveryNote_p22_12) states: 26,224 (4)
EG iterations: 0
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: AG [[EG [3<=DeliveryNote_p22_14] | AG [Status_p22_11<=DeliveryHandlerDelivery_p8_0]]]
normalized: ~ [E [true U ~ [[~ [E [true U ~ [Status_p22_11<=DeliveryHandlerDelivery_p8_0]]] | EG [3<=DeliveryNote_p22_14]]]]]
abstracting: (3<=DeliveryNote_p22_14) states: 64
...........
EG iterations: 11
abstracting: (Status_p22_11<=DeliveryHandlerDelivery_p8_0) states: 334,928 (5)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: EG [[~ [~ [2<=Delivery_p22_8]] | AF [Delivery_p22_4<=p7_2]]]
normalized: EG [[2<=Delivery_p22_8 | ~ [EG [~ [Delivery_p22_4<=p7_2]]]]]
abstracting: (Delivery_p22_4<=p7_2) states: 288,496 (5)
........................................................................................
EG iterations: 88
abstracting: (2<=Delivery_p22_8) states: 1,072 (3)
.
EG iterations: 1
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [EX [AF [p11_4<=DeliveryNote_p22_14]] & [AF [p10_2<=Status_p22_7] | AX [[Status_p20_6<=Organization_p20_2 | p2_2<=p3_1]]]]
normalized: [EX [~ [EG [~ [p11_4<=DeliveryNote_p22_14]]]] & [~ [EX [~ [[Status_p20_6<=Organization_p20_2 | p2_2<=p3_1]]]] | ~ [EG [~ [p10_2<=Status_p22_7]]]]]
abstracting: (p10_2<=Status_p22_7) states: 334,976 (5)
....................................................................
EG iterations: 68
abstracting: (p2_2<=p3_1) states: 333,496 (5)
abstracting: (Status_p20_6<=Organization_p20_2) states: 333,496 (5)
.abstracting: (p11_4<=DeliveryNote_p22_14) states: 54,544 (4)
..................................................................................
EG iterations: 82
.-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m2sec
checking: EF [[EG [p4_4<=ConsumerDelivery_p6_0] & ~ [Payment_p21_3<=PaymentRequest_p11_9]]]
normalized: E [true U [EG [p4_4<=ConsumerDelivery_p6_0] & ~ [Payment_p21_3<=PaymentRequest_p11_9]]]
abstracting: (Payment_p21_3<=PaymentRequest_p11_9) states: 313,600 (5)
abstracting: (p4_4<=ConsumerDelivery_p6_0) states: 333,496 (5)
................................................................................................
EG iterations: 96
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
checking: [~ [[2<=PaySchemeData_p21_10 & EF [Order_p20<=DeliveryRequest_p12_5]]] & [E [3<=Status_p20 U 1<=BrandList_p11_2] | [EG [DeliveryRequest_p12_5<=MerchantDelivery_p4_6] | EG [p11_13<=PaymentRequest_p11_9]]]]
normalized: [[E [3<=Status_p20 U 1<=BrandList_p11_2] | [EG [DeliveryRequest_p12_5<=MerchantDelivery_p4_6] | EG [p11_13<=PaymentRequest_p11_9]]] & ~ [[2<=PaySchemeData_p21_10 & E [true U Order_p20<=DeliveryRequest_p12_5]]]]
abstracting: (Order_p20<=DeliveryRequest_p12_5) states: 334,096 (5)
abstracting: (2<=PaySchemeData_p21_10) states: 1,240 (3)
abstracting: (p11_13<=PaymentRequest_p11_9) states: 57,712 (4)
..................................................................................
EG iterations: 82
abstracting: (DeliveryRequest_p12_5<=MerchantDelivery_p4_6) states: 337,192 (5)
.......................
EG iterations: 23
abstracting: (1<=BrandList_p11_2) states: 20,680 (4)
abstracting: (3<=Status_p20) states: 16
-> the formula is TRUE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: EX [[EF [2<=DeliveryResponse_p12_6] & EX [Status_p21_11<=p6_7]]]
normalized: EX [[EX [Status_p21_11<=p6_7] & E [true U 2<=DeliveryResponse_p12_6]]]
abstracting: (2<=DeliveryResponse_p12_6) states: 0
abstracting: (Status_p21_11<=p6_7) states: 326,472 (5)
..-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m1sec
checking: AG [Delivery_p22_4<=ConsumerPayment_p3]
normalized: ~ [E [true U ~ [Delivery_p22_4<=ConsumerPayment_p3]]]
abstracting: (Delivery_p22_4<=ConsumerPayment_p3) states: 288,496 (5)
-> the formula is FALSE
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m0sec
Total processing time: 0m14sec
BK_STOP 1433633514784
--------------------
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
3846
iterations count:1237 (27), effective:247 (5)
initing FirstDep: 0m0sec
iterations count:429 (9), effective:79 (1)
iterations count:251 (5), effective:43 (0)
iterations count:629 (13), effective:112 (2)
iterations count:142 (3), effective:28 (0)
iterations count:114 (2), effective:13 (0)
iterations count:72 (1), effective:6 (0)
iterations count:432 (9), effective:77 (1)
iterations count:45 (1), effective:0 (0)
iterations count:288 (6), effective:53 (1)
iterations count:167 (3), effective:35 (0)
iterations count:45 (1), effective:0 (0)
iterations count:319 (7), effective:63 (1)
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="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/root/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/IOTPpurchase-PT-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution
# this is for BenchKit: explicit launching of the test
cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2270"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C03M03P03D03, 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 r232su-smll-143354324700093"
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 ;