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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r232su-smll-143354324800100
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1433633561683

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=ReachabilityCardinality.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: EF [[[[p8_3<=p1_3 | 1<=Payment_p21_1] & [Status_p21_5<=PayReceipt_p21_12 & 2<=Status_p20]] & [[2<=p3_2 & p6_4<=p12_3] | ~ [p8_3<=PaymentHandlerPayment_p5_0]]]]
normalized: E [true U [[[p8_3<=p1_3 | 1<=Payment_p21_1] & [Status_p21_5<=PayReceipt_p21_12 & 2<=Status_p20]] & [~ [p8_3<=PaymentHandlerPayment_p5_0] | [2<=p3_2 & p6_4<=p12_3]]]]

abstracting: (p6_4<=p12_3) states: 349,952 (5)
abstracting: (2<=p3_2) states: 6,464 (3)
abstracting: (p8_3<=PaymentHandlerPayment_p5_0) states: 220,538 (5)
abstracting: (2<=Status_p20) states: 848
abstracting: (Status_p21_5<=PayReceipt_p21_12) states: 333,864 (5)
abstracting: (1<=Payment_p21_1) states: 21,512 (4)
abstracting: (p8_3<=p1_3) states: 99,184 (4)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-0 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: AG [p8_3<=Order_p22_6]
normalized: ~ [E [true U ~ [p8_3<=Order_p22_6]]]

abstracting: (p8_3<=Order_p22_6) states: 112,764 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [[p10_0<=PaymentHandlerPayment_p5_0 & ~ [[2<=Payment_p21_1 | p6_2<=HowDeliver_p12_2]]]]
normalized: E [true U [p10_0<=PaymentHandlerPayment_p5_0 & ~ [[2<=Payment_p21_1 | p6_2<=HowDeliver_p12_2]]]]

abstracting: (p6_2<=HowDeliver_p12_2) states: 292,968 (5)
abstracting: (2<=Payment_p21_1) states: 848
abstracting: (p10_0<=PaymentHandlerPayment_p5_0) states: 268,708 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-2 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [~ [[Status_p21_5<=p3_1 | PayReceipt_p21_15<=MerchantOffer_p2]]]]
normalized: ~ [E [true U ~ [[Status_p21_5<=p3_1 | PayReceipt_p21_15<=MerchantOffer_p2]]]]

abstracting: (PayReceipt_p21_15<=MerchantOffer_p2) states: 340,160 (5)
abstracting: (Status_p21_5<=p3_1) states: 333,496 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[~ [2<=MerchantDelivery_p4_6] & p6_7<=p3_6]]
normalized: ~ [E [true U ~ [[p6_7<=p3_6 & ~ [2<=MerchantDelivery_p4_6]]]]]

abstracting: (2<=MerchantDelivery_p4_6) states: 57,968 (4)
abstracting: (p6_7<=p3_6) states: 320,296 (5)
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [3<=HowDeliver_p12_2]
normalized: E [true U 3<=HowDeliver_p12_2]

abstracting: (3<=HowDeliver_p12_2) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-5 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[3<=Status_p21_5 & Organization_p22_5<=Organization_p22_9] | 3<=p6_2]]]
normalized: ~ [E [true U [3<=p6_2 | [3<=Status_p21_5 & Organization_p22_5<=Organization_p22_9]]]]

abstracting: (Organization_p22_5<=Organization_p22_9) states: 288,720 (5)
abstracting: (3<=Status_p21_5) states: 16
abstracting: (3<=p6_2) states: 272
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-6 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [[[1<=Delivery_p22_4 & p1_1<=p2_2] | 2<=p11_8]]]
normalized: ~ [E [true U [2<=p11_8 | [1<=Delivery_p22_4 & p1_1<=p2_2]]]]

abstracting: (p1_1<=p2_2) states: 320,296 (5)
abstracting: (1<=Delivery_p22_4) states: 68,512 (4)
abstracting: (2<=p11_8) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[~ [3<=p6_1] | Status_p20<=p3_4] | ~ [1<=p6_3]]]
normalized: ~ [E [true U ~ [[~ [1<=p6_3] | [Status_p20<=p3_4 | ~ [3<=p6_1]]]]]]

