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)
.....................
/home/mcc/execution
total 232K
-rw-r--r-- 1 mcc users 4.1K May 15 18:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K May 15 18:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 15 18:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K May 15 18:50 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 15 18:50 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.9K May 15 18:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 12K May 15 18:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 15 18:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.5K May 15 18:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K May 15 18:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K May 15 18:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 119 May 15 18:54 ReachabilityDeadlock.txt
-rw-r--r-- 1 mcc users 357 May 15 18:54 ReachabilityDeadlock.xml
-rw-r--r-- 1 mcc users 3.5K May 15 18:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K May 15 18:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 15 18:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 15 18:54 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 15 18:50 equiv_col
-rw-r--r-- 1 mcc users 13 May 15 18:50 instance
-rw-r--r-- 1 mcc users 6 May 15 18:50 iscolored
-rwxr-xr-x 1 mcc users 60K May 15 18:50 model.pnml
=====================================================================
Generated by BenchKit 2-3637
Executing tool lola
Input is IOTPpurchase-PT-C05M04P03D02, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r100-smll-152658630800215
=====================================================================

--------------------
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-00
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-01
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-02
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-03
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-04
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-05
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-06
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-07
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-08
FORMULA_NAME IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-09
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

=== Now, execution of the tool begins

BK_START 1526796984481

info: Time: 3600 - MCC
===========================================================================================
prep: translating IOTPpurchase-PT-C05M04P03D02 Petri net model.pnml into LoLA format
===========================================================================================
prep: translating PT Petri net complete
prep: check for too many tokens
===========================================================================================
prep: translating IOTPpurchase-PT-C05M04P03D02 formula ReachabilityCardinality into LoLA format
===========================================================================================
prep: translating PT formula complete
vrfy: Checking ReachabilityCardinality @ IOTPpurchase-PT-C05M04P03D02 @ 3570 seconds
lola: LoLA will run for 3570 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: Size of bit vector: 3552
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-C05M04P03D02-ReachabilityCardinality.task
lola: LP says that atomic proposition is always false: (2 <= BrandSelection_p11_5)
lola: LP says that atomic proposition is always false: (3 <= Delivery_p22_8)
lola: LP says that atomic proposition is always false: (3 <= PaymentRequest_p11_9)
lola: LP says that atomic proposition is always false: (3 <= p8_2)
lola: LP says that atomic proposition is always false: (3 <= p11_8)
lola: LP says that atomic proposition is always false: (3 <= HowDeliver_p12_2)
lola: A (G (((2 <= p6_7) OR (p8_2 <= Payment_p21_7)))) : A (G ((((PaymentNote_p21_13 <= 1) AND (Organization_p22_2 <= 2)) OR (Delivery_p22_8 <= p12_0)))) : A (G (((1 <= p8_1) OR (HowDeliver_p12_2 <= p11_11)))) : E (F (((p6_5 + 1 <= WhatDeliver_p12_1) AND (1 <= p4_5) AND (MerchantOffer_p2 <= 1)))) : A (G (((Status_p21_14 <= Organization_p22_9)))) : A (G (((Organization_p22_5 <= Status_p22_13) OR (p11_3 <= p12_4) OR (p11_11 + 1 <= p11_13) OR ((DeliveryHandlerDelivery_p8_0 <= p11_0) AND (p11_3 + 1 <= p8_3))))) : E (F (())) : E (F ((1 <= p8_2))) : A (G (((p1_1 <= Organization_p20_7) OR (1 <= p11_0) OR (p11_4 <= p6_5) OR (Status_p22_11 <= p12_0)))) : A (G (((1 <= Status_p22_11) OR (BrandList_p11_2 <= p3_4) OR (Delivery_p20 <= BrandSelection_p11_5) OR (1 <= Organization_p22_2) OR (1 <= BrandList_p11_2)))) : E (F (())) : E (F (())) : E (F (())) : A (G (((Order_p22_6 <= p12_4) OR (p4_5 <= Status_p21_9) OR ((p7_2 <= ConsumerOffer_p1) AND (p3_3 <= p5_2)) OR (p11_4 + 1 <= p3_10)))) : A (G (((p4_2 <= 1) OR (p6_1 <= 1) OR ((Order_p22_6 <= 1) AND (p3_3 + 1 <= p8_3))))) : A (G ((Order_p22_10 <= p6_1)))
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:157
lola: rewrite Frontend/Parser/formula_rewrite.k:148
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 223 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-6 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 1 will run for 237 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 2 will run for 254 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 3 will run for 274 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: FALSE
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: FALSE
lola: processed formula length: 5
lola: 12 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: processed formula with 0 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: 0 markings, 0 edges
lola:
FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
========================================
lola: subprocess 4 will run for 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F ((1 <= p8_2)))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F ((1 <= p8_2)))
lola: processed formula length: 19
lola: 13 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: (1 <= p8_2)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-4-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-7 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 5 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Status_p21_14 <= Organization_p22_9))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((Status_p21_14 <= Organization_p22_9))))
lola: processed formula length: 47
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-4-0.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Organization_p22_9 + 1 <= Status_p21_14))
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-5-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 28 markings, 27 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-4 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 6 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((Order_p22_10 <= p6_1)))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((Order_p22_10 <= p6_1)))
lola: processed formula length: 30
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (p6_1 + 1 <= Order_p22_10)
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-6-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 38 markings, 37 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 7 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: sara: ...considering subproblem: A (G (((1 <= p8_1) OR (HowDeliver_p12_2 <= p11_11))))place or transition ordering is non-deterministic

lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= p8_1) OR (HowDeliver_p12_2 <= p11_11))))
lola: processed formula length: 54
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p8_1 <= 0) AND (p11_11 + 1 <= HowDeliver_p12_2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 58 markings, 57 edges

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-2 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-7-0.sara
lola: subprocess 8 will run for 446 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((2 <= p6_7) OR (p8_2 <= Payment_p21_7))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((2 <= p6_7) OR (p8_2 <= Payment_p21_7))))
lola: processed formula length: 49
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p6_7 <= 1) AND (Payment_p21_7 + 1 <= p8_2))
lola: state equation: Generated DNF with 2 literals and 1 conjunctive subformulas
lola: lola: ========================================
state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-8-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 39 markings, 38 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-0 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 9 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: E (F (((p6_5 + 1 <= WhatDeliver_p12_1) AND (1 <= p4_5) AND (MerchantOffer_p2 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:625
lola: processed formula: E (F (((p6_5 + 1 <= WhatDeliver_p12_1) AND (1 <= p4_5) AND (MerchantOffer_p2 <= 1))))
lola: processed formula length: 85
lola: 13 rewrites

lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:625
lola: formula 0: ((p6_5 + 1 <= WhatDeliver_p12_1) AND (1 <= p4_5) AND (MerchantOffer_p2 <= 1))
lola: state equation: Generated DNF with 3 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-9-0.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-7-0.sara.
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-9-0.sara.
sara: place or transition ordering is non-deterministic
lola: SUBRESULT
lola: result: yes
lola: produced by: state space
lola: The predicate is reachable.
lola: 51 markings, 50 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-3 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 10 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G ((((PaymentNote_p21_13 <= 1) AND (Organization_p22_2 <= 2)) OR (Delivery_p22_8 <= p12_0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G ((((PaymentNote_p21_13 <= 1) AND (Organization_p22_2 <= 2)) OR (Delivery_p22_8 <= p12_0))))
lola: processed formula length: 97
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: (((2 <= PaymentNote_p21_13) OR (3 <= Organization_p22_2)) AND (p12_0 + 1 <= Delivery_p22_8))
lola: state equation: Generated DNF with 4 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-10-0.sara
lola: lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 174 markings, 173 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-1 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 11 will run for 713 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p4_2 <= 1) OR (p6_1 <= 1) OR ((Order_p22_6 <= 1) AND (p3_3 + 1 <= p8_3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p4_2 <= 1) OR (p6_1 <= 1) OR ((Order_p22_6 <= 1) AND (p3_3 + 1 <= p8_3)))))
lola: processed formula length: 85
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((2 <= p4_2) AND (2 <= p6_1) AND ((2 <= Order_p22_6) OR (p8_3 <= p3_3)))
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas

lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-11-0.sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 81 markings, 80 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 12 will run for 892 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((1 <= Status_p22_11) OR (BrandList_p11_2 <= p3_4) OR (Delivery_p20 <= BrandSelection_p11_5) OR (1 <= Organization_p22_2) OR (1 <= BrandList_p11_2))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((1 <= Status_p22_11) OR (BrandList_p11_2 <= p3_4) OR (Delivery_p20 <= BrandSelection_p11_5) OR (1 <= Organization_p22_2) OR (1 <= BrandList_p11_2))))
lola: processed formula length: 160
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Status_p22_11 <= 0) AND (p3_4 + 1 <= BrandList_p11_2) AND (BrandSelection_p11_5 + 1 <= Delivery_p20) AND (Organization_p22_2 <= 0) AND (BrandList_p11_2 <= 0))
lola: state equation: Generated DNF with 5 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-12-0.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-12-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-9 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 13 will run for 1189 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((p1_1 <= Organization_p20_7) OR (1 <= p11_0) OR (p11_4 <= p6_5) OR (Status_p22_11 <= p12_0))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((p1_1 <= Organization_p20_7) OR (1 <= p11_0) OR (p11_4 <= p6_5) OR (Status_p22_11 <= p12_0))))
lola: processed formula length: 104
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Organization_p20_7 + 1 <= p1_1) AND (p11_0 <= 0) AND (p6_5 + 1 <= p11_4) AND (p12_0 + 1 <= Status_p22_11))
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-13-0.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-13-0.sara.
sara: place or transition ordering is non-deterministic

