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 lola
Input is S_IOTPpurchase-PT-C01M01P01D01, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r118-blw7-149441649900102
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1496353180992


Time: 3600 - MCC
----- Start make prepare stdout -----
===========================================================================================
S_IOTPpurchase-PT-C01M01P01D01: translating PT Petri net model.pnml into LoLA format
===========================================================================================
translating PT Petri net complete


checking for too many tokens
===========================================================================================
S_IOTPpurchase-PT-C01M01P01D01: translating PT formula CTLCardinality into LoLA format
===========================================================================================
translating formula complete
touch formulae;
----- Start make result stdout -----
CTLCardinality @ S_IOTPpurchase-PT-C01M01P01D01 @ 3540 seconds
----- Start make result stdout -----
lola: LoLA will run for 3540 seconds at most (--timelimit)
lola: NET
lola: reading net from model.pnml.lola
lola: finished parsing
lola: closed net file model.pnml.lola
lola: 156/65536 symbol table entries, 0 collisions
lola: preprocessing...
lola: finding significant places
lola: 111 places, 45 transitions, 44 significant places
lola: computing forward-conflicting sets
lola: computing back-conflicting sets
lola: 70 transition conflict sets
lola: TASK
lola: reading formula from IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: (((ConsumerPayment_p3 <= 2) OR (DeliveryNote_p22_14 <= 2)) AND (Delivery_p22_1 + 1 <= OfferRequest_p10) AND (PaymentRequest_p11_9 + 1 <= p6_4) AND ((Status_p21_11 + 1 <= p7_3) OR ((Organization_p20_2 <= Organization_p21_2) AND (1 <= p11_4)))) : ((2 <= p4_4) AND (A (X ((p3_3 <= Organization_p21_2))) AND (PaymentNote_p21_13 <= Order_p22_10))) : (p4_2 <= Order_p20) : ((p1_1 <= p7_3) AND ((A (F ((3 <= MerchantOffer_p2))) OR (3 <= p6_5)) OR ((2 <= Payment_p21_3) AND (Status_p20 <= Status_p22_13) AND (2 <= PaymentAmount_p11_6) AND (1 <= Order_p22_10)))) : (Status_p21_11 <= p8_3) : E ((A (X ((Delivery_p22_8 <= MerchantDelivery_p4_6))) U ((p11_0 + 1 <= DeliveryRequest_p12_5) OR (PaymentAmount_p11_6 <= 1)))) : ((E (F (((Payment_p21_7 <= p8_2) OR (p3_5 <= p3_3)))) OR (((p5_2 <= p11_8) AND (1 <= p11_4) AND (1 <= DeliveryResponse_p12_6) AND (Organization_p20_7 <= p1_1)) OR (2 <= Organization_p20_7))) OR NOT(NOT(E (G ((2 <= Payment_p20_9)))))) : ((p6_3 <= p11_3) OR ((E (X ((PaymentAmount_p11_6 <= Status_p20))) AND (p4_2 <= Payment_p20_9)) OR (A (X ((3 <= p4_2))) AND (p3_3 <= 1)))) : A (F (E (F (((1 <= p11_8) AND (Order_p22_10 <= PaymentRequest_p11_9)))))) : (3 <= PayReceipt_p21_15) : (p3_3 + 1 <= WhatDeliver_p12_1) : (E (G (((p12_4 <= p11_8) OR (2 <= p4_1) OR (p3_4 <= p11_3) OR (1 <= Delivery_p20)))) OR ((PaymentRequest_p11_9 <= p6_3) AND (Delivery_p22_4 <= PayReceipt_p21_15) AND (p11_8 <= 2))) : (2 <= p12_4) : ((Status_p21_5 <= Order_p20_8) AND ((Delivery_p22_1 <= 2) OR ((Status_p21_11 <= PaymentNote_p21_16) AND (2 <= p3_8))) AND (((PaymentNote_p21_16 <= p6_4)) OR (3 <= Organization_p21_8)) AND (p4_1 <= Organization_p21_8)) : E (G ((((p5_4 <= p10_2) AND (1 <= p10_0) AND (DeliveryNote_p22_12 <= MerchantPayment_p4_0) AND (Delivery_p22_4 <= p4_4)) AND A (G ((2 <= Delivery_p20)))))) : ((E (G (((1 <= PayReceipt_p21_12) AND (2 <= p11_0)))) AND (((2 <= p4_1) OR (3 <= Status_p22_13) OR (p3_3 <= p3_7) OR (1 <= p8_2)) OR E (G ((3 <= p11_13))))) OR (3 <= BrandList_p11_2))
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (((ConsumerPayment_p3 <= 2) OR (DeliveryNote_p22_14 <= 2)) AND (Delivery_p22_1 + 1 <= OfferRequest_p10) AND (PaymentRequest_p11_9 + 1 <= p6_4) AND ((Status_p21_11 + 1 <= p7_3) OR ((Organization_p20_2 <= Organization_p21_2) AND (1 <= p11_4))))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (((ConsumerPayment_p3 <= 2) OR (DeliveryNote_p22_14 <= 2)) AND (Delivery_p22_1 + 1 <= OfferRequest_p10) AND (PaymentRequest_p11_9 + 1 <= p6_4) AND ((Status_p21_11 + 1 <= p7_3) OR ((Organization_p20_2 <= Organization_p21_2) AND (1 <= p11_4))))
lola: processed formula length: 244
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((2 <= p4_4) AND (A (X ((p3_3 <= Organization_p21_2))) AND (PaymentNote_p21_13 <= Order_p22_10)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p4_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p4_4)
lola: processed formula length: 11
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p4_2 <= Order_p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p4_2 <= Order_p20)
lola: processed formula length: 19
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p1_1 <= p7_3) AND ((A (F ((3 <= MerchantOffer_p2))) OR (3 <= p6_5)) OR ((2 <= Payment_p21_3) AND (Status_p20 <= Status_p22_13) AND (2 <= PaymentAmount_p11_6) AND (1 <= Order_p22_10))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p1_1 <= p7_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p1_1 <= p7_3)
lola: processed formula length: 14
lola: 1 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F ((3 <= MerchantOffer_p2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (3 <= MerchantOffer_p2))
lola: processed formula length: 33
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((3 <= p6_5) OR ((2 <= Payment_p21_3) AND (Status_p20 <= Status_p22_13) AND (2 <= PaymentAmount_p11_6) AND (1 <= Order_p22_10)))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((3 <= p6_5) OR ((2 <= Payment_p21_3) AND (Status_p20 <= Status_p22_13) AND (2 <= PaymentAmount_p11_6) AND (1 <= Order_p22_10)))
lola: processed formula length: 128
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 5 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: lola: SUBRESULT
lola: ========================================
result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 4 will run for 295 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (Status_p21_11 <= p8_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (Status_p21_11 <= p8_3)
lola: processed formula length: 23
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E ((A (X ((Delivery_p22_8 <= MerchantDelivery_p4_6))) U ((p11_0 + 1 <= DeliveryRequest_p12_5) OR (PaymentAmount_p11_6 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(AX((Delivery_p22_8 <= MerchantDelivery_p4_6)) U ((p11_0 + 1 <= DeliveryRequest_p12_5) OR (PaymentAmount_p11_6 <= 1)))
lola: processed formula length: 120
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Formula contains EX or AX operators, stubborn sets not applicable
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (F (((Payment_p21_7 <= p8_2) OR (p3_5 <= p3_3)))) OR (((p5_2 <= p11_8) AND (1 <= p11_4) AND (1 <= DeliveryResponse_p12_6) AND (Organization_p20_7 <= p1_1)) OR (2 <= Organization_p20_7))) OR NOT(NOT(E (G ((2 <= Payment_p20_9))))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 354 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (F (((Payment_p21_7 <= p8_2) OR (p3_5 <= p3_3))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: state equation: Generated DNF with 2 literals and 2 conjunctive subformulas
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: lola: SUBRESULT
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((p6_3 <= p11_3) OR ((E (X ((PaymentAmount_p11_6 <= Status_p20))) AND (p4_2 <= Payment_p20_9)) OR (A (X ((3 <= p4_2))) AND (p3_3 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 393 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p6_3 <= p11_3)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p6_3 <= p11_3)
lola: processed formula length: 15
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: SUBRESULT
lola: lola: result: yes========================================

lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 8 will run for 442 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: A (F (E (F (((1 <= p11_8) AND (Order_p22_10 <= PaymentRequest_p11_9))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U E(TRUE U ((1 <= p11_8) AND (Order_p22_10 <= PaymentRequest_p11_9))))
lola: processed formula length: 77
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 9 will run for 505 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (3 <= PayReceipt_p21_15)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= PayReceipt_p21_15)
lola: processed formula length: 24
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 10 will run for 590 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (p3_3 + 1 <= WhatDeliver_p12_1)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p3_3 + 1 <= WhatDeliver_p12_1)
lola: processed formula length: 31
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (E (G (((p12_4 <= p11_8) OR (2 <= p4_1) OR (p3_4 <= p11_3) OR (1 <= Delivery_p20)))) OR ((PaymentRequest_p11_9 <= p6_3) AND (Delivery_p22_4 <= PayReceipt_p21_15) AND (p11_8 <= 2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 708 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((p12_4 <= p11_8) OR (2 <= p4_1) OR (p3_4 <= p11_3) OR (1 <= Delivery_p20))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((p11_8 + 1 <= p12_4) AND (p4_1 <= 1) AND (p11_3 + 1 <= p3_4) AND (Delivery_p20 <= 0))))
lola: processed formula length: 101
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: yes
lola: produced by: CTL model checker
lola: The net satisfies the given formula.
lola: SUBRESULTlola:
lola: ========================================
result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 12 will run for 885 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: (2 <= p12_4)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (2 <= p12_4)
lola: processed formula length: 12
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 13 will run for 1180 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((Status_p21_5 <= Order_p20_8) AND ((Delivery_p22_1 <= 2) OR ((Status_p21_11 <= PaymentNote_p21_16) AND (2 <= p3_8))) AND (((PaymentNote_p21_16 <= p6_4)) OR (3 <= Organization_p21_8)) AND (p4_1 <= Organization_p21_8))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((Status_p21_5 <= Order_p20_8) AND ((Delivery_p22_1 <= 2) OR ((Status_p21_11 <= PaymentNote_p21_16) AND (2 <= p3_8))) AND (((PaymentNote_p21_16 <= p6_4)) OR (3 <= Organization_p21_8)) AND (p4_1 <= Organization_p21_8))
lola: processed formula length: 219
lola: 0 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: processed formula with 7 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: subprocess 14 will run for 1770 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G ((((p5_4 <= p10_2) AND (1 <= p10_0) AND (DeliveryNote_p22_12 <= MerchantPayment_p4_0) AND (Delivery_p22_4 <= p4_4)) AND A (G ((2 <= Delivery_p20))))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U (((p10_2 + 1 <= p5_4) OR (p10_0 <= 0) OR (MerchantPayment_p4_0 + 1 <= DeliveryNote_p22_12) OR (p4_4 + 1 <= Delivery_p22_4)) OR E(TRUE U (Delivery_p20 <= 1)))))
lola: processed formula length: 175
lola: 6 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: ((E (G (((1 <= PayReceipt_p21_12) AND (2 <= p11_0)))) AND (((2 <= p4_1) OR (3 <= Status_p22_13) OR (p3_3 <= p3_7) OR (1 <= p8_2)) OR E (G ((3 <= p11_13))))) OR (3 <= BrandList_p11_2))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 15 will run for 3540 seconds at most (--localtimelimit=-1)
lola: ========================================
lola: ...considering subproblem: E (G (((1 <= PayReceipt_p21_12) AND (2 <= p11_0))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: NOT(A(TRUE U ((PayReceipt_p21_12 <= 0) OR (p11_0 <= 1))))
lola: processed formula length: 58
lola: 2 rewrites
lola: formula mentions 0 of 111 places; total mentions: 0
lola: closed formula file IOTPpurchase-PT-C01M01P01D01-CTLCardinality.task
lola: STORE
lola: using a bit-perfect encoder (--encoder=bit)
lola: using 176 bytes per marking, with 0 unused bits
lola: using a prefix tree store (--store=prefix)
lola: Using CTL preserving stubborn sets
lola: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: Ignoring fairness constraints (--fair).
lola: SUBRESULT
lola: result: no
lola: produced by: CTL model checker
lola: The net does not satisfy the given formula.
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes yes yes yes no no yes no yes no unknown
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-2 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-3 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-4 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-5 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-6 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-9 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-13 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
FORMULA IOTPpurchase-PT-C01M01P01D01-CTLCardinality-15 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL USE_NUPN
----- Kill lola and sara stdout -----
----- Finished stdout -----

BK_STOP 1496353181265

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

----- Start make prepare stderr -----
----- Start make result stderr -----
----- Start make result stderr -----
----- Kill lola and sara stderr -----
----- Finished stderr -----

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="S_IOTPpurchase-PT-C01M01P01D01"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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/S_IOTPpurchase-PT-C01M01P01D01.tgz
mv S_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 lola"
echo " Input is S_IOTPpurchase-PT-C01M01P01D01, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r118-blw7-149441649900102"
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 ;