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-3254
Executing tool marcie
Input is IOTPpurchase-PT-C01M01P01D01, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 1
Run identifier is r031-blw7-149440473800106
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1494452246959

timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie rev. 8852M (built: crohr on 2017-05-03)
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

parse successfull
net created successfully

Net: IOTPpurchase_PT_C01M01P01D01
(NrP: 111 NrTr: 45 NrArc: 224)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec

net check time: 0m 0.000sec

init dd package: 0m 1.095sec


RS generation: 0m 0.004sec


-> reachability set: #nodes 188 (1.9e+02) #states 204



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

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

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

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

MC time: 0m 0.002sec

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

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

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

MC time: 0m 0.000sec

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

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

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-7 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [[2<=p12_7 & ~ [2<=Payment_p21_7]]]
normalized: E [true U [2<=p12_7 & ~ [2<=Payment_p21_7]]]

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

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-0 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [~ [Payment_p21_3<=Organization_p22_5]]
normalized: ~ [E [true U Payment_p21_3<=Organization_p22_5]]

abstracting: (Payment_p21_3<=Organization_p22_5)
states: 196
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [p5_3<=p8_1]
normalized: E [true U p5_3<=p8_1]

abstracting: (p5_3<=p8_1)
states: 200
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: AG [[p3_6<=p7_2 & ~ [~ [3<=p6_7]]]]
normalized: ~ [E [true U ~ [[p3_6<=p7_2 & 3<=p6_7]]]]

abstracting: (3<=p6_7)
states: 0
abstracting: (p3_6<=p7_2)
states: 200
-> the formula is FALSE

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

MC time: 0m 0.000sec

checking: AG [[2<=p8_1 | p3_1<=p3_3]]
normalized: ~ [E [true U ~ [[2<=p8_1 | p3_1<=p3_3]]]]

abstracting: (p3_1<=p3_3)
states: 200
abstracting: (2<=p8_1)
states: 0
-> the formula is FALSE

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-8 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.003sec

checking: AG [[1<=p11_8 | Order_p22_6<=Delivery_p20_10]]
normalized: ~ [E [true U ~ [[1<=p11_8 | Order_p22_6<=Delivery_p20_10]]]]

abstracting: (Order_p22_6<=Delivery_p20_10)
states: 188
abstracting: (1<=p11_8)
states: 200
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[[~ [2<=p1_1] | PaymentNote_p21_13<=p11_4] & 1<=p3_1]]
normalized: ~ [E [true U ~ [[1<=p3_1 & [PaymentNote_p21_13<=p11_4 | ~ [2<=p1_1]]]]]]

abstracting: (2<=p1_1)
states: 0
abstracting: (PaymentNote_p21_13<=p11_4)
states: 204
abstracting: (1<=p3_1)
states: 4
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [~ [[~ [Delivery_p20_10<=p5_1] & [1<=Status_p21_14 & 3<=p10_0]]]]
normalized: ~ [E [true U [[1<=Status_p21_14 & 3<=p10_0] & ~ [Delivery_p20_10<=p5_1]]]]

abstracting: (Delivery_p20_10<=p5_1)
states: 200
abstracting: (3<=p10_0)
states: 0
abstracting: (1<=Status_p21_14)
states: 4
-> the formula is TRUE

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

MC time: 0m 0.000sec

checking: AG [[~ [~ [2<=DeliveryRequest_p12_5]] & [2<=Payment_p20_9 & [1<=PaySchemeData_p21_10 | Payment_p20<=Organization_p20_7]]]]
normalized: ~ [E [true U ~ [[2<=DeliveryRequest_p12_5 & [[1<=PaySchemeData_p21_10 | Payment_p20<=Organization_p20_7] & 2<=Payment_p20_9]]]]]

abstracting: (2<=Payment_p20_9)
states: 0
abstracting: (Payment_p20<=Organization_p20_7)
states: 200
abstracting: (1<=PaySchemeData_p21_10)
states: 4
abstracting: (2<=DeliveryRequest_p12_5)
states: 0
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[2<=Organization_p21_4 & [2<=p11_7 & MerchantPayment_p4_0<=p2_1]] | p12_3<=p7_1]]
normalized: ~ [E [true U ~ [[p12_3<=p7_1 | [2<=Organization_p21_4 & [2<=p11_7 & MerchantPayment_p4_0<=p2_1]]]]]]

