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

--------------------
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-C12M10P15D17-CTLCardinality-0
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-1
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-10
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-11
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-12
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-13
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-14
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-15
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-2
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-3
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-4
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-5
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-6
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-7
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-8
FORMULA_NAME IOTPpurchase-PT-C12M10P15D17-CTLCardinality-9

=== Now, execution of the tool begins

BK_START 1463723954991


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_C12M10P15D17
(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.665sec


RS generation: 4m21.330sec


-> reachability set: #nodes 730767 (7.3e+05) #states 92,677,131,972,792 (13)



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

checking: AF [2<=Payment_p20]
normalized: ~ [EG [~ [2<=Payment_p20]]]

abstracting: (2<=Payment_p20) states: 4,222,601,069,000 (12)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 0m 0.020sec

checking: AG [~ [EG [2<=Delivery_p22_1]]]
normalized: ~ [E [true U EG [2<=Delivery_p22_1]]]

abstracting: (2<=Delivery_p22_1) states: 4,222,601,069,000 (12)
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 1m 7.100sec

checking: EF [1<=Status_p22_13]
normalized: E [true U 1<=Status_p22_13]

abstracting: (1<=Status_p22_13) states: 30,058,721,041,288 (13)
-> the formula is TRUE

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

MC time: 0m51.135sec

checking: AG [AX [~ [1<=p6_7]]]
normalized: ~ [E [true U EX [1<=p6_7]]]

abstracting: (1<=p6_7) states: 30,058,721,041,288 (13)
.
before gc: list nodes free: 1292654

after gc: idd nodes used:1994105, unused:62005895; list nodes free:317130192
-> the formula is FALSE

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

MC time: 1m44.648sec

checking: ~ [EF [EG [p6_3<=PaymentNote_p21_13]]]
normalized: ~ [E [true U EG [p6_3<=PaymentNote_p21_13]]]

abstracting: (p6_3<=PaymentNote_p21_13) states: 69,509,253,359,192 (13)
................................................................................................
EG iterations: 96
-> the formula is FALSE

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

MC time: 0m40.883sec

checking: A [AX [Delivery_p22_4<=PaySchemeData_p21_6] U 2<=PaymentNote_p21_16]
normalized: [~ [EG [~ [2<=PaymentNote_p21_16]]] & ~ [E [~ [2<=PaymentNote_p21_16] U [EX [~ [Delivery_p22_4<=PaySchemeData_p21_6]] & ~ [2<=PaymentNote_p21_16]]]]]

abstracting: (2<=PaymentNote_p21_16) states: 4,222,601,069,000 (12)
abstracting: (Delivery_p22_4<=PaySchemeData_p21_6) states: 48,506,697,597,360 (13)
.abstracting: (2<=PaymentNote_p21_16) states: 4,222,601,069,000 (12)
abstracting: (2<=PaymentNote_p21_16) states: 4,222,601,069,000 (12)

before gc: list nodes free: 3478294

after gc: idd nodes used:2075989, unused:61924011; list nodes free:320556753
.
EG iterations: 1
-> the formula is FALSE

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

MC time: 3m22.688sec

checking: ~ [~ [AG [[2<=Status_p21_9 | PaySchemeData_p11_10<=PaidFor_p11_1]]]]
normalized: ~ [E [true U ~ [[2<=Status_p21_9 | PaySchemeData_p11_10<=PaidFor_p11_1]]]]

abstracting: (PaySchemeData_p11_10<=PaidFor_p11_1) states: 72,380,382,401,494 (13)
abstracting: (2<=Status_p21_9) states: 3,667,880,724,776 (12)
-> the formula is FALSE

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

MC time: 0m32.521sec

checking: [AG [Organization_p21_8<=Organization_p20_7] | 2<=ConsumerPayment_p3]
normalized: [2<=ConsumerPayment_p3 | ~ [E [true U ~ [Organization_p21_8<=Organization_p20_7]]]]

abstracting: (Organization_p21_8<=Organization_p20_7) states: 76,731,036,569,032 (13)
abstracting: (2<=ConsumerPayment_p3) states: 4,222,601,069,000 (12)
-> the formula is FALSE

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

MC time: 0m 9.917sec

checking: ~ [[AX [[2<=PaymentHandlerPayment_p5_0 | p11_0<=p5_4]] & [~ [3<=p4_1] & AG [1<=PaymentHandlerPayment_p5_0]]]]
normalized: ~ [[[~ [E [true U ~ [1<=PaymentHandlerPayment_p5_0]]] & ~ [3<=p4_1]] & ~ [EX [~ [[2<=PaymentHandlerPayment_p5_0 | p11_0<=p5_4]]]]]]

abstracting: (p11_0<=p5_4) states: 87,645,890,048,730 (13)
abstracting: (2<=PaymentHandlerPayment_p5_0) states: 80,348,532,973,820 (13)
.abstracting: (3<=p4_1) states: 779,238,152,856 (11)
abstracting: (1<=PaymentHandlerPayment_p5_0) states: 86,512,832,473,306 (13)
-> the formula is TRUE

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

MC time: 0m53.263sec

checking: A [[1<=Order_p22_10 | DeliveryNote_p22_14<=DeliveryResponse_p12_6] U ~ [[1<=MerchantOffer_p2 | 1<=p3_8]]]
normalized: [~ [EG [[1<=MerchantOffer_p2 | 1<=p3_8]]] & ~ [E [[1<=MerchantOffer_p2 | 1<=p3_8] U [~ [[1<=Order_p22_10 | DeliveryNote_p22_14<=DeliveryResponse_p12_6]] & [1<=MerchantOffer_p2 | 1<=p3_8]]]]]

abstracting: (1<=p3_8) states: 58,902,655,747,348 (13)
abstracting: (1<=MerchantOffer_p2) states: 59,054,196,243,368 (13)
abstracting: (DeliveryNote_p22_14<=DeliveryResponse_p12_6) states: 67,682,767,255,560 (13)
abstracting: (1<=Order_p22_10) states: 28,315,197,109,928 (13)
abstracting: (1<=p3_8) states: 58,902,655,747,348 (13)
abstracting: (1<=MerchantOffer_p2) states: 59,054,196,243,368 (13)
abstracting: (1<=p3_8) states: 58,902,655,747,348 (13)
abstracting: (1<=MerchantOffer_p2) states: 59,054,196,243,368 (13)
.
EG iterations: 1
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m43.446sec

checking: ~ [[EG [~ [3<=PaidFor_p11_1]] & [~ [[p11_3<=OfferRequest_p10 | p5_2<=DeliveryNote_p22_14]] | ~ [2<=Organization_p22_9]]]]
normalized: ~ [[[~ [2<=Organization_p22_9] | ~ [[p11_3<=OfferRequest_p10 | p5_2<=DeliveryNote_p22_14]]] & EG [~ [3<=PaidFor_p11_1]]]]

abstracting: (3<=PaidFor_p11_1) states: 0

EG iterations: 0
abstracting: (p5_2<=DeliveryNote_p22_14) states: 78,496,856,960,358 (13)
abstracting: (p11_3<=OfferRequest_p10) states: 36,151,865,222,280 (13)
abstracting: (2<=Organization_p22_9) states: 7,664,537,491,456 (12)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C12M10P15D17-CTLCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.451sec

checking: A [Organization_p22_9<=p6_4 U [[3<=Payment_p21_7 | 2<=p3_6] & [Status_p21_9<=BrandList_p11_2 & 3<=WhatDeliver_p12_1]]]
normalized: [~ [EG [~ [[[Status_p21_9<=BrandList_p11_2 & 3<=WhatDeliver_p12_1] & [3<=Payment_p21_7 | 2<=p3_6]]]]] & ~ [E [~ [[[Status_p21_9<=BrandList_p11_2 & 3<=WhatDeliver_p12_1] & [3<=Payment_p21_7 | 2<=p3_6]]] U [~ [Organization_p22_9<=p6_4] & ~ [[[Status_p21_9<=BrandList_p11_2 & 3<=WhatDeliver_p12_1] & [3<=Payment_p21_7 | 2<=p3_6]]]]]]]

abstracting: (2<=p3_6) states: 4,222,601,069,000 (12)
abstracting: (3<=Payment_p21_7) states: 626,637,440,130 (11)
abstracting: (3<=WhatDeliver_p12_1) states: 0
abstracting: (Status_p21_9<=BrandList_p11_2) states: 76,105,977,774,640 (13)
abstracting: (Organization_p22_9<=p6_4) states: 70,937,980,308,644 (13)
abstracting: (2<=p3_6) states: 4,222,601,069,000 (12)
abstracting: (3<=Payment_p21_7) states: 626,637,440,130 (11)
abstracting: (3<=WhatDeliver_p12_1) states: 0
abstracting: (Status_p21_9<=BrandList_p11_2) states: 76,105,977,774,640 (13)
abstracting: (2<=p3_6) states: 4,222,601,069,000 (12)
abstracting: (3<=Payment_p21_7) states: 626,637,440,130 (11)
abstracting: (3<=WhatDeliver_p12_1) states: 0
abstracting: (Status_p21_9<=BrandList_p11_2) states: 76,105,977,774,640 (13)

EG iterations: 0
-> the formula is FALSE

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

MC time: 1m26.016sec

checking: [[EF [[3<=Order_p22_10 & 2<=p2_2]] | AX [2<=p5_1]] & ~ [[EX [p3_5<=p2_2] & MerchantOffer_p2<=p7_2]]]
normalized: [~ [[MerchantOffer_p2<=p7_2 & EX [p3_5<=p2_2]]] & [~ [EX [~ [2<=p5_1]]] | E [true U [3<=Order_p22_10 & 2<=p2_2]]]]

abstracting: (2<=p2_2) states: 4,222,601,069,000 (12)
abstracting: (3<=Order_p22_10) states: 1,836,571,161,864 (12)

before gc: list nodes free: 1788749

after gc: idd nodes used:1263868, unused:62736132; list nodes free:325000331

BK_TIME_CONFINEMENT_REACHED

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

25204 341685 1475677 2187101 2280586
iterations count:5976 (132), effective:1208 (26)

initing FirstDep: 0m 0.000sec


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

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

iterations count:256 (5), effective:43 (0)

iterations count:60 (1), effective:13 (0)

iterations count:437 (9), effective:102 (2)

iterations count:272 (6), effective:52 (1)

iterations count:524 (11), effective:113 (2)
452565 715029 730501
iterations count:3065 (68), effective:612 (13)

iterations count:322 (7), effective:58 (1)

iterations count:341 (7), effective:62 (1)
761446
iterations count:1095 (24), effective:218 (4)

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-C12M10P15D17"
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-C12M10P15D17.tgz
mv IOTPpurchase-PT-C12M10P15D17 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-C12M10P15D17, 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-146358913300093"
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 ;