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 IOTPpurchase-PT-C03M03P03D03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r065kn-blw3-146358913200075
=====================================================================

--------------------
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 1463723665818


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=CTLCardinality.xml --mcc-mode --memory=6 --suppress

parse successfull
net created successfully

Net: IOTPpurchase_PT_C03M03P03D03
(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.834sec


RS generation: 0m 0.437sec


-> reachability set: #nodes 6056 (6.1e+03) #states 354,176 (5)



starting MCC model checker
--------------------------

checking: ~ [~ [AG [Organization_p22_2<=Organization_p21_8]]]
normalized: ~ [E [true U ~ [Organization_p22_2<=Organization_p21_8]]]

abstracting: (Organization_p22_2<=Organization_p21_8) states: 333,284 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-1 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.284sec

checking: AX [[AF [2<=Status_p21_9] & ~ [2<=Payment_p20_9]]]
normalized: ~ [EX [~ [[~ [2<=Payment_p20_9] & ~ [EG [~ [2<=Status_p21_9]]]]]]]

abstracting: (2<=Status_p21_9) states: 416
.
EG iterations: 1
abstracting: (2<=Payment_p20_9) states: 848
.-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-3 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: EF [AF [[2<=p12_3 | 2<=Status_p21_11]]]
normalized: E [true U ~ [EG [~ [[2<=p12_3 | 2<=Status_p21_11]]]]]

abstracting: (2<=Status_p21_11) states: 808
abstracting: (2<=p12_3) states: 0
.
EG iterations: 1
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.151sec

checking: EG [Delivery_p22_8<=p1_3]
normalized: EG [Delivery_p22_8<=p1_3]

abstracting: (Delivery_p22_8<=p1_3) states: 329,056 (5)
...................................................................................................
EG iterations: 99
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.628sec

checking: EF [EG [[3<=Payment_p21_3 & 1<=p2_2]]]
normalized: E [true U EG [[3<=Payment_p21_3 & 1<=p2_2]]]

abstracting: (1<=p2_2) states: 21,512 (4)
abstracting: (3<=Payment_p21_3) states: 64
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [EF [[Payment_p21_1<=p12_3 | 2<=p11_7]]]
normalized: ~ [E [true U ~ [E [true U [Payment_p21_1<=p12_3 | 2<=p11_7]]]]]

abstracting: (2<=p11_7) states: 0
abstracting: (Payment_p21_1<=p12_3) states: 351,896 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.030sec

checking: EF [AG [[1<=PaymentHandlerPayment_p5_0 | Organization_p20_2<=p4_3]]]
normalized: E [true U ~ [E [true U ~ [[1<=PaymentHandlerPayment_p5_0 | Organization_p20_2<=p4_3]]]]]

abstracting: (Organization_p20_2<=p4_3) states: 335,864 (5)
abstracting: (1<=PaymentHandlerPayment_p5_0) states: 260,026 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.234sec

checking: AG [E [Order_p22_6<=Organization_p21_4 U ConsumerOffer_p1<=DeliveryHandlerDelivery_p8_0]]
normalized: ~ [E [true U ~ [E [Order_p22_6<=Organization_p21_4 U ConsumerOffer_p1<=DeliveryHandlerDelivery_p8_0]]]]

abstracting: (ConsumerOffer_p1<=DeliveryHandlerDelivery_p8_0) states: 344,488 (5)
abstracting: (Order_p22_6<=Organization_p21_4) states: 291,264 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.494sec

checking: EG [[AX [p3_4<=Payment_p21_1] & ~ [[2<=PayReceipt_p21_15 & 3<=p3_10]]]]
normalized: EG [[~ [[2<=PayReceipt_p21_15 & 3<=p3_10]] & ~ [EX [~ [p3_4<=Payment_p21_1]]]]]

abstracting: (p3_4<=Payment_p21_1) states: 333,496 (5)
.abstracting: (3<=p3_10) states: 16
abstracting: (2<=PayReceipt_p21_15) states: 848
............................................................................................................................
EG iterations: 124
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.859sec

checking: [EF [~ [[p1_1<=p1_3 | p8_1<=p12_3]]] & ~ [~ [1<=PaymentHandlerPayment_p5_0]]]
normalized: [1<=PaymentHandlerPayment_p5_0 & E [true U ~ [[p1_1<=p1_3 | p8_1<=p12_3]]]]

abstracting: (p8_1<=p12_3) states: 351,560 (5)
abstracting: (p1_1<=p1_3) states: 320,296 (5)
abstracting: (1<=PaymentHandlerPayment_p5_0) states: 260,026 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.245sec

checking: [p10_0<=p3_4 | EF [[[3<=p5_2 & 3<=p6_2] & 3<=p2_2]]]
normalized: [p10_0<=p3_4 | E [true U [3<=p2_2 & [3<=p5_2 & 3<=p6_2]]]]

abstracting: (3<=p6_2) states: 272
abstracting: (3<=p5_2) states: 4
abstracting: (3<=p2_2) states: 16
abstracting: (p10_0<=p3_4) states: 53,280 (4)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: EF [[AG [1<=p11_0] & [p12_3<=p3_1 & p12_7<=PayReceipt_p21_12]]]
normalized: E [true U [[p12_3<=p3_1 & p12_7<=PayReceipt_p21_12] & ~ [E [true U ~ [1<=p11_0]]]]]

abstracting: (1<=p11_0) states: 333,496 (5)
abstracting: (p12_7<=PayReceipt_p21_12) states: 60,976 (4)
abstracting: (p12_3<=p3_1) states: 53,280 (4)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-9 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AF [[EG [2<=Payment_p20_9] & [[3<=Order_p22_6 & 3<=PaymentNote_p21_16] & [1<=PaySchemeData_p21_10 & PaymentHandlerPayment_p5_0<=p4_2]]]]
normalized: ~ [EG [~ [[[[3<=Order_p22_6 & 3<=PaymentNote_p21_16] & [1<=PaySchemeData_p21_10 & PaymentHandlerPayment_p5_0<=p4_2]] & EG [2<=Payment_p20_9]]]]]

abstracting: (2<=Payment_p20_9) states: 848
.
EG iterations: 1
abstracting: (PaymentHandlerPayment_p5_0<=p4_2) states: 99,964 (4)
abstracting: (1<=PaySchemeData_p21_10) states: 31,420 (4)
abstracting: (3<=PaymentNote_p21_16) states: 16
abstracting: (3<=Order_p22_6) states: 256

EG iterations: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: [~ [A [p3_3<=Delivery_p20 U Delivery_p22_4<=p3_5]] | AF [~ [[p5_1<=PaidFor_p11_1 | Status_p21_14<=Status_p21_9]]]]
normalized: [~ [EG [[p5_1<=PaidFor_p11_1 | Status_p21_14<=Status_p21_9]]] | ~ [[~ [EG [~ [Delivery_p22_4<=p3_5]]] & ~ [E [~ [Delivery_p22_4<=p3_5] U [~ [p3_3<=Delivery_p20] & ~ [Delivery_p22_4<=p3_5]]]]]]]

abstracting: (Delivery_p22_4<=p3_5) states: 296,480 (5)
abstracting: (p3_3<=Delivery_p20) states: 333,496 (5)
abstracting: (Delivery_p22_4<=p3_5) states: 296,480 (5)
abstracting: (Delivery_p22_4<=p3_5) states: 296,480 (5)
....................................................
EG iterations: 52
abstracting: (Status_p21_14<=Status_p21_9) states: 333,284 (5)
abstracting: (p5_1<=PaidFor_p11_1) states: 338,870 (5)
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-7 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.858sec

checking: AG [[[~ [2<=p6_5] & [p8_1<=PaySchemeData_p21_10 & Organization_p22_2<=p8_2]] | [[Organization_p21_4<=ConsumerPayment_p3 & 2<=Status_p21_5] | BrandSelection_p11_5<=Organization_p22_2]]]
normalized: ~ [E [true U ~ [[[BrandSelection_p11_5<=Organization_p22_2 | [Organization_p21_4<=ConsumerPayment_p3 & 2<=Status_p21_5]] | [[p8_1<=PaySchemeData_p21_10 & Organization_p22_2<=p8_2] & ~ [2<=p6_5]]]]]]

abstracting: (2<=p6_5) states: 11,088 (4)
abstracting: (Organization_p22_2<=p8_2) states: 333,768 (5)
abstracting: (p8_1<=PaySchemeData_p21_10) states: 329,584 (5)
abstracting: (2<=Status_p21_5) states: 848
abstracting: (Organization_p21_4<=ConsumerPayment_p3) states: 313,632 (5)
abstracting: (BrandSelection_p11_5<=Organization_p22_2) states: 334,328 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-4 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.153sec

checking: EF [[[3<=p11_13 | [PaymentHandlerPayment_p5_0<=DeliveryResponse_p12_6 & OfferResponce_p10<=MerchantDelivery_p4_6]] & [[p4_3<=DeliveryRequest_p12_5 | 3<=p7_2] & ~ [Status_p21_5<=Status_p21_9]]]]
normalized: E [true U [[~ [Status_p21_5<=Status_p21_9] & [p4_3<=DeliveryRequest_p12_5 | 3<=p7_2]] & [3<=p11_13 | [PaymentHandlerPayment_p5_0<=DeliveryResponse_p12_6 & OfferResponce_p10<=MerchantDelivery_p4_6]]]]

abstracting: (OfferResponce_p10<=MerchantDelivery_p4_6) states: 223,664 (5)
abstracting: (PaymentHandlerPayment_p5_0<=DeliveryResponse_p12_6) states: 102,832 (5)
abstracting: (3<=p11_13) states: 0
abstracting: (3<=p7_2) states: 16
abstracting: (p4_3<=DeliveryRequest_p12_5) states: 280,064 (5)
abstracting: (Status_p21_5<=Status_p21_9) states: 333,284 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.164sec


Total processing time: 0m13.013sec


BK_STOP 1463723678869

--------------------
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.000sec

8663
iterations count:1267 (28), effective:247 (5)

initing FirstDep: 0m 0.000sec


iterations count:281 (6), effective:53 (1)

iterations count:465 (10), effective:86 (1)

iterations count:77 (1), effective:4 (0)

iterations count:787 (17), effective:146 (3)

iterations count:54 (1), effective:3 (0)

iterations count:675 (15), effective:134 (2)

iterations count:637 (14), effective:129 (2)

iterations count:255 (5), effective:44 (0)

iterations count:260 (5), effective:45 (1)

iterations count:476 (10), effective:91 (2)

iterations count:695 (15), effective:140 (3)

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="/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/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-2979"
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 r065kn-blw3-146358913200075"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;