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 lola
Input is IOTPpurchase-PT-C03M03P03D03, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r062kn-blw3-146358896700075
=====================================================================

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

=== Now, execution of the tool begins

BK_START 1463590851350

bkconf 3600
make: Nothing to be done for 'prepare'.
in benchkit_head lolaszeit 3540
CTLCardinality @ IOTPpurchase-PT-C03M03P03D03
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-0 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-1 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-2 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-3 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-4 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-5 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-6 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-7 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-8 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-9 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-10 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-11 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-12 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-13 TRUE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-14 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
FORMULA IOTPpurchase-PT-C03M03P03D03-CTLCardinality-15 FALSE TECHNIQUES PARALLEL_PROCESSING EXPLICIT SAT_SMT STATE_COMPRESSION STUBBORN_SETS TOPOLOGICAL
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-C03M03P03D03-CTLCardinality.task
lola: read: AG (E(Order_p22_6 <= Organization_p21_4 U ConsumerOffer_p1 <= DeliveryHandlerDelivery_p8_0)) : !(!(AG (Organization_p22_2 <= Organization_p21_8))) : AF ((EG (2 <= Payment_p20_9) AND ((3 <= Order_p22_6 AND 3 <= PaymentNote_p21_16) AND (1 <= PaySchemeData_p21_10 AND PaymentHandlerPayment_p5_0 <= p4_2)))) : AX ((AF (2 <= Status_p21_9) AND !(2 <= Payment_p20_9))) : AG (((!(2 <= p6_5) AND (p8_1 <= PayS... (shortened)
lola: formula length: 1470
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (E(-Organization_p21_4 + Order_p22_6 <= 0 U -DeliveryHandlerDelivery_p8_0 + ConsumerOffer_p1 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(E(TRUE U !(E(-Organization_p21_4 + Order_p22_6 <= 0 U -DeliveryHandlerDelivery_p8_0 + ConsumerOffer_p1 <= 0))))
lola: processed formula length: 113
lola: 210 rewrites
lola: formula mentions 4 of 111 places; total mentions: 4
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 1 will run for 236 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (Organization_p22_2 + -Organization_p21_8 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 2 will run for 252 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((EG (-Payment_p20_9 <= -2) AND (-Order_p22_6 <= -3 AND (-PaymentNote_p21_16 <= -3 AND (-PaySchemeData_p21_10 <= -1 AND -p4_2 + PaymentHandlerPayment_p5_0 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (!(A(TRUE U !(-Payment_p20_9 <= -2))) AND (-Order_p22_6 <= -3 AND (-PaymentNote_p21_16 <= -3 AND (-PaySchemeData_p21_10 <= -1 AND -p4_2 + PaymentHandlerPayment_p5_0 <= 0)))))
lola: processed formula length: 183
lola: 210 rewrites
lola: formula mentions 6 of 111 places; total mentions: 6
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 3 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AX ((AF (-Status_p21_9 <= -2) AND -Payment_p20_9 > -2))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: AX((A(TRUE U -Status_p21_9 <= -2) AND -Payment_p20_9 > -2))
lola: processed formula length: 59
lola: 210 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 4 will run for 294 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (((-p6_5 > -2 AND (p8_1 + -PaySchemeData_p21_10 <= 0 AND Organization_p22_2 + -p8_2 <= 0)) OR ((Organization_p21_4 + -ConsumerPayment_p3 <= 0 AND -Status_p21_5 <= -2) OR -Organization_p22_2 + BrandSelection_p11_5 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is not invariant.
lola: ========================================
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (EF ((-p1_3 + p1_1 > 0 AND -p12_3 + p8_1 > 0)) AND -PaymentHandlerPayment_p5_0 <= -1)
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p1_3 + p1_1 > 0 AND -p12_3 + p8_1 > 0))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: -PaymentHandlerPayment_p5_0 <= -1
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the property already in its initial state.
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 6 will run for 353 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AF ((-p12_3 <= -2 OR -Status_p21_11 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U A(TRUE U (-p12_3 <= -2 OR -Status_p21_11 <= -2)))
lola: processed formula length: 58
lola: 210 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (E(-Delivery_p20 + p3_3 > 0 R Delivery_p22_4 + -p3_5 > 0) OR AF ((-PaidFor_p11_1 + p5_1 > 0 AND Status_p21_14 + -Status_p21_9 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 7 will run for 392 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E(-Delivery_p20 + p3_3 > 0 R Delivery_p22_4 + -p3_5 > 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(!(-Delivery_p20 + p3_3 > 0) U !(Delivery_p22_4 + -p3_5 > 0)))
lola: processed formula length: 65
lola: 209 rewrites
lola: formula mentions 4 of 111 places; total mentions: 4
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 8 will run for 441 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AF ((-PaidFor_p11_1 + p5_1 > 0 AND Status_p21_14 + -Status_p21_9 > 0))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: A(TRUE U (-PaidFor_p11_1 + p5_1 > 0 AND Status_p21_14 + -Status_p21_9 > 0))
lola: processed formula length: 75
lola: 209 rewrites
lola: formula mentions 4 of 111 places; total mentions: 4
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p10_0 + -p3_4 <= 0 OR EF ((-p5_2 <= -3 AND (-p6_2 <= -3 AND -p2_2 <= -3))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 8 will run for 440 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: p10_0 + -p3_4 <= 0
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula with 1 atomic propositions
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-CTLCardinality.task
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The net violates the given property already in its initial state.
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((-p5_2 <= -3 AND (-p6_2 <= -3 AND -p2_2 <= -3)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: The predicate is unreachable.
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 9 will run for 503 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF ((AG (-p11_0 <= -1) AND (p12_3 + -p3_1 <= 0 AND p12_7 + -PayReceipt_p21_12 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U (!(E(TRUE U !(-p11_0 <= -1))) AND (p12_3 + -p3_1 <= 0 AND p12_7 + -PayReceipt_p21_12 <= 0)))
lola: processed formula length: 101
lola: 210 rewrites
lola: formula mentions 5 of 111 places; total mentions: 5
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 10 will run for 586 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: AG (EF ((-p12_3 + Payment_p21_1 <= 0 OR -p11_7 <= -2)))
lola: ========================================
lola: SUBTASK
lola: checking liveness
lola: liveness not yet implemented, converting to CTL...
lola: processed formula: !(E(TRUE U !(E(TRUE U (-p12_3 + Payment_p21_1 <= 0 OR -p11_7 <= -2)))))
lola: processed formula length: 71
lola: 210 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 11 will run for 703 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG ((AX (p3_4 + -Payment_p21_1 <= 0) AND (-PayReceipt_p21_15 > -2 OR -p3_10 > -3)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !((AX(p3_4 + -Payment_p21_1 <= 0) AND (-PayReceipt_p21_15 > -2 OR -p3_10 > -3)))))
lola: processed formula length: 93
lola: 210 rewrites
lola: formula mentions 4 of 111 places; total mentions: 4
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 12 will run for 879 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EG (Delivery_p22_8 + -p1_3 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: !(A(TRUE U !(Delivery_p22_8 + -p1_3 <= 0)))
lola: processed formula length: 43
lola: 209 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 1 significant temporal operators and needs 5 bytes of payload
lola: SUBRESULT
lola: result: yes
lola: The net satisfies the given formula.
lola: ========================================
lola: subprocess 13 will run for 1172 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (((-p11_13 <= -3 OR (-DeliveryResponse_p12_6 + PaymentHandlerPayment_p5_0 <= 0 AND -MerchantDelivery_p4_6 + OfferResponce_p10 <= 0)) AND ((p4_3 + -DeliveryRequest_p12_5 <= 0 OR -p7_2 <= -3) AND -Status_p21_9 + Status_p21_5 > 0)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: 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
lola: using reachability graph (--search=depth)
lola: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: The predicate is reachable.
lola: ========================================
lola: subprocess 14 will run for 1758 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (AG ((-PaymentHandlerPayment_p5_0 <= -1 OR Organization_p20_2 + -p4_3 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking possible invariance
lola: possible invariance not yet implemented, converting to CTL...
lola: processed formula: E(TRUE U !(E(TRUE U !((-PaymentHandlerPayment_p5_0 <= -1 OR Organization_p20_2 + -p4_3 <= 0)))))
lola: processed formula length: 96
lola: 210 rewrites
lola: formula mentions 3 of 111 places; total mentions: 3
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: ========================================
lola: subprocess 15 will run for 3513 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: EF (EG ((-Payment_p21_3 <= -3 AND -p2_2 <= -1)))
lola: ========================================
lola: SUBTASK
lola: checking CTL
lola: processed formula: E(TRUE U !(A(TRUE U !((-Payment_p21_3 <= -3 AND -p2_2 <= -1)))))
lola: processed formula length: 64
lola: 210 rewrites
lola: formula mentions 2 of 111 places; total mentions: 2
lola: closed formula file IOTPpurchase-PT-C03M03P03D03-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: RUNNING
lola: CTL formula contains 2 significant temporal operators and needs 9 bytes of payload
lola: SUBRESULT
lola: result: no
lola: The net does not satisfy the given formula.
lola: RESULT
lola: summary: no no no no no yes yes no no no yes no yes yes no no
lola: ========================================

BK_STOP 1463590880465

--------------------
content from 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="IOTPpurchase-PT-C03M03P03D03"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="lola"
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-C03M03P03D03.tgz
mv IOTPpurchase-PT-C03M03P03D03 execution

# this is for BenchKit: explicit launching of the test

cd execution
echo "====================================================================="
echo " Generated by BenchKit 2-2979"
echo " Executing tool lola"
echo " Input is IOTPpurchase-PT-C03M03P03D03, 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 r062kn-blw3-146358896700075"
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 ;