lola: state equation: solution impossible
lola: SUBRESULT
lola: result: yes
lola: produced by: state equation
lola: The predicate is invariant.
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-8 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 14 will run for 1784 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Organization_p22_5 <= Status_p22_13) OR (p11_3 <= p12_4) OR (p11_11 + 1 <= p11_13) OR ((DeliveryHandlerDelivery_p8_0 <= p11_0) AND (p11_3 + 1 <= p8_3)))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((Organization_p22_5 <= Status_p22_13) OR (p11_3 <= p12_4) OR (p11_11 + 1 <= p11_13) OR ((DeliveryHandlerDelivery_p8_0 <= p11_0) AND (p11_3 + 1 <= p8_3)))))
lola: processed formula length: 165
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((Status_p22_13 + 1 <= Organization_p22_5) AND (p12_4 + 1 <= p11_3) AND (p11_13 <= p11_11) AND ((p11_0 + 1 <= DeliveryHandlerDelivery_p8_0) OR (p8_3 <= p11_3)))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-14-0.sara
lola: state equation: calling and running sara
sara: try reading problem file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-14-0.sara.
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 2366 markings, 3201 edges
lola: ========================================

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-5 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: subprocess 15 will run for 3569 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: A (G (((Order_p22_6 <= p12_4) OR (p4_5 <= Status_p21_9) OR ((p7_2 <= ConsumerOffer_p1) AND (p3_3 <= p5_2)) OR (p11_4 + 1 <= p3_10))))
lola: ========================================
lola: SUBTASK
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: processed formula: A (G (((Order_p22_6 <= p12_4) OR (p4_5 <= Status_p21_9) OR ((p7_2 <= ConsumerOffer_p1) AND (p3_3 <= p5_2)) OR (p11_4 + 1 <= p3_10))))
lola: processed formula length: 136
lola: 14 rewrites
lola: closed formula file IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality.task
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
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: rewrite Frontend/Parser/formula_rewrite.k:631
lola: rewrite Frontend/Parser/formula_rewrite.k:694
lola: formula 0: ((p12_4 + 1 <= Order_p22_6) AND (Status_p21_9 + 1 <= p4_5) AND ((ConsumerOffer_p1 + 1 <= p7_2) OR (p5_2 + 1 <= p3_3)) AND (p3_10 <= p11_4))
lola: state equation: Generated DNF with 8 literals and 2 conjunctive subformulas
lola: state equation: write sara problem file to IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-15-0.sara
lola: state equation: calling and running sara
lola: SUBRESULT
lola: result: no
lola: produced by: state space
lola: The predicate is not invariant.
lola: 209 markings, 208 edges

FORMULA IOTPpurchase-PT-C05M04P03D02-ReachabilityCardinality-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
lola: RESULT
lola:
SUMMARY: no no no yes no no no yes yes yes no no no no no no
lola:
preliminary result: no no no yes no no no yes yes yes no no no no no no
lola: ========================================
lola: memory consumption: 23988 KB
lola: time consumption: 1 seconds

BK_STOP 1526796985195

--------------------
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-C05M04P03D02"
export BK_EXAMINATION="ReachabilityCardinality"
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/IOTPpurchase-PT-C05M04P03D02.tgz
mv IOTPpurchase-PT-C05M04P03D02 execution
cd execution
pwd
ls -lh

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-3637"
echo " Executing tool lola"
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 4"
echo " Run identifier is r100-smll-152658630800215"
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 ;