abstracting: (MerchantPayment_p4_0<=p2_1)
states: 184
abstracting: (2<=p11_7)
states: 0
abstracting: (2<=Organization_p21_4)
states: 0
abstracting: (p12_3<=p7_1)
states: 12
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: AG [[[[Status_p22_11<=p12_7 | PaymentAmount_p11_6<=p3_8] & ~ [2<=p5_1]] | ~ [~ [1<=Order_p22_3]]]]
normalized: ~ [E [true U ~ [[[[Status_p22_11<=p12_7 | PaymentAmount_p11_6<=p3_8] & ~ [2<=p5_1]] | 1<=Order_p22_3]]]]

abstracting: (1<=Order_p22_3)
states: 4
abstracting: (2<=p5_1)
states: 0
abstracting: (PaymentAmount_p11_6<=p3_8)
states: 200
abstracting: (Status_p22_11<=p12_7)
states: 204
-> the formula is TRUE

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

MC time: 0m 0.001sec

checking: AG [[[Organization_p21_8<=MerchantPayment_p4_0 & [Delivery_p22_1<=Order_p20_8 & 1<=PaidFor_p11_1]] & 1<=Delivery_p22_8]]
normalized: ~ [E [true U ~ [[1<=Delivery_p22_8 & [[Delivery_p22_1<=Order_p20_8 & 1<=PaidFor_p11_1] & Organization_p21_8<=MerchantPayment_p4_0]]]]]

abstracting: (Organization_p21_8<=MerchantPayment_p4_0)
states: 202
abstracting: (1<=PaidFor_p11_1)
states: 4
abstracting: (Delivery_p22_1<=Order_p20_8)
states: 200
abstracting: (1<=Delivery_p22_8)
states: 4
-> the formula is FALSE

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

MC time: 0m 0.001sec

checking: EF [[~ [1<=DeliveryRequest_p12_5] & [p3_2<=p6_3 | [Delivery_p20<=p7_1 | p5_2<=MerchantPayment_p4_0]]]]
normalized: E [true U [~ [1<=DeliveryRequest_p12_5] & [[Delivery_p20<=p7_1 | p5_2<=MerchantPayment_p4_0] | p3_2<=p6_3]]]

abstracting: (p3_2<=p6_3)
states: 188
abstracting: (p5_2<=MerchantPayment_p4_0)
states: 202
abstracting: (Delivery_p20<=p7_1)
states: 200
abstracting: (1<=DeliveryRequest_p12_5)
states: 8
-> the formula is TRUE

FORMULA IOTPpurchase-PT-C01M01P01D01-ReachabilityCardinality-9 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.002sec

totally nodes used: 15446(1.5e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 9991 23664 33655
used/not used/entry size/cache size: 22737 67086127 16 1024MB
basic ops cache: hits/miss/sum: 5516 30039 35555
used/not used/entry size/cache size: 56818 16720398 12 192MB
unary ops cache: hits/miss/sum: 0 136 136
used/not used/entry size/cache size: 136 8388472 8 64MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 12 96MB
state nr cache: hits/miss/sum: 290 603 893
used/not used/entry size/cache size: 603 2096549 32 64MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 67093420
1 15442
2 2
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 1.632sec


BK_STOP 1494452248623

--------------------
content from stderr:

check for maximal unmarked siphon
ok
check for constant places
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


iterations count:457 (10), effective:83 (1)

initing FirstDep: 0m 0.000sec


iterations count:45 (1), effective:0 (0)

iterations count:53 (1), effective:2 (0)

iterations count:47 (1), effective:1 (0)

iterations count:45 (1), effective:0 (0)

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

iterations count:48 (1), effective:1 (0)

iterations count:45 (1), effective:0 (0)

iterations count:50 (1), effective:2 (0)

iterations count:45 (1), effective:0 (0)

iterations count:52 (1), effective:2 (0)

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-C01M01P01D01"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="marcie"
export BK_RESULT_DIR="/tmp/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-C01M01P01D01.tgz
mv IOTPpurchase-PT-C01M01P01D01 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-3254"
echo " Executing tool marcie"
echo " Input is IOTPpurchase-PT-C01M01P01D01, 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 r031-blw7-149440473800106"
echo "====================================================================="
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; 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 ;