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

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

=== Now, execution of the tool begins

BK_START 1433633718035

Model: IOTPpurchase-PT-C05M04P03D02
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 5226 (5.2e+03) #states 17,406,024 (7)



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

checking: EF [[[[p2_1<=Order_p20_8 | 3<=p6_1] | [p5_4<=Order_p22_10 & p8_3<=p11_0]] & 2<=ConsumerDelivery_p6_0]]
normalized: E [true U [2<=ConsumerDelivery_p6_0 & [[p5_4<=Order_p22_10 & p8_3<=p11_0] | [p2_1<=Order_p20_8 | 3<=p6_1]]]]

abstracting: (3<=p6_1) states: 5,648 (3)
abstracting: (p2_1<=Order_p20_8) states: 15,870,720 (7)
abstracting: (p8_3<=p11_0) states: 12,343,992 (7)
abstracting: (p5_4<=Order_p22_10) states: 5,371,184 (6)
abstracting: (2<=ConsumerDelivery_p6_0) states: 117,800 (5)
-> the formula is TRUE

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

MC time: 0m18sec

checking: EF [[2<=Delivery_p22_1 & [~ [DeliveryResponse_p12_6<=p4_3] | p4_4<=DeliveryNote_p22_12]]]
normalized: E [true U [2<=Delivery_p22_1 & [p4_4<=DeliveryNote_p22_12 | ~ [DeliveryResponse_p12_6<=p4_3]]]]

abstracting: (DeliveryResponse_p12_6<=p4_3) states: 15,460,660 (7)
abstracting: (p4_4<=DeliveryNote_p22_12) states: 15,915,888 (7)
abstracting: (2<=Delivery_p22_1) states: 117,800 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-1 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26sec

checking: AG [Status_p21_9<=Organization_p21_4]
normalized: ~ [E [true U ~ [Status_p21_9<=Organization_p21_4]]]

abstracting: (Status_p21_9<=Organization_p21_4) states: 16,365,694 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [2<=p8_2]
normalized: E [true U 2<=p8_2]

abstracting: (2<=p8_2) states: 118,920 (5)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-3 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: AG [~ [3<=Delivery_p22_8]]
normalized: ~ [E [true U 3<=Delivery_p22_8]]

abstracting: (3<=Delivery_p22_8) states: 0
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-4 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [~ [~ [~ [PaymentNote_p21_16<=p5_2]]]]
normalized: E [true U ~ [PaymentNote_p21_16<=p5_2]]

abstracting: (PaymentNote_p21_16<=p5_2) states: 15,841,202 (7)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-5 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[~ [Organization_p21_8<=Payment_p21_1] & p2_2<=ConsumerOffer_p1]]
normalized: E [true U [p2_2<=ConsumerOffer_p1 & ~ [Organization_p21_8<=Payment_p21_1]]]

abstracting: (Organization_p21_8<=Payment_p21_1) states: 16,285,544 (7)
abstracting: (p2_2<=ConsumerOffer_p1) states: 16,004,388 (7)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-6 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m35sec

checking: AG [~ [[[p11_11<=Order_p20 & 3<=Organization_p21_8] & ~ [HowDeliver_p12_2<=p3_3]]]]
normalized: ~ [E [true U [[p11_11<=Order_p20 & 3<=Organization_p21_8] & ~ [HowDeliver_p12_2<=p3_3]]]]

abstracting: (HowDeliver_p12_2<=p3_3) states: 14,863,888 (7)
abstracting: (3<=Organization_p21_8) states: 1,310 (3)
abstracting: (p11_11<=Order_p20) states: 3,834,488 (6)
-> the formula is FALSE

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

MC time: 0m1sec

checking: EF [2<=p6_4]
normalized: E [true U 2<=p6_4]

abstracting: (2<=p6_4) states: 403,776 (5)
-> the formula is TRUE

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

MC time: 0m0sec

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

abstracting: (2<=Organization_p21_8) states: 56,008 (4)
-> the formula is FALSE

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

MC time: 0m0sec

checking: AG [[[[Organization_p22_5<=PaySchemeData_p11_10 & PaymentResponse_p11_12<=PaySchemeData_p11_10] | Order_p22_10<=p6_5] & ~ [[2<=p12_4 & 3<=p12_4]]]]
normalized: ~ [E [true U ~ [[[Order_p22_10<=p6_5 | [Organization_p22_5<=PaySchemeData_p11_10 & PaymentResponse_p11_12<=PaySchemeData_p11_10]] & ~ [[2<=p12_4 & 3<=p12_4]]]]]]