abstracting: (3<=p6_1) states: 16
abstracting: (Status_p20<=p3_4) states: 333,496 (5)
abstracting: (1<=p6_3) states: 35,344 (4)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-8 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[~ [2<=p8_2] & [2<=p3_7 | p11_8<=p7_2]] & 3<=HowDeliver_p12_2]]
normalized: E [true U [3<=HowDeliver_p12_2 & [~ [2<=p8_2] & [2<=p3_7 | p11_8<=p7_2]]]]

abstracting: (p11_8<=p7_2) states: 41,360 (4)
abstracting: (2<=p3_7) states: 848
abstracting: (2<=p8_2) states: 1,072 (3)
abstracting: (3<=HowDeliver_p12_2) states: 0
-> the formula is FALSE

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

MC time: 0m0sec

checking: EF [3<=BrandList_p11_2]
normalized: E [true U 3<=BrandList_p11_2]

abstracting: (3<=BrandList_p11_2) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [[~ [p11_7<=p6_1] | [3<=p10_0 | p3_8<=ConsumerDelivery_p6_0]]]]
normalized: E [true U ~ [[[3<=p10_0 | p3_8<=ConsumerDelivery_p6_0] | ~ [p11_7<=p6_1]]]]

abstracting: (p11_7<=p6_1) states: 41,360 (4)
abstracting: (p3_8<=ConsumerDelivery_p6_0) states: 276,282 (5)
abstracting: (3<=p10_0) states: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [[1<=Organization_p21_8 & 1<=Delivery_p22_8]]]]
normalized: E [true U [1<=Organization_p21_8 & 1<=Delivery_p22_8]]

abstracting: (1<=Delivery_p22_8) states: 26,224 (4)
abstracting: (1<=Organization_p21_8) states: 15,918 (4)
-> the formula is TRUE

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

MC time: 0m0sec

checking: AG [[[[p4_2<=ConsumerDelivery_p6_0 | DeliveryResponse_p12_6<=PaySchemeData_p21_6] | [p4_2<=p5_2 & BrandList_p11_2<=p3_4]] | [~ [PaySchemeData_p21_6<=Status_p22_13] | [2<=p3_5 | 2<=p5_3]]]]
normalized: ~ [E [true U ~ [[[~ [PaySchemeData_p21_6<=Status_p22_13] | [2<=p3_5 | 2<=p5_3]] | [[p4_2<=p5_2 & BrandList_p11_2<=p3_4] | [p4_2<=ConsumerDelivery_p6_0 | DeliveryResponse_p12_6<=PaySchemeData_p21_6]]]]]]

abstracting: (DeliveryResponse_p12_6<=PaySchemeData_p21_6) states: 322,408 (5)
abstracting: (p4_2<=ConsumerDelivery_p6_0) states: 333,496 (5)
abstracting: (BrandList_p11_2<=p3_4) states: 334,328 (5)
abstracting: (p4_2<=p5_2) states: 333,284 (5)
abstracting: (2<=p5_3) states: 808
abstracting: (2<=p3_5) states: 6,464 (3)
abstracting: (PaySchemeData_p21_6<=Status_p22_13) states: 334,144 (5)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m1sec

checking: EF [3<=Payment_p21_3]
normalized: E [true U 3<=Payment_p21_3]

abstracting: (3<=Payment_p21_3) states: 64
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C03M03P03D03-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [Order_p22_3<=Payment_p21_1]
normalized: ~ [E [true U ~ [Order_p22_3<=Payment_p21_1]]]

abstracting: (Order_p22_3<=Payment_p21_1) states: 333,496 (5)
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 0m11sec


BK_STOP 1433633573036

--------------------
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:856 (19), effective:159 (3)

iterations count:268 (5), effective:48 (1)

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

iterations count:543 (12), effective:96 (2)

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

iterations count:612 (13), effective:114 (2)

iterations count:356 (7), effective:45 (1)

iterations count:426 (9), effective:79 (1)

iterations count:448 (9), effective:84 (1)

iterations count:461 (10), effective:89 (1)

iterations count:621 (13), effective:117 (2)

iterations count:302 (6), effective:57 (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="ReachabilityCardinality"
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 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 r232su-smll-143354324800100"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "ReachabilityComputeBounds" ] ; 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 '' ReachabilityCardinality.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 ;