abstracting: (3<=p12_4) states: 0
abstracting: (2<=p12_4) states: 0
abstracting: (PaymentResponse_p11_12<=PaySchemeData_p11_10) states: 16,041,534 (7)
abstracting: (Organization_p22_5<=PaySchemeData_p11_10) states: 12,127,444 (7)
abstracting: (Order_p22_10<=p6_5) states: 17,406,024 (7)
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m15sec

checking: EF [2<=p11_8]
normalized: E [true U 2<=p11_8]

abstracting: (2<=p11_8) states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m0sec

checking: EF [[[[3<=DeliveryNote_p22_12 | 2<=Organization_p22_2] & [p4_5<=p2_1 & 3<=DeliveryHandlerDelivery_p8_0]] & ~ [Status_p22_7<=ConsumerDelivery_p6_0]]]
normalized: E [true U [~ [Status_p22_7<=ConsumerDelivery_p6_0] & [[p4_5<=p2_1 & 3<=DeliveryHandlerDelivery_p8_0] & [3<=DeliveryNote_p22_12 | 2<=Organization_p22_2]]]]

abstracting: (2<=Organization_p22_2) states: 117,800 (5)
abstracting: (3<=DeliveryNote_p22_12) states: 0
abstracting: (3<=DeliveryHandlerDelivery_p8_0) states: 0
abstracting: (p4_5<=p2_1) states: 15,870,720 (7)
abstracting: (Status_p22_7<=ConsumerDelivery_p6_0) states: 14,494,080 (7)
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m3sec

checking: AG [[~ [[Organization_p22_5<=PaymentResponse_p11_12 | PaymentNote_p21_13<=PayReceipt_p21_15]] | ~ [[2<=p7_1 | 2<=BrandList_p11_2]]]]
normalized: ~ [E [true U ~ [[~ [[2<=p7_1 | 2<=BrandList_p11_2]] | ~ [[Organization_p22_5<=PaymentResponse_p11_12 | PaymentNote_p21_13<=PayReceipt_p21_15]]]]]]

abstracting: (PaymentNote_p21_13<=PayReceipt_p21_15) states: 15,404,340 (7)
abstracting: (Organization_p22_5<=PaymentResponse_p11_12) states: 12,220,652 (7)
abstracting: (2<=BrandList_p11_2) states: 0
abstracting: (2<=p7_1) states: 117,800 (5)
-> the formula is FALSE

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

MC time: 0m2sec

checking: EF [DeliveryHandlerDelivery_p8_0<=OfferRequest_p10]
normalized: E [true U DeliveryHandlerDelivery_p8_0<=OfferRequest_p10]

abstracting: (DeliveryHandlerDelivery_p8_0<=OfferRequest_p10) states: 7,613,844 (6)
-> the formula is TRUE

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

MC time: 0m11sec

checking: EF [[[[1<=p5_3 & PaymentNote_p21_13<=Organization_p21_2] & [2<=p1_3 & p2_1<=Order_p20]] & 3<=Organization_p22_9]]
normalized: E [true U [3<=Organization_p22_9 & [[1<=p5_3 & PaymentNote_p21_13<=Organization_p21_2] & [2<=p1_3 & p2_1<=Order_p20]]]]

abstracting: (p2_1<=Order_p20) states: 15,870,720 (7)
abstracting: (2<=p1_3) states: 117,800 (5)
abstracting: (PaymentNote_p21_13<=Organization_p21_2) states: 15,404,340 (7)
abstracting: (1<=p5_3) states: 2,157,288 (6)
abstracting: (3<=Organization_p22_9) states: 0
-> the formula is FALSE

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

MC time: 0m0sec


Total processing time: 2m0sec


BK_STOP 1433633838354

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

8457
iterations count:1506 (33), effective:301 (6)

initing FirstDep: 0m0sec


iterations count:495 (11), effective:100 (2)

iterations count:513 (11), effective:102 (2)

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

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

iterations count:266 (5), effective:49 (1)

iterations count:419 (9), effective:92 (2)
5226
iterations count:1000 (22), effective:195 (4)

iterations count:410 (9), effective:72 (1)

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

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

iterations count:412 (9), effective:79 (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-C05M04P03D02"
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-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 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-C05M04P03D02, 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-143354324800113"
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 ;